Publications associées à Fast Proximal algorithms for Self-concordant function minimization with application to sparse graph selection

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

A first-order primal-dual method with adaptivity to local smoothness

Volkan Cevher, Maria-Luiza Vladarean

We consider the problem of finding a saddle point for the convex-concave objective

\min_x \max_y f(x) + \langle Ax, y\rangle - g^*(y)

, where

f

is a convex function with locally Lipschitz gradient and

g

is convex and possibly non-smooth. We propose an ...

2021

Fast Proximal algorithms for Self-concordant function minimization with application to sparse graph selection

Graph Chatbot

Chattez avec Graph Search

Universal and adaptive methods for robust stochastic optimization

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

UNDERGRAD: A Universal Black-Box Optimization Method with Almost Dimension-Free Convergence Rate Guarantees

STORM+: Fully Adaptive SGD with Momentum for Nonconvex Optimization

A Newton Frank-Wolfe method for constrained self-concordant minimization

Adaptation in Stochastic Algorithms: From Nonsmooth Optimization to Min-Max Problems and Beyond

Regret Minimization in Stochastic Non-Convex Learning via a Proximal-Gradient Approach

Large Steps in Inverse Rendering of Geometry

Last iterate convergence of SGD for Least-Squares in the Interpolation regime

A first-order primal-dual method with adaptivity to local smoothness

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Adaptation in Stochastic Algorithms: From Nonsmooth Optimization to Min-Max Problems and Beyond

Regret Minimization in Stochastic Non-Convex Learning via a Proximal-Gradient Approach

A first-order primal-dual method with adaptivity to local smoothness

Universal and adaptive methods for robust stochastic optimization

Last iterate convergence of SGD for Least-Squares in the Interpolation regime

UNDERGRAD: A Universal Black-Box Optimization Method with Almost Dimension-Free Convergence Rate Guarantees

A Newton Frank-Wolfe method for constrained self-concordant minimization

Large Steps in Inverse Rendering of Geometry

STORM+: Fully Adaptive SGD with Momentum for Nonconvex Optimization