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

142284426568 · Jun 202019922001200920172026
48 results for stochastic dynamic programming

This research develops an evolutionary approach to discover non-Gaussian stochastic dynamical systems.

problem Discovering explicit governing equations of stochastic dynamical systems with Lévy noise from data.
method ESSR approach using genetic programming, sparse regression, and nonlocal Kramers-Moyal formulas.
result The approach effectively extracts non-Gaussian stochastic dynamical systems from sample path data.

Deep learning solves complex stochastic control with jumps.

problem Solving high-dimensional stochastic control tasks with jumps.
method Model-based approach using two neural networks, iteratively trained with objectives derived from the Hamilton-Jacobi-Bellman equation.
result Demonstrates effectiveness in solving complex high-dimensional stochastic control tasks.

This paper studies dynamic stochastic optimization problems parametrized by a random variable. Such problems arise in many applications in operations research and mathematical finance. We give sufficient conditions for the existence of solutions and the absence of a duality gap. Our proof uses extended dynamic programm…

2011-05-04abs ↗pdf ↗

The paper analyzes error propagation in dynamic programming for stochastic control and option pricing.

problem Error propagation in dynamic programming for stochastic control and option pricing.
method Formulated a general dynamic programming framework, used RKHSs for nonparametric regression, and Monte Carlo subsampling for estimating continuation value.
result Proposed a rigorous error decomposition and control mechanism for error propagation in dynamic programming.

Neural model accelerates SDDP for stochastic optimization.

problem Exponential complexity of SDDP limits its applicability to low-dimensional problems.
method Trainable neural model maps problem instances to a low-dimensional piecewise linear value function.
result ν-SDDP significantly reduces problem solving cost without sacrificing solution quality.

New metric derived for robust optimization in stochastic control problems.

problem Non-parametric uncertainty in multiperiod stochastic control problems.
method Derived a new metric, adapted (p,)(p, \infty)--Wasserstein distance, and used dynamic programming principle.
result Dynamic programming principle for DRO problems with semi-separable cost functions.

This work presents the concept of kernel mean embedding and kernel probabilistic programming in the context of stochastic systems. We propose formulations to represent, compare, and propagate uncertainties for fairly general stochastic dynamics in a distribution-free manner. The new tools enjoy sound theory rooted in f…

2019-11-25abs ↗pdf ↗

Develops new optimization techniques for decision-making under uncertainty.

problem Decision-making under uncertainty with complex cost functions and nested expectations.
method Introduces Multistage Conditional Compositional Optimization (MCCO) and develops multilevel Monte Carlo techniques.
result New optimization techniques reduce scenario complexity from exponential to polynomial growth.

New method uses dynamic programming for meta continual learning.

problem Challenges of generalization and catastrophic forgetting in sequential learning.
method Developed a theoretical framework using dynamic programming for meta continual learning.
result Theoretical and practical method achieves better accuracy than existing methods.

We study a stochastic game where one player tries to find a strategy such that the state process reaches a target of controlled-loss-type, no matter which action is chosen by the other player. We provide, in a general setup, a relaxed geometric dynamic programming principle for this problem and derive, for the case of …

2012-06-27abs ↗pdf ↗

We introduce a novel numerical approach for a class of stochastic dynamic programs which arise as discretizations of backward stochastic differential equations or semi-linear partial differential equations. Solving such dynamic programs numerically requires the approximation of nested conditional expectations, i.e., it…

2016-05-24abs ↗pdf ↗

The paper solves optimal control problems for stochastic delay equations.

problem Optimal control of stochastic delay differential equations.
method Rewriting the problem in an infinite-dimensional Hilbert space, using dynamic programming and viscosity solutions.
result Characterizes the value function as the unique viscosity solution of the Hamilton-Jacobi-Bellman equation.

In this paper, we consider the problem of optimization of a portfolio consisting of securities. An investor with an initial capital, is interested in constructing a portfolio of securities. If the prices of securities change, the investor shall decide on reallocation of the portfolio. At each moment of time, the prices…

2017-12-02abs ↗pdf ↗

The paper shows how label noise in training can lead to solutions that solve a Lasso program.

problem Understanding the implicit bias of training algorithms in overparametrised models.
method Analyzing the continuous time version of the training dynamics of a quadratically parametrised model.
result The stochastic flow implicitly solves a Lasso program, providing convergence guarantees and support recovery conditions.

Solves VaR-constrained portfolio optimization in markets with stochastic volatility.

problem Optimizing portfolio in markets with stochastic volatility under VaR constraints.
method Dynamic programming approach to Heston's stochastic volatility model.
result Optimal investment strategy linked to unconstrained problem via a vega-neutral derivative.

We provide a dynamic programming principle for stochastic optimal control problems with expectation constraints. A weak formulation, using test functions and a probabilistic relaxation of the constraint, avoids restrictions related to a measurable selection but still implies the Hamilton-Jacobi-Bellman equation in the …

2011-05-04abs ↗pdf ↗

We study the performance of stochastically trained deep neural networks (DNNs) whose synaptic weights are implemented using emerging memristive devices that exhibit limited dynamic range, resolution, and variability in their programming characteristics. We show that a key device parameter to optimize the learning effic…

2017-11-09abs ↗pdf ↗

Model for optimal cybersecurity investment considering clustered cyberattacks.

