604 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- École Normale Supérieure - PSLFR41 papers
- Institut national de recherche en sciences et technologies du numériqueFR30 papers
- Département d'InformatiqueFR17 papers
- Centre National de la Recherche ScientifiqueFR6 papers
- Université Paris Sciences et LettresFR5 papers
- CentraleSupélecFR3 papers
- École Normale SupérieureBI3 papers
- Institut Polytechnique de ParisFR3 papers
- Laboratoire Traitement et Communication de l’InformationFR3 papers
- Massachusetts Institute of TechnologyUS3 papers
- CEA Paris-Saclay - Etablissement de SaclayFR2 papers
- Centre de Vision NumériqueFR2 papers
9 papers · 1 filter
On Lazy Training in Differentiable Programming
Lenaic Chizat, Edouard Oyallon, Francis Bach
In a series of recent theoretical works, it was shown that strongly over-parameterized neural networks trained with gradient-based methods could converge exponentially fast to zero…
Sharp Analysis of Learning with Discrete Losses
Alex Nowak-Vila, Francis Bach, Alessandro Rudi
The problem of devising learning strategies for discrete losses (e.g., multilabeling, ranking) is currently addressed with methods and theoretical analyses ad-hoc for each loss. In…
Sample Complexity of Sinkhorn divergences
Aude Genevay, Lénaic Chizat, Francis Bach +2
Optimal transport (OT) and maximum mean discrepancies (MMD) are now routinely used in machine learning to compare probability measures. We focus in this paper on \emph{Sinkhorn div…
A Kernel Perspective for Regularizing Deep Neural Networks
Alberto Bietti, Grégoire Mialon, Dexiong Chen +1
We propose a new point of view for regularizing deep neural networks by using the norm of a reproducing kernel Hilbert space (RKHS). Even though this norm cannot be computed, it ad…
Robust Seriation and Applications to Cancer Genomics
Antoine Recanati, Nicolas Servant, Jean-Philippe Vert +1
The seriation problem seeks to reorder a set of elements given pairwise similarity information, so that elements with higher similarity are closer in the resulting sequence. When a…
Nonlinear Acceleration of CNNs
Damien Scieur, Edouard Oyallon, Alexandre d'Aspremont +1
The Regularized Nonlinear Acceleration (RNA) algorithm is an acceleration method capable of improving the rate of convergence of many optimization schemes such as gradient descend,…
Differential Properties of Sinkhorn Approximation for Learning with Wasserstein Distance
Giulia Luise, Alessandro Rudi, Massimiliano Pontil +1
Applications of optimal transport have recently gained remarkable attention thanks to the computational advantages of entropic regularization. However, in most situations the Sinkh…
Constant Step Size Stochastic Gradient Descent for Probabilistic Modeling
Dmitry Babichev, Francis Bach
Stochastic gradient methods enable learning probabilistic models from large amounts of data. While large step-sizes (learning rates) have shown to be best for least-squares (e.g.,…
Frank-Wolfe with Subsampling Oracle
Thomas Kerdreux, Fabian Pedregosa, Alexandre d'Aspremont
We analyze two novel randomized variants of the Frank-Wolfe (FW) or conditional gradient algorithm. While classical FW algorithms require solving a linear minimization problem over…