8 citations · 40 across the 29 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.LG2022
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].
math.OC2022★ 2 cited
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…
cs.GT2022★ 1 cited
Online Learning in Supply-Chain Games
Nicolò Cesa-Bianchi, Tommaso Cesari, Takayuki Osogami +2
We study a repeated game between a supplier and a retailer who want to maximize their respective profits without full knowledge of the problem parameters. After characterizing the…