default search action
Luca Pesce
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c5]Luca Arnaboldi, Yatin Dandi, Florent Krzakala, Bruno Loureiro, Luca Pesce, Ludovic Stephan:
Online Learning and Information Exponents: The Importance of Batch size & Time/Complexity Tradeoffs. ICML 2024 - [c4]Hugo Cui, Luca Pesce, Yatin Dandi, Florent Krzakala, Yue M. Lu, Lenka Zdeborová, Bruno Loureiro:
Asymptotics of feature learning in two-layer networks after one gradient-step. ICML 2024 - [c3]Yatin Dandi, Emanuele Troiani, Luca Arnaboldi, Luca Pesce, Lenka Zdeborová, Florent Krzakala:
The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponents. ICML 2024 - [i9]Yatin Dandi, Emanuele Troiani, Luca Arnaboldi, Luca Pesce
, Lenka Zdeborová, Florent Krzakala:
The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponents. CoRR abs/2402.03220 (2024) - [i8]Hugo Cui, Luca Pesce
Asymptotics of feature learning in two-layer networks after one gradient-step. CoRR abs/2402.04980 (2024) - [i7]Luca Arnaboldi, Yatin Dandi, Florent Krzakala, Luca Pesce
Repetita Iuvant: Data Repetition Allows SGD to Learn High-Dimensional Multi-Index Functions. CoRR abs/2405.15459 (2024) - [i6]Luca Arnaboldi, Yatin Dandi, Florent Krzakala, Bruno Loureiro, Luca Pesce
Online Learning and Information Exponents: On The Importance of Batch size, and Time/Complexity Tradeoffs. CoRR abs/2406.02157 (2024) - [i5]Yatin Dandi, Luca Pesce, Hugo Cui, Florent Krzakala, Yue M. Lu, Bruno Loureiro:
A Random Matrix Theory Perspective on the Spectrum of Learned Features and Asymptotic Generalization Capabilities. CoRR abs/2410.18938 (2024) - 2023
- [c2]Luca Pesce, Florent Krzakala
Are Gaussian Data All You Need? The Extents and Limits of Universality in High-Dimensional Generalized Linear Estimation. ICML 2023: 27680-27708 - [i4]Luca Pesce
Are Gaussian data all you need? Extents and limits of universality in high-dimensional generalized linear estimation. CoRR abs/2302.08923 (2023) - [i3]Yatin Dandi, Florent Krzakala
Learning Two-Layer Neural Networks, One (Giant) Step at a Time. CoRR abs/2305.18270 (2023) - [i2]Francis R. Bach, Elisabetta Cornacchia, Luca Pesce
Theory and applications of the Sum-Of-Squares technique. CoRR abs/2306.16255 (2023) - 2022
- [c1]Luca Pesce, Bruno Loureiro, Florent Krzakala, Lenka Zdeborová:
Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gap. NeurIPS 2022 - [i1]Luca Pesce
Subspace clustering in high-dimensions: Phase transitions \& Statistical-to-Computational gap. CoRR abs/2205.13527 (2022) - 2021
- [d4]Giacomo Mazzamuto
Broca's Area Light-Sheet Microscopy. Version 1. Zenodo, 2021 [all versions] - [d3]Giacomo Mazzamuto
Broca's Area Light-Sheet Microscopy. Version 2. Zenodo, 2021 [all versions] - [d2]Giacomo Mazzamuto
Broca's Area Light-Sheet Microscopy. Version 3. Zenodo, 2021 [all versions] - [d1]Giacomo Mazzamuto
Broca's Area Light-Sheet Microscopy. Version 4. Zenodo, 2021 [all versions]
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-12-13 20:04 CET 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: