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

Trend · papers per month

50100150200 · May 202619922001200920172026
48 results for exponential Bellman equation

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.

The paper analyzes optimal consumption with past spending maximum as a reference.

problem Optimal consumption with past spending maximum as a reference.
method Path-dependent exponential utility, Hamilton-Jacobi-Bellman (HJB) equation, dual transform, smooth-fit principle.
result Closed-form solutions for optimal investment and consumption strategies in each region.

The paper studies scaling limits of hedging prices in financial models.

problem Scaling limits of exponential utility indifference prices in financial models.
method Formulated dual problem as stochastic control, solved HJB equation for upper bound, used duality result for lower bound.
result Represented scaling limit in terms of specific relative entropy and constructed asymptotic optimal hedging strategies.

We study power utility maximization for exponential Lévy models with portfolio constraints, where utility is obtained from consumption and/or terminal wealth. For convex constraints, an explicit solution in terms of the Lévy triplet is constructed under minimal assumptions by solving the Bellman equation. We use a nove…

2009-12-09abs ↗pdf ↗

Study optimal reinsurance and investment strategies under common shocks affecting financial and actuarial markets.

problem Maximizing expected exponential utility of terminal wealth in a company facing both ordinary and catastrophic claims.
method Modeling common shocks affecting financial and actuarial markets, using stochastic control and Hamilton-Jacobi-Bellman equations.
result Characterization of optimal reinsurance and investment strategies under common shock dependence.

The paper explores solutions to the distributional Bellman equation in reinforcement learning.

problem Distributional reinforcement learning considers complete return distributions, not just expected returns.
method Study existence and uniqueness of solutions to general distributional Bellman equations, linking them to multivariate affine equations.
result Any solution to a distributional Bellman equation can be derived from a multivariate affine distributional equation.

New RL approach handles non-exponential discounting for sequential decisions.

problem Modeling human discounting in sequential decision-making tasks.
method Generalized model-based reinforcement learning with arbitrary discount functions, using Hamilton-Jacobi-Bellman equation and collocation method.
result Validated approach on simulated problems, showing applicability to human discounting.

The Bellman error is a poor proxy for value function accuracy, even with all state-action pairs.

problem The Bellman error is a poor proxy for the accuracy of the value function.
method Study of the Bellman equation as a surrogate objective for value prediction accuracy.
result The magnitude of the Bellman error is only weakly related to the distance to the true value function, even with all state-action pairs.

Study optimal investment strategies for an insurer in two currency markets.

problem Maximizing expected exponential utility of terminal wealth for an insurer in two currency markets.
method Dynamic programming method applied to solve Hamilton-Jacobi-Bellman equations.
result Optimal investment strategies and value functions are derived.

Study solves optimal portfolio selection using HJB equation.

problem Optimal portfolio selection problem.
method Maximal monotone operator method, Banach fixed-point theorem, Fourier transform, monotone operators technique.
result Existence and uniqueness of solution to HJB equation.

Choquet regularization improves exploration in RL.

problem Improving exploration in reinforcement learning.
method Introducing Choquet regularizers to measure and manage exploration, reformulating RL problems and deriving explicit solutions.
result Explicit optimal distributions and Choquet regularizers for various exploratory samplers.

Deep neural nets approximate high-dimensional HJB equations efficiently.

problem Approximating solutions to high-dimensional HJB equations.
method Deep neural networks for approximating solutions.
result Deep neural networks can approximate solutions without the curse of dimensionality.

We present an approach for pricing European call options in presence of proportional transaction costs, when the stock price follows a general exponential Lévy process. The model is a generalization of the celebrated work of Davis, Panas and Zariphopoulou (1993), where the value of the option is defined as the utility …

2016-11-01abs ↗pdf ↗

Study risk-sensitive market making with entropy regularization for better quote control.

problem Risk-sensitive market making with exponential utility and penalties.
method Entropy-regularized certainty-equivalent Bellman policies for discrete-time market dynamics.
result Proves convergence and performance bounds for entropy-regularized policies.

The paper solves a complex financial optimization problem using a novel mathematical technique.

problem Optimizing portfolio selection in financial markets.
method Maximal monotone operator method and Riccati transformation.
result Existence and uniqueness of a solution to the transformed parabolic equation in a Sobolev space.

The paper introduces Bellman-consistent pessimism to improve offline reinforcement learning without overly pessimistic bias.

