SOTAVerified

Efficient Exploration

Efficient Exploration is one of the main obstacles in scaling up modern deep reinforcement learning algorithms. The main challenge in Efficient Exploration is the balance between exploiting current estimates, and gaining information about poorly understood states and actions.

Source: Randomized Value Functions via Multiplicative Normalizing Flows

Papers

Showing 461470 of 514 papers

TitleStatusHype
Lagrangian Manifold Monte Carlo on Monge PatchesCode0
Efficient Gradient-Free Variational Inference using Policy SearchCode0
Efficient Exploration via State Marginal MatchingCode0
Behavior-Guided Actor-Critic: Improving Exploration via Learning Policy Behavior Representation for Deep Reinforcement LearningCode0
Large-Batch, Iteration-Efficient Neural Bayesian Design OptimizationCode0
An Empirical Evaluation of Posterior Sampling for Constrained Reinforcement LearningCode0
Concurrent Meta Reinforcement LearningCode0
Efficient Exploration through Bayesian Deep Q-NetworksCode0
Efficient Exploration of the Rashomon Set of Rule Set ModelsCode0
Amortized Variational Deep Q NetworkCode0
Show:102550
← PrevPage 47 of 52Next →

No leaderboard results yet.