1 citations · 1 across the 4 of their papers we have counts for
10 papers
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…
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…
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…
An Algorithm for Stochastic and Adversarial Bandits with Switching Costs
Chloé Rouyer, Yevgeny Seldin, Nicolò Cesa-Bianchi
We propose an algorithm for stochastic and adversarial multiarmed bandits with switching costs, where the algorithm pays a price every time it switches the arm being played. Ou…
Finding Stable Matchings in PhD Markets with Consistent Preferences and Cooperative Partners
Maximilian Mordig, Riccardo Della Vecchia, Nicolò Cesa-Bianchi +1
We introduce a new algorithm for finding stable matchings in multi-sided matching markets. Our setting is motivated by a PhD market of students, advisors, and co-advisors, and can…
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…