arxiv
PublishedJune 5, 2026 at 4:00 AM
Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples
Publisher summary· verbatim
arXiv:2606.05967v1 Announce Type: cross Abstract: In this paper, we study the finite-time behavior of the TD(0) temporal-difference method with linear function approximation (LFA). We consider on-policy independent and identically distributed (i.i.d.) samples, a constant learning step, and the Polya
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSFMambaNet: Spectral-Frequency Enhanced Selective State Space Model for Correspondence Pruning11harxivOptical-Guided Neural Collapse for SAR Few-Shot Class Incremental Learning11harxivDynamic Infilling Anchors for Format-Constrained Generation in Diffusion Large Language Models11harxivTemporal Order Matters for Agentic Memory: Segment Trees for Long-Horizon Agents11hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