{"total":72,"rows":[{"id":"2107.06226","title":"Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage","created":"2021-07-13","cited_by_count":164,"area":"offlinerl"},{"id":"2110.04652","title":"Representation Learning for Online and Offline RL in Low-rank MDPs","created":"2021-10-09","cited_by_count":129,"area":"offlinerl"},{"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":"2106.06630","title":"Corruption-Robust Offline Reinforcement Learning","created":"2021-06-11","cited_by_count":51,"area":"offlinerl"},{"id":"2202.00063","title":"Efficient Reinforcement Learning in Block MDPs: A Model-free Representation Learning Approach","created":"2022-01-31","cited_by_count":51,"area":null},{"id":"2102.04692","title":"Fine-Grained Gap-Dependent Bounds for Tabular MDPs via Adaptive Multi-Step Bootstrap","created":"2021-02-09","cited_by_count":49,"area":null},{"id":"2102.05858","title":"Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits Simultaneously","created":"2021-02-11","cited_by_count":48,"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":"2303.02783","title":"Improved Sample Complexity Bounds for Distributionally Robust Reinforcement Learning","created":"2023-03-05","cited_by_count":44,"area":null},{"id":"2106.04117","title":"The best of both worlds: stochastic and adversarial episodic MDPs with unknown transition","created":"2021-06-08","cited_by_count":40,"area":null},{"id":"2205.14571","title":"Provable Benefits of Representational Transfer in Reinforcement Learning","created":"2022-05-29","cited_by_count":38,"area":null},{"id":"2107.01264","title":"Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning","created":"2021-07-02","cited_by_count":34,"area":null},{"id":"2102.05800","title":"Robust Policy Gradient against Strong Data Corruption","created":"2021-02-11","cited_by_count":30,"area":null},{"id":"2208.09407","title":"Learning in Stackelberg Games with Non-myopic Agents","created":"2022-08-19","cited_by_count":29,"area":null},{"id":"2207.00046","title":"Performative Reinforcement Learning","created":"2022-06-30","cited_by_count":27,"area":null},{"id":"2404.03578","title":"Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms","created":"2024-04-04","cited_by_count":26,"area":"deeprl"},{"id":"2310.12955","title":"Towards Robust Offline Reinforcement Learning under Diverse Data Corruption","created":"2023-10-19","cited_by_count":24,"area":"offlinerl"},{"id":"2110.12727","title":"Learning Stochastic Shortest Path with Linear Function Approximation","created":"2021-10-25","cited_by_count":23,"area":null},{"id":"2102.05776","title":"Defense Against Reward Poisoning Attacks in Reinforcement Learning","created":"2021-02-10","cited_by_count":21,"area":null},{"id":"2109.10963","title":"On Optimal Robustness to Adversarial Corruption in Online Decision Problems","created":"2021-09-22","cited_by_count":21,"area":null},{"id":"2102.06875","title":"Improved Corruption Robust Algorithms for Episodic Reinforcement Learning","created":"2021-02-13","cited_by_count":20,"area":null},{"id":"2206.01888","title":"Reward Poisoning Attacks on Offline Multi-Agent Reinforcement Learning","created":"2022-06-04","cited_by_count":20,"area":"offlinerl"},{"id":"2402.06734","title":"Corruption Robust Offline Reinforcement Learning with Human Feedback","created":"2024-02-09","cited_by_count":20,"area":"alignment"},{"id":"2209.13841","title":"Online Policy Optimization for Robust MDP","created":"2022-09-28","cited_by_count":19,"area":null},{"id":"2211.05632","title":"Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms","created":"2022-11-08","cited_by_count":19,"area":null},{"id":"2302.13534","title":"Improved Best-of-Both-Worlds Guarantees for Multi-Armed Bandits: FTRL with General Regularizers and Multiple Optimal Arms","created":"2023-02-27","cited_by_count":18,"area":null},{"id":"2511.01331","title":"RobustVLA: Robustness-Aware Reinforcement Post-Training for Vision-Language-Action Models","created":"2025-11-03","cited_by_count":18,"area":"vla"},{"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":"2305.12944","title":"Offline Primal-Dual Reinforcement Learning for Linear MDPs","created":"2023-05-22","cited_by_count":17,"area":"offlinerl"},{"id":"2302.12370","title":"Best-of-Three-Worlds Linear Bandit Algorithm with Variance-Adaptive Regret Bounds","created":"2023-02-24","cited_by_count":14,"area":null},{"id":"2302.13851","title":"Implicit Poisoning Attacks in Two-Agent Reinforcement Learning: Adversarial Policies for Training-Time Attacks","created":"2023-02-27","cited_by_count":14,"area":null},{"id":"2110.13052","title":"Can Q-Learning be Improved with Advice?","created":"2021-10-25","cited_by_count":13,"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":"2305.17380","title":"No-Regret Online Reinforcement Learning with Adversarial Losses and Transitions","created":"2023-05-27","cited_by_count":13,"area":null},{"id":"2201.02185","title":"Admissible Policy Teaching through Reward Design","created":"2022-01-06","cited_by_count":12,"area":null},{"id":"2206.12081","title":"Computationally Efficient PAC RL in POMDPs with Latent Determinism and Conditional Embeddings","created":"2022-06-24","cited_by_count":12,"area":null},{"id":"2202.01850","title":"A Robust Phased Elimination Algorithm for Corruption-Tolerant Gaussian Process Bandits","created":"2022-02-03","cited_by_count":11,"area":null},{"id":"2108.05439","title":"Gap-Dependent Unsupervised Exploration for Reinforcement Learning","created":"2021-08-11","cited_by_count":10,"area":null},{"id":"2307.05341","title":"Tracking Most Significant Shifts in Nonparametric Contextual Bandits","created":"2023-07-11","cited_by_count":10,"area":null},{"id":"2307.07670","title":"Efficient Adversarial Attacks on Online Multi-agent Reinforcement Learning","created":"2023-07-15","cited_by_count":10,"area":null},{"id":"2205.14842","title":"Efficient Reward Poisoning Attacks on Online Deep Reinforcement Learning","created":"2022-05-30","cited_by_count":9,"area":null},{"id":"2206.09642","title":"Beyond IID: data-driven decision-making in heterogeneous environments","created":"2022-06-20","cited_by_count":9,"area":null},{"id":"2411.00465","title":"Uncertainty-based Offline Variational Bayesian Reinforcement Learning for Robustness under Diverse Data Corruptions","created":"2024-11-01","cited_by_count":8,"area":"offlinerl"},{"id":"2310.18715","title":"Robust Offline Reinforcement learning with Heavy-Tailed Rewards","created":"2023-10-28","cited_by_count":7,"area":"offlinerl"},{"id":"2109.05546","title":"Improved Algorithms for Misspecified Linear Markov Decision Processes","created":"2021-09-12","cited_by_count":6,"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":"2502.10138","title":"Provably Efficient RL under Episode-Wise Safety in Constrained MDPs with Linear Function Approximation","created":"2025-02-14","cited_by_count":6,"area":"deeprl"},{"id":"2508.03768","title":"ORVIT: Near-Optimal Online Distributionally Robust Reinforcement Learning","created":"2025-08-05","cited_by_count":6,"area":"deeprl"},{"id":"2402.02700","title":"Sample Complexity Characterization for Linear Contextual MDPs","created":"2024-02-05","cited_by_count":5,"area":"deeprl"},{"id":"2102.12192","title":"Multiplicative Reweighting for Robust Neural Network Optimization","created":"2021-02-24","cited_by_count":4,"area":null},{"id":"2107.09572","title":"Best-of-All-Worlds Bounds for Online Learning with Feedback Graphs","created":"2021-07-20","cited_by_count":4,"area":null},{"id":"2201.12700","title":"Coordinated Attacks against Contextual Bandits: Fundamental Limits and Defense Mechanisms","created":"2022-01-30","cited_by_count":4,"area":null},{"id":"2302.04374","title":"Near-Optimal Adversarial Reinforcement Learning with Switching Costs","created":"2023-02-08","cited_by_count":4,"area":null},{"id":"2106.11220","title":"Corruption Robust Active Learning","created":"2021-06-21","cited_by_count":3,"area":null},{"id":"2404.10745","title":"Achieving Constant Regret in Linear Markov Decision Processes","created":"2024-04-16","cited_by_count":3,"area":"deeprl"},{"id":"2505.20621","title":"Multi-level Certified Defense Against Poisoning Attacks in Offline Reinforcement Learning","created":"2025-05-27","cited_by_count":3,"area":"offlinerl"},{"id":"2203.12048","title":"Review of Metrics to Measure the Stability, Robustness and Resilience of Reinforcement Learning","created":"2022-03-22","cited_by_count":2,"area":null},{"id":"2503.10228","title":"Policy Teaching via Data Poisoning in Learning from Human Preferences","created":"2025-03-13","cited_by_count":2,"area":"alignment"},{"id":"2304.12151","title":"Policy Resilience to Environment Poisoning Attacks on Reinforcement Learning","created":"2023-04-24","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":"2311.00859","title":"Optimal Cost Constrained Adversarial Attacks For Multiple Agent Systems","created":"2023-11-01","cited_by_count":1,"area":null},{"id":"2406.18805","title":"Online Stackelberg Optimization via Nonlinear Control","created":"2024-06-27","cited_by_count":1,"area":null},{"id":"2503.00387","title":"LNUCB-TA: Linear-nonlinear Hybrid Bandit Learning with Temporal Attention","created":"2025-03-01","cited_by_count":1,"area":null},{"id":"2509.08933","title":"Corruption-Tolerant Asynchronous Q-Learning with Near-Optimal Rates","created":"2025-09-10","cited_by_count":1,"area":"deeprl"},{"id":"2412.14075","title":"Online MDP with Transition Prototypes: A Robust Adaptive Approach","created":"2024-12-18","cited_by_count":0,"area":null},{"id":"2506.06891","title":"Robust In-Context Reinforcement Learning Under Reward Poisoning Attacks","created":"2025-06-07","cited_by_count":0,"area":"deeprl"},{"id":"2510.19528","title":"Learning Upper Lower Value Envelopes to Shape Online RL: A Principled Approach","created":"2025-10-22","cited_by_count":0,"area":"deeprl"},{"id":"2602.09394","title":"The Critical Horizon: Inspection Design Principles for Multi-Stage Operations and Deep Reasoning","created":"2026-02-10","cited_by_count":0,"area":"lr"},{"id":"2602.14543","title":"Truly Adapting to Adversarial Constraints in Constrained MABs","created":"2026-02-16","cited_by_count":0,"area":null},{"id":"2603.14673","title":"A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming","created":"2026-03-15","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},{"id":"2609.38938","title":"Robust Risk-Sensitive Reinforcement Learning from Corrupted Human Feedback","created":"2026-09-30","cited_by_count":0,"area":"alignment"}],"next_cursor":null}