default search action
Raphaël Berthier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c4]Denys Pushkin, Raphaël Berthier, Emmanuel Abbe:
On the Minimal Degree Bias in Generalization on the Unseen for non-Boolean Functions. ICML 2024 - [i11]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) - 2023
- [j2]Raphaël Berthier:
Incremental Learning in Diagonal Linear Networks. J. Mach. Learn. Res. 24: 171:1-171:26 (2023) - [c3]Pierre Marion, Raphaël Berthier:
Leveraging the two-timescale regime to demonstrate convergence of neural networks. NeurIPS 2023 - [i10]Raphaël Berthier, Andrea Montanari, Kangjie Zhou:
Learning time-scales in two-layers neural networks. CoRR abs/2303.00055 (2023) - [i9]Pierre Marion, Raphaël Berthier:
Leveraging the two timescale regime to demonstrate convergence of neural networks. CoRR abs/2304.09576 (2023) - 2022
- [i8]Raphaël Berthier, Mufan (Bill) Li:
Acceleration of Gossip Algorithms through the Euler-Poisson-Darboux Equation. CoRR abs/2202.10742 (2022) - [i7]Raphaël Berthier:
Incremental Learning in Diagonal Linear Networks. CoRR abs/2208.14673 (2022) - 2021
- [b1]Raphaël Berthier:
Analysis and Acceleration of Gradient Descents and Gossip Algorithms. (Analyse et Accélération des Descentes de Gradient et des Algorithmes de Gossip). PSL University, France, 2021 - [c2]Mathieu Even, Raphaël Berthier, Francis R. Bach, Nicolas Flammarion, Hadrien Hendrikx, Pierre Gaillard, Laurent Massoulié, Adrien B. Taylor:
Continuized Accelerations of Deterministic and Stochastic Gradient Descents, and of Gossip Algorithms. NeurIPS 2021: 28054-28066 - [i6]Raphaël Berthier, Francis R. Bach, Nicolas Flammarion, Pierre Gaillard, Adrien B. Taylor:
A Continuized View on Nesterov Acceleration. CoRR abs/2102.06035 (2021) - [i5]Mathieu Even, Raphaël Berthier, Francis R. Bach, Nicolas Flammarion, Pierre Gaillard, Hadrien Hendrikx, Laurent Massoulié, Adrien B. Taylor:
A Continuized View on Nesterov Acceleration for Stochastic Gradient Descent and Randomized Gossip. CoRR abs/2106.07644 (2021) - [i4]Cédric Gerbelot, Raphaël Berthier:
Graph-based Approximate Message Passing Iterations. CoRR abs/2109.11905 (2021) - 2020
- [j1]Raphaël Berthier, Francis R. Bach, Pierre Gaillard:
Accelerated Gossip in Networks of Given Dimension Using Jacobi Polynomial Iterations. SIAM J. Math. Data Sci. 2(1): 24-47 (2020) - [c1]Raphaël Berthier, Francis R. Bach, Pierre Gaillard:
Tight Nonparametric Convergence Rates for Stochastic Gradient Descent under the Noiseless Linear Model. NeurIPS 2020 - [i3]Raphaël Berthier, Francis R. Bach, Pierre Gaillard:
Tight Nonparametric Convergence Rates for Stochastic Gradient Descent under the Noiseless Linear Model. CoRR abs/2006.08212 (2020)
2010 – 2019
- 2018
- [i2]Raphaël Berthier, Francis R. Bach, Pierre Gaillard:
Gossip of Statistical Observations using Orthogonal Polynomials. CoRR abs/1805.08531 (2018) - 2017
- [i1]Raphaël Berthier, Andrea Montanari, Phan-Minh Nguyen:
State Evolution for Approximate Message Passing with Non-Separable Functions. CoRR abs/1708.03950 (2017)
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-09-13 00:44 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: