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 301310 of 514 papers

TitleStatusHype
Lagrangian Manifold Monte Carlo on Monge PatchesCode0
Efficient Policy Space Response Oracles0
Learning to Act with Affordance-Aware Multimodal Neural SLAMCode0
Synthesizing explainable counterfactual policies for algorithmic recourse with program synthesisCode0
Using Non-Stationary Bandits for Learning in Repeated Cournot Games with Non-Stationary Demand0
JueWu-MC: Playing Minecraft with Sample-efficient Hierarchical Reinforcement Learning0
A Fast and Scalable Polyatomic Frank-Wolfe Algorithm for the LASSOCode0
BooVI: Provably Efficient Bootstrapped Value Iteration0
HelixMO: Sample-Efficient Molecular Optimization in Scene-Sensitive Latent Space0
IB-MVS: An Iterative Algorithm for Deep Multi-View Stereo based on Binary Decisions0
Show:102550
← PrevPage 31 of 52Next →

No leaderboard results yet.