1 citations · 1 across the 13 of their papers we have counts for
3 papers · 1 filter
An Efficient Minimax-Optimal Algorithm for Adversarial -Set Bandits
Francesco Bacchiocchi, Tommaso Cesari, Roberto Colomboni
We study adversarial combinatorial bandits with -set actions, where at each round the learner selects out of items and observes only the aggregate loss of the selected i…
Multi-Armed Bandits With Best-Action Queries
Francesco Bacchiocchi, Matteo Castiglioni, Alberto Marchesi +1
We study \emph{multi-armed bandits} (MABs) augmented with \emph{best-action queries}, in which the learner may additionally query an oracle that reveals the best arm in the current…
Autoregressive Bandits
Francesco Bacchiocchi, Gianmarco Genalti, Davide Maran +4
Autoregressive processes naturally arise in a large variety of real-world scenarios, including stock markets, sales forecasting, weather prediction, advertising, and pricing. When…