mlsanityData to 7 Oct 2026

Stochastic Primal-Dual Methods and Sample Complexity of Reinforcement Learning

arXiv 1612.02516 ↗First posted 8 Dec 2016stat.ML cs.AI math.OCcited by 15

Not on the map. Why?

Abstract (arXiv)

We study the online estimation of the optimal policy of a Markov decision process (MDP). We propose a class of Stochastic Primal-Dual (SPD) methods which exploit the inherent minimax duality of Bellman equations. The SPD methods update a few coordinates of the value and policy estimates as a new state transition is observed. These methods use small storage and has low computational complexity per iteration. The SPD methods find an absolute-ε-optimal policy, with high probability, using Oleft(frac|S|4 |A|2σ2 (1-γ)6ε2 right) iterations/samples for the infinite-horizon discounted-reward MDP and Oleft(frac|S|4 |A|2H6σ2 ε2 right) for the finite-horizon MDP.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 Dec 2016.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2020: 1; 2021: 4; 2022: 3; 2023: 1; 2024: 1; 2025: 3; 2026: 2.

15 papers.

Sort:

By area: