- Home
- Best Scientists - Computer Science
- Florent Krzakala

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
46
Citations
8,351
200
World Ranking
4413
National Ranking
103

- Quantum mechanics
- Algorithm
- Statistics

His main research concerns Algorithm, Statistical physics, Message passing, Belief propagation and Quantum annealing. Florent Krzakala specializes in Algorithm, namely Compressed sensing. His research in Statistical physics intersects with topics in Simulated annealing, Generalization, Energy landscape and Adiabatic process.

His Message passing research is multidisciplinary, incorporating elements of Matrix decomposition, Low-rank approximation and Matrix. His studies examine the connections between Matrix and genetics, as well as such issues in Applied mathematics, with regards to Computational complexity theory and Random graph. His Belief propagation research is multidisciplinary, incorporating perspectives in Discrete mathematics, Stochastic block model and Cavity method.

- Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications. (584 citations)
- Spectral redemption in clustering sparse networks (488 citations)
- Gibbs states and the set of solutions of random constraint satisfaction problems (397 citations)

His main research concerns Algorithm, Message passing, Statistical physics, Compressed sensing and Spin glass. His Algorithm research is mostly focused on the topic Belief propagation. Florent Krzakala usually deals with Message passing and limits it to topics linked to Superposition principle and Hadamard transform.

His work on Cavity method as part of general Statistical physics study is frequently connected to Amorphous solid, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them. His Compressed sensing study combines topics in areas such as MNIST database, Prior probability and Robustness. His Spin glass research incorporates themes from Symmetry breaking and Bethe lattice.

- Algorithm (41.25%)
- Message passing (25.00%)
- Statistical physics (20.31%)

- Artificial neural network (12.50%)
- Algorithm (41.25%)
- Matrix (16.56%)

Florent Krzakala mostly deals with Artificial neural network, Algorithm, Matrix, Limit and Gaussian. His Artificial neural network study combines topics in areas such as Training set and Data set. Florent Krzakala studies Compressed sensing, a branch of Algorithm.

Florent Krzakala interconnects Spurious relationship, Random matrix and Maxima and minima in the investigation of issues within Matrix. Florent Krzakala combines subjects such as Statistical theory and Generalization with his study of Limit. Florent Krzakala has researched Gaussian in several fields, including Manifold, Linear regression, Applied mathematics and Interpolation.

- Optimal errors and phase transitions in high-dimensional generalized linear models (97 citations)
- Modelling the influence of data structure on learning in neural networks: the hidden manifold model (30 citations)
- Generalisation error in learning with random features and the hidden manifold model (25 citations)

- Quantum mechanics
- Statistics
- Algorithm

His primary scientific interests are in Artificial neural network, Algorithm, Gaussian, Artificial intelligence and Limit. His studies in Algorithm integrate themes in fields like Matrix, Statistical inference and Prior probability. His Statistical inference research is multidisciplinary, relying on both Random matrix, Message passing and Inference.

His research integrates issues of Linear regression, Mutual information, Interpolation, Manifold and Applied mathematics in his study of Gaussian. Florent Krzakala has included themes like Perceptron and Invariant in his Limit study. His work on Cavity method as part of his general Statistical physics study is frequently connected to Contiguity, thereby bridging the divide between different branches of science.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications.

Aurelien Decelle;Florent Krzakala;Cristopher Moore;Lenka Zdeborová.

Physical Review E **(2011)**

775 Citations

Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications.

Aurelien Decelle;Florent Krzakala;Cristopher Moore;Lenka Zdeborová.

Physical Review E **(2011)**

775 Citations

Spectral redemption in clustering sparse networks

Florent Krzakala;Cristopher Moore;Elchanan Mossel;Joseph Neeman.

Proceedings of the National Academy of Sciences of the United States of America **(2013)**

614 Citations

Spectral redemption in clustering sparse networks

Florent Krzakala;Cristopher Moore;Elchanan Mossel;Joseph Neeman.

Proceedings of the National Academy of Sciences of the United States of America **(2013)**

614 Citations

Gibbs states and the set of solutions of random constraint satisfaction problems

Florent Krzakała;Andrea Montanari;Federico Ricci-Tersenghi;Guilhem Semerjian.

Proceedings of the National Academy of Sciences of the United States of America **(2007)**

494 Citations

Gibbs states and the set of solutions of random constraint satisfaction problems

Florent Krzakała;Andrea Montanari;Federico Ricci-Tersenghi;Guilhem Semerjian.

Proceedings of the National Academy of Sciences of the United States of America **(2007)**

494 Citations

Inference and phase transitions in the detection of modules in sparse networks.

Aurelien Decelle;Florent Krzakala;Cristopher Moore;Lenka Zdeborová.

Physical Review Letters **(2011)**

368 Citations

Inference and phase transitions in the detection of modules in sparse networks.

Aurelien Decelle;Florent Krzakala;Cristopher Moore;Lenka Zdeborová.

Physical Review Letters **(2011)**

368 Citations

Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices

Florent Krzakala;Marc Mézard;Francois Sausset;Yifan Sun;Yifan Sun.

Journal of Statistical Mechanics: Theory and Experiment **(2012)**

286 Citations

Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices

Florent Krzakala;Marc Mézard;Francois Sausset;Yifan Sun;Yifan Sun.

Journal of Statistical Mechanics: Theory and Experiment **(2012)**

286 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

École Polytechnique Fédérale de Lausanne

University of California, Berkeley

École Normale Supérieure

Beijing University of Posts and Telecommunications

Santa Fe Institute

Sapienza University of Rome

Bocconi University

Los Alamos National Laboratory

University of Padua

New York University

French Institute for Research in Computer Science and Automation - INRIA

Publications: 20

Aalto University

University of Pennsylvania

Panoramic Digital Health

Yazd University

Grenoble Alpes University

Chinese Academy of Sciences

University of Southern California

University of Alabama at Birmingham

Uppsala University

University of Nevada, Las Vegas

St Thomas' Hospital

University College London

Carnegie Mellon University

University College London

National Institute for Astrophysics

University of Edinburgh

Something went wrong. Please try again later.