conftrace_

eluder dimension

22 papers

Explore in graph

Co-occurring keywords

regret bound (1926) function approximation (319) sample complexity (1169) reinforcement learning (4352) multi-armed bandit (1098) upper confidence bound (197) contextual bandit (381) optimistic exploration (34) online algorithm (445) model-free reinforcement learning (63)

Papers

Contextual Bandits with Stage-wise Constraints JMLR 2025
Near-continuous time Reinforcement Learning for continuous state-action spaces ALT 2024
How Does Variance Shape the Regret in Contextual Bandits? NIPS 2024
The Star Number and Eluder Dimension: Elementary Observations About the Dimensions of Disagreement COLT 2024
On the Statistical Efficiency of Mean-Field Reinforcement Learning with General Function Approximation AISTATS 2024
A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation NIPS 2024
Causal Bandits with General Causal Models and Interventions AISTATS 2024
VO$Q$L: Towards Optimal Regret in Model-free RL with Nonlinear Function Approximation COLT 2023
Low-Switching Policy Gradient with Exploration via Online Sensitivity Sampling ICML 2023
Uniform-PAC Guarantees for Model-Based RL with Bounded Eluder Dimension UAI 2023
Experiment Planning with Function Approximation NIPS 2023
Understanding the Eluder Dimension NIPS 2022
Reinforcement Learning with Logarithmic Regret and Policy Switches NIPS 2022
Randomized Exploration in Reinforcement Learning with General Value Function Approximation ICML 2021
Representation Learning Beyond Linear Prediction Functions NIPS 2021
Provably Correct Optimization and Exploration with Non-linear Policies ICML 2021
Agnostic $Q$-learning with Function Approximation in Deterministic Systems: Near-Optimal Bounds on Approximation Error and Sample Complexity NIPS 2020
Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder Dimension NIPS 2020
On Thompson Sampling for Smoother-than-Lipschitz Bandits AISTATS 2020
Model-based Reinforcement Learning and the Eluder Dimension NIPS 2014
Efficient Exploration and Value Function Generalization in Deterministic Systems NIPS 2013
Eluder Dimension and the Sample Complexity of Optimistic Exploration NIPS 2013