114 citations · 132 across the 12 of their papers we have counts for
4 papers · 1 filter
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…
Active Learning of Classifiers with Label and Seed Queries
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi +2
We study exact active learning of binary and multiclass classifiers with margin. Given an -point set , we want to learn any unknown classifier on who…
High Probability Bounds for Stochastic Subgradient Schemes with Heavy Tailed Noise
Daniela A. Parletta, Andrea Paudice, Massimiliano Pontil +1
In this work we study high probability bounds for stochastic subgradient methods under heavy tailed noise. In this setting the noise is only assumed to have finite variance as oppo…