Skip to content
conftrace_

Reinforcement Learning

9,982 papers (145 classified directly here)

9
43
51
966
1,445
'5
'10
'15
'20
'25

Papers (including subtopics)

Theoretically Principled Deep RL Acceleration via Nearest Neighbor Function Approximation AAAI 2021 There Is No Turning Back: A Self-Supervised Approach for Reversibility-Aware Reinforcement Learning NeurIPS 2021 The Sample Complexity of Teaching by Reinforcement on Q-Learning AAAI 2021 The Sensory Neuron as a Transformer: Permutation-Invariant Neural Networks for Reinforcement Learning NeurIPS 2021 The Successful Ingredients of Policy Gradient Algorithms IJCAI 2021 The Value-Improvement Path: Towards Better Representations for Reinforcement Learning AAAI 2021 Thompson sampling for Markov games with piecewise stationary opponent policies UAI 2021 ThriftyDAgger: Budget-Aware Novelty and Risk Gating for Interactive Imitation Learning CoRL 2021 Time-Constrained Multi-Agent Path Finding in Non-Lattice Graphs with Deep Reinforcement Learning ACML 2021 Time Discretization-Invariant Safe Action Repetition for Policy Gradient Methods NeurIPS 2021 TimeTraveler: Reinforcement Learning for Temporal Knowledge Graph Forecasting EMNLP 2021 Towards a Dimension-Free Understanding of Adaptive Linear Control COLT 2021 Towards Automatic Evaluation of Dialog Systems: A Model-Free Off-Policy Evaluation Approach EMNLP 2021 Towards Better Laplacian Representation in Reinforcement Learning with Generalized Graph Drawing ICML 2021 Towards Deeper Deep Reinforcement Learning with Spectral Normalization NeurIPS 2021 Towards Distraction-Robust Active Visual Tracking ICML 2021 Towards Effective Context for Meta-Reinforcement Learning: an Approach based on Contrastive Learning AAAI 2021 Towards Hyperparameter-free Policy Selection for Offline Reinforcement Learning NeurIPS 2021 Towards Instance-Optimal Offline Reinforcement Learning with Pessimism NeurIPS 2021 Towards mental time travel: a hierarchical memory for reinforcement learning agents NeurIPS 2021 Towards Open Ad Hoc Teamwork Using Graph-based Policy Learning ICML 2021 Towards Real Robot Learning in the Wild: A Case Study in Bipedal Locomotion CoRL 2021 Towards Robust Bisimulation Metric Learning NeurIPS 2021 Towards Sample Efficient Agents through Algorithmic Alignment (Student Abstract) AAAI 2021 Towards Tight Bounds on the Sample Complexity of Average-reward MDPs ICML 2021