Cover Image

Continuous-time reinforcement learning: ellipticity enables model-free value function approximation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Mou, Wenlong
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Optimization and Control Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Statistical guarantees for continuous-time policy evaluation: blessing of ellipticity and new tradeoffs
by: Mou, Wenlong
Published: (2025)

Is RL fine-tuning harder than regression? A PDE learning approach for diffusion models
by: Mou, Wenlong
Published: (2025)

Optimal and instance-dependent guarantees for Markovian linear stochastic approximation
by: Mou, Wenlong, et al.
Published: (2021)

Iteratively reweighted kernel machines efficiently learn sparse functions
by: Zhu, Libin, et al.
Published: (2025)

High-probability sample complexities for policy evaluation with linear function approximation
by: Li, Gen, et al.
Published: (2023)

Off-policy estimation with adaptively collected data: the power of online learning
by: Lee, Jeonghwan, et al.
Published: (2024)

Mixing Times and Privacy Analysis for the Projected Langevin Algorithm under a Modulus of Continuity
by: Bravo, Mario, et al.
Published: (2025)

Joint learning of a network of linear dynamical systems via total variation penalization
by: Donnat, Claire, et al.
Published: (2025)

On Bellman equations for continuous-time policy evaluation I: discretization and approximation
by: Mou, Wenlong, et al.
Published: (2024)

Convergence of flow-based generative models via proximal gradient descent in Wasserstein space
by: Cheng, Xiuyuan, et al.
Published: (2023)

Long-time dynamics and universality of nonconvex gradient descent
by: Han, Qiyang
Published: (2025)

RandALO: Out-of-sample risk estimation in no time flat
by: Nobel, Parth, et al.
Published: (2024)

High-dimensional Limit of SGD for Diagonal Linear Networks
by: Malaxechebarría, Begoña García, et al.
Published: (2026)

A Spectral Framework for Closed-Form Relative Density Estimation
by: Bach, Francis
Published: (2026)

Risk reversal for least squares estimators under nested convex constraints
by: Al-Ghattas, Omar
Published: (2026)

Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling
by: Vukovic, Manojlo, et al.
Published: (2026)

Data-Efficient Non-Gaussian Semi-Nonparametric Density Estimation for Nonlinear Dynamical Systems
by: Liao, Aaron R., et al.
Published: (2026)

Computation of Least Trimmed Squares: A Branch-and-Bound framework with Hyperplane Arrangement Enhancements
by: Meng, Xiang, et al.
Published: (2026)

Frequentist Regret Analysis of Gaussian Process Thompson Sampling via Fractional Posteriors
by: Roy, Somjit, et al.
Published: (2026)

Trajectory-Restricted Optimization Conditions and Geometry-Aware Linear Convergence
by: Chaudhry, Faris, et al.
Published: (2026)

Robust Assortment Optimization from Observational Data
by: Lu, Miao, et al.
Published: (2026)

Stochastic Optimization with Optimal Importance Sampling
by: Aolaritei, Liviu, et al.
Published: (2025)

A Theory of Feature Learning in Kernel Models
by: Chen, Yunlu, et al.
Published: (2023)

A review of NMF, PLSA, LBA, EMA, and LCA with a focus on the identifiability issue
by: Qi, Qianqian, et al.
Published: (2025)

Pessimism Meets Risk: Risk-Sensitive Offline Reinforcement Learning
by: Zhang, Dake, et al.
Published: (2024)

Error Analysis of Triangular Optimal Transport Maps for Filtering
by: Al-Jarrah, Mohammad, et al.
Published: (2025)

Online Inference of Constrained Optimization: Primal-Dual Optimality and Sequential Quadratic Programming
by: Gao, Yihang, et al.
Published: (2025)

Denoising Diffusions with Optimal Transport: Localization, Curvature, and Multi-Scale Complexity
by: Liang, Tengyuan, et al.
Published: (2024)

Learning and Decision-Making with Data: Optimal Formulations and Phase Transitions
by: Bennouna, Amine, et al.
Published: (2021)

Blessings and Curses of Covariate Shifts: Adversarial Learning Dynamics, Directional Convergence, and Equilibria
by: Liang, Tengyuan
Published: (2022)

Extreme mass distributions for quasi-copulas
by: Omladič, Matjaž, et al.
Published: (2025)

Learning an Optimal Assortment Policy under Observational Data
by: Han, Yuxuan, et al.
Published: (2025)

Algorithms for mean-field variational inference via polyhedral optimization in the Wasserstein space
by: Jiang, Yiheng, et al.
Published: (2023)

An Elementary Proof of the Near Optimality of LogSumExp Smoothing
by: Samakhoana, Thabo, et al.
Published: (2025)

Online Experimental Design With Estimation-Regret Trade-off Under Network Interference
by: Zhang, Zhiheng, et al.
Published: (2024)

Federated Optimization of Smooth Loss Functions
by: Jadbabaie, Ali, et al.
Published: (2022)

On the Uniform Convergence of Subdifferentials in Stochastic Optimization and Learning
by: Ruan, Feng
Published: (2024)

A New Perspective On Denoising Based On Optimal Transport
by: Trillos, Nicolas Garcia, et al.
Published: (2023)

Decentralized Sparse Linear Regression via Gradient-Tracking: Linear Convergence and Statistical Guarantees
by: Maros, Marie, et al.
Published: (2022)

Certified Multi-Fidelity Zeroth-Order Optimization
by: de Montbrun, Étienne, et al.
Published: (2023)