Methods

Offline-to-Online Reinforcement Learning via Balanced Replay and Pessimistic Q-Ensemble CoRL 2021 Off-Policy Confidence Sequences ICML 2021 Off-policy Evaluation in Infinite-Horizon Reinforcement Learning with Latent Confounders AISTATS 2021 Off-Policy Risk Assessment in Contextual Bandits NeurIPS 2021 Of Moments and Matching: A Game-Theoretic Framework for Closing the Imitation Gap ICML 2021 On Blame Attribution for Accountable Multi-Agent Sequential Decision Making NeurIPS 2021 On Convergence of Gradient Expected Sarsa(λ) AAAI 2021 On Effective Scheduling of Model-based Reinforcement Learning NeurIPS 2021 One Protocol to Rule Them All: Wireless Network-on-Chip using Deep Reinforcement Learning NSDI 2021 Online 3D Bin Packing with Constrained Deep Reinforcement Learning AAAI 2021 Online and Offline Reinforcement Learning by Planning with a Learned Model NeurIPS 2021 Online learning in MDPs with linear function approximation and bandit feedback. NeurIPS 2021 Online Learning in Unknown Markov Games ICML 2021 Online Markov Decision Processes with Aggregate Bandit Feedback COLT 2021 Online Model Selection for Reinforcement Learning with Function Approximation AISTATS 2021 Online Policy Gradient for Model Free Learning of Linear Quadratic Regulators with $\sqrt$T Regret ICML 2021 Online Robust Reinforcement Learning with Model Uncertainty NeurIPS 2021 Online Selection of Diverse Committees IJCAI 2021 Online Sparse Reinforcement Learning AISTATS 2021 On Pathologies in KL-Regularized Reinforcement Learning from Expert Demonstrations NeurIPS 2021 On-Policy Deep Reinforcement Learning for the Average-Reward Criterion ICML 2021 On Proximal Policy Optimization’s Heavy-tailed Gradients ICML 2021 On Reinforcement Learning with Adversarial Corruption and Its Application to Block MDP ICML 2021 On Reward-Free RL with Kernel and Neural Function Approximations: Single-Agent MDP and Markov Game ICML 2021 On the Convergence and Sample Efficiency of Variance-Reduced Policy Gradient Method NeurIPS 2021