Methods

Balancing Learning Speed and Stability in Policy Gradient via Adaptive Exploration AISTATS 2020 Balancing Quality and Human Involvement: An Effective Approach to Interactive Neural Machine Translation AAAI 2020 Bandit Linear Control NeurIPS 2020 BAR — A Reinforcement Learning Agent for Bounding-Box Automated Refinement AAAI 2020 Batch Reinforcement Learning with Hyperparameter Gradients ICML 2020 Bayes-Adaptive Monte-Carlo Planning and Learning for Goal-Oriented Dialogues AAAI 2020 Bayesian Learning with Adaptive Load Allocation Strategies L4DC 2020 Bayesian Reinforcement Learning via Deep, Sparse Sampling AISTATS 2020 Behaviour Suite for Reinforcement Learning ICLR 2020 Being Optimistic to Be Conservative: Quickly Learning a CVaR Policy AAAI 2020 Be Relevant, Non-Redundant, and Timely: Deep Reinforcement Learning for Real-Time Event Summarization AAAI 2020 Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs NeurIPS 2020 Bidirectional Model-based Policy Optimization ICML 2020 Bi-Level Actor-Critic for Multi-Agent Coordination AAAI 2020 Black-box Off-policy Estimation for Infinite-Horizon Reinforcement Learning ICLR 2020 Bootstrap Latent-Predictive Representations for Multitask Reinforcement Learning ICML 2020 Bootstrapped Q-learning with Context Relevant Observation Pruning to Generalize in Text-based Games EMNLP 2020 Boundary Extension Features for Width-Based Planning with Simulators on Continuous-State Domains IJCAI 2020 Breaking the Curse of Many Agents: Provable Mean Embedding Q-Iteration for Mean-Field Reinforcement Learning ICML 2020 Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model NeurIPS 2020 Bridging Imagination and Reality for Model-Based Deep Reinforcement Learning NeurIPS 2020 BRPO: Batch Residual Policy Optimization IJCAI 2020 Calibration of Shared Equilibria in General Sum Partially Observable Markov Games NeurIPS 2020 Can Increasing Input Dimensionality Improve Deep Reinforcement Learning? ICML 2020 Can Q-Learning with Graph Networks Learn a Generalizable Branching Heuristic for a SAT Solver? NeurIPS 2020