Research
On-device research index

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.

168,657 papers · 148 categories

Trend · papers per month

124248371495 · Jun 202019922001200920172026
48 results for Belief Space

Paper introduces a new framework to improve sample efficiency in POMDPs learning.

problem Challenges in off-policy evaluation for POMDPs, especially with hidden states.
method Exploits the metric structure of belief space to relax coverage assumptions.
result Unified analysis technique yields tighter error bounds and sample efficiency improvements.

NBF combines deep learning with classical filtering for better belief tracking.

problem Maintaining distributions over hidden states in partially observable systems.
method Trains neural networks to map beliefs to fixed-length vectors, updating them with incoming observations and dynamics.
result NBF efficiently tracks shifting, multimodal beliefs without particle impoverishment.

FORBES learns flexible belief states for POMDPs using normalizing flows.

problem Accurately modeling belief states in POMDPs for high-dimensional, continuous spaces.
method Integrates normalizing flows into variational inference for continuous belief state learning.
result FORBES learns flexible belief states that enable multi-modal predictions and high-quality reconstructions.

A method for eliciting expert beliefs using preferential questions and normalizing flows.

problem Eliciting high-dimensional probability distributions from noisy judgments.
method Normalizing flows based on preferential questions with a novel functional prior.
result The method allows for the inference of arbitrarily flexible densities from preferential judgments.

Unified kernel for prediction markets reduces belief variance forecast error.

problem Lack of standardized tools for quoting and hedging belief risk in prediction markets.
method Logit jump-diffusion model with risk-neutral drift, calibration pipeline, and coherent derivative layer.
result Model reduces forecast error compared to diffusion-only and probability-space baselines.

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, …

2019-06-22abs ↗pdf ↗

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…

2015-06-19abs ↗pdf ↗

New method approximates POMDPs with PB-MDPs, providing error bounds and practical algorithms.

problem Difficulty in solving POMDPs with continuous or hybrid state and observation spaces.
method Bounding particle filtering error and adapting MDP algorithms to POMDPs.
result General theory and practical algorithms for POMDPs with no direct dependence on state and observation space sizes.

UWM-JEPA predicts future scenarios in belief space, improving accuracy in partially observed environments.

problem Predicting future scenarios in partially observed environments with uncertainty.
method Introduces UWM-JEPA, a JEPA world model with a density-matrix latent and learned unitary predictor.
result UWM-JEPA achieves 0.77 accuracy on a hidden-velocity indicator task, outperforming LSTM-JEPA.

This thesis investigates belief propagation's performance in graphical models with loops.

problem Belief propagation's performance and convergence guarantees in models with loops are uncertain.
method Investigates how model parameters affect belief propagation's performance, convergence, and approximation quality.
result Model parameters influence the number of fixed points, convergence properties, and approximation quality of belief propagation.

This work explores a social learning problem with agents having nonidentical noise variances and mismatched beliefs. We consider an NN-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…

2018-11-23abs ↗pdf ↗

Model captures decision-making under bounded rationality with prior beliefs and market feedback.

problem Bounded rationality in decision-making with limited processing abilities.
method Maximum entropy principle applied to Quantal Response Statistical Equilibrium framework.
result Prior beliefs influence decision-making, altering the outcome of 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…

2012-10-19abs ↗pdf ↗

This paper optimizes reinsurance contracts with belief differences between insurer and reinsurer.

problem Dynamic reinsurance design with heterogeneous beliefs under mean-variance framework.
method Modeling surplus process, applying partitioned domain optimization, solving HJB system.
result Optimal reinsurance contracts with belief heterogeneity are more complex than standard contracts.

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…

2009-12-31abs ↗pdf ↗

New algorithm reduces communication in distributed learning by sharing compressed beliefs.

problem Efficiently learning from private data in a distributed setting with large hypothesis sets.
method Proposes a belief update rule for distributed cooperative learning with compressed (sparse or quantized) beliefs.
result Beliefs converge almost surely to optimal hypotheses with a linear concentration rate.

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…

2020-03-04abs ↗pdf ↗

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 $α…

2019-08-23abs ↗pdf ↗

The paper explains stock market predictability through a model of heterogeneous beliefs.

problem Understanding and predicting stock market behavior based on news and investor beliefs.
method A discrete-time model of heterogeneous beliefs where some agents receive noisy signals about asset fundamentals.
result Momentum and reversal in stock prices arise from investors' incorrect beliefs about signal accuracy and fundamental values.

Regularization methods, specifically those which directly alter weights like L1L_1 and L2L_2, 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…

2019-10-31abs ↗pdf ↗

Study shows price bubbles can exist even with heterogeneous beliefs.

problem Equilibrium price formation in markets with different belief groups.
method Analyzes continuous time asset trading with heterogeneous investors and mean reverting asset.
result Price bubbles may not form even with heterogeneous beliefs, contrary to initial expectations.

Develops a framework for quantifying agentic AI model risk using LLM-inferred Bayesian state filters.

problem Quantifying the risk of agentic AI systems due to uncertain beliefs and actions.
method Representing the system as a partially observed Markov decision process with latent states, Bayesian belief updates, control-dependent losses, and tail-risk functionals.
result Develops a rigorous framework for separating uncertainty quantification from risk measurement.

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…

2010-01-11abs ↗pdf ↗

Unified Bayesian model explains in-context learning and activation steering in LLMs.

problem Understanding and controlling the behavior of large language models (LLMs) through prompts and activations.
method Developed a Bayesian model to explain and predict the effects of in-context learning and activation steering.
result Unified model predicts distinct phases and sudden shifts in LLM behavior, explaining prior empirical phenomena.

Recurrent networks learn beliefs from history in partially observable environments.

problem Learning optimal policies in partially observable environments.
method Trained recurrent neural networks to approximate value functions, measuring mutual information between hidden states and beliefs.
result Recurrent networks' hidden states correlate with beliefs of relevant state variables, improving expected return.

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…

2018-11-15abs ↗pdf ↗

Deep belief networks can approximate any multivariate density with binary hidden units.

problem Approximating multivariate probability densities with binary hidden units.
method Sharp quantitative bounds on approximation error in terms of hidden units.
result Deep belief networks can approximate any multivariate density with binary hidden units under mild integrability requirements.

A new model validation framework for agentic AI systems based on POMDPs.

problem Model validation of agentic AI systems.
method A POMDP-based framework for belief-state, forecast, and policy validation.
result The framework decomposes autonomous decision making into information, beliefs, forecasts, actions, and utility.

POLAR learns efficient data acquisition policies using pretrained belief representations.

problem Challenges in learning effective policies for adaptive data acquisition.
method POLAR decouples representation learning from policy learning by leveraging pretrained predictive foundation models as belief-state encoders.
result POLAR outperforms state-of-the-art methods across diverse tasks while requiring fewer training samples.

SOLBP extends efficient inference to uncertain Bayesian networks.

problem Inference in uncertain Bayesian networks with second-order probabilities.
method Extends Loopy Belief Propagation to second-order Bayesian networks.
result Generates inferences consistent with sum-product networks, more efficient and scalable.

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…

2019-11-21abs ↗pdf ↗