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

22446587 · Jun 202019922001200920172026
48 results for risk-sensitive RL

Study risk-sensitive RL in offline settings, improving efficiency and accuracy.

problem Efficiently derive near-optimal policies for risk-sensitive RL using offline data.
method Introduced two provably sample-efficient algorithms for risk-sensitive offline RL in linear MDPs.
result First provably efficient risk-sensitive offline RL algorithms.

Paper introduces a new method for risk-sensitive investment management using RL.

problem Risk-sensitive portfolio management with unknown model parameters.
method Combines RL and risk-sensitive stochastic control with Gaussian perturbations for exploration.
result Endogenous relative-entropy regularization and optimal investment strategy derived.

Improved risk-sensitive RL with exponential Bellman equation and better regret bounds.

problem Exponential gap between upper and lower bounds in risk-sensitive RL.
method Identified and addressed deficiencies in existing algorithms and analysis; developed novel analysis and exploration mechanism.
result Improved regret upper bounds over existing ones.

This paper introduces a method to incorporate risk sensitivity in RL using quadratic variation penalties.

problem Risk-sensitive reinforcement learning under entropy regularization.
method Equivalent martingale property and quadratic variation penalty for value process.
result The proposed method improves finite-sample performance in linear-quadratic control problems.

This paper analyzes risk-sensitive reinforcement learning with Conditional Value-at-Risk (CVaR) for robust Markov Decision Processes.

problem Risk-sensitive reinforcement learning for robust Markov Decision Processes (RMDPs) with state-action-dependent ambiguity sets.
method The paper establishes a connection between robustness and risk sensitivity, defining a new risk measure NCVaR and proposing value iteration algorithms.
result The proposed approach using NCVaR optimization and value iteration algorithms can solve problems with state-action-dependent ambiguity sets.

The objective in a traditional reinforcement learning (RL) problem is to find a policy that optimizes the expected value of a performance metric such as the infinite-horizon cumulative discounted or long-run average cost/reward. In practice, optimizing the expected value alone may not be satisfactory, in that it may be…

2018-10-22abs ↗pdf ↗

The paper optimizes risk-sensitive RL with CVaR, achieving near-minimax-optimal results.

problem Optimizing risk-sensitive reinforcement learning with CVaR objective.
method Developed algorithms for multi-arm bandits and online RL in MDPs, achieving near-minimax-optimal regret.
result Achieved near-minimax-optimal regret of O(τ1SAK)O(τ^{-1}\sqrt{SAK}) for constant ττ.

Efficient RL in partially observable risk-sensitive environments with hindsight observations.

problem Risk-sensitive reinforcement learning in partially observable environments.
method Integrates hindsight observations into POMDP framework, develops novel RL algorithm.
result Achieves polynomial regret with provable efficiency, outperforming existing methods.

A new method for risk-sensitive reinforcement learning using Spectral Risk Measures.

problem Incorporating risk sensitivity into reinforcement learning algorithms.
method Proposes a novel framework for optimizing Spectral Risk Measures in both online and offline RL algorithms.
result Demonstrates consistent outperformance over existing risk-sensitive methods in various domains.

A new RL framework for risk-sensitive decision-making using convex scoring functions.

problem Time-inconsistent risk measures in reinforcement learning.
method Convex scoring functions, augmented state space, auxiliary variable, customized Actor-Critic algorithm.
result Theoretical guarantees for approximation and convergence under certain conditions.

Most conventional Reinforcement Learning (RL) algorithms aim to optimize decision-making rules in terms of the expected returns. However, especially for risk management purposes, other risk-sensitive criteria such as the value-at-risk or the expected shortfall are sometimes preferred in real applications. Here, we desc…

2012-03-15abs ↗pdf ↗

This work tackles risk-sensitive deep RL by optimizing policies with variance constraints.

problem Risk and aleatoric uncertainty in deep reinforcement learning.
method Lagrangian and Fenchel dualities to transform the problem into an unconstrained saddle-point policy optimization problem, and an actor-critic algorithm to iteratively update policy, Lagrange multiplier, and Fenchel dual variable.
result The proposed actor-critic algorithm finds a globally optimal policy at a sublinear rate.

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.

Unified market making controls risk, arbitrage, and volatility surfaces.

problem Market making risk, arbitrage, and volatility surface consistency.
method Constrained RL and stochastic control for risk-sensitive execution and hedging.
result Agent achieves positive P&L with zero calendar and butterfly violations.

Develops RL for dynamic risk assessment in stochastic optimization.

problem Time-consistent risk assessment in stochastic optimization problems.
method Model-free reinforcement learning with dynamic convex risk measures, time-consistent dynamic programming, policy gradient updates, actor-critic neural network optimization.
result Demonstrates optimal policies for statistical arbitrage, financial hedging, and robot control.

This work develops efficient methods for continuous-time distributional reinforcement learning.

problem Continuous-time reinforcement learning with return distributions.
method Parameterizing return distributions using quantile representation and showing topological properties.
result Efficient approximation algorithm for continuous-time distributional reinforcement learning.

Paper develops NPG for risk-averse RL with ECRMs, proving global convergence.

