default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntoine Maillard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Antoine Maillard
, Dmitriy Kunisky:
Fitting an Ellipsoid to Random Points: Predictions Using the Replica Method. IEEE Trans. Inf. Theory 70(10): 7273-7296 (2024)- [i16]Antoine Maillard, Emanuele Troiani, Simon Martin, Florent Krzakala, Lenka Zdeborová:
Bayes-optimal learning of an extensive-width neural network from quadratically many samples. CoRR abs/2408.03733 (2024) - 2023
- [j2]Jonathan Dong, Lorenzo Valzania, Antoine Maillard, Thanh-An Pham, Sylvain Gigan, Michael Unser:
Phase Retrieval: From Computational Imaging to Machine Learning: A tutorial. IEEE Signal Process. Mag. 40(1): 45-57 (2023) - [i15]Antoine Maillard, Afonso S. Bandeira, David Belius, Ivan Dokmanic, Shuta Nakajima:
Injectivity of ReLU networks: perspectives from statistical physics. CoRR abs/2302.14112 (2023) - [i14]Afonso S. Bandeira, Antoine Maillard, Shahar Mendelson, Elliot Paquette:
Fitting an ellipsoid to a quadratic number of random points. CoRR abs/2307.01181 (2023) - [i13]Antoine Maillard, Dmitriy Kunisky:
Fitting an ellipsoid to random points: predictions using the replica method. CoRR abs/2310.01169 (2023) - [i12]Antoine Maillard, Afonso S. Bandeira:
Exact threshold for approximate ellipsoid fitting of random points. CoRR abs/2310.05787 (2023) - 2022
- [c7]Emanuele Troiani, Vittorio Erba, Florent Krzakala, Antoine Maillard, Lenka Zdeborová:
Optimal denoising of rotationally invariant rectangular matrices. MSML 2022: 97-112 - [i11]Emanuele Troiani, Vittorio Erba, Florent Krzakala, Antoine Maillard, Lenka Zdeborová:
Optimal denoising of rotationally invariant rectangular matrices. CoRR abs/2203.07752 (2022) - [i10]Afonso S. Bandeira, Antoine Maillard, Nikita Zhivotovskiy:
A remark on Kashin's discrepancy argument and partial coloring in the Komlós conjecture. CoRR abs/2206.08734 (2022) - [i9]Afonso S. Bandeira, Antoine Maillard, Richard Nickl, Sven Wang:
On free energy barriers in Gaussian priors and failure of MCMC for high-dimensional unimodal distributions. CoRR abs/2209.02001 (2022) - 2021
- [j1]Benjamin Aubin, Bruno Loureiro, Antoine Maillard, Florent Krzakala, Lenka Zdeborová:
The Spiked Matrix Model With Generative Priors. IEEE Trans. Inf. Theory 67(2): 1156-1181 (2021) - [c6]Antoine Maillard, Florent Krzakala, Yue M. Lu, Lenka Zdeborová:
Construction of optimal spectral methods in phase retrieval. MSML 2021: 693-720 - [i8]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
- [c5]Antoine Maillard, Gérard Ben Arous, Giulio Biroli:
Landscape Complexity for the Empirical Risk of Generalized Linear Models. MSML 2020: 287-327 - [c4]Antoine Maillard, Bruno Loureiro, Florent Krzakala, Lenka Zdeborová:
Phase retrieval in high dimensions: Statistical and computational phase transitions. NeurIPS 2020 - [i7]Antoine Maillard, Bruno Loureiro, Florent Krzakala, Lenka Zdeborová:
Phase retrieval in high dimensions: Statistical and computational phase transitions. CoRR abs/2006.05228 (2020) - [i6]Antoine Maillard, Florent Krzakala, Yue M. Lu, Lenka Zdeborová:
Construction of optimal spectral methods in phase retrieval. CoRR abs/2012.04524 (2020)
2010 – 2019
- 2019
- [c3]Benjamin Aubin, Bruno Loureiro, Antoine Maillard, Florent Krzakala, Lenka Zdeborová:
The spiked matrix model with generative priors. NeurIPS 2019: 8364-8375 - [i5]Benjamin Aubin, Bruno Loureiro, Antoine Maillard, Florent Krzakala, Lenka Zdeborová:
The spiked matrix model with generative priors. CoRR abs/1905.12385 (2019) - [i4]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) - [i3]Antoine Maillard, Gérard Ben Arous, Giulio Biroli:
Landscape Complexity for the Empirical Risk of Generalized Linear Models. CoRR abs/1912.02143 (2019) - 2018
- [c2]Jean Barbier, Nicolas Macris, Antoine Maillard, Florent Krzakala:
The Mutual Information in Random Linear Estimation Beyond i.i.d. Matrices. ISIT 2018: 1390-1394 - [c1]Benjamin Aubin, Antoine Maillard, Jean Barbier, Florent Krzakala, Nicolas Macris, Lenka Zdeborová:
The committee machine: Computational to statistical gaps in learning a two-layers neural network. NeurIPS 2018: 3227-3238 - [i2]Jean Barbier, Nicolas Macris, Antoine Maillard, Florent Krzakala:
The Mutual Information in Random Linear Estimation Beyond i.i.d. Matrices. CoRR abs/1802.08963 (2018) - [i1]Benjamin Aubin, Antoine Maillard, Jean Barbier, Florent Krzakala, Nicolas Macris, Lenka Zdeborová:
The committee machine: Computational to statistical gaps in learning a two-layers neural network. CoRR abs/1806.05451 (2018)
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-08 21:26 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:
