Publications associées à On The Convergence Of Stochastic Primal-Dual Hybrid Gradient

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

On The Convergence Of Stochastic Primal-Dual Hybrid Gradient

Graph Chatbot

Chattez avec Graph Search

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling

Universal and adaptive methods for robust stochastic optimization

Localizing Unsynchronized Sensors With Unknown Sources

Stochastic homogenization of degenerate integral functionals with linear growth

Stochastic distributed learning with gradient quantization and double-variance reduction

Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization

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

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

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

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Universal and adaptive methods for robust stochastic optimization

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

A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling

Stochastic homogenization of degenerate integral functionals with linear growth

Stochastic distributed learning with gradient quantization and double-variance reduction

Localizing Unsynchronized Sensors With Unknown Sources

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

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

Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization