{"total":10,"rows":[{"id":"2302.09408","title":"Best of Both Worlds Policy Optimization","created":"2023-02-18","cited_by_count":17,"area":null},{"id":"2302.06834","title":"Improved Regret Bounds for Linear Adversarial MDPs via Linear Optimization","created":"2023-02-14","cited_by_count":15,"area":null},{"id":"2205.13044","title":"Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments","created":"2022-05-25","cited_by_count":6,"area":null},{"id":"2305.07911","title":"Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedback","created":"2023-05-13","cited_by_count":6,"area":null},{"id":"2210.04946","title":"Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path","created":"2022-10-10","cited_by_count":4,"area":null},{"id":"2311.07876","title":"Learning Adversarial Low-rank Markov Decision Processes with Unknown Transition and Full-information Feedback","created":"2023-11-14","cited_by_count":4,"area":null},{"id":"2210.09255","title":"A Unified Algorithm for Stochastic Path Problems","created":"2022-10-17","cited_by_count":1,"area":null},{"id":"2511.00637","title":"Stochastic Shortest Path with Sparse Adversarial Costs","created":"2025-11-01","cited_by_count":1,"area":null},{"id":"2302.03789","title":"Layered State Discovery for Incremental Autonomous Exploration","created":"2023-02-07","cited_by_count":0,"area":null},{"id":"2608.17703","title":"Dijkstra as an Oracle for Online Stochastic Shortest Path Navigation with Provable Guarantees","created":"2026-08-18","cited_by_count":0,"area":null}],"next_cursor":null}