{"total":12,"rows":[{"id":"2210.06718","title":"Hybrid RL: Using Both Offline and Online Data Can Make RL Efficient","created":"2022-10-13","cited_by_count":161,"area":null},{"id":"2208.05129","title":"Robust Reinforcement Learning using Offline Data","created":"2022-08-10","cited_by_count":96,"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":"2203.07368","title":"The Efficacy of Pessimism in Asynchronous Q-Learning","created":"2022-03-14","cited_by_count":42,"area":null},{"id":"2209.13841","title":"Online Policy Optimization for Robust MDP","created":"2022-09-28","cited_by_count":19,"area":null},{"id":"2206.00165","title":"Byzantine-Robust Online and Offline Distributed Reinforcement Learning","created":"2022-06-01","cited_by_count":13,"area":null},{"id":"2403.07933","title":"Corruption-Robust Offline Two-Player Zero-Sum Markov Games","created":"2024-03-04","cited_by_count":4,"area":null},{"id":"2202.00076","title":"Optimal Estimation of Off-Policy Policy Gradient via Double Fitted Iteration","created":"2022-01-31","cited_by_count":1,"area":null},{"id":"2307.13903","title":"Corruption-Robust Lipschitz Contextual Search","created":"2023-07-26","cited_by_count":1,"area":null},{"id":"2507.10567","title":"Protocols for Verifying Smooth Strategies in Bandits and Games","created":"2025-07-08","cited_by_count":0,"area":null},{"id":"2602.01825","title":"Learning Sequential Decisions from Multiple Sources via Group-Robust Markov Decision Processes","created":"2026-02-02","cited_by_count":0,"area":null},{"id":"2608.06520","title":"Online Security Learning in Cooperative Multi-Agent Systems under Hidden Byzantine Attacks","created":"2026-08-06","cited_by_count":0,"area":null}],"next_cursor":null}