2 citations · 3 across the 5 of their papers we have counts for
12 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…
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…
On Margin-Based Cluster Recovery with Oracle Queries
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi +1
We study an active cluster recovery problem where, given a set of points and an oracle answering queries like "are these two points in the same cluster?", the task is to recove…
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries
Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi +1
We investigate the problem of exact cluster recovery using oracle queries. Previous results show that clusters in Euclidean spaces that are convex and separated with a margin can b…
Robust Unsupervised Learning via L-Statistic Minimization
Andreas Maurer, Daniela A. Parletta, Andrea Paudice +1
Designing learning algorithms that are resistant to perturbations of the underlying data distribution is a problem of wide practical and theoretical importance. We present a genera…