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

Roast My Dev Desktop: Zero Minimalism, Maximum Chaos
0dev.to
랩트 모네로 붕괴: 익숙한 신뢰 배신 이야기
0dev.to
Why has it become harder and harder to type one-handed on smartphones these days?
0dev.to
내 PDF 문서를 로컬 LLM에게 검색시키기 — RAG 실전 구축
0dev.to
How we tell parents what a teen's AI chat was about, without showing them the chat
0dev.to
GitHub Actions GITHUB_TOKEN: 11 Tags Pushed, 0 Release Workflows Ran
0dev.to