Cover Image

Rising Rested Bandits: Lower Bounds and Efficient Algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fiandri, Marco, Metelli, Alberto Maria, Trov`o, Francesco
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

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

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

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

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

Open Problem: Tight Bounds for Kernelized Multi-Armed Bandits with Bernoulli Rewards
by: Mussi, Marco, 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)

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

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

Autoregressive Bandits
by: Bacchiocchi, Francesco, et al.
Published: (2022)

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

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

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

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

$(ε, u)$-Adaptive Regret Minimization in Heavy-Tailed Bandits
by: Genalti, Gianmarco, et al.
Published: (2023)

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

A Refined Analysis of UCBVI
by: Drago, Simone, et al.
Published: (2025)

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

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

Lower Bounds for Time-Varying Kernelized Bandits
by: Cai, Xu, et al.
Published: (2024)

Rising Rested MAB with Linear Drift
by: Amichay, Omer, et al.
Published: (2025)

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

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

Combinatorial Rising Bandits
by: Song, Seockbean, et al.
Published: (2024)

Variance-Dependent Regret Lower Bounds for Contextual Bandits
by: He, Jiafan, et al.
Published: (2025)

Lower Bounds for the Algorithmic Complexity of Learned Indexes
by: Croquevielle, Luis Alberto, et al.
Published: (2026)

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

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

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

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

Efficient and Interpretable Bandit Algorithms
by: Mukherjee, Subhojyoti, et al.
Published: (2023)

Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
by: Goyal, Tanmay, et al.
Published: (2025)

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

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

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

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

A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
by: Chase, Zachary, et al.
Published: (2025)

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

Rising Multi-Armed Bandits with Known Horizons
by: Song, Seockbean, et al.
Published: (2026)

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

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