Publications associées à The role of perspective functions in convexity, polyconvexity, rank-one convexity and separate convexity

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

The role of perspective functions in convexity, polyconvexity, rank-one convexity and separate convexity

Graph Chatbot

Chattez avec Graph Search

Stable parameterization of continuous and piecewise-linear functions

Stochastic homogenization of degenerate integral functionals with linear growth

Localizing Unsynchronized Sensors With Unknown Sources

DIVIDE-AND-CONQUER METHODS FOR FUNCTIONS OF MATRICES WITH BANDED OR HIERARCHICAL LOW-RANK STRUCTURE\ast

Stochastic distributed learning with gradient quantization and double-variance reduction

Finite Littlestone Dimension Implies Finite Information Complexity

On The Convergence Of Stochastic Primal-Dual Hybrid Gradient

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

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

Critical Parameters for Scalable Distributed Learning with Large Batches and Asynchronous Updates

DIVIDE-AND-CONQUER METHODS FOR FUNCTIONS OF MATRICES WITH BANDED OR HIERARCHICAL LOW-RANK STRUCTURE\ast

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

Finite Littlestone Dimension Implies Finite Information Complexity

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

On The Convergence Of Stochastic Primal-Dual Hybrid Gradient

Critical Parameters for Scalable Distributed Learning with Large Batches and Asynchronous Updates

Stable parameterization of continuous and piecewise-linear functions

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