{"total":8,"rows":[{"id":"2102.06548","title":"Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis","created":"2021-02-12","cited_by_count":92,"area":null},{"id":"2307.02632","title":"Stability of Q-Learning Through Design and Optimism","created":"2023-07-05","cited_by_count":8,"area":null},{"id":"2107.01348","title":"Examining average and discounted reward optimality criteria in reinforcement learning","created":"2021-07-03","cited_by_count":6,"area":null},{"id":"2209.07446","title":"Efficiency Ordering of Stochastic Gradient Descent","created":"2022-09-15","cited_by_count":6,"area":null},{"id":"2302.07477","title":"Optimal Sample Complexity of Stable Discounted Markov Decision Processes","created":"2023-02-15","cited_by_count":6,"area":null},{"id":"2309.05105","title":"Convex Q Learning in a Stochastic Environment: Extended Version","created":"2023-09-10","cited_by_count":5,"area":null},{"id":"2401.09665","title":"Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walks","created":"2024-01-18","cited_by_count":2,"area":null},{"id":"2603.27874","title":"Stability and Sensitivity Analysis of Relative Temporal-Difference Learning: Extended Version","created":"2026-03-29","cited_by_count":0,"area":null}],"next_cursor":null}