conftrace
_
Papers
Trends
Conferences
Explore
Authors
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Achievements
← Methods
Reinforcement Learning
›
Methods
›
Deep RL
3,861 papers
Papers per year
2005: 1
2006: 9
2007: 14
2008: 15
2009: 9
2010: 21
2011: 27
2012: 32
2013: 21
2014: 17
2015: 10
2016: 33
2017: 102
2018: 222
2019: 399
2020: 450
2021: 533
2022: 478
2023: 532
2024: 513
2025: 326
2026: 97
Papers
Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder Dimension
NIPS 2020
Task-Agnostic Online Reinforcement Learning with an Infinite Mixture of Gaussian Processes
NIPS 2020
On the Convergence of Smooth Regularized Approximate Value Iteration Schemes
NIPS 2020
The LoCA Regret: A Consistent Metric to Evaluate Model-Based Behavior in Reinforcement Learning
NIPS 2020
Dynamic Regret of Policy Optimization in Non-Stationary Environments
NIPS 2020
The Mean-Squared Error of Double Q-Learning
NIPS 2020
Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction
NIPS 2020
Implicit Distributional Reinforcement Learning
NIPS 2020
Generalized Hindsight for Reinforcement Learning
NIPS 2020
Improving Generalization in Reinforcement Learning with Mixture Regularization
NIPS 2020
Novelty Search in Representational Space for Sample Efficient Exploration
NIPS 2020
Robust Reinforcement Learning via Adversarial training with Langevin Dynamics
NIPS 2020
One Solution is Not All You Need: Few-Shot Extrapolation via Structured MaxEnt RL
NIPS 2020
PlanGAN: Model-based Planning With Sparse Rewards and Multiple Goals
NIPS 2020
Bandit Linear Control
NIPS 2020
Security Analysis of Safe and Seldonian Reinforcement Learning Algorithms
NIPS 2020
Bridging Imagination and Reality for Model-Based Deep Reinforcement Learning
NIPS 2020
Is Long Horizon RL More Difficult Than Short Horizon RL?
NIPS 2020
Self-Paced Deep Reinforcement Learning
NIPS 2020
Steady State Analysis of Episodic Reinforcement Learning
NIPS 2020
Can Q-Learning with Graph Networks Learn a Generalizable Branching Heuristic for a SAT Solver?
NIPS 2020
An Efficient Asynchronous Method for Integrating Evolutionary and Gradient-based Policy Search
NIPS 2020
Trust the Model When It Is Confident: Masked Model-based Actor-Critic
NIPS 2020
Shared Experience Actor-Critic for Multi-Agent Reinforcement Learning
NIPS 2020
RD$^2$: Reward Decomposition with Representation Decomposition
NIPS 2020
<
1
…
100
101
102
…
155
>