🏢 Université Côte D'Azur

Score-based generative models are provably robust to multiple error sources, as shown via a novel Wasserstein uncertainty propagation theorem.

Researchers rigorously prove the Strong Lottery Ticket Hypothesis, offering the first theoretical guarantees on the sparsity of winning neural network subnetworks.

First high-probability complexity guarantees for solving stochastic nonconvex minimax problems using a single-loop method are established.