{"total":6,"rows":[{"id":"2310.11677","title":"Improved Sample Complexity Analysis of Natural Policy Gradient Algorithm with General Parameterization for Infinite Horizon Discounted Reward Markov Decision Processes","created":"2023-10-18","cited_by_count":25,"area":null},{"id":"2310.11684","title":"Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes","created":"2023-10-18","cited_by_count":3,"area":null},{"id":"2606.16729","title":"Learning Policy from a Single Trajectory in Average-Reward Markov Decision Process","created":"2026-06-15","cited_by_count":3,"area":null},{"id":"2602.11387","title":"Provably Efficient Algorithms for S- and Non-Rectangular Robust MDPs with General Parameterization","created":"2026-02-11","cited_by_count":1,"area":null},{"id":"2606.26316","title":"High-Probability PL-SGD with Markovian Noise: Optimal Mixing and Tail Dependence","created":"2026-06-24","cited_by_count":0,"area":null},{"id":"2610.04117","title":"Sharp Convergence and Sample Complexity of Policy Mirror Descent for Average-Reward MDPs","created":"2026-10-02","cited_by_count":0,"area":null}],"next_cursor":null}