arXiv Machine Learning

Continuous-Time Reinforcement Learning for Controlled Hawkes Jump-Diffusions

The paper introduces a method for controlling multivariate Hawkes-driven stochastic differential equations using machine learning in a non‑Markovian setting. It develops a finite‑dimensional Markovianization technique that approximates Hawkes processes with mixtures of exponential kernels, proving convergence of the approximation to the original process and its value function. A continuous‑time deterministic policy gradient algorithm, called Hawkes‑CT DDPG, is then proposed to solve the control problem model‑free, relying only on observed event times, SDE solutions, and decay filters, and is compared against discrete‑time reinforcement learning approaches for various kernel types.

arXiv AI
Sep 21

Reinforcement Learning under External Influence: Guarantees, Algorithms, and Sample Complexity

The paper investigates reinforcement learning in Markov decision processes whose dynamics are perturbed by non‑Markovian external events. It identifies conditions that make the problem tractable by limiting consideration to a finite history of events, and proposes a policy iteration algorithm that learns state‑dependent policies conditioned on this history. The authors provide theoretical guarantees for policy improvement, analyze sample complexity for least‑squares evaluation and improvement, and extend their results to discrete‑time Hawkes processes with Gaussian marks, validating their approach with experiments in control environments.

By Ranga Shaarad Ayyagari, Revanth Raj Eega, Ambedkar Dukkipati
Hugging Face Trending Papers
Aug 3

Finite-Time Analysis of Discounted Exponential-Utility Reinforcement Learning

Discounted exponential utility provides a principled criterion for risk-sensitive sequential decision-making, but its nonlinear structure complicates reinforcement learning. A recent work \citep{thoppe2026reinforcement} addressed this difficulty by introducing a Bellman-compatible surrogate and two model-free fixed-point algorithms for optimizing it over stationary policies.

arXiv Machine Learning
Aug 24

Reinforcement Learning for Continuous-Time Jump Markov Decision Processes with Applications to Network Dynamic Pricing

The paper introduces reinforcement learning for Continuous-Time Jump Markov Decision Processes (CTJMDPs) with general discrete state spaces and continuous/discrete actions. It develops entropy‑regularized continuous‑time control and establishes theoretical foundations for q‑learning in this setting, providing model‑free algorithms that outperform naive discretization. Numerical tests on network dynamic pricing demonstrate the method’s ability to learn near‑optimal policies and scale to large networks.

By Huiling Meng, Ningyuan Chen, Xuefeng Gao
arXiv Machine Learning
Jul 30

Learning Controlled Stochastic Differential Equations

arXiv:2411. 01982v2 Announce Type: replace-cross Abstract: We study the problem of learning controlled stochastic differential equations (SDEs) \[ dX_t = b(t,X_t,u_t)\,dt + \sigma(t,X_t,u_t)\,dW_t, \] whose drift and diffusion depend nonlinearly on time, state, and control values.

By Luc Brogat-Motte, Riccardo Bonalli, Alessandro Rudi
arXiv Machine Learning
Sep 15

Learning to Solve Stochastic Controls with Unknown Drifts and Running Rewards: Theory, Algorithms and Convergence

The paper investigates continuous‑time stochastic control problems with unknown drift and running reward functions, using an exploratory reinforcement learning framework that incorporates relaxed controls and entropy regularization. It develops policy‑iteration algorithms based on probabilistic representations of the optimal value function and its gradient, proving convergence and demonstrating performance through numerical examples. The study also extends to a special case with control‑dependent diffusion, requiring a Hessian representation.

By Jin Ma, Gaozhan Wang, Jianfeng Zhang, Xunyu Zhou