{"total":26,"rows":[{"id":"2102.05406","title":"Non-stationary Reinforcement Learning without Prior Knowledge: An Optimal Black-box Approach","created":"2021-02-10","cited_by_count":98,"area":null},{"id":"2110.03580","title":"A Model Selection Approach for Corruption Robust Reinforcement Learning","created":"2021-10-07","cited_by_count":45,"area":null},{"id":"2104.11186","title":"Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret","created":"2021-04-22","cited_by_count":34,"area":null},{"id":"2212.05949","title":"Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision Processes","created":"2022-12-12","cited_by_count":33,"area":null},{"id":"2103.13056","title":"Minimax Regret for Stochastic Shortest Path","created":"2021-03-24","cited_by_count":30,"area":null},{"id":"2102.05284","title":"Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case","created":"2021-02-10","cited_by_count":28,"area":null},{"id":"2106.08377","title":"Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path","created":"2021-06-15","cited_by_count":23,"area":null},{"id":"2110.12727","title":"Learning Stochastic Shortest Path with Linear Function Approximation","created":"2021-10-25","cited_by_count":23,"area":null},{"id":"2201.13172","title":"Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback","created":"2022-01-31","cited_by_count":22,"area":null},{"id":"2301.13087","title":"Improved Regret for Efficient Online Reinforcement Learning with Linear Function Approximation","created":"2023-01-30","cited_by_count":17,"area":null},{"id":"2106.05335","title":"Online Learning for Stochastic Shortest Path Model via Posterior Sampling","created":"2021-06-09","cited_by_count":16,"area":null},{"id":"2305.08629","title":"A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs","created":"2023-05-15","cited_by_count":15,"area":null},{"id":"2112.09859","title":"Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP","created":"2021-12-18","cited_by_count":14,"area":null},{"id":"2202.03334","title":"Policy Optimization for Stochastic Shortest Path","created":"2022-02-07","cited_by_count":13,"area":null},{"id":"2208.12483","title":"Dynamic Regret of Online Markov Decision Processes","created":"2022-08-26","cited_by_count":13,"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":"2305.17402","title":"Learning and Collusion in Multi-unit Auctions","created":"2023-05-27","cited_by_count":5,"area":null},{"id":"2201.13170","title":"Cooperative Online Learning in Stochastic and Adversarial MDPs","created":"2022-01-31","cited_by_count":4,"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":"2305.10744","title":"Online Resource Allocation in Episodic Markov Decision Processes","created":"2023-05-18","cited_by_count":1,"area":null},{"id":"2402.08998","title":"Nearly Minimax Optimal Regret for Learning Linear Mixture Stochastic Shortest Path","created":"2024-02-14","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":"2208.00330","title":"Convex duality for stochastic shortest path problems in known and unknown environments","created":"2022-07-31","cited_by_count":0,"area":null},{"id":"2302.03789","title":"Layered State Discovery for Incremental Autonomous Exploration","created":"2023-02-07","cited_by_count":0,"area":null}],"next_cursor":null}