59 citations · 162 across the 62 of their papers we have counts for
8 papers · 1 filter
Communication-Aware Collaborative Learning
Avrim Blum, Shelby Heinecke, Lev Reyzin
Algorithms for noiseless collaborative PAC learning have been analyzed and optimized in recent years with respect to sample complexity. In this paper, we study collaborative PAC le…
Online Learning with Primary and Secondary Losses
Avrim Blum, Han Shao
We study the problem of online learning with primary and secondary losses. For example, a recruiter making decisions of which job applicants to hire might weigh false positives and…
Kidney exchange and endless paths: On the optimal use of an altruistic donor
Avrim Blum, Yishay Mansour
We consider a well-studied online random graph model for kidney exchange, where nodes representing patient-donor pairs arrive over time, and the probability of a directed edge is p…
An Analysis of Robustness of Non-Lipschitz Networks
Maria-Florina Balcan, Avrim Blum, Dravyansh Sharma +1
Despite significant advances, deep networks remain highly susceptible to adversarial attack. One fundamental challenge is that small input perturbations can often produce large mov…
Active Local Learning
Arturs Backurs, Avrim Blum, Neha Gupta
In this work we consider active local learning: given a query point , and active access to an unlabeled training set , output the prediction of a near-optimal $h \in H…
The Strategic Perceptron
Saba Ahmadi, Hedyeh Beyhaghi, Avrim Blum +1
The classical Perceptron algorithm provides a simple and elegant procedure for learning a linear classifier. In each step, the algorithm observes the sample's position and label an…