World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
55
Citations
14164
World Ranking
4261
National Ranking
96

Overview

Lenka Zdeborová is affiliated with the École Polytechnique Fédérale de Lausanne in Switzerland. Their research focuses on the intersection of computer science and physics, with substantial contributions to artificial intelligence, statistics, and nonlinear physics.

Their body of work spans several key subfields, including:

  • Artificial Intelligence
  • Statistics and Probability
  • Statistical and Nonlinear Physics
  • Computational Mechanics
  • Signal Processing

Zdeborová's research topics cover a range of theoretical and applied areas, notably:

  • Neural Networks and Applications
  • Gaussian Processes and Bayesian Inference
  • Sparse and Compressive Sensing Techniques
  • Statistical Methods and Inference
  • Theoretical and Computational Physics
  • Blind Source Separation Techniques
  • Stochastic Gradient Optimization Techniques

The scientist has published extensively in prominent venues, including:

  • arXiv (Cornell University)
  • Journal of Statistical Mechanics Theory and Experiment
  • Physical Review E
  • Machine Learning Science and Technology
  • Journal of Physics A Mathematical and Theoretical

Among the recent publications under Zdeborová's name are:

  • Understanding deep learning is also a job for physicists, 2020, Nature Physics
  • Generalisation error in learning with random features and the hidden manifold model*, 2021, Journal of Statistical Mechanics Theory and Experiment
  • Learning curves of generic features maps for realistic datasets with a teacher-student model*, 2022, Journal of Statistical Mechanics Theory and Experiment
  • The Gaussian equivalence of generative models for learning with shallow neural networks, 2020, arXiv (Cornell University)
  • Generalisation error in learning with random features and the hidden manifold model, 2020, arXiv (Cornell University)

Zdeborová frequently collaborates with researchers including:

  • Florent Krza̧kała
  • Bruno Loureiro
  • Hugo Cui
  • Emanuele Troiani
  • Freya Behrens

Best Publications

  • Machine learning and the physical sciences

    Giuseppe Carleo;J. Ignacio Cirac;Kyle Cranmer;Laurent Daudet

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

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

  • Spectral redemption in clustering sparse networks

    Florent Krzakala;Cristopher Moore;Elchanan Mossel;Joseph Neeman

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

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

  • Statistical physics of inference: thresholds and algorithms

    Lenka Zdeborová;Florent Krzakala

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

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

  • Inferring the origin of an epidemic with a dynamic message-passing algorithm.

    Andrey Y. Lokhov;Marc Mézard;Hiroki Ohta;Lenka Zdeborová

  • Statistical-Physics-Based Reconstruction in Compressed Sensing

    Florent Krzakala;Marc Mézard;François Sausset;Yifan Sun;Yifan Sun

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

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

  • Percolation on Sparse Networks

    Brian Karrer;Mark E. J. Newman;Lenka Zdeborová

  • Phase transitions in the coloring of random graphs

    Lenka Zdeborová;Florent Krzakala

  • Network dismantling

    Alfredo Braunstein;Alfredo Braunstein;Luca Dall’Asta;Luca Dall’Asta;Guilhem Semerjian;Lenka Zdeborová

  • Optimal errors and phase transitions in high-dimensional generalized linear models

    Jean Barbier;Florent Krzakala;Nicolas Macris;Léo Miolane

  • Fast and simple decycling and dismantling of networks.

    Lenka Zdeborová;Pan Zhang;Hai-Jun Zhou

  • Mutual information for symmetric rank-one matrix estimation: A proof of the replica formula

    jean barbier;Mohamad Dia;Nicolas Macris;Florent Krzakala

  • The number of matchings in random graphs

    Lenka Zdeborová;Marc Mézard

  • Adaptive damping and mean removal for the generalized approximate message passing algorithm

    Jeremy Vila;Philip Schniter;Sundeep Rangan;Florent Krzakala

  • Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications

    Thibault Lesieur;Florent Krzakala;Florent Krzakala;Lenka Zdeborová

  • Entropy and mutual information in models of deep neural networks

    Marylou Gabrié;Andre Manoel;Clément Luneau;Jean Barbier

  • Hiding Quiet Solutions in Random Constraint Satisfaction Problems

    Florent Krzakala;Florent Krzakala;Lenka Zdeborová

  • Spectral Clustering of graphs with the Bethe Hessian

    Alaa Saade;Florent Krzakala;Lenka Zdeborova

  • Modelling the influence of data structure on learning in neural networks: the hidden manifold model

    Sebastian Goldt;Marc Mézard;Florent Krzakala;Lenka Zdeborová

Frequent Co-Authors

Florent Krzakala
Florent Krzakala École Polytechnique Fédérale de Lausanne
Marc Lelarge
Marc Lelarge École Normale Supérieure
Cristopher Moore
Cristopher Moore Santa Fe Institute
Yue M. Lu
Yue M. Lu Beijing University of Posts and Telecommunications
Michael I. Jordan
Michael I. Jordan University of California, Berkeley
Michael Chertkov
Michael Chertkov University of Arizona
Peter J. Mucha
Peter J. Mucha Dartmouth College
Andrea Crisanti
Andrea Crisanti University of Padua
Philip Schniter
Philip Schniter The Ohio State University
Henry D. Pfister
Henry D. Pfister Duke University

External Links

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

Report an issue

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:

Related Online Degrees & Career Pathways

Exploring online pathways in Computer Science opens up a broad range of degree options fit for different career goals and needs. Students looking for a quicker start may consider the fastest associates degree programs, which allow entry into the workforce or a head start toward a bachelor's degree in less time.

For those interested in educational leadership roles or teaching future computer science professionals, pursuing an ed.d educational leadership degree online can lead to advanced positions in academia or administration.

Choosing the right college is crucial, especially with so many remote learning options available. Looking into the best online colleges can help you find accredited programs that match your learning style and budget.

Individuals passionate about gaming may find that game design degrees offer specialized, creative opportunities within the technology sector, including development, animation, and project management roles.

Best Scientists Citing Lenka Zdeborová

Trending Scientists

Recently Published Articles