default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChiara Cammarota
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i7]Tony Bonnaire, Giulio Biroli, Chiara Cammarota:
From Zero to Hero: How local curvature at artless initial conditions leads away from bad minima. CoRR abs/2403.02418 (2024)- 2022
- [c4]Gioia Boschi, Anthony P. Young, Sagar Joglekar, Chiara Cammarota, Nishanth Sastry:
Who Has the Last Word? Understanding How to Sample Online Discussions. WWW (Companion Volume) 2022: 390 - 2021
- [j1]Gioia Boschi
, Anthony P. Young, Sagar Joglekar, Chiara Cammarota, Nishanth Sastry:
Who Has the Last Word? Understanding How to Sample Online Discussions. ACM Trans. Web 15(3): 12:1-12:25 (2021) - 2020
- [c3]Stefano Sarao Mannelli, Giulio Biroli, Chiara Cammarota, Florent Krzakala, Pierfrancesco Urbani, Lenka Zdeborová:
Complex Dynamics in Simple Neural Networks: Understanding Gradient Flow in Phase Retrieval. NeurIPS 2020 - [i6]Stefano Sarao Mannelli, Giulio Biroli, Chiara Cammarota, Florent Krzakala, Pierfrancesco Urbani, Lenka Zdeborová:
Complex Dynamics in Simple Neural Networks: Understanding Gradient Flow in Phase Retrieval. CoRR abs/2006.06997 (2020)
2010 – 2019
- 2019
- [c2]Stefano Sarao Mannelli, Giulio Biroli, Chiara Cammarota, Florent Krzakala, Lenka Zdeborová:
Who is Afraid of Big Bad Minima? Analysis of gradient-flow in spiked matrix-tensor models. NeurIPS 2019: 8676-8686 - [i5]Giulio Biroli, Chiara Cammarota, Federico Ricci-Tersenghi:
How to iron out rough landscapes and get optimal performances: Replicated Gradient Descent and its application to tensor PCA. CoRR abs/1905.12294 (2019) - [i4]Gioia Boschi, Anthony P. Young, Sagar Joglekar, Chiara Cammarota, Nishanth Sastry:
Having the Last Word: Understanding How to Sample Discussions Online. CoRR abs/1906.04148 (2019) - [i3]Stefano Sarao Mannelli, Giulio Biroli, Chiara Cammarota, Florent Krzakala, Lenka Zdeborová:
Who is Afraid of Big Bad Minima? Analysis of Gradient-Flow in a Spiked Matrix-Tensor Model. CoRR abs/1907.08226 (2019) - 2018
- [c1]Marco Baity-Jesi, Levent Sagun, Mario Geiger, Stefano Spigler, Gérard Ben Arous, Chiara Cammarota, Yann LeCun, Matthieu Wyart, Giulio Biroli:
Comparing Dynamics: Deep Neural Networks versus Glassy Systems. ICML 2018: 324-333 - [i2]Marco Baity-Jesi, Levent Sagun, Mario Geiger, Stefano Spigler, Gérard Ben Arous, Chiara Cammarota, Yann LeCun, Matthieu Wyart, Giulio Biroli:
Comparing Dynamics: Deep Neural Networks versus Glassy Systems. CoRR abs/1803.06969 (2018) - [i1]Stefano Sarao Mannelli, Giulio Biroli, Chiara Cammarota, Florent Krzakala, Pierfrancesco Urbani, Lenka Zdeborová:
Marvels and Pitfalls of the Langevin Algorithm in Noisy High-dimensional Inference. CoRR abs/1812.09066 (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 2025-01-09 13:00 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:
