activity
20242026
most citedCompression of Structured Data with Autoencoders: Provable Benefit of Nonlinearities and Depth

1 citations · 1 across the 7 of their papers we have counts for

collaborators

9 papers

cs.LG2026

When do data mixtures improve scaling laws? Insights from high-dimensional regression

Diyuan Wu, Lehan Chen, Theodor Misiakiewicz +1

Modern machine learning systems are trained on mixtures of data from different domains, and choosing the right mixture can substantially improve downstream performance. Despite an…

cs.LG2026

A Sharp Transition in Data Reconstruction under Differential Privacy

Max Cairney-Leeming, Simone Bombari, Marco Mondelli

Data reconstruction attacks have empirically been successful in recovering training samples from learned models, raising privacy concerns and motivating defenses with guarantees th…

cs.LG2026

Optimal Representation Size: High-Dimensional Analysis of Pretraining and Linear Probing

Valentina Njaradi, Clémentine Dominé, Rachel Swanson +2

Learning to generalise from limited data is a fundamental challenge for both artificial and biological systems. A common strategy is to extract reusable structure from abundant unl…

cs.LG2026

Sink vs. diagonal patterns as mechanisms for attention switch and oversmoothing prevention

Peter Súkeník, Cristina López Amado, Christoph H. Lampert +1

This paper studies the role of sinks and diagonal patterns as attention switch and anti-oversmoothing mechanisms. We analyze geometric conditions under which sinks can be represent…

cs.LG2026

Improved Scaling Laws via Weak-to-Strong Generalization in Random Feature Ridge Regression

Diyuan Wu, Lehan Chen, Theodor Misiakiewicz +1

It is increasingly common in machine learning to use learned models to label data and then employ such data to train more capable models. The phenomenon of weak-to-strong generaliz…

cs.LG2025

A Law of Data Reconstruction for Random Features (and Beyond)

Leonardo Iurada, Simone Bombari, Tatiana Tommasi +1

Large-scale deep learning models are known to memorize parts of the training set. In machine learning theory, memorization is often framed as interpolation or label fitting, and cl…

stat.ML2025

High-Dimensional Private Linear Regression with Optimal Rates

Simone Bombari, Jialei Luo, Inbar Seroussi +1

Differentially private (DP) linear regression has received significant attention in the recent theoretical literature, with several approaches proposed to improve error rates. Our…

cs.LG2024★ 1 cited

Compression of Structured Data with Autoencoders: Provable Benefit of Nonlinearities and Depth

Kevin Kögler, Alexander Shevchenko, Hamed Hassani +1

Autoencoders are a prominent model in many empirical branches of machine learning and lossy data compression. However, basic theoretical questions remain unanswered even in a shall…

cs.IT2024

Tight Bounds for Linear and Non-Linear Contraction of Divergences via Duality

Amedeo Roberto Esposito, Marco Mondelli

We develop a novel framework for bounding the contraction of information divergences, using duality and associated norms in Orlicz spaces. By working in the dual space, we obtain a…