Image de couverture de livre

Regret Bounds and Reinforcement Learning Exploration of EXP-based Algorithms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Xu, Mengfan, Klabjan, Diego
Format:	Preprint
Publié:	2020
Sujets:	Machine Learning Artificial Intelligence
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Communication-Efficient Federated Low-Rank Update Algorithm and its Connection to Implicit Regularization
par: Park, Haemin, et autres
Publié: (2024)

Technical Debt in In-Context Learning: Diminishing Efficiency in Long Context
par: Joo, Taejong, et autres
Publié: (2025)

Kernelized Reinforcement Learning with Order Optimal Regret Bounds
par: Vakili, Sattar, et autres
Publié: (2023)

Decentralized Blockchain-based Robust Multi-agent Multi-armed Bandit
par: Xu, Mengfan, et autres
Publié: (2024)

Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning
par: Moradipari, Ahmadreza, et autres
Publié: (2023)

Bridging Distributional and Risk-sensitive Reinforcement Learning with Provable Regret Bounds
par: Liang, Hao, et autres
Publié: (2022)

Fast EXP3 Algorithms
par: Sato, Ryoma, et autres
Publié: (2025)

No-Regret Reinforcement Learning in Smooth MDPs
par: Maran, Davide, et autres
Publié: (2024)

Kernel-Based Function Approximation for Average Reward Reinforcement Learning: An Optimist No-Regret Algorithm
par: Vakili, Sattar, et autres
Publié: (2024)

Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret
par: Zhong, Han, et autres
Publié: (2023)

Worst-Case Regret Bounds for Exploration via Randomized Value Functions
par: Russo, Daniel
Publié: (2019)

Multi-Layer Attention-Based Explainability via Transformers for Tabular Data
par: Gavito, Andrea Treviño, et autres
Publié: (2023)

Regret-Free Reinforcement Learning for LTL Specifications
par: Majumdar, Rupak, et autres
Publié: (2024)

Regret-Based Defense in Adversarial Reinforcement Learning
par: Belaire, Roman, et autres
Publié: (2023)

Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds
par: Huang, Jiayi, et autres
Publié: (2023)

Neighboring State-based Exploration for Reinforcement Learning
par: Li, Yu-Teng, et autres
Publié: (2022)

Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes
par: Moon, Sang Bin, et autres
Publié: (2024)

OPRIDE: Offline Preference-based Reinforcement Learning via In-Dataset Exploration
par: Yang, Yiqin, et autres
Publié: (2026)

Provably Efficient Exploration in Reward Machines with Low Regret
par: Bourel, Hippolyte, et autres
Publié: (2024)

Variance-Dependent Regret Lower Bounds for Contextual Bandits
par: He, Jiafan, et autres
Publié: (2025)

Variance-Dependent Regret Bounds for Non-stationary Linear Bandits
par: Wang, Zhiyong, et autres
Publié: (2024)

In-context Exploration-Exploitation for Reinforcement Learning
par: Dai, Zhenwen, et autres
Publié: (2024)

Satisficing Exploration for Deep Reinforcement Learning
par: Arumugam, Dilip, et autres
Publié: (2024)

Reinforcement Learning by Guided Safe Exploration
par: Yang, Qisong, et autres
Publié: (2023)

Upper and Lower Bounds for Distributionally Robust Off-Dynamics Reinforcement Learning
par: Liu, Zhishuai, et autres
Publié: (2024)

Variable-Agnostic Causal Exploration for Reinforcement Learning
par: Nguyen, Minh Hoang, et autres
Publié: (2024)

Exploration in Knowledge Transfer Utilizing Reinforcement Learning
par: Jedlička, Adam, et autres
Publié: (2024)

Is Exploration or Optimization the Problem for Deep Reinforcement Learning?
par: Berseth, Glen
Publié: (2025)

Is Exploration All You Need? Effective Exploration Characteristics for Transfer in Reinforcement Learning
par: Balloch, Jonathan C., et autres
Publié: (2024)

Reinforcement Learning-based Feature Generation Algorithm for Scientific Data
par: Xiao, Meng, et autres
Publié: (2025)

More Efficient Randomized Exploration for Reinforcement Learning via Approximate Sampling
par: Ishfaq, Haque, et autres
Publié: (2024)

Enhance Exploration in Safe Reinforcement Learning with Contrastive Representation Learning
par: Doan, Duc Kien, et autres
Publié: (2025)

Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits
par: Xue, Bo, et autres
Publié: (2025)

Adventurer: Exploration with BiGAN for Deep Reinforcement Learning
par: Liu, Yongshuai, et autres
Publié: (2025)

Provably Efficient Exploration in Inverse Constrained Reinforcement Learning
par: Yue, Bo, et autres
Publié: (2024)

Offline Model-Based Reinforcement Learning with Anti-Exploration
par: Srinivasan, Padmanaba, et autres
Publié: (2024)

Guardian: Decoupling Exploration from Safety in Reinforcement Learning
par: Cai, Kaitong, et autres
Publié: (2025)

A Temporally Correlated Latent Exploration for Reinforcement Learning
par: Oh, SuMin, et autres
Publié: (2024)

Optimistic Exploration for Risk-Averse Constrained Reinforcement Learning
par: McCarthy, James, et autres
Publié: (2025)

On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits
par: Hou, Yunlong, et autres
Publié: (2026)