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

53105158210 · Jun 202019922001200920172026
48 results for transition uncertainty

A new algorithm for deep Q-learning with robustness to state transition uncertainty.

problem Model uncertainty in state transitions for non-tabular, continuous state spaces.
method Distributionally robust approach using worst-case transition ball and dualized Bellman operator with Sinkhorn distance.
result Optimal policy found through solving non-linear Bellman equation with neural network parameterization.

Improved simulation of phase transitions using hierarchical autoregressive networks.

problem Simulating phase transitions in complex systems.
method Hierarchical Autoregressive Neural (HAN) network sampling algorithm.
result Significant improvement in statistical uncertainty compared to the Wolff cluster algorithm.

RRPI improves offline RL by optimizing policies against worst-case dynamics.

problem Offline RL's performance degrades under distribution shift and transition uncertainty.
method Formulates offline RL as robust policy optimization, treating transition kernel as decision variable.
result RRPI achieves strong average performance on D4RL benchmarks, outperforming recent baselines.

The paper tackles robust control for insurance contracts under uncertain transition rates.

problem Maximizing utility in insurance contracts with uncertain transition rates.
method Novel robust utility maximization problem under bounded cumulative transition rate uncertainty, using worst-case scenario analysis.
result Existence and uniqueness of worst-case and best-case reserves for insurance contracts.

Regularization helps resolve ambiguity in mean-variance models, improving predictive uncertainty quantification.

problem Signal-to-noise ambiguity in overparameterized mean-variance models.
method Statistical field theory framework to explain phase transition.
result Regularization reduces variability and improves predictive uncertainty quantification.

Proposes a method to enhance exploration in RL using temporal difference uncertainties.

problem Challenges in estimating uncertainty in non-tabular reinforcement learning settings.
method Estimates uncertainty over value function using temporal difference errors and incorporates it as an intrinsic reward.
result Demonstrates improved exploration in various tasks, including Deep Sea and Atari 2600 environments.

Develops a deterministic method to approximate NSDEs for better uncertainty quantification.

problem Computational infeasibility of obtaining well-calibrated uncertainty from NSDEs.
method Bidimensional moment matching algorithm for approximating NSDE transition kernel.
result Deterministic approximation improves uncertainty calibration and prediction accuracy.

Robots can rapidly acquire new skills from demonstrations. However, during generalisation of skills or transitioning across fundamentally different skills, it is unclear whether the robot has the necessary knowledge to perform the task. Failing to detect missing information often leads to abrupt movements or to collisi…

2018-08-06abs ↗pdf ↗

Study designs steering rewards for MFGs with unknown dynamics and model uncertainty.

problem Designing incentives for large populations of agents in MFGs with uncertain model details.
method Developed optimistic exploration algorithms for agents with no-adaptive regret behaviors.
result Sub-linear regret guarantees for cumulative gaps between agent behaviors and desired outcomes.

A critical and challenging problem in reinforcement learning is how to learn the state-action value function from the experience replay buffer and simultaneously keep sample efficiency and faster convergence to a high quality solution. In prior works, transitions are uniformly sampled at random from the replay buffer o…

2018-04-23abs ↗pdf ↗

Study models risks for low-carbon economy in Balkan countries, focusing on shadow economy and populism.

problem Risks and uncertainties in establishing a low-carbon economy in Balkan countries with transition economies.
method Transdisciplinary approach combining economic policy, public opinion, and climate change models.
result Identifies shadow economy and populism as key risk factors for low-carbon economy implementation.

Paper models uncertainty in electricity and gas markets to assess its impact.

problem Addressing uncertainties in coupled electricity and gas markets.
method Integrated and stochastic optimisation approaches for large-scale energy systems.
result Quantifies the value of encoding uncertainty in models.

Paper proposes a new framework for robust multi-modal data fusion under uncertainty.

