← Search

Lorenzo Bardone

5 accepted papers

2026

A Solvable High-Dimensional Model Where Nonlinear Autoencoders Learn Structure Invisible to PCA While Test Loss Misaligns With Generalization

ICML 2026poster

Many real-world datasets contain hidden structure that cannot be detected by simple linear correlations between input features. For example, latent factors may influence the data in a coordinated way, even though their effect is invisible to covariance-based methods such as PCA. In practice, nonline…

Cited by 0SourceScholar
2026

A theory of learning data statistics in diffusion models, from easy to hard

ICML 2026poster

While diffusion models have emerged as a powerful class of generative models, their learning dynamics remain poorly understood. We address this issue first by empirically showing that standard diffusion models trained on natural images exhibit a simplicity bias, learning simple, pair-wise input stat…

Cited by 0SourceScholar
2025

Feature learning from non-Gaussian inputs: the case of Independent Component Analysis in high dimensions

ICML 2025spotlight

Deep neural networks learn structured features from complex, non-Gaussian inputs, but the mechanisms behind this process remain poorly understood. Our work is motivated by the observation that the first-layer filters learnt by deep convolutional neural networks from natural images resemble those…

Cited by 0SourcePDFScholar
2024

Learning from higher-order correlations, efficiently: hypothesis tests, random features, and neural networks

NeurIPS 2024poster

Neural networks excel at discovering statistical patterns in high-dimensional data sets. In practice, higher-order cumulants, which quantify the non-Gaussian correlations between three or more variables, are particularly important for the performance of neural networks. But how efficient are neural…

Cited by 0SourcePDFScholar
2024

Sliding Down the Stairs: How Correlated Latent Variables Accelerate Learning with Neural Networks

ICML 2024poster

Neural networks extract features from data using stochastic gradient descent (SGD). In particular, higher-order input cumulants (HOCs) are crucial for their performance. However, extracting information from the $p$th cumulant of $d$-dimensional inputs is computationally hard: the number of samples r…

Cited by 4SourcePDFScholar