196 citations · 319 across the 19 of their papers we have counts for
4 papers · 1 filter
Tight Load Balancing via Randomized Local Search
Petra Berenbrink, Peter Kling, Christopher Liaw +1
We consider the following balls-into-bins process with bins and balls: each ball is equipped with a mutually independent exponential clock of rate 1. Whenever a ball's cloc…
Sample-Efficient Learning of Mixtures
Hassan Ashtiani, Shai Ben-David, Abbas Mehrabian
We consider PAC learning of probability distributions (a.k.a. density estimation), where we are given an i.i.d. sample generated from an unknown target distribution, and want to ou…
The string of diamonds is nearly tight for rumour spreading
Omer Angel, Abbas Mehrabian, Yuval Peres
For a rumour spreading protocol, the spread time is defined as the first time that everyone learns the rumour. We compare the synchronous push&pull rumour spreading protocol with i…
Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks
Peter L. Bartlett, Nick Harvey, Chris Liaw +1
We prove new upper and lower bounds on the VC-dimension of deep neural networks with the ReLU activation function. These bounds are tight for almost the entire range of parameters.…