Colin Sandon

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 28

Top Topics

Information Theory

Fundamental Limits

Error Probability

Top Venues

IEEE Trans. Inf. Theory

Publications

Byron Chin, Ankur Moitra, Elchanan Mossel, Colin Sandon
The power of an adversary in Glauber dynamics. COLT (2024)
Souvik Dhara, Julia Gaudio, Elchanan Mossel, Colin Sandon
The Power of Two Matrices in Spectral Algorithms for Community Recovery. IEEE Trans. Inf. Theory 70 (5) (2024)
Emmanuel Abbe, Samy Bengio, Aryo Lotfi, Colin Sandon, Omid Saremi
How Far Can Transformers Reason? The Locality Barrier and Inductive Scratchpad. CoRR (2024)
Emmanuel Abbe, Colin Sandon
A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels. FOCS (2023)
Emmanuel Abbe, Colin Sandon
Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting. CoRR (2023)
Emmanuel Abbe, Colin Sandon
A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels. CoRR (2023)
Souvik Dhara, Julia Gaudio, Elchanan Mossel, Colin Sandon
Spectral recovery of binary censored block models. SODA (2022)
Souvik Dhara, Julia Gaudio, Elchanan Mossel, Colin Sandon
The Power of Two Matrices in Spectral Algorithms. CoRR (2022)
Souvik Dhara, Julia Gaudio, Elchanan Mossel, Colin Sandon
Spectral Algorithms Optimally Recover (Censored) Planted Dense Subgraphs. CoRR (2022)
Ankur Moitra, Elchanan Mossel, Colin Sandon
Learning to Sample from Censored Markov Random Fields. CoRR (2021)
Emmanuel Abbe, Pritish Kamath, Eran Malach, Colin Sandon, Nathan Srebro
On the Power of Differentiable Learning versus PAC and SQ Learning. CoRR (2021)
Emmanuel Abbe, Pritish Kamath, Eran Malach, Colin Sandon, Nathan Srebro
On the Power of Differentiable Learning versus PAC and SQ Learning. NeurIPS (2021)
Ankur Moitra, Elchanan Mossel, Colin Sandon
Spoofing Generalization: When Can't You Trust Proprietary Models? CoRR (2021)
Emmanuel Abbe, Colin Sandon
On the universality of deep learning. NeurIPS (2020)
Emmanuel Abbe, Colin Sandon
Poly-time universality and limitations of deep learning. CoRR (2020)
Ankur Moitra, Elchanan Mossel, Colin Sandon
Parallels Between Phase Transitions and Circuit Complexity? COLT (2020)
Emmanuel Abbe, Enric Boix-Adserà, Peter Ralli, Colin Sandon
Graph Powering and Spectral Robustness. SIAM J. Math. Data Sci. 2 (1) (2020)
Ankur Moitra, Elchanan Mossel, Colin Sandon
The Circuit Complexity of Inference. CoRR (2019)
Emmanuel Abbe, Enric Boix, Peter Ralli, Colin Sandon
Graph powering and spectral robustness. CoRR (2018)
Emmanuel Abbe, Colin Sandon
Provable limitations of deep learning. CoRR (2018)
Emmanuel Abbe, Colin Sandon
Crossing the KS threshold in the stochastic block model with information theory. ISIT (2016)
Emmanuel Abbe, Colin Sandon
Achieving the KS threshold in the general stochastic block model with linearized acyclic belief propagation. NIPS (2016)
Emmanuel Abbe, Noga Alon, Afonso S. Bandeira, Colin Sandon
Linear Boolean Classification, Coding and the Critical Problem. IEEE Trans. Inf. Theory 62 (4) (2016)
Emmanuel Abbe, Colin Sandon
Recovering Communities in the General Stochastic Block Model Without Knowing the Parameters. NIPS (2015)
Emmanuel Abbe, Colin Sandon
Community detection in general stochastic block models: fundamental limits and efficient recovery algorithms. CoRR (2015)
Emmanuel Abbe, Colin Sandon
Recovering communities in the general stochastic block model without knowing the parameters. CoRR (2015)
Emmanuel Abbe, Colin Sandon
Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery. FOCS (2015)
Emmanuel Abbe, Colin Sandon
Detection in the stochastic block model with multiple clusters: proof of the achievability conjectures, acyclic BP, and the information-computation gap. CoRR (2015)
Colin Sandon, Fabrizio Zanello
Warnaar's bijection and colored partition identities, I. J. Comb. Theory, Ser. A 120 (1) (2013)