Simon Matet
YOU?
Author Swipe
View article: Implicit regularization with strongly convex bias: Stability and acceleration
Implicit regularization with strongly convex bias: Stability and acceleration Open
Implicit regularization refers to the property of optimization algorithms to be biased towards a certain class of solutions. This property is relevant to understand the behavior of modern machine learning algorithms as well as to design ef…
View article: Don't relax: early stopping for convex regularization
Don't relax: early stopping for convex regularization Open
We consider the problem of designing efficient regularization algorithms when regularization is encoded by a (strongly) convex functional. Unlike classical penalization methods based on a relaxation approach, we propose an iterative method…