activity
20212026
most citedTruncating Trajectories in Monte Carlo Reinforcement Learning

3 citations · 16 across the 47 of their papers we have counts for

collaborators
Showing 2025Show all

7 papers · 1 filter

cs.LG2025

Power Grid Control with Graph-Based Distributed Reinforcement Learning

Carlo Fabrizio, Gianvito Losapio, Marco Mussi +2

The necessary integration of renewable energy sources, combined with the expanding scale of power networks, presents significant challenges in controlling modern power grids. Tradi…

cs.LG2025

Generalized Kernelized Bandits: A Novel Self-Normalized Bernstein-Like Dimension-Free Inequality and Regret Bounds

Alberto Maria Metelli, Simone Drago, Marco Mussi

We study the regret minimization problem in the novel setting of generalized kernelized bandits (GKBs), where we optimize an unknown function belonging to a reproducing kerne…

cs.LG2025

Gym4ReaL: A Suite for Benchmarking Real-World Reinforcement Learning

Davide Salaorni, Vincenzo De Paola, Samuele Delpero +9

In recent years, \emph{Reinforcement Learning} (RL) has made remarkable progress, achieving superhuman performance in a wide range of simulated environments. As research moves towa…

cs.LG2025

Catoni-Style Change Point Detection for Regret Minimization in Non-Stationary Heavy-Tailed Bandits

Gianmarco Genalti, Sujay Bhatt, Nicola Gatti +1

Regret minimization in stochastic non-stationary bandits gained popularity over the last decade, as it can model a broad class of real-world problems, from advertising to recommend…

stat.ML2025

Thompson Sampling-like Algorithms for Stochastic Rising Bandits

Marco Fiandri, Alberto Maria Metelli, Francesco Trovò

Stochastic rising rested bandit (SRRB) is a setting where the arms' expected rewards increase as they are pulled. It models scenarios in which the performances of the different opt…

stat.ML2025

A Refined Analysis of UCBVI

Simone Drago, Marco Mussi, Alberto Maria Metelli

In this work, we provide a refined analysis of the UCBVI algorithm (Azar et al., 2017), improving both the bonus terms and the regret analysis. Additionally, we compare our version…

cs.LG2025

Achieving Regret in Average-Reward POMDPs with Known Observation Models

Alessio Russo, Alberto Maria Metelli, Marcello Restelli

We tackle average-reward infinite-horizon POMDPs with an unknown transition model but a known observation model, a setting that has been previously addressed in two limiting ways:…