problem Offline reinforcement learning's challenge of discovering good policies without exhaustive exploration.
method Introduces Bellman-consistent pessimism for function approximation, improving sample complexity and adaptability.
result Improves sample complexity by O(d)\mathcal{O}(d) in the action space finite case, and automatically adapts to bias-variance tradeoff.

This paper extends the classical consumption and portfolio rules model in continuous time (Merton 1969, 1971) to the framework of decision-makers with time-inconsistent preferences. The model is solved for different utility functions for both, naive and sophisticated agents, and the results are compared. In order to so…

2009-01-16abs ↗pdf ↗

Optimal contracts are found for agents with quadratic effort costs.

problem Finding optimal contracts in principal-agent problems with quadratic effort costs.
method Modeling the problem using Hamilton-Jacobi-Bellman (HJB) equations and proving the existence of classical solutions.
result Existence of optimal contracts for agents with quadratic effort costs is proven.

Paper analyzes convergence of Sinkhorn algorithm for discrete probability measures on torus.

problem Achieving exponential convergence of Sinkhorn algorithm in general settings.
method Coupling by reflection techniques for controlled diffusions on the torus.
result Proves pointwise exponential convergence of Sinkhorn iterates and their gradient.

The problem of determining the European-style option price in the incomplete market has been examined within the framework of stochastic optimization. An analytic method based on the discrete dynamic programming equation (Bellman equation) has been developed that gives the general formalism for determining the option p…

1998-07-30abs ↗pdf ↗

We solve continuous-time reinforcement learning using distributional Hamilton-Jacobi-Bellman equations.

problem Predicting the distribution of returns in continuous-time, stochastic environments.
method We derive a distributional Hamilton-Jacobi-Bellman equation for Itô diffusions and Feller-Dynkin processes, and propose an algorithm based on a JKO scheme.
result We propose an online control algorithm that can be used to approximately solve the distributional HJB equation.

New method quantifies uncertainty in reinforcement learning models.

problem Quantifying uncertainty over expected cumulative rewards in reinforcement learning.
method Proposes a new uncertainty Bellman equation to more accurately estimate value function variance.
result Our method converges to the true posterior variance over values and improves sample-efficiency.

Deep nets solve MDPs without high dimensions.

problem Solving Bellman equations for MDPs in high dimensions.
method Deep neural networks with ReLU activation approximating payoff and transition functions.
result Deep nets can approximate QQ-functions in polynomially bounded parameters.

We study the optimal excess-of-loss reinsurance problem when both the intensity of the claims arrival process and the claim size distribution are influenced by an exogenous stochastic factor. We assume that the insurer's surplus is governed by a marked point process with dual-predictable projection affected by an envir…

2019-04-10abs ↗pdf ↗

Deep learning for HJB PDEs using synthetic data and residual minimization.

problem Solving Hamilton-Jacobi-Bellman PDEs for optimal control problems.
method Gradient-augmented synthetic dataset for supervised learning, residual minimization.
result Improves accuracy and efficiency of deep learning for HJB PDEs.

We extend the Deep Galerkin Method (DGM) introduced in Sirignano and Spiliopoulos (2018)} to solve a number of partial differential equations (PDEs) that arise in the context of optimal stochastic control and mean field games. First, we consider PDEs where the function is constrained to be positive and integrate to uni…

2019-11-30abs ↗pdf ↗

We consider the exploration/exploitation problem in reinforcement learning. For exploitation, it is well known that the Bellman equation connects the value at any time-step to the expected value at subsequent time-steps. In this paper we consider a similar \textit{uncertainty} Bellman equation (UBE), which connects the…

2017-09-15abs ↗pdf ↗

Optimizes control of infectious disease spread using stochastic methods.

problem Optimizing control of highly infectious diseases like COVID-19.
method Reformulated Hamilton-Jacobi-Bellman equation as stochastic minimum principle, leading to forward-backward stochastic differential equations.
result Numerous numerical solutions presented under various scenarios.

Bayes optimal algorithm under certain conditions doesn't achieve exponential simple regret.

problem Best arm identification with normal rewards over time.
method Fixed-budget best arm identification problem with rewards from normal distributions. Evaluates performance via simple regret.
result Bayes optimal algorithm does not yield exponential decrease in simple regret.

We consider a general class of non-linear Bellman equations. These open up a design space of algorithms that have interesting properties, which has two potential advantages. First, we can perhaps better model natural phenomena. For instance, hyperbolic discounting has been proposed as a mathematical model that matches …

2019-07-08abs ↗pdf ↗