Cover Image

Kernel-Based Function Approximation for Average Reward Reinforcement Learning: An Optimist No-Regret Algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Vakili, Sattar, Olkhovskaya, Julia
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Artificial Intelligence
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)

Open Problem: Order Optimal Regret Bounds for Kernel-Based Reinforcement Learning
by: Vakili, Sattar
Published: (2024)

Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning
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)

Constrained Reinforcement Learning with Average Reward Objective: Model-Based and Model-Free Algorithms
by: Aggarwal, Vaneet, et al.
Published: (2024)

Regret Analysis of Policy Gradient Algorithm for Infinite Horizon Average Reward Markov Decision Processes
by: Bai, Qinbo, et al.
Published: (2023)

Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes
by: Moon, Sang Bin, et al.
Published: (2024)

Optimistic Policy Learning under Pessimistic Adversaries with Regret and Violation Guarantees
by: Ganguly, Sourav, et al.
Published: (2026)

Optimistic Reinforcement Learning with Quantile Objectives
by: Alipour-Vaezi, Mohammad, et al.
Published: (2025)

Optimistic Thompson Sampling for No-Regret Learning in Unknown Games
by: Li, Yingru, et al.
Published: (2024)

Provably Adaptive Average Reward Reinforcement Learning for Metric Spaces
by: Kar, Avik, et al.
Published: (2024)

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

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

Optimistic Exploration for Risk-Averse Constrained Reinforcement Learning
by: McCarthy, James, et al.
Published: (2025)

A Harmonic Mean Formulation of Average Reward Reinforcement Learning in SMDPs
by: Shtossel, Erel, et al.
Published: (2026)

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

Efficient $Q$-Learning and Actor-Critic Methods for Robust Average Reward Reinforcement Learning
by: Xu, Yang, et al.
Published: (2025)

The Perils of Optimizing Learned Reward Functions: Low Training Error Does Not Guarantee Low Regret
by: Fluri, Lukas, et al.
Published: (2024)

Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes
by: Ganguly, Bhargav, et al.
Published: (2023)

No-Regret Reinforcement Learning in Smooth MDPs
by: Maran, Davide, et al.
Published: (2024)

Constraints as Rewards: Reinforcement Learning for Robots without Reward Functions
by: Ishihara, Yu, et al.
Published: (2025)

Reinforcement Learning with LTL and $ω$-Regular Objectives via Optimality-Preserving Translation to Average Rewards
by: Le, Xuan-Bach, et al.
Published: (2024)

Optimistic World Models: Efficient Exploration in Model-Based Deep Reinforcement Learning
by: Mete, Akshay, et al.
Published: (2026)

An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints
by: Zhu, Jiahui, et al.
Published: (2025)

Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent
by: Xu, Hang, et al.
Published: (2024)

Algorithms for Learning Kernels Based on Centered Alignment
by: Cortes, Corinna, et al.
Published: (2012)

No Regrets: Investigating and Improving Regret Approximations for Curriculum Discovery
by: Rutherford, Alexander, et al.
Published: (2024)

Regret-Free Reinforcement Learning for LTL Specifications
by: Majumdar, Rupak, et al.
Published: (2024)

A Computationally Efficient Algorithm for Infinite-Horizon Average-Reward Linear MDPs
by: Hong, Kihyuk, et al.
Published: (2025)

Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency
by: Salgia, Sudeep, et al.
Published: (2023)

Burning RED: Unlocking Subtask-Driven Reinforcement Learning and Risk-Awareness in Average-Reward Markov Decision Processes
by: Rojas, Juan Sebastian, et al.
Published: (2024)

Provably Efficient Exploration in Reward Machines with Low Regret
by: Bourel, Hippolyte, et al.
Published: (2024)

Global Convergence for Average Reward Constrained MDPs with Primal-Dual Actor Critic Algorithm
by: Xu, Yang, et al.
Published: (2025)

Unsupervised Zero-Shot Reinforcement Learning via Functional Reward Encodings
by: Frans, Kevin, et al.
Published: (2024)

Average-Reward Soft Actor-Critic
by: Adamczyk, Jacob, et al.
Published: (2025)

Optimistic Rates for Learning from Label Proportions
by: Li, Gene, et al.
Published: (2024)

A Rollout-Based Algorithm and Reward Function for Resource Allocation in Business Processes
by: Middelhuis, Jeroen, et al.
Published: (2025)

Uncertainty-Aware Reward-Free Exploration with General Function Approximation
by: Zhang, Junkai, et al.
Published: (2024)

Impoola: The Power of Average Pooling for Image-Based Deep Reinforcement Learning
by: Trumpp, Raphael, et al.
Published: (2025)

Directed-MAML: Meta Reinforcement Learning Algorithm with Task-directed Approximation
by: Zhang, Yang, et al.
Published: (2025)