{"total":11,"rows":[{"id":"2201.11206","title":"Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes","created":"2022-01-26","cited_by_count":49,"area":null},{"id":"2202.03060","title":"The Importance of Non-Markovianity in Maximum State Entropy Exploration","created":"2022-02-07","cited_by_count":35,"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":"2403.11477","title":"Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs","created":"2024-03-18","cited_by_count":17,"area":null},{"id":"2405.17108","title":"Finding good policies in average-reward Markov Decision Processes without prior knowledge","created":"2024-05-27","cited_by_count":13,"area":null},{"id":"2306.13601","title":"Active Coverage for PAC Reinforcement Learning","created":"2023-06-23","cited_by_count":8,"area":null},{"id":"2111.12045","title":"Adaptive Multi-Goal Exploration","created":"2021-11-23","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":"2409.04744","title":"Reward Guidance for Reinforcement Learning Tasks Based on Large Language Models: The LMGT Framework","created":"2024-09-07","cited_by_count":4,"area":null},{"id":"2301.04268","title":"Adversarial Online Multi-Task Reinforcement Learning","created":"2023-01-11","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}