2 citations · 2 across the 3 of their papers we have counts for
7 papers
Regret Analysis of Dyadic Search
François Bachoc, Tommaso Cesari, Roberto Colomboni +1
We analyze the cumulative regret of the Dyadic Search algorithm of Bachoc et al. [2022].
A Near-Optimal Algorithm for Univariate Zeroth-Order Budget Convex Optimization
François Bachoc, Tommaso Cesari, Roberto Colomboni +1
This paper studies a natural generalization of the problem of minimizing a univariate convex function by querying its values sequentially. At each time-step , the optimizer…
Bilateral Trade: A Regret Minimization Perspective
Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni +2
Bilateral trade, a fundamental topic in economics, models the problem of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they h…
An Efficient Algorithm for Cooperative Semi-Bandits
Riccardo Della Vecchia, Tommaso Cesari
We consider the problem of asynchronous online combinatorial optimization on a network of communicating agents. At each time step, some of the agents are stochastically activated,…
A Nearest Neighbor Characterization of Lebesgue Points in Metric Measure Spaces
Tommaso Cesari, Roberto Colomboni
The property of almost every point being a Lebesgue point has proven to be crucial for the consistency of several classification algorithms based on nearest neighbors. We character…
Cooperative Online Learning: Keeping your Neighbors Updated
Nicolò Cesa-Bianchi, Tommaso R. Cesari, Claire Monteleoni
We study an asynchronous online learning setting with a network of agents. At each time step, some of the agents are activated, requested to make a prediction, and pay the correspo…