Kernelized Reinforcement Learning with Order Optimal Regret Bounds
Fuente:
arXiv
Saved in:
| Main Authors: | Vakili, Sattar, Olkhovskaya, Julia |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Kernel-Based Function Approximation for Average Reward Reinforcement Learning: An Optimist No-Regret Algorithm
by: Vakili, Sattar, et al.
Published: (2024)
by: Vakili, Sattar, et al.
Published: (2024)
Open Problem: Order Optimal Regret Bounds for Kernel-Based Reinforcement Learning
by: Vakili, Sattar
Published: (2024)
by: Vakili, Sattar
Published: (2024)
Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency
by: Salgia, Sudeep, et al.
Published: (2023)
by: Salgia, Sudeep, et al.
Published: (2023)
Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning
by: Kayal, Aya, et al.
Published: (2025)
by: Kayal, Aya, et al.
Published: (2025)
Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning
by: Moradipari, Ahmadreza, et al.
Published: (2023)
by: Moradipari, Ahmadreza, et al.
Published: (2023)
Regret Bounds and Reinforcement Learning Exploration of EXP-based Algorithms
by: Xu, Mengfan, et al.
Published: (2020)
by: Xu, Mengfan, et al.
Published: (2020)
Bayesian Optimization from Human Feedback: Near-Optimal Regret Bounds
by: Kayal, Aya, et al.
Published: (2025)
by: Kayal, Aya, et al.
Published: (2025)
Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds
by: Huang, Jiayi, et al.
Published: (2023)
by: Huang, Jiayi, et al.
Published: (2023)
Bridging Distributional and Risk-sensitive Reinforcement Learning with Provable Regret Bounds
by: Liang, Hao, et al.
Published: (2022)
by: Liang, Hao, et al.
Published: (2022)
Improved Regret Bounds for Bandits with Expert Advice
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)
No-Regret Reinforcement Learning in Smooth MDPs
by: Maran, Davide, et al.
Published: (2024)
by: Maran, Davide, et al.
Published: (2024)
Regret-Based Defense in Adversarial Reinforcement Learning
by: Belaire, Roman, et al.
Published: (2023)
by: Belaire, Roman, et al.
Published: (2023)
Regret-Free Reinforcement Learning for LTL Specifications
by: Majumdar, Rupak, et al.
Published: (2024)
by: Majumdar, Rupak, et al.
Published: (2024)
Learning Kernel-Based MDPs from Episodic Preferential Feedback
by: Pavlovic, Nikola, et al.
Published: (2026)
by: Pavlovic, Nikola, et al.
Published: (2026)
Minimax Optimal Variance-Aware Regret Bounds for Multinomial Logistic MDPs
by: Boudart, Pierre, et al.
Published: (2026)
by: Boudart, Pierre, et al.
Published: (2026)
Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes
by: Moon, Sang Bin, et al.
Published: (2024)
by: Moon, Sang Bin, et al.
Published: (2024)
Variance-Dependent Regret Lower Bounds for Contextual Bandits
by: He, Jiafan, et al.
Published: (2025)
by: He, Jiafan, et al.
Published: (2025)
Variance-Dependent Regret Bounds for Non-stationary Linear Bandits
by: Wang, Zhiyong, et al.
Published: (2024)
by: Wang, Zhiyong, et al.
Published: (2024)
Kernel Density Bayesian Inverse Reinforcement Learning
by: Mandyam, Aishwarya, et al.
Published: (2023)
by: Mandyam, Aishwarya, et al.
Published: (2023)
Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time
by: Kalupahana, Kalana, et al.
Published: (2026)
by: Kalupahana, Kalana, et al.
Published: (2026)
Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits
by: Xue, Bo, et al.
Published: (2025)
by: Xue, Bo, et al.
Published: (2025)
On The Sample Complexity Bounds In Bilevel Reinforcement Learning
by: Gaur, Mudit, et al.
Published: (2025)
by: Gaur, Mudit, et al.
Published: (2025)
No-Regret Thompson Sampling for Finite-Horizon Markov Decision Processes with Gaussian Processes
by: Bayrooti, Jasmine, et al.
Published: (2025)
by: Bayrooti, Jasmine, et al.
Published: (2025)
Dr. Kernel: Reinforcement Learning Done Right for Triton Kernel Generations
by: Liu, Wei, et al.
Published: (2026)
by: Liu, Wei, et al.
Published: (2026)
Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret
by: Zhong, Han, et al.
Published: (2023)
by: Zhong, Han, et al.
Published: (2023)
Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms
by: Liu, Xutong, et al.
Published: (2022)
by: Liu, Xutong, et al.
Published: (2022)
Is Optimal Transport Necessary for Inverse Reinforcement Learning?
by: Dong, Zixuan, et al.
Published: (2025)
by: Dong, Zixuan, et al.
Published: (2025)
Worst-Case Regret Bounds for Exploration via Randomized Value Functions
by: Russo, Daniel
Published: (2019)
by: Russo, Daniel
Published: (2019)
Kernel-Based Distributed Q-Learning: A Scalable Reinforcement Learning Approach for Dynamic Treatment Regimes
by: Wang, Di, et al.
Published: (2023)
by: Wang, Di, et al.
Published: (2023)
Reasoning without Regret
by: Chitra, Tarun
Published: (2025)
by: Chitra, Tarun
Published: (2025)
Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
by: Ji, Kaixuan, et al.
Published: (2026)
by: Ji, Kaixuan, et al.
Published: (2026)
An Optimal Discriminator Weighted Imitation Perspective for Reinforcement Learning
by: Xu, Haoran, et al.
Published: (2025)
by: Xu, Haoran, et al.
Published: (2025)
Realizable Abstractions: Near-Optimal Hierarchical Reinforcement Learning
by: Cipollone, Roberto, et al.
Published: (2025)
by: Cipollone, Roberto, et al.
Published: (2025)
Bounding-Box Inference for Error-Aware Model-Based Reinforcement Learning
by: Talvitie, Erin J., et al.
Published: (2024)
by: Talvitie, Erin J., et al.
Published: (2024)
Theoretical Analysis of Meta Reinforcement Learning: Generalization Bounds and Convergence Guarantees
by: Wang, Cangqing, et al.
Published: (2024)
by: Wang, Cangqing, et al.
Published: (2024)
Upper and Lower Bounds for Distributionally Robust Off-Dynamics Reinforcement Learning
by: Liu, Zhishuai, et al.
Published: (2024)
by: Liu, Zhishuai, et al.
Published: (2024)
Reinforcement Learning Interventions on Boundedly Rational Human Agents in Frictionful Tasks
by: Nofshin, Eura, et al.
Published: (2024)
by: Nofshin, Eura, et al.
Published: (2024)
Regret-Guided Search Control for Efficient Learning in AlphaZero
by: Tsai, Yun-Jui, et al.
Published: (2026)
by: Tsai, Yun-Jui, et al.
Published: (2026)
PROWL: Prioritized Regret-Driven Optimization for World Model Learning
by: Güzel, Ahmet H., et al.
Published: (2026)
by: Güzel, Ahmet H., et al.
Published: (2026)
No Regrets: Investigating and Improving Regret Approximations for Curriculum Discovery
by: Rutherford, Alexander, et al.
Published: (2024)
by: Rutherford, Alexander, et al.
Published: (2024)
Similar Items
-
Kernel-Based Function Approximation for Average Reward Reinforcement Learning: An Optimist No-Regret Algorithm
by: Vakili, Sattar, et al.
Published: (2024) -
Open Problem: Order Optimal Regret Bounds for Kernel-Based Reinforcement Learning
by: Vakili, Sattar
Published: (2024) -
Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency
by: Salgia, Sudeep, et al.
Published: (2023) -
Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning
by: Kayal, Aya, et al.
Published: (2025) -
Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning
by: Moradipari, Ahmadreza, et al.
Published: (2023)