Recency-weighted Markovian inference
We describe a Markov latent state space (MLSS) model, where the latent state distribution is a decaying mixture over multiple past states. We present a simple sampling algorithm that allows to approximate such high-order MLSS with fixed time and memory costs.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Stochastic Stability of a Recency Weighted Sampling Dynamic
We introduce and study a model of long-run convention formation for rare interactions. Players in this model form beliefs by observing a recency-weighted sample of past interactions, to which they noisily best respond. W…
Prompt Compression in Production Task Orchestration: A Pre-Registered Randomized Trial
The economics of prompt compression depend not only on reducing input tokens but on how compression changes output length, which is typically priced several times higher. We evaluate this in a pre-registered six-arm rand…
Markovian Score Climbing: Variational Inference with KL(p||q)
Modern variational inference (VI) uses stochastic gradients to avoid intractable expectations, enabling large-scale probabilistic inference in complex models. VI posits a family of approximating distributions q and then …
Variational InferenceRecency-Weighted Temporally-Segmented Ensemble for Time-Series Modeling
Time-series modeling in process industries faces the challenge of dealing with complex, multi-faceted, and evolving data characteristics. Conventional single model approaches often struggle to capture the interplay of di…
Time SeriesTempoFit: Plug-and-Play Layer-Wise Temporal KV Memory for Long-Horizon Vision-Language-Action Manipulation
Pretrained Vision-Language-Action (VLA) policies have achieved strong single-step manipulation, but their inference remains largely memoryless, which is brittle in non-Markovian long-horizon settings with occlusion, stat…