Skip to content
conftrace_

exploration algorithm

11 papers

Explore in graph

Co-occurring keywords · papers mentioning both

multi-armed bandit (4) regret bound (3) sample efficiency (3) reward-free exploration (2) model-based reinforcement learning (2) sample complexity (2) online learning (2) reinforcement learning (2) soft tree (1) exploration strategy (1)

Papers

Improved Regret of Linear Ensemble Sampling NeurIPS 2024 No-Regret Bandit Exploration based on Soft Tree Ensemble Model NeurIPS 2024 FLEX: an Adaptive Exploration Algorithm for Nonlinear Systems ICML 2023 Instance-Sensitive Algorithms for Pure Exploration in Multinomial Logit Bandit AAAI 2022 Near-Optimal Reward-Free Exploration for Linear Mixture MDPs with Plug-in Solver ICLR 2022 On the Statistical Efficiency of Reward-Free Exploration in Non-Linear RL NeurIPS 2022 Temporally-Extended ε-Greedy Exploration ICLR 2021 Implicit Generative Modeling for Efficient Exploration ICML 2020 Kinematic State Abstraction and Provably Efficient Rich-Observation Reinforcement Learning ICML 2020 Almost Optimal Exploration in Multi-Armed Bandits ICML 2013 Autonomous Exploration For Navigating In MDPs COLT 2012