Skip to content
conftrace_

policy class

9 papers

Explore in graph

Co-occurring keywords · papers mentioning both

contextual bandit (4) regret bound (4) online learning (3) markov decision process (2) policy learning (2) sample complexity (2) supervised learning guarantee (1) offline policy optimization (1) finite-sample guarantee (1) adversarial target (1)

Papers

Reliable Active Apprenticeship Learning ALT 2025 Agnostic Interactive Imitation Learning: New Theory and Practical Algorithms ICML 2024 Importance-Weighted Offline Learning Done Right ALT 2024 Is Behavior Cloning All You Need? Understanding Horizon in Imitation Learning NeurIPS 2024 When is Agnostic Reinforcement Learning Statistically Tractable? NeurIPS 2023 Online learning with dynamics: A minimax perspective NeurIPS 2020 Contextual bandits with continuous actions: Smoothing, zooming, and adapting COLT 2019 BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits ICML 2016 Contextual Bandit Algorithms with Supervised Learning Guarantees AISTATS 2011