Imagen de Portada

A Refined Analysis of UCBVI

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Drago, Simone, Mussi, Marco, Metelli, Alberto Maria
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Learning Optimal Deterministic Policies with Stochastic Policy Gradients
por: Montenegro, Alessandro, et al.
Publicado: (2024)

Last-Iterate Global Convergence of Policy Gradients for Constrained Reinforcement Learning
por: Montenegro, Alessandro, et al.
Publicado: (2024)

Reusing Trajectories in Policy Gradients Enables Fast Convergence
por: Montenegro, Alessandro, et al.
Publicado: (2025)

Power Grid Control with Graph-Based Distributed Reinforcement Learning
por: Fabrizio, Carlo, et al.
Publicado: (2025)

Learning Deterministic Policies with Policy Gradients in Constrained Markov Decision Processes
por: Montenegro, Alessandro, et al.
Publicado: (2025)

Best Arm Identification for Stochastic Rising Bandits
por: Mussi, Marco, et al.
Publicado: (2023)

State and Action Factorization in Power Grids
por: Losapio, Gianvito, et al.
Publicado: (2024)

Bridging Rested and Restless Bandits with Graph-Triggering: Rising and Rotting
por: Genalti, Gianmarco, et al.
Publicado: (2024)

Performance Improvement Bounds for Lipschitz Configurable Markov Decision Processes
por: Metelli, Alberto Maria
Publicado: (2024)

Autoregressive Bandits
por: Bacchiocchi, Francesco, et al.
Publicado: (2022)

Federated UCBVI: Communication-Efficient Federated Regret Minimization with Heterogeneous Agents
por: Labbi, Safwan, et al.
Publicado: (2024)

Thompson Sampling-like Algorithms for Stochastic Rising Bandits
por: Fiandri, Marco, et al.
Publicado: (2025)

Sliding-Window Thompson Sampling for Non-Stationary Settings
por: Fiandri, Marco, et al.
Publicado: (2024)

Interpetable Target-Feature Aggregation for Multi-Task Learning based on Bias-Variance Analysis
por: Bonetti, Paolo, et al.
Publicado: (2024)

Robustness in the Face of Partial Identifiability in Reward Learning
por: Lazzati, Filippo, et al.
Publicado: (2025)

Learning Utilities from Demonstrations in Markov Decision Processes
por: Lazzati, Filippo, et al.
Publicado: (2024)

Rising Rested Bandits: Lower Bounds and Efficient Algorithms
por: Fiandri, Marco, et al.
Publicado: (2024)

Generalizing Behavior via Inverse Reinforcement Learning with Closed-Form Reward Centroids
por: Lazzati, Filippo, et al.
Publicado: (2025)

Imitation Learning as Return Distribution Matching
por: Lazzati, Filippo, et al.
Publicado: (2025)

A Provably Efficient Option-Based Algorithm for both High-Level and Low-Level Learning
por: Drappo, Gianluca, et al.
Publicado: (2024)

How does Inverse RL Scale to Large State Spaces? A Provably Efficient Approach
por: Lazzati, Filippo, et al.
Publicado: (2024)

Online Dynamic Pricing of Complementary Products
por: Mussi, Marco, et al.
Publicado: (2025)

Reward Compatibility: A Framework for Inverse RL
por: Lazzati, Filippo, et al.
Publicado: (2025)

Achieving $\widetilde{\mathcal{O}}(\sqrt{T})$ Regret in Average-Reward POMDPs with Known Observation Models
por: Russo, Alessio, et al.
Publicado: (2025)

Pure Exploration under Mediators' Feedback
por: Poiani, Riccardo, et al.
Publicado: (2023)

Offline Inverse RL: New Solution Concepts and Provably Efficient Algorithms
por: Lazzati, Filippo, et al.
Publicado: (2024)

Efficient Learning of POMDPs with Known Observation Model in Average-Reward Setting
por: Russo, Alessio, et al.
Publicado: (2024)

Statistical Analysis of Policy Space Compression Problem
por: Molaei, Majid, et al.
Publicado: (2024)

Catoni-Style Change Point Detection for Regret Minimization in Non-Stationary Heavy-Tailed Bandits
por: Genalti, Gianmarco, et al.
Publicado: (2025)

Truncating Trajectories in Monte Carlo Policy Evaluation: an Adaptive Approach
por: Poiani, Riccardo, et al.
Publicado: (2024)

Local Linearity: the Key for No-regret Reinforcement Learning in Continuous MDPs
por: Maran, Davide, et al.
Publicado: (2024)

Policy Gradient with Active Importance Sampling
por: Papini, Matteo, et al.
Publicado: (2024)

Gym4ReaL: A Suite for Benchmarking Real-World Reinforcement Learning
por: Salaorni, Davide, et al.
Publicado: (2025)

Causal Fairness for Survival Analysis
por: Plecko, Drago
Publicado: (2026)

Information Capacity Regret Bounds for Bandits with Mediator Feedback
por: Eldowa, Khaled, et al.
Publicado: (2024)

Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs
por: Maran, Davide, et al.
Publicado: (2024)

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

Inverse Reinforcement Learning with Sub-optimal Experts
por: Poiani, Riccardo, et al.
Publicado: (2024)