problem Unexpected modality failures in nonlinear non-Gaussian dynamic processes.
method Dynamic model averaging (DMA) based particle filter (PF) algorithm.
result The proposed solution outperforms state-of-the-art methods in experiments.

As part of Basel II's incremental risk charge (IRC) methodology, this paper summarizes our extensive investigations of constructing transition probability matrices (TPMs) for unsecuritized credit products in the trading book. The objective is to create monthly or quarterly TPMs with predefined sectors and ratings that …

2011-02-18abs ↗pdf ↗

New algorithm solves uncertain Markov decision processes using Wasserstein uncertainty.

problem Solving Markov decision processes with uncertain transition probabilities.
method Distributionally robust QQ-learning algorithm for Wasserstein uncertainty.
result Convergence of the algorithm proved and demonstrated with real data.

Novel framework for risk-sensitive reinforcement learning with robustness against uncertainty.

problem Risk-sensitive reinforcement learning with uncertainty in transition dynamics.
method Developed a risk-sensitive robust Markov decision process (RSRMDP), derived its Bellman equation, and proposed a Bayesian Dynamic Programming (Bayesian DP) algorithm.
result Demonstrated convergence to near-optimal policies and analyzed sample and computational complexities.

Study online RL with mismatched dynamics, achieving sublinear regret.

problem Exploration challenges in online RL with mismatched training and deployment dynamics.
method Introduce supremal visitation ratio, propose efficient algorithm with ff-divergence.
result Achieves sublinear regret in online RMDPs with optimal dependence on supremal visitation ratio and interaction episodes.

A Robust Markov Decision Process (RMDP) is a sequential decision making model that accounts for uncertainty in the parameters of dynamic systems. This uncertainty introduces difficulties in learning an optimal policy, especially for environments with large state spaces. We propose two algorithms, RTD-DQN and Deep-RoK, …

2017-03-07abs ↗pdf ↗

Bayesian analysis reveals epistemic uncertainty as a key diagnostic for delayed generalization in in-context learning.

problem Delayed generalization in in-context learning from few examples.
method Bayesian perspective, modular arithmetic tasks, approximate Bayesian techniques, spectral mechanism analysis.
result Epistemic uncertainty collapses sharply when the model groks, indicating a practical diagnostic of generalization.

Robust Markov Decision Processes (RMDPs) intend to ensure robustness with respect to changing or adversarial system behavior. In this framework, transitions are modeled as arbitrary elements of a known and properly structured uncertainty set and a robust optimal policy can be derived under the worst-case scenario. In t…

2019-05-20abs ↗pdf ↗

Paper develops a new RL method for MDPs with uncertainty, achieving better regret bounds.

problem Online reinforcement learning in environments with both endogenous and exogenous uncertainty.
method Developed a VB-UCRL algorithm that restarts based on variation schedules.
result Established a regret bound of saving at most S\sqrt{S} or S16T112S^{\frac{1}{6}}T^{\frac{1}{12}}.

The study shows how trade uncertainty affects stock-bond correlations over time.

problem Impact of trade policy uncertainty on stock-bond correlations.
method Daily data analysis using GARCH-based models (CCC, STCC, DCC) with TPU and political dummy variables.
result Time-varying correlation models better capture the dynamics of stock-bond correlations than constant models.

We here present a model of the dynamics of extremism based on opinion dynamics in order to understand the circumstances which favour its emergence and development in large fractions of the general public. Our model is based on the bounded confidence hypothesis and on the evolution of initially anti-conformist agents to…

2015-03-16abs ↗pdf ↗

The paper stabilizes PD term structures under forecast uncertainty using a Kalman filter with an anchored observation model.

problem Stable estimation of lifetime PDs under forecast uncertainty.
method Reformulated in state-space framework, introduced an anchored observation model.
result Asymptotic stochastic stability of error dynamics, leading to smoother projections.

Proposes MIVI for efficient posterior estimation and design of MCMC transitions.

