default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColin Sandon
Person information
- affiliation: Massachusetts Institute of Technology (MIT), Department of Mathematics, Cambridge, MA, USA
- affiliation: Princeton University, Department of Mathematics, J, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]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): 3599-3621 (2024)- [c11]Byron Chin, Ankur Moitra, Elchanan Mossel, Colin Sandon:
The power of an adversary in Glauber dynamics. COLT 2024: 1102-1124 - [i15]Emmanuel Abbe, Samy Bengio, Aryo Lotfi, Colin Sandon, Omid Saremi:
How Far Can Transformers Reason? The Locality Barrier and Inductive Scratchpad. CoRR abs/2406.06467 (2024) - 2023
- [c10]Emmanuel Abbe, Colin Sandon:
A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels. FOCS 2023: 177-193 - [i14]Emmanuel Abbe, Colin Sandon:
A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels. CoRR abs/2304.02509 (2023) - [i13]Emmanuel Abbe, Colin Sandon:
Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting. CoRR abs/2312.04329 (2023) - 2022
- [c9]Souvik Dhara, Julia Gaudio, Elchanan Mossel, Colin Sandon:
Spectral recovery of binary censored block models. SODA 2022: 3389-3416 - [i12]Souvik Dhara, Julia Gaudio, Elchanan Mossel, Colin Sandon:
Spectral Algorithms Optimally Recover (Censored) Planted Dense Subgraphs. CoRR abs/2203.11847 (2022) - [i11]Souvik Dhara, Julia Gaudio, Elchanan Mossel, Colin Sandon:
The Power of Two Matrices in Spectral Algorithms. CoRR abs/2210.05893 (2022) - 2021
- [c8]Ankur Moitra, Elchanan Mossel, Colin Sandon:
Learning to Sample from Censored Markov Random Fields. COLT 2021: 3419-3451 - [c7]Emmanuel Abbe, Pritish Kamath, Eran Malach, Colin Sandon, Nathan Srebro:
On the Power of Differentiable Learning versus PAC and SQ Learning. NeurIPS 2021: 24340-24351 - [i10]Ankur Moitra, Elchanan Mossel, Colin Sandon:
Learning to Sample from Censored Markov Random Fields. CoRR abs/2101.06178 (2021) - [i9]Ankur Moitra, Elchanan Mossel, Colin Sandon:
Spoofing Generalization: When Can't You Trust Proprietary Models? CoRR abs/2106.08393 (2021) - [i8]Emmanuel Abbe, Pritish Kamath, Eran Malach, Colin Sandon, Nathan Srebro:
On the Power of Differentiable Learning versus PAC and SQ Learning. CoRR abs/2108.04190 (2021) - 2020
- [j3]Emmanuel Abbe, Enric Boix-Adserà, Peter Ralli, Colin Sandon:
Graph Powering and Spectral Robustness. SIAM J. Math. Data Sci. 2(1): 132-157 (2020) - [c6]Ankur Moitra, Elchanan Mossel, Colin Sandon:
Parallels Between Phase Transitions and Circuit Complexity? COLT 2020: 2910-2946 - [c5]Emmanuel Abbe, Colin Sandon:
On the universality of deep learning. NeurIPS 2020 - [i7]Emmanuel Abbe, Colin Sandon:
Poly-time universality and limitations of deep learning. CoRR abs/2001.02992 (2020)
2010 – 2019
- 2019
- [i6]Ankur Moitra, Elchanan Mossel, Colin Sandon:
The Circuit Complexity of Inference. CoRR abs/1904.05483 (2019) - 2018
- [i5]Emmanuel Abbe, Enric Boix, Peter Ralli, Colin Sandon:
Graph powering and spectral robustness. CoRR abs/1809.04818 (2018) - [i4]Emmanuel Abbe, Colin Sandon:
Provable limitations of deep learning. CoRR abs/1812.06369 (2018) - 2017
- [b1]Colin Sandon:
Community Detection in the Stochastic Block Model: fundamental limits. Princeton University, USA, 2017 - 2016
- [j2]Emmanuel Abbe, Noga Alon, Afonso S. Bandeira, Colin Sandon:
Linear Boolean Classification, Coding and the Critical Problem. IEEE Trans. Inf. Theory 62(4): 1667-1673 (2016) - [c4]Emmanuel Abbe, Colin Sandon:
Crossing the KS threshold in the stochastic block model with information theory. ISIT 2016: 840-844 - [c3]Emmanuel Abbe, Colin Sandon:
Achieving the KS threshold in the general stochastic block model with linearized acyclic belief propagation. NIPS 2016: 1334-1342 - 2015
- [c2]Emmanuel Abbe, Colin Sandon:
Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery. FOCS 2015: 670-688 - [c1]Emmanuel Abbe, Colin Sandon:
Recovering Communities in the General Stochastic Block Model Without Knowing the Parameters. NIPS 2015: 676-684 - [i3]Emmanuel Abbe, Colin Sandon:
Community detection in general stochastic block models: fundamental limits and efficient recovery algorithms. CoRR abs/1503.00609 (2015) - [i2]Emmanuel Abbe, Colin Sandon:
Recovering communities in the general stochastic block model without knowing the parameters. CoRR abs/1506.03729 (2015) - [i1]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 abs/1512.09080 (2015) - 2013
- [j1]Colin Sandon, Fabrizio Zanello:
Warnaar's bijection and colored partition identities, I. J. Comb. Theory A 120(1): 28-38 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
