Showing 2026Show all
3 papers · 1 filter
cs.LG2026
Parameter-Free Heavy-Tailed Bandits
Gianmarco Genalti, Alberto Maria Metelli
Heavy-tailed distributions arise naturally in sequential decision-making problems such as financial investment, online advertising, and network management, where rare but extreme o…
cs.LG2026
Online Packet Scheduling with Deadlines and Learning
Gianmarco Genalti, Achraf Azize, Vianney Perchet
Network routers that enforce Quality-of-Service (QoS) guarantees must decide, at every clock cycle, which expiring packet of information to transmit, even when the value of the pac…
cs.LG2026
Replicable Constrained Bandits
Matteo Bollini, Gianmarco Genalti, Francesco Emanuele Stradi +2
Algorithmic \emph{replicability} has recently been introduced to address the need for reproducible experiments in machine learning. A \emph{replicable online learning} algorithm is…