{"total":31,"rows":[{"id":"2110.03239","title":"Understanding Domain Randomization for Sim-to-real Transfer","created":"2021-10-07","cited_by_count":80,"area":null},{"id":"2202.04129","title":"Independent Policy Gradient for Large-Scale Markov Potential Games: Sharper Rates, Function Approximation, and Game-Agnostic Convergence","created":"2022-02-08","cited_by_count":57,"area":null},{"id":"2107.08346","title":"Policy Optimization in Adversarial MDPs: Improved Exploration via Dilated Bonuses","created":"2021-07-18","cited_by_count":52,"area":null},{"id":"2202.00150","title":"Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints","created":"2022-01-31","cited_by_count":29,"area":null},{"id":"2306.16394","title":"Sharper Model-free Reinforcement Learning for Average-reward Markov Decision Processes","created":"2023-06-28","cited_by_count":29,"area":null},{"id":"2105.08024","title":"Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting","created":"2021-05-17","cited_by_count":28,"area":null},{"id":"2309.01922","title":"Regret Analysis of Policy Gradient Algorithm for Infinite Horizon Average Reward Markov Decision Processes","created":"2023-09-05","cited_by_count":26,"area":null},{"id":"2108.05533","title":"Efficient Local Planning with Linear Function Approximation","created":"2021-08-12","cited_by_count":23,"area":null},{"id":"2106.03442","title":"Average-Reward Reinforcement Learning with Trust Region Methods","created":"2021-06-07","cited_by_count":19,"area":null},{"id":"2301.12942","title":"Refined Regret for Adversarial MDPs with Linear Function Approximation","created":"2023-01-30","cited_by_count":19,"area":null},{"id":"2102.07301","title":"Nearly Minimax Optimal Regret for Learning Infinite-horizon Average-reward MDPs with Linear Function Approximation","created":"2021-02-15","cited_by_count":18,"area":null},{"id":"2102.12611","title":"Improved Regret Bound and Experience Replay in Regularized Policy Iteration","created":"2021-02-25","cited_by_count":18,"area":null},{"id":"2105.14016","title":"Sample-Efficient Reinforcement Learning for Linearly-Parameterized MDPs with a Generative Model","created":"2021-05-28","cited_by_count":18,"area":null},{"id":"2102.12661","title":"Online Learning for Unknown Partially Observable MDPs","created":"2021-02-25","cited_by_count":17,"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":"2302.09408","title":"Best of Both Worlds Policy Optimization","created":"2023-02-18","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":"2105.01593","title":"Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation","created":"2021-05-04","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":"2111.00213","title":"Adjacency constraint for efficient hierarchical reinforcement learning","created":"2021-10-30","cited_by_count":10,"area":null},{"id":"2210.12057","title":"Efficient Global Planning in Large MDPs via Stochastic Primal-Dual Optimization","created":"2022-10-21","cited_by_count":8,"area":null},{"id":"2302.14004","title":"Optimistic Planning by Regularized Dynamic Programming","created":"2023-02-27","cited_by_count":8,"area":null},{"id":"2302.04376","title":"Efficient Planning in Combinatorial Action Spaces with Applications to Cooperative Multi-Agent Reinforcement Learning","created":"2023-02-08","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":"2306.08803","title":"Langevin Thompson Sampling with Logarithmic Communication: Bandits and Reinforcement Learning","created":"2023-06-15","cited_by_count":5,"area":null},{"id":"2302.00808","title":"ACPO: A Policy Optimization Algorithm for Average MDPs with Constraints","created":"2023-02-02","cited_by_count":4,"area":null},{"id":"2508.11931","title":"An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction","created":"2025-08-16","cited_by_count":4,"area":null},{"id":"2301.02389","title":"Provable Reset-free Reinforcement Learning by No-Regret Reduction","created":"2023-01-06","cited_by_count":3,"area":null},{"id":"2205.09056","title":"Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPs","created":"2022-05-18","cited_by_count":2,"area":null},{"id":"2410.14992","title":"Learning Infinite-Horizon Average-Reward Linear Mixture MDPs of Bounded Span","created":"2024-10-19","cited_by_count":1,"area":null},{"id":"2504.08200","title":"Influential Bandits: Pulling an Arm May Change the Environment","created":"2025-04-11","cited_by_count":0,"area":null}],"next_cursor":null}