problem Efficiently estimating posterior distributions in constrained time.
method Combines variational inference and MCMC with a variational distribution and optimized Markov chain.
result Optimized Markov chain improves variational distribution and vice versa, leading to more accurate posteriors.

Risk-averse model uncertainty framework for safe reinforcement learning.

problem Safe decision making in uncertain environments.
method Risk-averse perspective towards model uncertainty using coherent distortion risk measures; equivalent to distributionally robust safe reinforcement learning problems; efficient, model-free implementation.
result Demonstrates robust performance and safety across perturbed test environments.

Study dynamic risk measures with distributional uncertainty using optimal transport.

problem Risk robustification under distributional uncertainty in Markovian models.
method Characterize risk measures via convex monotone semigroups and optimal transport costs.
result Identify generator and correction terms for dynamic risk measures under different scaling regimes.

Deep state space model forecasts time series with uncertainty.

problem Probabilistic forecasting for risk management.
method Parameterized deep networks for non-linear models, recurrent neural nets for dependency, ARD network for exogenous variables.
result Accurate and sharp probabilistic forecasts with realistic uncertainty growth.

Study values and optimizes forestry leases under risk and uncertainty.

problem Valuing and optimizing forestry leases in the presence of catastrophe risk and parameter uncertainty.
method Stochastic bio-economic models, Kalman filter, maximum likelihood estimation, RBSDEs, Monte Carlo simulations.
result Conservative strategy is recommended due to parameter uncertainty.

Study shows sudden loss of balance in stock market networks after 2011, reducing predictability.

problem Reduced predictability in stock markets due to structural changes.
method Rank correlations and weighted signed networks to analyze interconnectivity and balance.
result Sudden loss of balance in stock market networks after 2011, leading to decreased predictability.

Robust reinforcement learning aims to produce policies that have strong guarantees even in the face of environments/transition models whose parameters have strong uncertainty. Existing work uses value-based methods and the usual primitive action setting. In this paper, we propose robust methods for learning temporally …

2018-02-09abs ↗pdf ↗

BCPO optimizes offline RL policies by converting uncertainty into conservative bounds.

problem Offline RL's fragility under distribution shifts and model errors.
method Bayesian approach with credible lower bounds and KL regularization.
result BCPO yields an uncertainty-calibrated policy that avoids exploiting model errors.

Safe-M3^3-UCRL learns safe policies for multi-agent systems with global constraints.

problem Global constraints in mean-field reinforcement learning for multi-agent systems.
method Safe-M3^3-UCRL uses epistemic uncertainty and log-barrier approach to ensure constraints satisfaction.
result Safe-M3^3-UCRL learns safe policies for multi-agent systems with global constraints.

New algorithm reduces regret and constraint violation in adversarial CMDP learning.

problem Online learning for episodic stochastically constrained Markov decision processes (CMDPs) with adversarial loss.
method Upper Confidence Primal-Dual Reinforcement Learning (UC-PDL) algorithm.
result Achieves O~(LSAT)\widetilde{\mathcal{O}}(L|\mathcal{S}|\sqrt{|\mathcal{A}|T}) upper bounds of both regret and constraint violation.

We present an analysis of oil prices in US$ and in other major currencies that diagnoses unsustainable faster-than-exponential behavior. This supports the hypothesis that the recent oil price run-up has been amplified by speculative behavior of the type found during a bubble-like expansion. We also attempt to unravel t…

2008-06-06abs ↗pdf ↗

New theorems show agents need specific internal structures to perform well under uncertainty.

problem How do agents need to be structured to perform well under uncertainty?
method Proved selection theorems showing strong task performance forces specific internal structures.
result Strong task performance forces world models, belief-like memory, and persistent regime-tracking variables.

Efficient RL for linear MDPs with unknown transitions.

problem Long planning horizons and unknown state transitions in linear mixture MDPs.
method Horizon-free algorithm using weighted least squares with variance and uncertainty awareness.
result Achieves optimal regret up to logarithmic factors.