default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Mézard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i41]Giulio Biroli, Tony Bonnaire, Valentin De Bortoli, Marc Mézard:
Dynamical Regimes of Diffusion Models. CoRR abs/2402.18491 (2024)- [i40]Giulio Biroli, Marc Mézard:
Kernel Density Estimators in Large Dimensions. CoRR abs/2408.05807 (2024) - [i39]Jerome Garnier-Brun, Marc Mézard, Emanuele Moscato, Luca Saglietti:
How transformers learn structured data: insights from hierarchical filtering. CoRR abs/2408.15138 (2024) - 2023
- [i38]Carlo Lucibello, Marc Mézard:
The Exponential Capacity of Dense Associative Memories. CoRR abs/2304.14964 (2023) - [i37]Clarissa Lauditi, Emanuele Troiani, Marc Mézard:
Sparse Representations, Inference and Learning. CoRR abs/2306.16097 (2023) - [i36]Francesco Camilli, Marc Mézard:
The Decimation Scheme for Symmetric Matrix Factorization. CoRR abs/2307.16564 (2023) - [i35]Marco Benedetti, Louis Carillo, Enzo Marinari, Marc Mézard:
Eigenvector Dreaming. CoRR abs/2308.13445 (2023) - 2022
- [i34]Francesco Camilli, Marc Mézard:
Matrix factorization with neural networks. CoRR abs/2212.02105 (2022) - 2021
- [c9]Sebastian Goldt, Bruno Loureiro, Galen Reeves, Florent Krzakala
, Marc Mézard, Lenka Zdeborová:
The Gaussian equivalence of generative models for learning with shallow neural networks. MSML 2021: 426-471 - [c8]Bruno Loureiro, Cédric Gerbelot, Hugo Cui, Sebastian Goldt, Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Learning curves of generic features maps for realistic datasets with a teacher-student model. NeurIPS 2021: 18137-18151 - [i33]Bruno Loureiro, Cédric Gerbelot, Hugo Cui, Sebastian Goldt, Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Capturing the learning curves of generic features maps for realistic data sets with a teacher-student model. CoRR abs/2102.08127 (2021) - [i32]Antoine Maillard, Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Perturbative construction of mean-field equations in extensive-rank matrix factorization and denoising. CoRR abs/2110.08775 (2021) - 2020
- [c7]Federica Gerace, Bruno Loureiro, Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Generalisation error in learning with random features and the hidden manifold model. ICML 2020: 3452-3462 - [i31]Federica Gerace, Bruno Loureiro, Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Generalisation error in learning with random features and the hidden manifold model. CoRR abs/2002.09339 (2020) - [i30]Sebastian Goldt, Galen Reeves, Marc Mézard, Florent Krzakala, Lenka Zdeborová:
The Gaussian equivalence of generative models for learning with two-layer neural networks. CoRR abs/2006.14709 (2020) - [i29]Antoine Baker, Indaco Biazzo, Alfredo Braunstein, Giovanni Catania, Luca Dall'Asta, Alessandro Ingrosso, Florent Krzakala, Fabio Mazza, Marc Mézard, Anna Paola Muntoni, Maria Refinetti, Stefano Sarao Mannelli, Lenka Zdeborová:
Epidemic mitigation by statistical inference from contact tracing data. CoRR abs/2009.09422 (2020)
2010 – 2019
- 2019
- [i28]Antoine Maillard, Laura Foini, Alejandro Lage Castellanos, Florent Krzakala, Marc Mézard, Lenka Zdeborová:
High-temperature Expansions and Message Passing Algorithms. CoRR abs/1906.08479 (2019) - [i27]Sebastian Goldt, Marc Mézard, Florent Krzakala, Lenka Zdeborová:
Modelling the influence of data structure on learning in neural networks. CoRR abs/1909.11500 (2019) - 2017
- [c6]Andre Manoel, Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Multi-layer generalized linear estimation. ISIT 2017: 2098-2102 - [i26]Andre Manoel, Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Multi-Layer Generalized Linear Estimation. CoRR abs/1701.06981 (2017) - 2016
- [j9]Yoshiyuki Kabashima, Florent Krzakala, Marc Mézard, Ayaka Sakata, Lenka Zdeborová:
Phase Transitions and Sample Complexity in Bayes-Optimal Matrix Factorization. IEEE Trans. Inf. Theory 62(7): 4228-4265 (2016) - 2014
- [j8]Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Reweighted Belief Propagation and Quiet Planting for Random K-SAT. J. Satisf. Boolean Model. Comput. 8(3/4): 149-171 (2014) - [i25]Yoshiyuki Kabashima, Florent Krzakala, Marc Mézard, Ayaka Sakata, Lenka Zdeborová:
Phase transitions and sample complexity in Bayes-optimal matrix factorization. CoRR abs/1402.1298 (2014) - [i24]Andrey Y. Lokhov, Marc Mézard, Lenka Zdeborová:
Dynamic message-passing equations for models with unidirectional dynamics. CoRR abs/1407.1255 (2014) - 2013
- [c5]Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Compressed sensing under matrix uncertainty: Optimum thresholds and robust approximate message passing. ICASSP 2013: 5519-5523 - [c4]Pan Zhang, Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Non-adaptive pooling strategies for detection of rare faulty items. ICC Workshops 2013: 1409-1414 - [c3]Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Phase diagram and approximate message passing for blind calibration and dictionary learning. ISIT 2013: 659-663 - [i23]Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Compressed Sensing under Matrix Uncertainty: Optimum Thresholds and Robust Approximate Message Passing. CoRR abs/1301.0901 (2013) - [i22]Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Phase Diagram and Approximate Message Passing for Blind Calibration and Dictionary Learning. CoRR abs/1301.5898 (2013) - [i21]Pan Zhang, Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Non-adaptive pooling strategies for detection of rare faulty items. CoRR abs/1302.0189 (2013) - [i20]Andrey Y. Lokhov, Marc Mézard, Hiroki Ohta, Lenka Zdeborová:
Inferring the origin of an epidemy with dynamic message-passing algorithm. CoRR abs/1303.5315 (2013) - 2012
- [c2]Jean Barbier, Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Compressed sensing of approximately-sparse signals: Phase transitions and optimal reconstruction. Allerton Conference 2012: 800-807 - [i19]Florent Krzakala, Marc Mézard, François Sausset, Yifan Sun, Lenka Zdeborová:
Probabilistic Reconstruction in Compressed Sensing: Algorithms, Phase Diagrams, and Threshold Achieving Matrices. CoRR abs/1206.3953 (2012) - [i18]Jean Barbier, Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Compressed Sensing of Approximately-Sparse Signals: Phase Transitions and Optimal Reconstruction. CoRR abs/1207.2079 (2012) - [i17]Emmanuelle Gouillart, Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Belief Propagation Reconstruction for Discrete Tomography. CoRR abs/1211.2379 (2012) - 2011
- [j7]Marc Mézard, Prasad Tetali:
Special Section on Constraint Satisfaction Problems and Message Passing Algorithms. SIAM J. Discret. Math. 25(2): 733-735 (2011) - [j6]Marc Mézard, Cristina Toninelli:
Group Testing With Random Pools: Optimal Two-Stage Algorithms. IEEE Trans. Inf. Theory 57(3): 1736-1745 (2011) - [i16]Florent Krzakala, Marc Mézard, François Sausset, Yifan Sun, Lenka Zdeborová:
Statistical physics-based reconstruction in compressed sensing. CoRR abs/1109.4424 (2011)
2000 – 2009
- 2009
- [i15]Saburo Higuchi, Marc Mézard:
Susceptibility Propagation for Constraint Satisfaction Problems. CoRR abs/0903.1621 (2009) - [i14]Saburo Higuchi, Marc Mézard:
Decimation flows in constraint satisfaction problems. CoRR abs/0908.1599 (2009) - 2008
- [j5]Hervé Daudé, Marc Mézard, Thierry Mora, Riccardo Zecchina:
Pairs of SAT-assignments in random Boolean formulæ. Theor. Comput. Sci. 393(1-3): 260-279 (2008) - [i13]Lenka Zdeborová, Marc Mézard:
Hard constraint satisfaction problems. CoRR abs/0803.2955 (2008) - [i12]Lenka Zdeborová, Marc Mézard:
Constraint satisfaction problems with isolated solutions are hard. CoRR abs/0810.1499 (2008) - 2007
- [i11]Marc Mézard, Cristina Toninelli:
Group Testing with Random Pools: optimal two-stage algorithms. CoRR abs/0706.3104 (2007) - 2006
- [j4]Stephan Mertens, Marc Mézard, Riccardo Zecchina:
Threshold values of random K-SAT from the cavity method. Random Struct. Algorithms 28(3): 340-373 (2006) - [p1]Alfredo Braunstein, Marc Mézard, Martin Weigt, Riccardo Zecchina:
Constraint Satisfaction by Survey Propagation. Computational Complexity and Statistical Physics 2006: 107-124 - [i10]Lenka Zdeborová, Marc Mézard:
The number of matchings in random graphs. CoRR abs/cond-mat/0603350 (2006) - [i9]Thierry Mora, Marc Mézard:
Geometrical organization of solutions to random linear Boolean equations. CoRR abs/cond-mat/0609099 (2006) - 2005
- [j3]Alfredo Braunstein, Marc Mézard, Riccardo Zecchina:
Survey propagation: An algorithm for satisfiability. Random Struct. Algorithms 27(2): 201-226 (2005) - [i8]Marc Mézard, Thierry Mora, Riccardo Zecchina:
Clustering of solutions in the random satisfiability problem. CoRR abs/cond-mat/0504070 (2005) - [i7]Hervé Daudé, Marc Mézard, Thierry Mora, Riccardo Zecchina:
Pairs of SAT Assignment in Random Boolean Formulae. CoRR abs/cond-mat/0506053 (2005) - [i6]Stefano Ciliberti, Marc Mézard:
The theoretical capacity of the Parity Source Coder. CoRR abs/cond-mat/0506652 (2005) - [i5]Marc Mézard, Matteo Palassini, Olivier Rivoire:
Landscape of solutions in constraint satisfaction problems. CoRR abs/cond-mat/0507451 (2005) - 2003
- [i4]Stephan Mertens, Marc Mézard, Riccardo Zecchina:
Threshold values of Random K-SAT from the cavity method. CoRR cs.CC/0309020 (2003) - 2002
- [i3]Marc Mézard, Federico Ricci-Tersenghi, Riccardo Zecchina:
Alternative solutions to diluted p-spin models and XORSAT problems. CoRR cond-mat/0207140 (2002) - [i2]Alfredo Braunstein, Marc Mézard, Martin Weigt, Riccardo Zecchina:
Constraint Satisfaction by Survey Propagation. CoRR cond-mat/0212451 (2002) - [i1]Alfredo Braunstein, Marc Mézard, Riccardo Zecchina:
Survey propagation: an algorithm for satisfiability. CoRR cs.CC/0212002 (2002)
1990 – 1999
- 1992
- [j2]Silvio Franz, Marc Mézard, Giorgio Parisi:
On The Mean Field Theory of Random Heteropolymers. Int. J. Neural Syst. 3(Supplement): 195-200 (1992)
1980 – 1989
- 1989
- [c1]Marc Mézard:
Learning algorithms in neural networks: recent results. NATO Neurocomputing 1989: 75-79 - 1988
- [j1]Werner Krauth, Marc Mézard, Jean-Pierre Nadal:
Basins of Attraction in a Perception-like Neural Network. Complex Syst. 2(4) (1988)
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-10-01 21:42 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:
