Continuous-time algorithms improve online learning performance.
problem Online learning with sequential data and minimizing overall regret.
method Extending discrete-time algorithms to continuous-time models for online linear optimization, adversarial bandit, and adversarial linear bandit.
result Optimal regret bounds are proven for continuous-time settings.
Consider power utility maximization of terminal wealth in a 1-dimensional continuous-time exponential Levy model with finite time horizon. We discretize the model by restricting portfolio adjustments to an equidistant discrete time grid. Under minimal assumptions we prove convergence of the optimal discrete-time strate…
New method solves continuous time mean-variance model for consistent investment strategy.
problem Time-consistent optimal strategy for continuous time mean-variance model.
method Developed a new Bellman principle method.
result Obtained a time-consistent dynamic optimal strategy.
Paper solves POMDPs in continuous time and discrete spaces.
problem Optimal decision making in discrete state and action space systems under partial observability.
method Combining optimal filtering theory and deep learning to solve a Hamilton-Jacobi-Bellman equation.
result Derives a mathematical description and solution approach for continuous-time POMDPs.
New continuous-time optimization algorithms converge in finite time to local minima.
problem Finding local minima in optimization problems.
method Discontinuous dynamical systems with finite-time convergence via Lyapunov-based differential inequality.
result Finite-time convergence to strict local minima with provable settling time.
Study analyzes a new algorithm for complex optimization problems.
problem Stochastic bilevel optimisation problems in continuous-time models.
method Continuous-time, two-timescale stochastic approximation algorithm.
result Obtained weak convergence rate using central limit theorem.
Efficient deep policy gradient method for continuous-time control problems.
problem Optimal control in continuous time with fine time discretization.
method Multi-scale deep policy gradient method with varying time discretization.
result Targeted efficiency in computational resources achieved through multi-scale approach.
New RL framework models continuous-time dynamics using neural ODEs.
problem Modeling continuous-time dynamics in semi-Markov decision processes.
method Model-based reinforcement learning with neural ODEs.
result High-performing policies developed with minimal data.
We aim to construct the optimal solutions to the undiscounted continuous-time infinite horizon optimization problems, the objective functionals of which may be unbounded. We identify the condition under which the limit of the solutions to the finite horizon problems is optimal for the infinite horizon problems under th…
Study on optimal portfolio selection with varying borrowing and saving rates in continuous-time markets.
problem Optimal portfolio selection in markets with different borrowing and saving rates.
method Hamilton-Jacobi-Bellman equation, partial differential equation, verification argument.
result Existence and smoothness of the value function, identification of trading regions and strategies.
Continuous-time model shows insider trading constraints impact market dynamics.
problem Trading constraints faced by insiders in continuous-time models.
method Proved global existence of equilibrium with terminal trading constraint.
result Equilibrium model aligns with empirical market behaviors.
CT-OT Flow estimates continuous-time dynamics from discrete snapshots.
problem Estimating continuous-time dynamics from temporally aggregated snapshots with noisy or uncertain timestamps.
method Two-stage framework: aligning neighboring intervals via partial optimal transport (POT) and reconstructing a continuous-time distribution through temporal kernel smoothing.
result Reduces distributional and trajectory errors compared with existing methods across synthetic and real datasets.
We consider a family of learning strategies for online optimization problems that evolve in continuous time and we show that they lead to no regret. From a more traditional, discrete-time viewpoint, this continuous-time approach allows us to derive the no-regret properties of a large class of discrete-time algorithms i…
Paper studies continuous prediction with experts' advice using differential equations.
problem Continuous prediction with experts' advice in online learning.
method Continuous-time stochastic calculus and differential equations.
result Improved guarantees for quantile regret with continuous-time algorithm.
This paper extends risk parity to continuous-time, solving risk budgeting problems.
problem Achieving robust risk across different assets in continuous-time.
method Characterizing risk contributions and solving risk budgeting problems using continuous-time terminal variance.
result Risk contributions and risk budgets can be represented as predictable processes in continuous-time.
Continuous-time optimal stopping solved with deep reinforcement learning
problem Optimal stopping problems in continuous time
method CARLOS (Continuous-time Adaptive Reinforcement Learning for Optimal Stopping)
result Higher prices than existing Bermudan solvers, approaching American upper bound
Continuous-time Sinkhorn flow generalizes and unifies existing dynamics.
problem Entropy-regularized optimal transport problems.
method Continuous-time mirror descent framework.
result Unified perspective on various dynamics in ML and math.
Continuous-time analysis shows SGD with noise prefers flat minima.
problem Optimizing neural networks using SGD with noise.
method Continuous-time model for SGD with noise analysis.
result Optimization prefers flat minima in certain noise regimes.
Accelerated gradient methods play a central role in optimization, achieving optimal rates in many settings. While many generalizations and extensions of Nesterov's original acceleration method have been proposed, it is not yet clear what is the natural scope of the acceleration concept. In this paper, we study accelera…
Stochastic gradient descent in continuous time (SGDCT) provides a computationally efficient method for the statistical learning of continuous-time models, which are widely used in science, engineering, and finance. The SGDCT algorithm follows a (noisy) descent direction along a continuous stream of data. SGDCT performs…
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…
It is well known that mean-variance portfolio selection is a time-inconsistent optimal control problem in the sense that it does not satisfy Bellman's optimality principle and therefore the usual dynamic programming approach fails. We develop a time- consistent formulation of this problem, which is based on a local not…
Continuous-time mean-variance portfolio selection model with nonlinear wealth equations and bankruptcy prohibition is investigated by the dual method. A necessary and sufficient condition which the optimal terminal wealth satisfies is obtained through a terminal perturbation technique. It is also shown that the optimal…
The paper studies problem of continuous time optimal portfolio selection for a incom- plete market diffusion model. It is shown that, under some mild conditions, near optimal strategies for investors with different performance criteria can be constructed using a limited number of fixed processes (mutual funds), for a m…
Continuous-time distributed mirror descent with integral feedback converges to global optimum.
problem Distributed optimization of a global strongly convex function with local convex components.
method Continuous-time distributed mirror descent with integral feedback.
result Asymptotic convergence to global optimum with constant step-size.
Study shows certainty equivalent policy minimizes regret in continuous-time systems.
problem Minimizing regret in continuous-time stochastic linear-quadratic systems.
method Theoretical analysis of randomized certainty equivalent policy.
result Establishes square-root of time regret bounds and linear scaling with parameters.
New framework for policy gradient methods in continuous time reinforcement learning.
problem Addressing policy gradient methods for continuous time reinforcement learning.
method Control randomisation technique to derive policy gradient representation for various Markovian control problems.
result Demonstrated application to optimal switching problems in the energy sector.
Optimal trading strategy in Proof-of-Stake blockchain using continuous-time control.
problem Finding the optimal balance between stake utility and consumption utility in Proof-of-Stake blockchain.
method Continuous-time control approach, dynamic programming, Hamilton-Jacobi-Bellman (HJB) equations.
result Close-form solutions for linear and convex utility functions, optimal strategies identified.
Naive investors make riskier choices than optimal strategies in continuous-time finance.
problem Continuous-time Markowitz portfolio selection with naive reoptimization.
method Analytical derivation of naive policies from discretely naive policies.
result Naive policies are always riskier and less efficient than equilibrium policies.
A \emph{new} notion of equilibrium, which we call \emph{strong equilibrium}, is introduced for time-inconsistent stopping problems in continuous time. Compared to the existing notions introduced in ArXiv: 1502.03998 and ArXiv: 1709.05181, which in this paper are called \emph{mild equilibrium} and \emph{weak equilibrium…
New framework for fair online allocation in continuous time with deadlines.
problem Fair allocation under deadlines in continuous-time online learning.
method Continuous-time utility maximization, dual ascent optimization for time averages.
result Achieves ildeO(B−1/2) regret bound in the absence of statistical knowledge. Study utility maximization with delayed information in continuous time Gaussian markets.
problem Maximizing utility with delayed information in continuous time Gaussian markets.
method Purely probabilistic approach based on Radon-Nikodym derivatives of Gaussian measures.
result Solution for optimal control and value in a specific Gaussian framework.
DQNs can approximate optimal Q-functions with high accuracy on compact sets.
problem Approximating optimal Q-functions in continuous-time Markov Decision Processes.
method Stochastic control, FBSDEs, residual network approximation theorems, large deviation bounds, viscosity solutions.
result DQNs can approximate optimal Q-functions on compact sets with arbitrary accuracy and high probability.
We study an optimal execution problem with uncertain market impact to derive a more realistic market model. We construct a discrete-time model as a value function for optimal execution. Market impact is formulated as the product of a deterministic part increasing with execution volume and a positive stochastic noise pa…
The aim of this work consists in the study of the optimal investment strategy for a behavioural investor, whose preference towards risk is described by both a probability distortion and an S-shaped utility function. Within a continuous-time financial market framework and assuming that asset prices are modelled by semim…
In this paper, two Q-learning (QL) methods are proposed and their convergence theories are established for addressing the model-free optimal control problem of general nonlinear continuous-time systems. By introducing the Q-function for continuous-time systems, policy iteration based QL (PIQL) and value iteration based…
This is a follow up of our previous paper - Trybuła and Zawisza \cite{TryZaw}, where we considered a modification of a monotone mean-variance functional in continuous time in stochastic factor model. In this article we address the problem of optimizing the mentioned functional in a market with a stochastic interest rat…
The paper develops RL methods for optimal switching between multiple states.
problem Optimal switching between multiple states in continuous time.
method Entropy-regularized exploration, HJB equations, policy improvement, value function convergence.
result The RL algorithm converges to optimal policies as temperature parameter vanishes.
We price and hedge American options robustly in continuous time.
problem Pricing and hedging American options in continuous time with model uncertainty.
method Assumes continuous semimartingale asset prices and closed convex constraints on volatility. Proves robust pricing-hedging duality and identifies American options as European options on an enlarged space.
result We prove robust pricing-hedging duality and show it holds against richer models with dynamic trading of European options.
New method optimizes SDE models using continuous-time gradient descent.
problem Optimizing over the stationary distribution of SDE models.
method Continuous-time stochastic gradient descent for SDE models.
result Asymptotic convergence to the direction of steepest descent.
To improve the efficient frontier of the classical mean-variance model in continuous time, we propose a varying terminal time mean-variance model with a constraint on the mean value of the portfolio asset, which moves with the varying terminal time. Using the embedding technique from stochastic optimal control in conti…
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.
Improved continuous-time consistency models for large-scale image generation.
problem Training instability and discretization errors in existing diffusion models.
method Unified theoretical framework, improved diffusion process, and network architecture.
result Trained continuous-time CMs at 1.5B parameters, achieving state-of-the-art FID scores.
Study optimal growth strategies in a continuous-time asset market.
problem Guaranteeing that individual agent strategies cannot outperform the market.
method Mean-field approximation of an infinite number of infinitesimal agents, focusing on optimal strategy distribution among assets.
result Optimal strategy for market agents is to invest proportionally to discounted expected relative dividend intensities.
Solves steering problem with continuous time, Hilbert-Schmidt cost, and matrix ODEs.
problem Fixed horizon linear quadratic covariance steering in continuous time with a specific terminal cost.
method Formulates necessary conditions as a coupled matrix ODE two-point boundary value problem, designs a matricial recursive algorithm, and proves convergence.
result Proposes and proves the convergence of a matricial recursive algorithm for solving the steering problem.
Study optimal strategy for maximizing exponential utility in financial market with linear price impact.
problem Maximizing exponential utility in financial market with linear price impact.
method Purely probabilistic approach using duality.
result Computed optimal portfolio strategy and value for Ornstein-Uhlenbeck process.
New framework optimizes multi-asset portfolio choice for high dimensions.
problem Optimizing high-dimensional continuous-time portfolio choice.
method Combines Pontryagin's Maximum Principle with BPTT for neural network policy learning.
result Achieves near-optimal policies with improved efficiency and precision.
This paper proposes a general framework of multi-armed bandit (MAB) processes by introducing a type of restrictions on the switches among arms evolving in continuous time. The Gittins index process is constructed for any single arm subject to the restrictions on switches and then the optimality of the corresponding Git…