Paper introduces a new framework to improve sample efficiency in POMDPs learning.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
NBF combines deep learning with classical filtering for better belief tracking.
FORBES learns flexible belief states for POMDPs using normalizing flows.
A method for eliciting expert beliefs using preferential questions and normalizing flows.
A framework for cost of belief revision in uncertain agents.
Generalized belief propagation converges to optimal solutions on graphs with motifs.
Study risk sharing with Lambda VaR under diverse beliefs.
Unified kernel for prediction markets reduces belief variance forecast error.
Belief propagation recovers backpropagation results.
New framework analyzes belief evolution in social networks.
We consider the problem of imitation learning from expert demonstrations in partially observable Markov decision processes (POMDPs). Belief representations, which characterize the distribution over the latent states in a POMDP, have been modeled using recurrent neural networks and probabilistic latent variable models, …
Study links cognitive effort to thermodynamic principles, optimizing decision-making.
We propose an original particle-based implementation of the Loopy Belief Propagation (LPB) algorithm for pairwise Markov Random Fields (MRF) on a continuous state space. The algorithm constructs adaptively efficient proposal distributions approximating the local beliefs at each note of the MRF. This is achieved by cons…
New method approximates POMDPs with PB-MDPs, providing error bounds and practical algorithms.
UWM-JEPA predicts future scenarios in belief space, improving accuracy in partially observed environments.
This paper presents a solution for persistent monitoring of real-world stochastic phenomena, where the underlying covariance structure changes sharply across time, using a small number of mobile robot sensors. We propose an adaptive solution for the problem where stochastic real-world dynamics are modeled as a Gaussian…
This thesis investigates belief propagation's performance in graphical models with loops.
This work explores a social learning problem with agents having nonidentical noise variances and mismatched beliefs. We consider an -agent binary hypothesis test in which each agent sequentially makes a decision based not only on a private observation, but also on preceding agents' decisions. In addition, the agents…
Belief Propagation algorithms are instruments used broadly to solve graphical model optimization and statistical inference problems. In the general case of a loopy Graphical Model, Belief Propagation is a heuristic which is quite successful in practice, even though its empirical success, typically, lacks theoretical gu…
Model captures decision-making under bounded rationality with prior beliefs and market feedback.
By elaborating on the notion of linear belief functions (Dempster 1990; Liu 1996), we propose an elementary approach to knowledge representation for expert systems using linear belief functions. We show how to use basic matrices to represent market information and financial knowledge, including complete ignorance, stat…
This paper optimizes reinsurance contracts with belief differences between insurer and reinsurer.
Deep belief networks are a powerful way to model complex probability distributions. However, learning the structure of a belief network, particularly one with hidden units, is difficult. The Indian buffet process has been used as a nonparametric Bayesian prior on the directed structure of a belief network with a single…
In this paper I empirically investigate prediction markets for binary options. Advocates of prediction markets have suggested that asset prices are consistent estimators of the "true" probability of a state of the world being realized. I test whether the market reaches a "consensus." I find little evidence for converge…
New algorithm reduces communication in distributed learning by sharing compressed beliefs.
A graphical model is a structured representation of locally dependent random variables. A traditional method to reason over these random variables is to perform inference using belief propagation. When provided with the true data generating process, belief propagation can infer the optimal posterior probability estimat…
We propose a projected gradient dynamical system as a model for a bargaining scheme for an asset for which the two interested agents have personal valuations which do not initially coincide. The personal valuations are formed using subjective beliefs concerning the future states of the world and the reservation prices …
New -BP algorithm improves belief propagation for graphs with loops.
New group testing method uses Belief Propagation for accurate screening.
Belief propagation (BP) can do exact inference in loop-free graphs, but its performance could be poor in graphs with loops, and the understanding of its solution is limited. This work gives an interpretable belief propagation rule that is actually minimization of a localized -divergence. We term this algorithm as $α…
We generalize recent theoretical work on the minimal number of layers of narrow deep belief networks that can approximate any probability distribution on the states of their visible units arbitrarily well. We relax the setting of binary units (Sutskever and Hinton, 2008; Le Roux and Bengio, 2008, 2010; Montúfar and Ay,…
The paper explains stock market predictability through a model of heterogeneous beliefs.
Regularization methods, specifically those which directly alter weights like and , are an integral part of many learning algorithms. Both the regularizers mentioned above are formulated by assuming certain priors in the parameter space and these assumptions, in some cases, induce sparsity in the parameter sp…
A number of problems in statistical physics and computer science can be expressed as the computation of marginal probabilities over a Markov random field. Belief propagation, an iterative message-passing algorithm, computes exactly such marginals when the underlying graph is a tree. But it has gained its popularity as …
Study shows price bubbles can exist even with heterogeneous beliefs.
Develops a framework for quantifying agentic AI model risk using LLM-inferred Bayesian state filters.
This paper presents a general framework for studying diverse beliefs in dynamic economies. Within this general framework, the characterization of a central-planner general equilbrium turns out to be very easy to derive, and leads to a range of interesting applications. We show how for an economy with log investors hold…
Unified Bayesian model explains in-context learning and activation steering in LLMs.
Recurrent networks learn beliefs from history in partially observable environments.
Unsupervised representation learning has succeeded with excellent results in many applications. It is an especially powerful tool to learn a good representation of environments with partial or noisy observations. In partially observable domains it is important for the representation to encode a belief state, a sufficie…
Deep belief networks can approximate any multivariate density with binary hidden units.
We present the first PAC optimal algorithm for Bayes-Adaptive Markov Decision Processes (BAMDPs) in continuous state and action spaces, to the best of our knowledge. The BAMDP framework elegantly addresses model uncertainty by incorporating Bayesian belief updates into long-term expected return. However, computing an e…
A new model validation framework for agentic AI systems based on POMDPs.
POLAR learns efficient data acquisition policies using pretrained belief representations.
SOLBP extends efficient inference to uncertain Bayesian networks.
The cost of belief changes with precision and is a hyperbolic geometry.
We introduce a formal language IE that is a variant of the language PAL developed in [van Benthem 2011] by adding a belief operator and a common belief operator,specializing to stochastic analysis. A constant symbol in the language denotes a stochastic process so that we can represent several financial events as formul…
Information theory provides a mathematical foundation to measure uncertainty in belief. Belief is represented by a probability distribution that captures our understanding of an outcome's plausibility. Information measures based on Shannon's concept of entropy include realization information, Kullback-Leibler divergenc…