Publications associées à UNDERGRAD: A Universal Black-Box Optimization Method with Almost Dimension-Free Convergence Rate Guarantees

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.

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

Volkan Cevher, Anastasios Kyrillidis

The convex

\ell_1

-regularized

\log\det

divergence criterion has been shown to produce theoretically consistent graph learning. However, this objective function is challenging since the

\ell_1

-regularization is nonsmooth, the

\log\det

objective is n ...

2013

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

Graph Chatbot

Chattez avec Graph Search

Solving the Infinite-horizon Constrained LQR Problem using Accelerated Dual Proximal Methods

Asynchronous updates for stochastic gradient descent

On the influence of momentum acceleration on online learning

On the influence of momentum acceleration on online learning

Multi-index stochastic collocation convergence rates for random PDEs with parametric regularity

Path-following gradient-based decomposition algorithms for separable convex optimization

Splitting methods in control

Fast Proximal Algorithms For Self-Concordant Function Minimization With Application To Sparse Graph Selection

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

A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions

Fast Proximal Algorithms For Self-Concordant Function Minimization With Application To Sparse Graph Selection

On the influence of momentum acceleration on online learning

Splitting methods in control

Solving the Infinite-horizon Constrained LQR Problem using Accelerated Dual Proximal Methods

Asynchronous updates for stochastic gradient descent

On the influence of momentum acceleration on online learning

Multi-index stochastic collocation convergence rates for random PDEs with parametric regularity

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

A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions

Path-following gradient-based decomposition algorithms for separable convex optimization