Methods

Exploiting Reasoning Chains for Multi-hop Science Question Answering EMNLP 2021 Exploration by Maximizing Renyi Entropy for Reward-Free RL Framework AAAI 2021 Exploration-Exploitation in Multi-Agent Competition: Convergence with Bounded Rationality NeurIPS 2021 Exploration in Approximate Hyper-State Space for Meta Reinforcement Learning ICML 2021 Exploration of Unknown Environments Using Deep Reinforcement Learning AAAI 2021 Exploring Dynamic Selection of Branch Expansion Orders for Code Generation ACL 2021 Exploring Supervised and Unsupervised Rewards in Machine Translation EACL 2021 Exponential Bellman Equation and Improved Regret Bounds for Risk-Sensitive Reinforcement Learning NeurIPS 2021 Extending Policy Shaping to Continuous State Spaces (Student Abstract) AAAI 2021 Extracting Strong Policies for Robotics Tasks from Zero-Order Trajectory Optimizers ICLR 2021 FACMAC: Factored Multi-Agent Centralised Policy Gradients NeurIPS 2021 Factored Policy Gradients: Leveraging Structure for Efficient Learning in MOMDPs NeurIPS 2021 Fast active learning for pure exploration in reinforcement learning ICML 2021 Fast Algorithms for L_∞-constrained S-rectangular Robust MDPs NeurIPS 2021 Faster Policy Learning with Continuous-Time Gradients L4DC 2021 Fast Rates for the Regret of Offline Reinforcement Learning COLT 2021 Fast Stochastic Kalman Gradient Descent for Reinforcement Learning L4DC 2021 Fast Training Method for Stochastic Compositional Optimization Problems NeurIPS 2021 Fault-Tolerant Federated Reinforcement Learning with Theoretical Guarantee NeurIPS 2021 Feedback Attribution for Counterfactual Bandit Learning in Multi-Domain Spoken Language Understanding EMNLP 2021 Finding the Stochastic Shortest Path with Low Regret: the Adversarial Cost and Unknown Transition Case ICML 2021 Fine-Grained Gap-Dependent Bounds for Tabular MDPs via Adaptive Multi-Step Bootstrap COLT 2021 Finite-Sample Analysis of Off-Policy Natural Actor-Critic Algorithm ICML 2021 Finite-Sample Analysis of Off-Policy TD-Learning via Generalized Bellman Operators NeurIPS 2021 Finite-Sample Regret Bound for Distributionally Robust Offline Tabular Reinforcement Learning AISTATS 2021