20 citations · 44 across the 32 of their papers we have counts for
8 papers · 1 filter
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…
Truly Adapting to Adversarial Constraints in Constrained MABs
Francesco Emanuele Stradi, Kalana Kalupahana, Matteo Castiglioni +2
We study the constrained variant of the \emph{multi-armed bandit} (MAB) problem, in which the learner aims not only at minimizing the total loss incurred during the learning dynami…
Data-Dependent Regret Bounds for Constrained MABs
Gianmarco Genalti, Francesco Emanuele Stradi, Matteo Castiglioni +2
This paper initiates the study of data-dependent regret bounds in constrained MAB settings. These bounds depend on the sequence of losses that characterize the problem instance. Th…
No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!
Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi +2
We study online decision making problems under resource constraints, where both reward and cost functions are drawn from distributions that may change adversarially over time. We f…
Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
Francesco Emanuele Stradi, Matteo Castiglioni, Alberto Marchesi +1
We study online learning in \emph{constrained MDPs} (CMDPs), focusing on the goal of attaining sublinear strong regret and strong cumulative constraint violation. Differently from…
Best-of-Both-Worlds Policy Optimization for CMDPs with Bandit Feedback
Francesco Emanuele Stradi, Anna Lunghi, Matteo Castiglioni +2
We study online learning in constrained Markov decision processes (CMDPs) in which rewards and constraints may be either stochastic or adversarial. In such settings, Stradi et al.(…