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
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Angrier Birds: Bayesian reinforcement learning
Large-scale signatures of unconsciousness are consistent with a departure from critical dynamics
Batch Bayesian Optimization via Local Penalization
Bandit Algorithms for Tree Search
Stochastic Gradient Hamiltonian Monte Carlo
Safe Exploration of State and Action Spaces in Reinforcement Learning
Generalization and Exploration via Randomized Value Functions
Sparse graphs using exchangeable random measures
Volumetric Spanners: an Efficient Exploration Basis for Learning
Extended Formulations for Online Linear Bandit Optimization
Efficient Reinforcement Learning in Deterministic Systems with Value Function Generalization
(More) Efficient Reinforcement Learning via Posterior Sampling
A Community Based Algorithm for Large Scale Web Service Composition
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.