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

24487296 · Jun 202019922001200920172026
48 results for uncertain rewards

Novel framework for risk-sensitive reinforcement learning using martingale decomposition.

problem Risk sensitivity in sequential decision-making with uncertain rewards.
method Martingale decomposition and chaotic variation for reward uncertainty, integrated into model-free reinforcement learning algorithms.
result Demonstrated relevance of risk-sensitive reinforcement learning in grid world and portfolio optimization problems.

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}).

Algorithm learns optimal coordination for strategic agents in uncertain settings.

problem Optimizing rewards for strategic agents with private types and actions.
method Combines delaying mechanism, reward angle estimation, and LinUCB algorithm.
result Near optimal regret bound of O~(T)\tilde{O}(\sqrt{T}) for learning optimal policy.

Improved DPO framework penalizes preference uncertainty to avoid overoptimization.

problem Aligning LLMs to human preferences is challenging due to varied, context-dependent, and ambiguous preferences.
method Developed a pessimistic framework for DPO by introducing preference uncertainty penalization schemes.
result Improved overall performance and better completions on high-uncertainty responses compared to vanilla DPO.

The question of how to explore, i.e., take actions with uncertain outcomes to learn about possible future rewards, is a key question in reinforcement learning (RL). Here, we show a surprising result: We show that Q-learning with nonlinear Q-function and no explicit exploration (i.e., a purely greedy policy) can learn s…

2018-05-29abs ↗pdf ↗

In this paper we consider stochastic optimization problems for an ambiguity averse decision maker who is uncertain about the parameters of the underlying process. In a first part we consider problems of optimal stopping under drift ambiguity for one-dimensional diffusion processes. Analogously to the case of ordinary o…

2011-10-18abs ↗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.

A new policy learning method allows policies to abstain when uncertain, improving safety and applicability.

problem Risk of making decisions without full confidence in uncertain predictions.
method Policy learning with abstention, identifying near-optimal policies and constructing an abstention rule.
result Improved safety and applicability in policy learning, with theoretical guarantees.

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 ↗

New strategies improve multi-agent decision-making on irregular networks.

problem Maximizing group reward in multi-agent settings with heterogeneous strategies.
method Design and analysis of heterogeneous explore-exploit strategies for multi-star networks.
result Group performance improves under heterogeneous strategies compared to homogeneous strategies.

Algorithm identifies optimal stable matching in uncertain two-sided markets.

problem Sequential learning in two-sided markets with unknown preferences.
method Pure exploration approach with elimination-based algorithms exploiting partial preference information.
result Identification of pervasive stable matching for optimal stable matching identification.

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.

Framework for robust control in cooperative systems with uncertain common noise.

problem Optimizing collective behavior of agents in the presence of uncertain common noise.
method Proposes a robust mean-field control framework and proves existence of optimal controls.
result Existence of optimal open-loop controls linked to a lifted robust Markov decision problem.

This thesis proposes a derivatives hedging framework using deep learning and reinforcement learning.

problem Traditional hedging models fail in complex, uncertain markets due to assumptions like continuous trading and zero transaction costs.
method Integrates deep learning and reinforcement learning, using a spatiotemporal attention-based Transformer for probabilistic forecasting and hedging.
result The proposed method significantly outperforms traditional approaches in U.S. and Chinese financial markets.

This paper analyzes the multi-armed bandit model using path-integral methods.

problem Understanding the stochastic dynamics and optimal strategies in multi-armed bandit problems.
method Path-integral analysis of statistical physics.
result Emergence of multimodal regret distribution with large regrets from exploitation of sub-optimal arms.

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.

The paper addresses portfolio allocation with uncertain covariance matrices, finding a logarithmic risk dependence.

problem Portfolio allocation with uncertain covariance matrices.
method Calculates the expected value of CARA utility function over a distribution of covariance matrices, considering uncertainty in future returns and covariances.
result Marginalization introduces a logarithmic dependence on risk, leading to lower allocation levels for higher uncertainties.

Develops new methods for risk-aware decision-making in medical bandits.

problem Risk-averse decision-making in medical contexts with limited data.
method Safe, anytime-valid concentration bounds, risk-aware contextual bandits, nonparametric algorithms.
result Improved decision-making algorithms for postoperative patient follow-up.

Bayesian Gaussian process models handle uncertain data locations in PDE approximations.

problem Handling uncertainties in data locations for PDE approximations.
method Bayesian inference of uncertain inputs integrated into Gaussian process predictions.
result Substantial reduction in predictive uncertainties achieved through Bayesian inference.

Polynomial chaos surrogates quantify epistemic uncertainty in AI-driven scientific models.

problem Uncertainty in reward estimates hinders interpretability in sequential generative models.
method Fit polynomial chaos expansions to trained models to propagate epistemic uncertainty and quantify sensitivity.
result Interpretable decomposition of reward components driving generative decisions.

