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,742 papers · 148 categories

Trend · papers per month

9182635 · Jun 202019922001200920172026
48 results for uncertain belief

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.

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.

In this paper, we solve portfolio rebalancing problem when security returns are represented by uncertain variables considering transaction costs. The performance of the proposed model is studied using constant-proportion portfolio insurance (CPPI) as rebalancing strategy. Numerical results showed that uncertain paramet…

2018-12-18abs ↗pdf ↗

A framework for navigating environments with spatially correlated obstacles and uncertain blockage status.

problem Navigation in environments with spatially correlated obstacles of uncertain blockage status.
method Modeling spatial correlation with Gaussian Random Field, developing Bayesian belief updates, proposing a two-stage learning framework with offline and online phases.
result Consistent performance gains over baselines in environments with adversarial interruptions or clustered natural hazards.

The study proves necessary conditions for robust decision-making in uncertain environments.

problem Conditions for robust decision-making in uncertain environments.
method Quantitative selection theorems and binary betting decisions.
result World models, belief-like memory, and persistent variables are necessary for strong task performance.

We propose a feed-forward inference method applicable to belief and neural networks. In a belief network, the method estimates an approximate factorized posterior of all hidden units given the input. In neural networks the method propagates uncertainty of the input through all the layers. In neural networks with inject…

2018-03-28abs ↗pdf ↗

We study the Markowitz portfolio selection problem with unknown drift vector in the multidimensional framework. The prior belief on the uncertain expected rate of return is modeled by an arbitrary probability law, and a Bayesian approach from filtering theory is used to learn the posterior distribution about the drift …

2018-11-16abs ↗pdf ↗

We study the formation of derivative prices in equilibrium between risk-neutral agents with heterogeneous beliefs about the dynamics of the underlying. Under the condition that the derivative cannot be shorted, we prove the existence of a unique equilibrium price and show that it incorporates the speculative value of p…

2016-12-29abs ↗pdf ↗

In deterministic optimization, line searches are a standard tool ensuring stability and efficiency. Where only stochastic gradients are available, no direct equivalent has so far been formulated, because uncertain gradients do not allow for a strict sequence of decisions collapsing the search space. We construct a prob…

2017-03-29abs ↗pdf ↗

In deterministic optimization, line searches are a standard tool ensuring stability and efficiency. Where only stochastic gradients are available, no direct equivalent has so far been formulated, because uncertain gradients do not allow for a strict sequence of decisions collapsing the search space. We construct a prob…

2015-02-10abs ↗pdf ↗

The paper explores how to handle uncertain evidence in probabilistic models.

problem Handling uncertain evidence in probabilistic models and stochastic simulators.
method The paper considers distributional evidence, Jeffrey's rule, and virtual evidence as methods for interpreting uncertain evidence.
result The paper provides guidelines on how to account for uncertain evidence and highlights the importance of careful consideration.

In this paper, within the framework of uncertainty theory, the valuation of equity warrants is investigated. Different from the methods of probability theory, the equity warrants pricing problem is solved by using the method of uncertain calculus. Based on the assumption that the firm price follows an uncertain differe…

2017-11-22abs ↗pdf ↗

Single autoregressive model outperforms ensemble methods in offline reinforcement learning.

problem Offline reinforcement learning with limited data and model errors.
method Infer system dynamics from data and optimize policies on model rollouts, using a single autoregressive model.
result Single autoregressive model achieves better performance than ensembles on the D4RL benchmark.

We propose a probabilistic framework for pricing derivatives, which acknowledges that information and beliefs are subjective. Market prices can be translated into implied probabilities. In particular, futures imply returns for these implied probability distributions. We argue that volatility is not risk, but uncertaint…

2010-01-11abs ↗pdf ↗

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 ↗

Quantum methods model uncertain volatility in financial markets.

problem Modeling financial asset prices with uncertain volatility.
method Quantum stochastic calculus with unitary and non-unitary time evolution.
result Different volatility levels encoded in quantum states, leading to varied market price evolutions.

New model predicts dynamic volatility in uncertain financial markets.

problem Predicting dynamic volatility in financial markets with uncertainty.
method Generalized Barndorff-Nielsen and Shephard (BN-S) model considering delay and fuzziness.
result Effective prediction of dynamic volatility with improved performance.

Recent breakthroughs in AI for multi-agent games like Go, Poker, and Dota, have seen great strides in recent years. Yet none of these games address the real-life challenge of cooperation in the presence of unknown and uncertain teammates. This challenge is a key game mechanism in hidden role games. Here we develop the …

2019-06-05abs ↗pdf ↗

New algorithm for reinforcement learning in uncertain environments with unknown thresholds.

problem Safety in reinforcement learning in unknown and uncertain environments.
method Growing-Window estimator sampling and Stochastic Pessimistic-Optimistic Thresholding (SPOT) algorithm.
result Achieves sublinear regret and constraint violation of ildeO(T) ilde{\mathcal{O}}(\sqrt{T}).

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.

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.

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.

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 method for accurate pricing of multidimensional derivatives under uncertain volatility.

problem High-dimensional stochastic control problem in uncertain volatility model.
method Backward actor-critic stochastic policy gradient scheme combining DP, PPO, and neural networks.
result Accurate and efficient pricing of multidimensional derivatives compared to benchmarks.