Papers with Code 아카이브
Efficient Exploration
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
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
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Misspecification-robust likelihood-free inference in high dimensions
Particle Filter Based Monocular Human Tracking with a 3D Cardbox Model and a Novel Deterministic Resampling Strategy
Minimax Value Interval for Off-Policy Evaluation and Policy Optimization
GLIB: Efficient Exploration for Relational Model-Based Reinforcement Learning via Goal-Literal Babbling
Meta Reinforcement Learning with Autonomous Inference of Subtask Dependencies
Parameterized Indexed Value Function for Efficient Exploration in Reinforcement Learning
Recruitment-imitation Mechanism for Evolutionary Reinforcement Learning
Provably Efficient Exploration in Policy Optimization
Comprehensive decision-strategy space exploration for efficient territorial planning strategies
Scaling active inference
Bayesian Curiosity for Efficient Exploration in Reinforcement Learning
Implicit Generative Modeling for Efficient Exploration
Efficient Exploration through Intrinsic Motivation Learning for Unsupervised Subgoal Discovery in Model-Free Hierarchical Reinforcement Learning
MAME : Model-Agnostic Meta-Exploration
Multi-Path Policy Optimization
Neural Contextual Bandits with UCB-based Exploration
VASE: Variational Assorted Surprise Exploration for Reinforcement Learning
Structured exploration in the finite horizon linear quadratic dual control problem
Better Exploration with Optimistic Actor-Critic
Learning Transferable Graph Exploration
Dynamic Subgoal-based Exploration via Bayesian Optimization
ConEx: Efficient Exploration of Big-Data System Configurations for Better Performance
Receding Horizon Curiosity
Learning to Seek: Autonomous Source Seeking with Deep Reinforcement Learning Onboard a Nano Drone Microcontroller
Learning Index Selection with Structured Action Spaces
Biased Estimates of Advantages over Path Ensembles
$\sqrt{n}$-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank
Improving a State-of-the-Art Heuristic for the Minimum Latency Problem with Data Mining
Learning to Explore in Motion and Interaction Tasks
Memory Based Trajectory-conditioned Policies for Learning from Sparse Rewards
Directed Exploration for Reinforcement Learning
Learning-Driven Exploration for Reinforcement Learning
Efficient Exploration via State Marginal Matching
Learning to Score Behaviors for Guided Policy Optimization
Self-Supervised Exploration via Disagreement
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.