Framework for games with uncertain parameters, ensuring no player can improve by changing strategy.

problem Non-cooperative games with globally uncertain parameters and no common prior.
method Mixed strategies and subjective priors, Extended Equilibrium defined by fixed-point argument.
result Existence of Extended Equilibrium under certain conditions.

IDT learns human preferences from uncertain decisions, even when humans are suboptimal.

problem Learning human preferences from uncertain and suboptimal decisions.
method Inverse decision theory (IDT) framework, statistical analysis of IDT, characterizing sample complexity.
result Learning preferences is easier when decisions are more uncertain, even if humans are suboptimal.

The paper tackles robust control with uncertain dependence using data-driven methods.

problem Nonparametric robust control under dependence uncertainty in multi-period stochastic systems.
method Nonparametric adaptive robust control framework using stochastic gradient descent ascent algorithm.
result The controller benefits from knowing more about the uncertain model.

Paper proposes online optimization for uncertain systems using machine learning and DRO.

problem Optimization of uncertain dynamical systems with distributional uncertainty.
method Combines machine learning with Distributional Robust Optimization (DRO) to handle uncertainty.
result Online solutions with probabilistic regret bounds for uncertain systems.

This paper optimizes sampling policies for Bayesian optimization to improve exploration and exploitation.

problem Improving the balance between exploration and exploitation in Bayesian optimization.
method Developed efficient methods to estimate and optimize non-myopic acquisition functions using rollout policies and stochastic gradient optimization.
result Efficient optimization of sampling policies leads to better performance in Bayesian optimization.

This paper tackles JSSP with uncertain task durations using DRL.

problem Job Shop Scheduling Problem with uncertain task durations.
method Integrates Graph Neural Networks (GNNs) and Deep Reinforcement Learning (DRL) to generate robust schedules.
result Advances DRL applications to JSSPs, enhancing generalization and scalability.

The broad set of deep generative models (DGMs) has achieved remarkable advances. However, it is often difficult to incorporate rich structured domain knowledge with the end-to-end DGMs. Posterior regularization (PR) offers a principled framework to impose structured constraints on probabilistic models, but has limited …

2018-06-26abs ↗pdf ↗

This paper improves learning uncertain Bayesian networks from incomplete data.

problem Learning conditional probabilities in Bayesian networks with limited data.
method Develops methods to estimate and quantify uncertainty in conditional probabilities with incomplete data.
result Improves state-of-the-art approaches for handling uncertain Bayesian networks with incomplete data.

In this paper, we propose the uncertain volatility models with stochastic bounds. Like the regular uncertain volatility models, we know only that the true model lies in a family of progressively measurable and bounded processes, but instead of using two deterministic bounds, the uncertain volatility fluctuates between …

2017-02-16abs ↗pdf ↗

UnKGCP generates prediction intervals for uncertain knowledge graphs with statistical guarantees.

problem Lack of quantified predictive uncertainty in existing UnKGE methods.
method Proposes extsc{UnKGCP} framework using conformal prediction with a novel nonconformity measure.
result Sharp prediction intervals effectively capture predictive uncertainty in diverse UnKGE methods.

Novel pricing method for equity-indexed annuities under uncertain volatility and stochastic interest rate.

problem Pricing equity-indexed annuities with early surrender risk under uncertain market conditions.
method Advanced financial modeling techniques, including uncertain volatility framework and Hull-White model for interest rate dynamics. Numerical algorithm using tree-based framework with local volatility optimization.
result High effectiveness of the proposed numerical algorithm compared to machine learning-based methods.

GPMI method interpolates uncertain atrial conduction velocity on non-Euclidean manifolds.

problem Uncertainty in atrial conduction velocity calculations.
method Gaussian Process Manifold Interpolation (GPMI) on human atrial manifolds.
result GPMI accounts for atrial topology and calculates CV uncertainty.

A machine learning approach to compute Black-Scholes prices with uncertain volatility.

problem Approximating financial markets with continuous-time models like Black-Scholes when data is discrete.
method Generalized Polynomial Chaos (gPC) method combined with a machine learning technique called Bi-Fidelity.
result Efficient numerical method to quantify uncertainty in derivative pricing.

Diffusion approximations optimize sequential experimentation for uncertain parameters.

problem Maximizing reward from unknown parameter Θ with delayed action.
method Bayesian sequential experimentation framework, dynamic programming, diffusion asymptotics.
result Derives diffusion approximation for optimal experimentation strategy.

The paper tackles mean-variance analysis in Bayesian optimization under uncertainty.

problem Optimizing decisions in uncertain environments considering trade-offs between average and variance of risk.
method Developed bounds for mean and variance risk measures in Gaussian Process models and proposed AL algorithms for multi-task, multi-objective, and constrained optimization scenarios.
result Proposed AL algorithms effectively address the mean-variance trade-off in uncertain optimization scenarios.