4 papers · 1 filter
Non-asymptotic Convergence of Stochastic Gradient Descent in Score-based Generative Models
Stanislas Strasman, Sobihan Surendran, Sylvain Le Corff
Score-based Generative Models (SGMs) have achieved impressive performance in data generation across a wide range of applications. While the statistical properties of their sampling…
Latent Guided Sampling for Combinatorial Optimization
Sobihan Surendran, Adeline Fermanian, Sylvain Le Corff
Combinatorial Optimization problems are widespread in domains such as logistics, manufacturing, and drug discovery, yet their NP-hard nature makes them computationally challenging.…
Theoretical Convergence Guarantees for Variational Autoencoders
Sobihan Surendran, Antoine Godichon-Baggioni, Sylvain Le Corff
Variational Autoencoders (VAE) are popular generative models used to sample from complex data distributions. Despite their empirical success in various machine learning tasks, sign…
Non-asymptotic Analysis of Biased Adaptive Stochastic Approximation
Sobihan Surendran, Antoine Godichon-Baggioni, Adeline Fermanian +1
Stochastic Gradient Descent (SGD) with adaptive steps is widely used to train deep neural networks and generative models. Most theoretical results assume that it is possible to obt…