Emmanuel Abbe
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
- Enric Boixonce
- Theodor Misiakiewiczonce
who talks about the same things
- Ankur Moitra18 talks
- David P. Woodruff18 talks
- Rotem Oshman4 talks
- Mark Braverman5 talks
- François Le Gall4 talks
- Yuval Filmus9 talks
| title | conference | date |
|---|---|---|
| Learning Staircases | Deep Learning Theory Symposium 2021 | 2021-12-03 |
Claim: certain nested “staircase” Boolean functions with growing degree are not kernel learnable (NTK/random features require ~D^K samples/features) but are… | ||
| Graph Powering | Optimization, Statistics and Uncertainty | 2017-11-28 |
Proposes graph powering: form a new graph by adding edges between nodes within graph distance ≤ R, using the adjacency of walks thresholded to 0/1, then run… | ||
| Fundamental Limit of Community Detection in Stochastic Block Models | Information Theory, Learning and Big Data (Simons Institute, 2015) | 2015-03-16 |
States an exact information-theoretic threshold for exact recovery in stochastic block models with log-degree scaling: recovery occurs iff a Chernoff–Hellinger… | ||
| Lucky Talk: From Coding to Clustering | Information Theory, Learning and Big Data (Simons Institute, 2015) | 2015-03-16 |
Exact recovery for the stochastic block model is pinned down: with p = a log n / n and q = b log n / n the two-group symmetric case has a sharp solvability… | ||
| Reed-Muller and Other Subcodes of the Sierpinski Matrix | Coding: From Practice to Theory | 2015-02-19 |
Reed–Muller rows are reinterpreted via the Sierpinski tensor and a polarization of conditional ranks to build explicit parity matrices that meet a… | ||
| nothing matches | ||