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
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Efficient Exploration of the Rashomon Set of Rule Set Models
NeoRL: Efficient Exploration for Nonepisodic RL
Computing low-thrust transfers in the asteroid belt, a comparison between astrodynamical manipulations and a machine learning approach
Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling
Opinion-Guided Reinforcement Learning
Evolutionary Large Language Model for Automated Feature Transformation
GLaD: Synergizing Molecular Graphs and Language Descriptors for Enhanced Power Conversion Efficiency Prediction in Organic Photovoltaic Devices
Intrinsic Rewards for Exploration without Harm from Observational Noise: A Simulation Study Based on the Free Energy Principle
Navigating Chemical Space with Latent Flows
MESA: Cooperative Meta-Exploration in Multi-Agent Learning through Exploiting State-Action Space Structure
Efficient Exploration of Image Classifier Failures with Bayesian Optimization and Text-to-Image Models
Evolutionary Reinforcement Learning via Cooperative Coevolution
An Offline Reinforcement Learning Algorithm Customized for Multi-Task Fusion in Large-Scale Recommender Systems
Sampling for Model Predictive Trajectory Planning in Autonomous Driving using Normalizing Flows
Streamlining Ocean Dynamics Modeling with Fourier Neural Operators: A Multiobjective Hyperparameter and Architecture Optimization Approach
Learning Off-policy with Model-based Intrinsic Motivation For Active Online Exploration
Cognitive Planning for Object Goal Navigation using Generative AI Models
VDSC: Enhancing Exploration Timing with Value Discrepancy and State Counts
Safe Reinforcement Learning for Constrained Markov Decision Processes with Stochastic Stopping Time
Explore until Confident: Efficient Exploration for Embodied Question Answering
A Straightforward Gradient-Based Approach for High-Tc Superconductor Design: Leveraging Domain Knowledge via Adaptive Constraints
Hierarchical Spatial Proximity Reasoning for Vision-and-Language Navigation
Diffusion-Reinforcement Learning Hierarchical Motion Planning in Multi-agent Adversarial Games
MAMBA: an Effective World Model Approach for Meta-Reinforcement Learning
Beyond Joint Demonstrations: Personalized Expert Guidance for Efficient Multi-Agent Reinforcement Learning
Scalable Online Exploration via Coverability
Noisy Spiking Actor Network for Exploration
Vlearn: Off-Policy Learning with Efficient State-Value Function Estimation
Finding Waldo: Towards Efficient Exploration of NeRF Scene Spaces
A Natural Extension To Online Algorithms For Hybrid RL With Limited Coverage
Cradle: Empowering Foundation Agents Towards General Computer Control
GenNBV: Generalizable Next-Best-View Policy for Active 3D Reconstruction
ACE : Off-Policy Actor-Critic with Causality-Aware Entropy Regularization
Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits
Diffusion Models Meet Contextual Bandits with Large Action Spaces
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.