Emmanuel Abbe
Orcid: 0000-0002-8014-5706Affiliations:
- EPFL, Switzerland
- Princeton University, USA (former)
According to our database1,
Emmanuel Abbe
authored at least 107 papers
between 2008 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting.
CoRR, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the International Conference on Machine Learning, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023
Can Knowledge Transfer Techniques Compensate for the Limited Myocardial Infarction Data by Leveraging Hæmodynamics? An in silico Study.
Proceedings of the Artificial Intelligence in Medicine, 2023
2022
Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Learning to Reason with Neural Networks: Generalization, Unseen Data and Boolean Measures.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
An Initial Alignment between Neural Network and Target is Needed for Gradient Descent to Learn.
Proceedings of the International Conference on Machine Learning, 2022
The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networks.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022
2021
IEEE Trans. Inf. Theory, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Proceedings of the 38th International Conference on Machine Learning, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
Proceedings of the Conference on Learning Theory, 2021
2020
IEEE Trans. Inf. Theory, 2020
Chaining Meets Chain Rule: Multilevel Entropic Regularization and Training of Neural Networks.
J. Mach. Learn. Res., 2020
CoRR, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the IEEE International Symposium on Information Theory, 2020
2019
IEEE Trans. Inf. Theory, 2019
Chaining Meets Chain Rule: Multilevel Entropic Regularization and Training of Neural Nets.
CoRR, 2019
Proceedings of the IEEE International Symposium on Information Theory, 2019
2018
Found. Trends Commun. Inf. Theory, 2018
CoRR, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
Proceedings of the 35th International Conference on Machine Learning, 2018
2017
Polarization of the Rényi Information Dimension With Applications to Compressed Sensing.
IEEE Trans. Inf. Theory, 2017
J. Mach. Learn. Res., 2017
Entropy, 2017
CoRR, 2017
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
2016
IEEE Trans. Inf. Theory, 2016
Achieving the KS threshold in the general stochastic block model with linearized acyclic belief propagation.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016
Proceedings of the IEEE International Symposium on Information Theory, 2016
Proceedings of the IEEE International Symposium on Information Theory, 2016
Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016
Proceedings of the 2016 Annual Conference on Information Science and Systems, 2016
Proceedings of the 54th Annual Allerton Conference on Communication, 2016
2015
Conditional Random Fields, Planted Constraint Satisfaction, and Entropy Concentration.
Theory Comput., 2015
Randomness and Dependencies Extraction via Polarization, With Applications to Slepian-Wolf Coding and Secrecy.
IEEE Trans. Inf. Theory, 2015
IEEE Trans. Circuits Syst. II Express Briefs, 2015
Detection in the stochastic block model with multiple clusters: proof of the achievability conjectures, acyclic BP, and the information-computation gap.
CoRR, 2015
Community detection in general stochastic block models: fundamental limits and efficient recovery algorithms.
CoRR, 2015
CoRR, 2015
Concentration of the number of solutions of random planted CSPs and Goldreich's one-way candidates.
CoRR, 2015
Recovering Communities in the General Stochastic Block Model Without Knowing the Parameters.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015
Proceedings of the IEEE International Symposium on Information Theory, 2015
Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
2014
Decoding Binary Node Labels from Censored Edge Measurements: Phase Transition and Efficient Recovery.
IEEE Trans. Netw. Sci. Eng., 2014
IEEE Trans. Inf. Theory, 2014
Random Struct. Algorithms, 2014
Linear inverse problems on Erdős-Rényi graphs: Information-theoretic limits and efficient recovery.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014
Polynomial complexity of polar codes for non-binary alphabets, key agreement and Slepian-Wolf coding.
Proceedings of the 48th Annual Conference on Information Sciences and Systems, 2014
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014
2013
IEEE Trans. Inf. Theory, 2013
CoRR, 2013
Polarization of the Rényi information dimension for single and multi terminal analog compression.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013
Proceedings of the 51st Annual Allerton Conference on Communication, 2013
2012
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
2011
Proceedings of the Information Theory and Applications Workshop, 2011
Proceedings of the 8th International Symposium on Wireless Communication Systems, 2011
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
2010
Proceedings of the 2010 IEEE Information Theory Workshop, 2010
Proceedings of the 2010 IEEE Information Theory Workshop, 2010
Proceedings of the Information Theory and Applications Workshop, 2010
2009
Proceedings of the IEEE International Symposium on Information Theory, 2009
2008
Linear Universal Decoding for Compound Channels: a Local to Global Geometric Approach
CoRR, 2008
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008