problem Optimal investment in cybersecurity to reduce system vulnerability under clustered cyberattacks.
method Developed a continuous-time stochastic model using a Hawkes process, extended Gordon-Loeb model, solved as a Markovian stochastic optimal control problem.
result Investment policies that account for attack clustering lead to more effective and responsive strategies, improving upon static and Poisson-based approaches.

New algorithm solves complex stopping problems with robust optimization.

problem Solving complex stochastic optimal stopping problems.
method Simulation-based robust optimization with exact reformulation as a zero-one bilinear program.
result Developed polynomial-time heuristics and algorithms for practical solution.

Solves Merton's investment-consumption problem with certainty equivalent approach.

problem Maximizing CRRA utility of consumption over time and investment mix.
method Identifies a certainty equivalent problem for the Merton problem, reformulates it as an SOCP, and applies it to model predictive control.
result The certainty equivalent problem can be solved as an SOCP, facilitating model predictive control.

The paper analyzes trade execution strategies for large traders in a stochastic market environment.

problem Analyzing trade execution strategies in a stochastic market with price impact.
method Formulated a Markov game model and used backward induction method of dynamic programming.
result Explicit closed-form execution strategy at Markov perfect equilibrium.

Efficiently selects top-m designs for various contexts using sequential sampling.

problem Optimizing selection of top-m designs across different contexts.
method Formulated as a stochastic dynamic programming problem, developed sequential sampling policy.
result Asymptotically optimal sampling ratios for efficient selection.

We introduce the notion of a stochastic probabilistic program and present a reference implementation of a probabilistic programming facility supporting specification of stochastic probabilistic programs and inference in them. Stochastic probabilistic programs allow straightforward specification and efficient inference …

2020-01-08abs ↗pdf ↗

The paper solves complex control problems using neural networks.

problem Solving McKean-Vlasov control problems.
method Mean-field neural networks and algorithms based on dynamic programming and stochastic maximum principle.
result Extensive numerical results show the accuracy of the proposed algorithms.

Inspired by dynamic programming, we propose Stochastic Virtual Gradient Descent (SVGD) algorithm where the Virtual Gradient is defined by computational graph and automatic differentiation. The method is computationally efficient and has little memory requirements. We also analyze the theoretical convergence properties …

2019-07-09abs ↗pdf ↗

The paper solves multi-period portfolio selection with constraints using a dynamic factor model.

problem Multi-period mean-variance portfolio selection with constraints.
method Dynamic factor model, dynamic programming, piecewise linear feedback policy.
result Optimal portfolio policies determined by two stochastic processes.

This paper considers a non-Markov control problem arising in a financial market where asset returns depend on hidden factors. The problem is non-Markov because nonlinear filtering is required to make inference on these factors, and hence the associated dynamic program effectively takes the filtering distribution as one…

2018-07-22abs ↗pdf ↗

Paper tackles non-Markovian control problems with new learning methods.

problem Non-Markovian stochastic control problems with unknown parameters.
method Off-model training and importance sampling for deep neural network approximation.
result Quantitative error bounds for adaptive learning under model uncertainty.

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.

Paper analyzes convergence of dynamic policy gradient for MDPs, improving performance in finite-time problems.

problem Optimal policies in finite-time MDPs are not stationary and require epoch-specific training.
method Introduces dynamic policy gradient combining dynamic programming and policy gradient, analyzes convergence for softmax parametrisation.
result Dynamic policy gradient training exploits finite-time structure, leading to better convergence bounds.

Paper introduces a new volatility model for natural gas markets and discusses swing option pricing.

problem Modeling price and storage dynamics in natural gas markets with path-dependent volatility.
method Developed a novel stochastic path-dependent volatility model and used deep learning for swing option pricing.
result Proposed a deep learning method for numerical approximations of swing option pricing.

We generalize the primal-dual methodology, which is popular in the pricing of early-exercise options, to a backward dynamic programming equation associated with time discretization schemes of (reflected) backward stochastic differential equations (BSDEs). Taking as an input some approximate solution of the backward dyn…

2013-10-14abs ↗pdf ↗

BCI provides calibrated prediction intervals for time series forecasts.

problem Calibration of prediction intervals for time series forecasts.
method BCI wraps around any time series forecasting models and optimizes interval lengths using dynamic programming.
result BCI achieves long-term coverage under arbitrary distribution shifts and temporal dependence.

CEFOL uses deep learning for dynamic programming with recursive utility.

problem Challenges in solving dynamic programming problems with recursive utility.
method Introduces a separate neural network for certainty equivalent, uses first-order optimality conditions to learn value and policy functions.
result CEFOL achieves high accuracy in learning value and policy functions, matching VFI benchmarks.

Machine learning provides algorithms that can learn from data and make inferences or predictions on data. Stochastic acceptors or probabilistic automata are stochastic automata without output that can model components in machine learning scenarios. In this paper, we provide dynamic programming algorithms for the comput…

2018-12-23abs ↗pdf ↗

The paper models battery valuation in intraday electricity markets, incorporating liquidity costs.

problem Valuing batteries in intraday electricity markets considering liquidity costs.
method Stochastic model for mid-prices combined with a deterministic model for liquidity costs, using dynamic programming for optimization.
result Liquidity costs significantly impact battery valuation, especially with multiple batteries.

We study utility maximization problem for general utility functions using dynamic programming approach. We consider an incomplete financial market model, where the dynamics of asset prices are described by an RdR^d-valued continuous semimartingale. Under some regularity assumptions we derive backward stochastic partial…

2008-06-02abs ↗pdf ↗