Cover Image

Open Problem: Order Optimal Regret Bounds for Kernel-Based Reinforcement Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Vakili, Sattar
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Kernelized Reinforcement Learning with Order Optimal Regret Bounds
by: Vakili, Sattar, et al.
Published: (2023)

Kernel-Based Function Approximation for Average Reward Reinforcement Learning: An Optimist No-Regret Algorithm
by: Vakili, Sattar, et al.
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)

Bayesian Optimization from Human Feedback: Near-Optimal Regret Bounds
by: Kayal, Aya, et al.
Published: (2025)

Learning Kernel-Based MDPs from Episodic Preferential Feedback
by: Pavlovic, Nikola, et al.
Published: (2026)

No-Regret Thompson Sampling for Finite-Horizon Markov Decision Processes with Gaussian Processes
by: Bayrooti, Jasmine, et al.
Published: (2025)

Reinforcement Learning Using known Invariances
by: Cioba, Alexandru, et al.
Published: (2025)

Improved Kernel Alignment Regret Bound for Online Kernel Learning
by: Li, Junfan, et al.
Published: (2022)

Near-Optimal Regret in Adversarial Kernel Bandits
by: Zhang, Yu-Jie, et al.
Published: (2026)

Reinforcement Learning and Regret Bounds for Admission Control
by: Weber, Lucas, et al.
Published: (2024)

Order Optimal Regret Bounds for Sharpe Ratio Optimization under Thompson Sampling
by: Shah, Mohammad Taha, et al.
Published: (2025)

Tighter Regret Bounds for Contextual Action-Set Reinforcement Learning
by: Chen, Zijun, et al.
Published: (2026)

Regret Bounds for Noise-Free Cascaded Kernelized Bandits
by: Li, Zihan, et al.
Published: (2022)

Order-Optimal Regret in Distributed Kernel Bandits using Uniform Sampling with Shared Randomness
by: Pavlovic, Nikola, et al.
Published: (2024)

Transfer in Reinforcement Learning via Regret Bounds for Learning Agents
by: Tuynman, Adrienne, et al.
Published: (2022)

Regret Bounds for Reinforcement Learning from Multi-Source Imperfect Preferences
by: Shi, Ming, et al.
Published: (2026)

Optimal Dynamic Regret by Transformers for Non-Stationary Reinforcement Learning
by: Chen, Baiyuan, et al.
Published: (2025)

Dynamic Regret Reduces to Kernelized Static Regret
by: Jacobsen, Andrew, et al.
Published: (2025)

Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning
by: Moradipari, Ahmadreza, et al.
Published: (2023)

Regret Bounds and Reinforcement Learning Exploration of EXP-based Algorithms
by: Xu, Mengfan, et al.
Published: (2020)

A Finite Time Analysis of Thompson Sampling for Bayesian Optimization with Preferential Feedback
by: Lazzaro, Joseph, et al.
Published: (2026)

Open Problem: Tight Bounds for Kernelized Multi-Armed Bandits with Bernoulli Rewards
by: Mussi, Marco, et al.
Published: (2024)

Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds
by: Huang, Jiayi, et al.
Published: (2023)

Threshold-Based Optimal Arm Selection in Monotonic Bandits: Regret Lower Bounds and Algorithms
by: Varude, Chanakya, et al.
Published: (2025)

Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality
by: Bongole, Raghav, et al.
Published: (2024)

Bridging Distributional and Risk-sensitive Reinforcement Learning with Provable Regret Bounds
by: Liang, Hao, et al.
Published: (2022)

Identification and Adaptive Control of Markov Jump Systems: Sample Complexity and Regret Bounds
by: Sattar, Yahya, et al.
Published: (2021)

Tighter Regret Lower Bound for Gaussian Process Bandits with Squared Exponential Kernel in Hypersphere
by: Iwazaki, Shogo
Published: (2026)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
by: Réveillard, William, et al.
Published: (2025)

Regret-Optimal Q-Learning with Low Cost for Single-Agent and Federated Reinforcement Learning
by: Zhang, Haochen, et al.
Published: (2025)

Regret-Based Defense in Adversarial Reinforcement Learning
by: Belaire, Roman, et al.
Published: (2023)

Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal
by: Ziomek, Juliusz, et al.
Published: (2024)

Disentangling Recognition and Decision Regrets in Image-Based Reinforcement Learning
by: Hüyük, Alihan, et al.
Published: (2024)

Gradient-Variation Regret Bounds for Unconstrained Online Learning
by: Zhao, Yuheng, et al.
Published: (2026)

Towards Optimal Differentially Private Regret Bounds in Linear MDPs
by: Sahu, Sharan
Published: (2025)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024)

Generalized Kernelized Bandits: A Novel Self-Normalized Bernstein-Like Dimension-Free Inequality and Regret Bounds
by: Metelli, Alberto Maria, et al.
Published: (2025)

Data-Driven Upper Confidence Bounds with Near-Optimal Regret for Heavy-Tailed Bandits
by: Tamás, Ambrus, et al.
Published: (2024)

Stagewise Reinforcement Learning and the Geometry of the Regret Landscape
by: Elliott, Chris, et al.
Published: (2026)