Frank-Wolfe Style Algorithms for Large Scale Optimization

08/15/2018
by   Lijun Ding, et al.
0

We introduce a few variants on Frank-Wolfe style algorithms suitable for large scale optimization. We show how to modify the standard Frank-Wolfe algorithm using stochastic gradients, approximate subproblem solutions, and sketched decision variables in order to scale to enormous problems while preserving (up to constants) the optimal convergence rate O(1/k).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/29/2020

Projection-Free Adaptive Gradients for Large-Scale Optimization

The complexity in large-scale optimization can lie in both handling the ...
research
11/14/2017

Stochastic Strictly Contractive Peaceman-Rachford Splitting Method

In this paper, we propose a couple of new Stochastic Strictly Contractiv...
research
06/30/2023

An Oblivious Stochastic Composite Optimization Algorithm for Eigenvalue Optimization Problems

In this work, we revisit the problem of solving large-scale semidefinite...
research
02/01/2019

Compressing Gradient Optimizers via Count-Sketches

Many popular first-order optimization methods (e.g., Momentum, AdaGrad, ...
research
09/08/2017

Super-speeds with Zero-RAM: Next Generation Large-Scale Optimization in Your Laptop!

This article presents the novel breakthrough general purpose algorithm f...
research
02/05/2015

A PARTAN-Accelerated Frank-Wolfe Algorithm for Large-Scale SVM Classification

Frank-Wolfe algorithms have recently regained the attention of the Machi...
research
06/10/2022

Splitted Levenberg-Marquardt Method for Large-Scale Sparse Problems

We consider large-scale nonlinear least squares problems with sparse res...

Please sign up or login with your details

Forgot password? Click here to reset