Bayesian inference as iterated random functions with applications to sequential inference in graphical models
We propose a general formalism of iterated random functions with semigroup property, under which exact and approximate Bayesian posterior updates can be viewed as specific instances. A convergence theory for iterated random functions is presented. As an application of the general theory we analyze convergence behaviors of exact and approximate message-passing algorithms that arise in a sequential change point detection problem formulated via a latent variable directed graphical model. The sequential inference algorithm and its supporting theory are illustrated by simulated examples.
Code (0)
등록된 구현이 없습니다.
Tasks
Bayesian InferenceChange Point DetectionSimilar Papers 제목 키워드 기반
Bayesian Model of Behaviour in Economic Games
Classical Game Theoretic approaches that make strong rationality assumptions have difficulty modeling observed behaviour in Economic games of human subjects. We investigate the role of finite levels of iterated reasoning…
modelFull Bayesian Reinforcement Learning via LF-IBIS
Reinforcement Learning (RL) is a sequential decision-making framework in which an agent learns optimal policies through interaction with an environment by maximizing cumulative rewards. Among RL methods, Bayesian Reinfor…
Reinforcement LearningBayesian InferenceTree-based iterated local search for Markov random fields with applications in image analysis
The \emph{maximum a posteriori} (MAP) assignment for general structure Markov random fields (MRFs) is computationally intractable. In this paper, we exploit tree-based methods to efficiently address this problem. Our nov…
DenoisingImage DenoisingStereo MatchingStereo Matching HandSome Limit Properties of Markov Chains Induced by Stochastic Recursive Algorithms
Recursive stochastic algorithms have gained significant attention in the recent past due to data driven applications. Examples include stochastic gradient descent for solving large-scale optimization problems and empiric…
On the strong stability of ergodic iterations
We revisit processes generated by iterated random functions driven by a stationary and ergodic sequence. Such a process is called strongly stable if a random initialization exists, for which the process is stationary and…