AI & ML
Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise
arXiv stat.ML0 views
arXiv:2411.13711v2 Announce Type: replace-cross Abstract: This paper establishes, to our knowledge, the first almost sure convergence rate and the first maximal concentration bound with sub-Weibull tails for general contractive stochastic approximation algorithms with Markovian noise. As a corollary, we also obtain convergence rates in $L^p$. Key to our successes is a novel discretization of the mean ODE of stochastic approximation algorithms using intervals with diminishing (instead of constant) length. Applications yield the first almost sure convergence rate for $Q$-learning without count-based learning rates and the first maximal concentration bound for off-policy temporal difference learning, both with Markovian samples.
Source:https://arxiv.org/abs/2411.13711PreviousDesigning Algorithmic Recommendations to Achieve Human-AI ComplementarityNexttempdisagg: A Python Framework for Temporal Disaggregation of Time Series Data
Related posts
VESTA: Visual Exploration with Statistical Tool Agents
0arXiv stat.CO
An interpretable semiparametric Bayesian machine learning model for high-dimensional circulating epigenetic signatures of multiple myeloma
0arXiv stat.CO
Quantum Nondecimated Wavelet Transform: Theory, Circuits, and Applications
0arXiv stat.CO
dapper: Data Augmentation for Private Posterior Estimation in R
0arXiv stat.CO
HAVAPlot: A Web-Based Scientific Visualization and Post-Processing Platform
0arXiv stat.CO
ISC Stormcast For Friday, November 20th, 2026 https://isc.sans.edu/podcastdetail/10188, (Fri, Nov 20th)
0SANS ISC