← Search

Chiara Cammarota

4 accepted papers

2026

Overparametrization bends the landscape: BBP transitions at initialization in simple Neural Networks

ICLR 2026oral

High-dimensional non-convex loss landscapes play a central role in the theory of Machine Learning. Gaining insight into how these landscapes interact with gradient-based optimization methods, even in relatively simple models, can shed light on this enigmatic feature of neural networks. In this work,…

Cited by 0SourceScholar
2020

Complex Dynamics in Simple Neural Networks: Understanding Gradient Flow in Phase Retrieval

NeurIPS 2020poster

Despite the widespread use of gradient-based algorithms for optimising high-dimensional non-convex functions, understanding their ability of finding good minima instead of being trapped in spurious ones remains to a large extent an open problem. Here we focus on gradient flow dynamics for phase retr…

Cited by 36SourcePDFScholar
2019

Who is Afraid of Big Bad Minima? Analysis of gradient-flow in spiked matrix-tensor models

NeurIPS 2019spotlight

Gradient-based algorithms are effective for many machine learning tasks, but despite ample recent effort and some progress, it often remains unclear why they work in practice in optimising high-dimensional non-convex functions and why they find good minima instead of being trapped in spurious ones.H…

2018

Comparing Dynamics: Deep Neural Networks versus Glassy Systems

ICML 2018oral

We analyze numerically the training dynamics of deep neural networks (DNN) by using methods developed in statistical physics of glassy systems. The two main issues we address are the complexity of the loss-landscape and of the dynamics within it, and to what extent DNNs share similarities with glass…

Cited by 138SourcePDFScholar