problem Ensuring reliable performance in stochastic RL problems with risk-averse policies.
method Developed natural policy gradient updates for ECRMs-based RL problems, proving global optimality and iteration complexity.
result Global convergence of risk-averse NPG algorithm with ECRMs.

Study risk-sensitive reinforcement learning with Lipschitz dynamic risk measures, establishing regret bounds.

problem Risk-sensitive reinforcement learning in Markov decision processes.
method Two model-based algorithms for Lipschitz dynamic risk measures, focusing on regret bounds.
result Upper bounds demonstrate optimal dependencies on actions and episodes, reflecting risk sensitivity vs. sample complexity trade-off.

We develop a framework for interacting with uncertain environments in reinforcement learning (RL) by leveraging preferences in the form of utility functions. We claim that there is value in considering different risk measures during learning. In this framework, the preference for risk can be tuned by variation of the p…

2019-06-14abs ↗pdf ↗

RL-CVaR model improves insurance reserving under economic stress.

problem Managing insurance reserve setting under claim development uncertainty and macroeconomic stress.
method Reinforcement Learning (PPO) with CVaR constraints, trained under regime-aware curriculum.
result RL-CVaR policy reduces solvency violations and tail-risk compared to classical methods.

Overview of risk-sensitive Markov decision processes with Optimized Certainty Equivalent.

problem Optimizing decision-making under risk in Markov processes.
method Analyzes risk-sensitive criteria using Optimized Certainty Equivalent, including entropic risk and Conditional Value-at-Risk.
result Conditions for the existence of optimal policies and solution procedures are provided.

We study risk-sensitive imitation learning where the agent's goal is to perform at least as well as the expert in terms of a risk profile. We first formulate our risk-sensitive imitation learning setting. We consider the generative adversarial approach to imitation learning (GAIL) and derive an optimization problem for…

2018-08-13abs ↗pdf ↗

Separates estimation and control in risk-sensitive investment problems with partial observation.

problem Risk-sensitive investment problems with incomplete observation.
method Investigates separability of a general class of risk-sensitive investment management problems using a finite-dimensional filter.
result The separated problem is strictly equivalent to the original control problem.

New algorithms optimize risk in reinforcement learning with exponential utility.

problem Optimizing rewards under risk in reinforcement learning with unknown transition kernels.
method Two model-free algorithms: Risk-Sensitive Value Iteration (RSVI) and Risk-Sensitive Q-learning (RSQ).
result Proved near-optimal regret bounds for RSVI and RSQ.

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.

The paper studies risk-sensitive learning schemes and provides learning bounds for empirical OCE minimizers.

problem Risk-sensitive learning aims to minimize risk-averse measures of loss.
method Proposes learning bounds for empirical OCE minimizers based on Rademacher average and variance.
result Provides two learning bounds on the performance of empirical OCE minimizers.

Framework improves ETF volatility forecasting by adapting to market conditions.

problem Challenges in volatility forecasting due to shifting market conditions and varying model performance.
method Risk-sensitive specialist routing using online risk-sensitive evaluation and state-dependent gating.
result Reduces forecast loss by 24% and underprediction loss by 22% compared to rolling-best baseline.

The paper addresses human-like decision-making in multi-agent systems using bounded risk-sensitive Markov Games.

problem Modeling human-like decision-making in multi-agent systems with risk-seeking and loss-aversion behaviors.
method Forward policy design and inverse reward learning with iterative reasoning and cumulative prospect theory.
result The proposed algorithms demonstrate both risk-averse and risk-seeking behaviors in multi-agent systems.

New algorithm for risk-sensitive reinforcement learning with natural policy gradients.

problem Risk-sensitive reinforcement learning with downside risk constraints.
method Introduce a new Bellman equation to estimate the lower partial moment of returns, use natural policy gradients, and extend Reward Constrained Policy Optimization.
result Sample-efficient estimation of partial moments and effective risk-sensitive control.

Develops variational framework for LQG risk-sensitive MFGs with major-minor interactions.

problem Risk-sensitive optimal control in LQG systems with major-minor interactions.
method Variational approach, nonlinear necessary and sufficient condition of optimality, equivalent risk-neutral measure, Markovian closed-loop best-response strategies.
result Derives optimal control strategies for LQG risk-sensitive MFGs with major-minor interactions, establishing Nash and ε\varepsilon-Nash equilibria.

Autonomous systems can substantially enhance a human's efficiency and effectiveness in complex environments. Machines, however, are often unable to observe the preferences of the humans that they serve. Despite the fact that the human's and machine's objectives are aligned, asymmetric information, along with heterogene…

2017-05-26abs ↗pdf ↗

We study a risk sensitive control version of the lifetime ruin probability problem. We consider a sequence of investments problems in Black-Scholes market that includes a risky asset and a riskless asset. We present a differential game that governs the limit behavior. We solve it explicitly and use it in order to find …

2015-03-19abs ↗pdf ↗

In this paper we consider long-run risk sensitive average cost impulse control applied to a continuous-time Feller-Markov process. Using the probabilistic approach, we show how to get a solution to a suitable continuous-time Bellman equation and link it with the impulse control problem. The optimal strategy for the und…

2019-12-05abs ↗pdf ↗