default search action
Emmanuel Abbe
Person information
- affiliation: EPFL, Switzerland
- affiliation (former): Princeton University, USA
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c61]Enric Boix-Adserà, Omid Saremi, Emmanuel Abbe, Samy Bengio, Etai Littwin, Joshua M. Susskind:
When can transformers reason with abstract symbols? ICLR 2024 - [c60]Denys Pushkin, Raphaël Berthier, Emmanuel Abbe:
On the Minimal Degree Bias in Generalization on the Unseen for non-Boolean Functions. ICML 2024 - [c59]Xiaowu Sun, Theofilos Belmpas, Ortal Yona Senouf, Emmanuel Abbe, Pascal Frossard, Bernard De Bruyne, Olivier Muller, Stéphane Fournier, Thabo Mahendiran, Dorina Thanou:
Graph Neural Network based Future Clinical Events Prediction from Invasive Coronary Angiography. ISBI 2024: 1-5 - [i74]Denys Pushkin, Raphaël Berthier, Emmanuel Abbe:
On the Minimal Degree Bias in Generalization on the Unseen for non-Boolean Functions. CoRR abs/2406.06354 (2024) - [i73]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) - [i72]Aryo Lotfi, Enrico Fini, Samy Bengio, Moin Nabi, Emmanuel Abbe:
Visual Scratchpads: Enabling Global Reasoning in Vision. CoRR abs/2410.08165 (2024) - [i71]Omar Montasser, Han Shao, Emmanuel Abbe:
Transformation-Invariant Learning and Theoretical Guarantees for OOD Generalization. CoRR abs/2410.23461 (2024) - 2023
- [j30]Emmanuel Abbe, Ori Sberlo, Amir Shpilka, Min Ye:
Reed-Muller Codes. Found. Trends Commun. Inf. Theory 20(1-2): 1-156 (2023) - [c58]Riccardo Tenderini, Federico Betti, Ortal Yona Senouf, Olivier Muller, Simone Deparis, Annalisa Buffa, Emmanuel Abbe:
Can Knowledge Transfer Techniques Compensate for the Limited Myocardial Infarction Data by Leveraging Hæmodynamics? An in silico Study. AIME 2023: 218-228 - [c57]Emmanuel Abbe, Enric Boix Adserà, Theodor Misiakiewicz:
SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics. COLT 2023: 2552-2623 - [c56]Emmanuel Abbe, Colin Sandon:
A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels. FOCS 2023: 177-193 - [c55]Emmanuel Abbe, Samy Bengio, Aryo Lotfi, Kevin Rizk:
Generalization on the Unseen, Logic Reasoning and Degree Curriculum. ICML 2023: 31-60 - [c54]Emmanuel Abbe, Samy Bengio, Enric Boix-Adserà, Etai Littwin, Joshua M. Susskind:
Transformers learn through gradual rank increase. NeurIPS 2023 - [c53]Emmanuel Abbe, Elisabetta Cornacchia, Aryo Lotfi:
Provable Advantage of Curriculum Learning on Parity Targets with Mixed Inputs. NeurIPS 2023 - [i70]Emmanuel Abbe, Samy Bengio, Aryo Lotfi, Kevin Rizk:
Generalization on the Unseen, Logic Reasoning and Degree Curriculum. CoRR abs/2301.13105 (2023) - [i69]Emmanuel Abbe, Enric Boix-Adserà, Theodor Misiakiewicz:
SGD learning on neural networks: leap complexity and saddle-to-saddle dynamics. CoRR abs/2302.11055 (2023) - [i68]Emmanuel Abbe, Colin Sandon:
A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels. CoRR abs/2304.02509 (2023) - [i67]Enric Boix-Adserà, Etai Littwin, Emmanuel Abbe, Samy Bengio, Joshua M. Susskind:
Transformers learn through gradual rank increase. CoRR abs/2306.07042 (2023) - [i66]Emmanuel Abbe, Elisabetta Cornacchia, Aryo Lotfi:
Provable Advantage of Curriculum Learning on Parity Targets with Mixed Inputs. CoRR abs/2306.16921 (2023) - [i65]Stéphane d'Ascoli, Samy Bengio, Josh M. Susskind, Emmanuel Abbe:
Boolformer: Symbolic Regression of Logic Functions with Transformers. CoRR abs/2309.12207 (2023) - [i64]Enric Boix-Adserà, Omid Saremi, Emmanuel Abbe, Samy Bengio, Etai Littwin, Joshua M. Susskind:
When can transformers reason with abstract symbols? CoRR abs/2310.09753 (2023) - [i63]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
- [c52]Emmanuel Abbe, Enric Boix Adserà, Theodor Misiakiewicz:
The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networks. COLT 2022: 4782-4887 - [c51]Emmanuel Abbe, Elisabetta Cornacchia, Jan Hazla, Christopher Marquis:
An Initial Alignment between Neural Network and Target is Needed for Gradient Descent to Learn. ICML 2022: 33-52 - [c50]Emmanuel Abbe, Enric Boix-Adserà:
On the non-universality of deep learning: quantifying the cost of symmetry. NeurIPS 2022 - [c49]Emmanuel Abbe, Samy Bengio, Elisabetta Cornacchia, Jon M. Kleinberg, Aryo Lotfi, Maithra Raghu, Chiyuan Zhang:
Learning to Reason with Neural Networks: Generalization, Unseen Data and Boolean Measures. NeurIPS 2022 - [c48]Emmanuel Abbe, Shuangping Li, Allan Sly:
Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster. STOC 2022: 860-873 - [i62]Emmanuel Abbe, Enric Boix-Adserà, Theodor Misiakiewicz:
The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networks. CoRR abs/2202.08658 (2022) - [i61]Emmanuel Abbe, Elisabetta Cornacchia, Jan Hazla, Christopher Marquis:
An initial alignment between neural network and target is needed for gradient descent to learn. CoRR abs/2202.12846 (2022) - [i60]Emmanuel Abbe, Samy Bengio, Elisabetta Cornacchia, Jon M. Kleinberg, Aryo Lotfi, Maithra Raghu, Chiyuan Zhang:
Learning to Reason with Neural Networks: Generalization, Unseen Data and Boolean Measures. CoRR abs/2205.13647 (2022) - [i59]Emmanuel Abbe, Enric Boix-Adserà:
On the non-universality of deep learning: quantifying the cost of symmetry. CoRR abs/2208.03113 (2022) - 2021
- [j29]Emmanuel Abbe, Amir Shpilka, Min Ye:
Reed-Muller Codes: Theory and Algorithms. IEEE Trans. Inf. Theory 67(6): 3251-3277 (2021) - [j28]Emmanuel Abbe, Jan Hazla, Ido Nachum:
Almost-Reed-Muller Codes Achieve Constant Rates for Random Errors. IEEE Trans. Inf. Theory 67(12): 8034-8050 (2021) - [c47]Emmanuel Abbe, Elisabetta Cornacchia, Yuzhou Gu, Yury Polyanskiy:
Stochastic block model entropy and broadcasting on trees with survey. COLT 2021: 1-25 - [c46]Emmanuel Abbe, Shuangping Li, Allan Sly:
Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric Perceptron. FOCS 2021: 327-338 - [c45]Eran Malach, Pritish Kamath, Emmanuel Abbe, Nathan Srebro:
Quantifying the Benefit of Using Differentiable Learning over Tangent Kernels. ICML 2021: 7379-7389 - [c44]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 - [c43]Emmanuel Abbe, Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler, Dheeraj Nagaraj:
The staircase property: How hierarchical structure can guide deep learning. NeurIPS 2021: 26989-27002 - [i58]Emmanuel Abbe, Elisabetta Cornacchia, Yuzhou Gu, Yury Polyanskiy:
Stochastic block model entropy and broadcasting on trees with survey. CoRR abs/2101.12601 (2021) - [i57]Eran Malach, Pritish Kamath, Emmanuel Abbe, Nathan Srebro:
Quantifying the Benefit of Using Differentiable Learning over Tangent Kernels. CoRR abs/2103.01210 (2021) - [i56]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) - [i55]Emmanuel Abbe, Enric Boix-Adserà, Matthew S. Brennan, Guy Bresler, Dheeraj Nagaraj:
The staircase property: How hierarchical structure can guide deep learning. CoRR abs/2108.10573 (2021) - 2020
- [j27]Emmanuel Abbe, Sanjeev R. Kulkarni, Eun Jee Lee:
Generalized Nonbacktracking Bounds on the Influence. J. Mach. Learn. Res. 21: 31:1-31:36 (2020) - [j26]Amir-Reza Asadi, Emmanuel Abbe:
Chaining Meets Chain Rule: Multilevel Entropic Regularization and Training of Neural Networks. J. Mach. Learn. Res. 21: 139:1-139:32 (2020) - [j25]Emmanuel Abbe, Enric Boix-Adserà, Peter Ralli, Colin Sandon:
Graph Powering and Spectral Robustness. SIAM J. Math. Data Sci. 2(1): 132-157 (2020) - [j24]Min Ye, Emmanuel Abbe:
Recursive Projection-Aggregation Decoding of Reed-Muller Codes. IEEE Trans. Inf. Theory 66(8): 4948-4965 (2020) - [j23]Emmanuel Abbe, Min Ye:
Reed-Muller Codes Polarize. IEEE Trans. Inf. Theory 66(12): 7311-7332 (2020) - [c42]Elisabetta Cornacchia, Neta Singer, Emmanuel Abbe:
Polarization in Attraction-Repulsion Models. ISIT 2020: 2765-2770 - [c41]Emmanuel Abbe, Colin Sandon:
On the universality of deep learning. NeurIPS 2020 - [i54]Emmanuel Abbe, Colin Sandon:
Poly-time universality and limitations of deep learning. CoRR abs/2001.02992 (2020) - [i53]Emmanuel Abbe, Amir Shpilka, Min Ye:
Reed-Muller Codes: Theory and Algorithms. CoRR abs/2002.03317 (2020) - [i52]Emmanuel Abbe, Jan Hazla, Ido Nachum:
Almost-Reed-Muller Codes Achieve Constant Rates for Random Errors. CoRR abs/2004.09590 (2020) - [i51]Elisabetta Cornacchia, Neta Singer, Emmanuel Abbe:
Polarization in Attraction-Repulsion Models. CoRR abs/2006.05251 (2020) - [i50]Emmanuel Abbe, Shuangping Li, Allan Sly:
Learning Sparse Graphons and the Generalized Kesten-Stigum Threshold. CoRR abs/2006.07695 (2020) - [i49]Emmanuel Abbe, Peter Ralli:
An Alon-Boppana theorem for powered graphs and generalized Ramanujan graphs. CoRR abs/2006.11248 (2020) - [i48]Emmanuel Abbe, Jianqing Fan, Kaizheng Wang:
An 𝓁p theory of PCA and spectral clustering. CoRR abs/2006.14062 (2020) - [i47]Amir-Reza Asadi, Emmanuel Abbe:
Maximum Multiscale Entropy and Neural Network Regularization. CoRR abs/2006.14614 (2020)
2010 – 2019
- 2019
- [j22]Emmanuel Abbe, Sophie Spirkl:
Entropic Matroids and Their Representation. Entropy 21(10): 948 (2019) - [j21]Emmanuel Abbe, Tamir Bendory, William E. Leeb, João M. Pereira, Nir Sharon, Amit Singer:
Multireference Alignment Is Easier With an Aperiodic Translation Distribution. IEEE Trans. Inf. Theory 65(6): 3565-3584 (2019) - [c40]Emmanuel Abbe, Min Ye:
Reed-Muller Codes Polarize. FOCS 2019: 273-286 - [c39]Emmanuel Abbe, Enric Boix Adserà:
Subadditivity Beyond Trees and the Chi-Squared Mutual Information. ISIT 2019: 697-701 - [c38]Min Ye, Emmanuel Abbe:
Recursive projection-aggregation decoding of Reed-Muller codes. ISIT 2019: 2064-2068 - [i46]Emmanuel Abbe, Min Ye:
Reed-Muller codes polarize. CoRR abs/1901.11533 (2019) - [i45]Min Ye, Emmanuel Abbe:
Recursive projection-aggregation decoding of Reed-Muller codes. CoRR abs/1902.01470 (2019) - [i44]Emmanuel Abbe, Enric Boix:
Subadditivity Beyond Trees and the Chi-Squared Mutual Information. CoRR abs/1902.02431 (2019) - [i43]Amir-Reza Asadi, Emmanuel Abbe:
Chaining Meets Chain Rule: Multilevel Entropic Regularization and Training of Neural Nets. CoRR abs/1906.11148 (2019) - [i42]Emmanuel Abbe, Sophie Spirkl:
Entropic matroids and their representation. CoRR abs/1909.12175 (2019) - 2018
- [j20]Emmanuel Abbe:
Community Detection and Stochastic Block Models. Found. Trends Commun. Inf. Theory 14(1-2): 1-162 (2018) - [c37]Min Ye, Emmanuel Abbe:
Communication-Computation Efficient Gradient Coding. ICML 2018: 5606-5615 - [c36]Emmanuel Abbe, João M. Pereira, Amit Singer:
Estimation in the Group Action Channel. ISIT 2018: 561-565 - [c35]Amir-Reza Asadi, Emmanuel Abbe, Sergio Verdú:
Chaining Mutual Information and Tightening Generalization Bounds. NeurIPS 2018: 7245-7254 - [i41]Emmanuel Abbe, João M. Pereira, Amit Singer:
Estimation in the group action channel. CoRR abs/1801.04366 (2018) - [i40]Min Ye, Emmanuel Abbe:
Communication-Computation Efficient Gradient Coding. CoRR abs/1802.03475 (2018) - [i39]Emmanuel Abbe, Enric Boix:
An Information-Percolation Bound for Spin Synchronization on General Graphs. CoRR abs/1806.03227 (2018) - [i38]Amir-Reza Asadi, Emmanuel Abbe, Sergio Verdú:
Chaining Mutual Information and Tightening Generalization Bounds. CoRR abs/1806.03803 (2018) - [i37]Emmanuel Abbe, Enric Boix, Peter Ralli, Colin Sandon:
Graph powering and spectral robustness. CoRR abs/1809.04818 (2018) - [i36]Emmanuel Abbe, Colin Sandon:
Provable limitations of deep learning. CoRR abs/1812.06369 (2018) - 2017
- [j19]Emmanuel Abbe, Jiange Li, Mokshay M. Madiman:
Entropies of Weighted Sums in Cyclic Groups and an Application to Polar Codes. Entropy 19(9): 235 (2017) - [j18]Emmanuel Abbe:
Community Detection and Stochastic Block Models: Recent Developments. J. Mach. Learn. Res. 18: 177:1-177:86 (2017) - [j17]Emmanuel Abbe:
Learning from graphical data. SIGMETRICS Perform. Evaluation Rev. 45(3): 96 (2017) - [j16]Saeid Haghighatshoar, Emmanuel Abbe:
Polarization of the Rényi Information Dimension With Applications to Compressed Sensing. IEEE Trans. Inf. Theory 63(11): 6858-6868 (2017) - [c34]Emmanuel Abbe, João M. Pereira, Amit Singer:
Sample complexity of the boolean multireference alignment problem. ISIT 2017: 1316-1320 - [c33]Amir-Reza Asadi, Emmanuel Abbe, Sergio Verdú:
Compressing data on graphs with clusters. ISIT 2017: 1583-1587 - [c32]Emmanuel Abbe, Sanjeev R. Kulkarni, Eun Jee Lee:
Nonbacktracking Bounds on the Influence in Independent Cascade Models. NIPS 2017: 1407-1416 - [i35]Emmanuel Abbe, João M. Pereira, Amit Singer:
Sample Complexity of the Boolean Multireference Alignment Problem. CoRR abs/1701.07540 (2017) - [i34]Emmanuel Abbe:
Community detection and stochastic block models: recent developments. CoRR abs/1703.10146 (2017) - [i33]Emmanuel Abbe, Sanjeev R. Kulkarni, Eun Jee Lee:
Nonbacktracking Bounds on the Influence in Independent Cascade Models. CoRR abs/1706.05295 (2017) - [i32]Emmanuel Abbe, Laurent Massoulié, Andrea Montanari, Allan Sly, Nikhil Srivastava:
Group Synchronization on Grids. CoRR abs/1706.08561 (2017) - [i31]Emmanuel Abbe, Tamir Bendory, William E. Leeb, João Pereira, Nir Sharon, Amit Singer:
Multireference Alignment is Easier with an Aperiodic Translation Distribution. CoRR abs/1710.02793 (2017) - 2016
- [j15]Emmanuel Abbe, Afonso S. Bandeira, Georgina Hall:
Exact Recovery in the Stochastic Block Model. IEEE Trans. Inf. Theory 62(1): 471-487 (2016) - [j14]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) - [c31]Emmanuel Abbe:
Graph compression: The effect of clusters. Allerton 2016: 1-8 - [c30]Irineo Cabreros, Emmanuel Abbe, Aristotelis Tsirigos:
Detecting community structures in Hi-C genomic data. CISS 2016: 584-589 - [c29]Eun Jee Lee, Sudeep Kamath, Emmanuel Abbe, Sanjeev R. Kulkarni:
Spectral bounds for independent cascade model with sensitive edges. CISS 2016: 649-653 - [c28]Yash Deshpande, Emmanuel Abbe, Andrea Montanari:
Asymptotic mutual information for the binary stochastic block model. ISIT 2016: 185-189 - [c27]Emmanuel Abbe, Colin Sandon:
Crossing the KS threshold in the stochastic block model with information theory. ISIT 2016: 840-844 - [c26]Emmanuel Abbe, Colin Sandon:
Achieving the KS threshold in the general stochastic block model with linearized acyclic belief propagation. NIPS 2016: 1334-1342 - 2015
- [j13]Sen Tao, Emmanuel Abbe, Naveen Verma:
Statistical ADC Enhanced by Pipelining and Subranging. IEEE Trans. Circuits Syst. II Express Briefs 62-II(6): 538-542 (2015) - [j12]Naveen Goela, Emmanuel Abbe, Michael Gastpar:
Polar Codes for Broadcast Channels. IEEE Trans. Inf. Theory 61(2): 758-782 (2015) - [j11]Emmanuel Abbe:
Randomness and Dependencies Extraction via Polarization, With Applications to Slepian-Wolf Coding and Secrecy. IEEE Trans. Inf. Theory 61(5): 2388-2398 (2015) - [j10]Emmanuel Abbe, Amir Shpilka, Avi Wigderson:
Reed-Muller Codes for Random Erasures and Errors. IEEE Trans. Inf. Theory 61(10): 5229-5252 (2015) - [j9]Remi A. Chou, Matthieu R. Bloch, Emmanuel Abbe:
Polar Coding for Secret-Key Generation. IEEE Trans. Inf. Theory 61(11): 6213-6237 (2015) - [j8]Emmanuel Abbe, Andrea Montanari:
Conditional Random Fields, Planted Constraint Satisfaction, and Entropy Concentration. Theory Comput. 11: 413-443 (2015) - [c25]Emmanuel Abbe, Colin Sandon:
Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery. FOCS 2015: 670-688 - [c24]Emmanuel Abbe, Yuval Wigderson:
High-Girth matrices and polarization. ISIT 2015: 2461-2465 - [c23]Emmanuel Abbe, Colin Sandon:
Recovering Communities in the General Stochastic Block Model Without Knowing the Parameters. NIPS 2015: 676-684 - [c22]Emmanuel Abbe, Amir Shpilka, Avi Wigderson:
Reed-Muller Codes for Random Erasures and Errors. STOC 2015: 297-306 - [i30]Emmanuel Abbe, Yuval Wigderson:
High-Girth Matrices and Polarization. CoRR abs/1501.06528 (2015) - [i29]Emmanuel Abbe, Colin Sandon:
Community detection in general stochastic block models: fundamental limits and efficient recovery algorithms. CoRR abs/1503.00609 (2015) - [i28]Emmanuel Abbe, Katherine Edwards:
Concentration of the number of solutions of random planted CSPs and Goldreich's one-way candidates. CoRR abs/1504.08316 (2015) - [i27]Emmanuel Abbe, Colin Sandon:
Recovering communities in the general stochastic block model without knowing the parameters. CoRR abs/1506.03729 (2015) - [i26]Yash Deshpande, Emmanuel Abbe, Andrea Montanari:
Asymptotic Mutual Information for the Two-Groups Stochastic Block Model. CoRR abs/1507.08685 (2015) - [i25]Irineo Cabreros, Emmanuel Abbe, Aristotelis Tsirigos:
Detecting Community Structures in Hi-C Genomic Data. CoRR abs/1509.05121 (2015) - [i24]Emmanuel Abbe, Jiange Li, Mokshay M. Madiman:
Entropies of weighted sums in cyclic groups and applications to polar codes. CoRR abs/1512.00135 (2015) - [i23]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) - 2014
- [j7]Emmanuel Abbe, Andrea Montanari:
On the concentration of the number of solutions of random satisfiability formulas. Random Struct. Algorithms 45(3): 362-382 (2014) - [j6]Saeid Haghighatshoar, Emmanuel Abbe, I. Emre Telatar:
A New Entropy Power Inequality for Integer-Valued Random Variables. IEEE Trans. Inf. Theory 60(7): 3787-3796 (2014) - [j5]Emmanuel Abbe, Afonso S. Bandeira, Annina Bracher, Amit Singer:
Decoding Binary Node Labels from Censored Edge Measurements: Phase Transition and Efficient Recovery. IEEE Trans. Netw. Sci. Eng. 1(1): 10-22 (2014) - [c21]Eun Jee Lee, Emmanuel Abbe:
Two shannon-type problems on secure multi-party computations. Allerton 2014: 1287-1293 - [c20]Jingbo Liu, Emmanuel Abbe:
Polynomial complexity of polar codes for non-binary alphabets, key agreement and Slepian-Wolf coding. CISS 2014: 1-6 - [c19]Emmanuel Abbe, Noga Alon, Afonso S. Bandeira:
Linear Boolean classification, coding and "the critical problem". ISIT 2014: 1231-1235 - [c18]Emmanuel Abbe, Afonso S. Bandeira, Annina Bracher, Amit Singer:
Linear inverse problems on Erdős-Rényi graphs: Information-theoretic limits and efficient recovery. ISIT 2014: 1251-1255 - [i22]Emmanuel Abbe, Noga Alon, Afonso S. Bandeira:
Linear Boolean classification, coding and "the critical problem". CoRR abs/1401.6528 (2014) - [i21]Eun Jee Lee, Emmanuel Abbe:
A Shannon Approach to Secure Multi-party Computations. CoRR abs/1401.7360 (2014) - [i20]Emmanuel Abbe, Afonso S. Bandeira, Annina Bracher, Amit Singer:
Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery. CoRR abs/1404.4749 (2014) - [i19]Jingbo Liu, Emmanuel Abbe:
Polynomial complexity of polar codes for non-binary alphabets, key agreement and Slepian-Wolf coding. CoRR abs/1405.0776 (2014) - [i18]Emmanuel Abbe, Afonso S. Bandeira, Georgina Hall:
Exact Recovery in the Stochastic Block Model. CoRR abs/1405.3267 (2014) - [i17]Emmanuel Abbe, Amir Shpilka, Avi Wigderson:
Reed-Muller codes for random erasures and errors. CoRR abs/1411.4590 (2014) - 2013
- [j4]Emmanuel Abbe, Shao-Lun Huang, Emre Telatar:
Proof of the Outage Probability Conjecture for MISO Channels. IEEE Trans. Inf. Theory 59(5): 2596-2602 (2013) - [c17]Emmanuel Abbe, Andrea Montanari:
The mutual information of a class of graphical channels. Allerton 2013: 20-25 - [c16]Emmanuel Abbe, Andrea Montanari:
Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration. APPROX-RANDOM 2013: 332-346 - [c15]Saeid Haghighatshoar, Emmanuel Abbe, Emre Telatar:
A new entropy power inequality for integer-valued random variables. ISIT 2013: 589-593 - [c14]Saeid Haghighatshoar, Emmanuel Abbe:
Polarization of the Rényi information dimension for single and multi terminal analog compression. ISIT 2013: 779-783 - [c13]Naveen Goela, Emmanuel Abbe, Michael Gastpar:
Polar codes for broadcast channels. ISIT 2013: 1127-1131 - [c12]Remi A. Chou, Matthieu R. Bloch, Emmanuel Abbe:
Polar coding for secret-key generation. ITW 2013: 1-5 - [i16]Saeid Haghighatshoar, Emmanuel Abbe, Emre Telatar:
A new entropy power inequality for integer-valued random variables. CoRR abs/1301.4185 (2013) - [i15]Naveen Goela, Emmanuel Abbe, Michael Gastpar:
Polar Codes For Broadcast Channels. CoRR abs/1301.6150 (2013) - [i14]Saeid Haghighatshoar, Emmanuel Abbe:
Polarization of the Rényi Information Dimension for Single and Multi Terminal Analog Compression. CoRR abs/1301.6388 (2013) - [i13]Emmanuel Abbe, Andrea Montanari:
Conditional Random Fields, Planted Satisfaction, and Entropy Concentration. CoRR abs/1305.4274 (2013) - [i12]Remi A. Chou, Matthieu R. Bloch, Emmanuel Abbe:
Polar Coding for Secret-Key Generation. CoRR abs/1305.4746 (2013) - 2012
- [j3]Emmanuel Abbe, Lizhong Zheng:
A Coordinate System for Gaussian Networks. IEEE Trans. Inf. Theory 58(2): 721-733 (2012) - [j2]Emmanuel Abbe, Emre Telatar:
Polar Codes for the m-User Multiple Access Channel. IEEE Trans. Inf. Theory 58(8): 5437-5448 (2012) - [c11]Saeid Haghighatshoar, Emmanuel Abbe, Emre Telatar:
Adaptive sensing using deterministic partial Hadamard matrices. ISIT 2012: 1842-1846 - [c10]Emmanuel Abbe, Shao-Lun Huang, Emre Telatar:
Proof of the outage probability conjecture for MISO channels. ITW 2012: 65-69 - [i11]Saeid Haghighatshoar, Emmanuel Abbe, Emre Telatar:
Adaptive sensing using deterministic partial Hadamard matrices. CoRR abs/1202.6555 (2012) - 2011
- [c9]Emmanuel Abbe:
Polarization and randomness extraction. ISIT 2011: 184-188 - [c8]Emmanuel Abbe, Andrew R. Barron:
Polar coding schemes for the AWGN channel. ISIT 2011: 194-198 - [c7]Emmanuel Abbe:
Polar coding in networks: Known results and new directions. ISWCS 2011: 577-578 - [c6]Emmanuel Abbe:
Randomness and dependencies extraction via polarization. ITA 2011: 8-14 - [i10]Emmanuel Abbe:
Extracting randomness and dependencies via a matrix polarization. CoRR abs/1102.1247 (2011) - [i9]Emmanuel Abbe, Shao-Lun Huang, Emre Telatar:
Proof of the outage probability conjecture for MISO channels. CoRR abs/1103.5478 (2011) - [i8]Emmanuel Abbe, Amir E. Khandani, Andrew W. Lo:
Privacy-Preserving Methods for Sharing Financial Risk Exposures. CoRR abs/1111.5228 (2011) - 2010
- [j1]Emmanuel Abbe, Lizhong Zheng:
Linear Universal Decoding for Compound Channels. IEEE Trans. Inf. Theory 56(12): 5999-6013 (2010) - [c5]Emmanuel Abbe, Emre Telatar:
MAC polar codes and matroids. ITA 2010: 8-15 - [c4]Emmanuel Abbe:
Universal source polarization and sparse recovery. ITW 2010: 1-5 - [c3]Emmanuel Abbe, Rethnakaran Pulikkoonattu:
Universal a posteriori metrics game. ITW 2010: 1-5 - [i7]Emmanuel Abbe, Emre Telatar:
Polar Codes for the m-User MAC and Matroids. CoRR abs/1002.0777 (2010) - [i6]Emmanuel Abbe, Lizhong Zheng:
A Coordinate System for Gaussian Networks. CoRR abs/1002.2271 (2010) - [i5]Emmanuel Abbe, Rethnakaran Pulikkoonattu:
Universal A Posteriori Metrics Game. CoRR abs/1004.4815 (2010) - [i4]Emmanuel Abbe, Andrea Montanari:
On the concentration of the number of solutions of random satisfiability formulas. CoRR abs/1006.3786 (2010) - [i3]Emmanuel Abbe:
Universal polar coding and sparse recovery. CoRR abs/1012.0367 (2010) - [i2]Emmanuel Abbe:
Mutual information, matroids and extremal dependencies. CoRR abs/1012.4755 (2010)
2000 – 2009
- 2009
- [c2]Emmanuel Abbe, Lizhong Zheng:
Coding along Hermite polynomials for Gaussian noise channels. ISIT 2009: 1644-1648 - 2008
- [b1]Emmanuel Abbe:
Local to global geometric methods in information theory. Massachusetts Institute of Technology, Cambridge, MA, USA, 2008 - [c1]Emmanuel Abbe, Lizhong Zheng:
Linear universal decoding for compound channels: an Euclidean Geometric Approach. ISIT 2008: 1098-1102 - [i1]Emmanuel Abbe, Lizhong Zheng:
Linear Universal Decoding for Compound Channels: a Local to Global Geometric Approach. CoRR abs/0809.5217 (2008)
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-11-30 00:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint