Recent scalability improvements for semidefinite programming with applications in machine learning, control, and robotics
Historically, scalability has been a major challenge for the successful application of
semidefinite programming in fields such as machine learning, control, and robotics. In this …
semidefinite programming in fields such as machine learning, control, and robotics. In this …
Introduction to online convex optimization
E Hazan - Foundations and Trends® in Optimization, 2016 - nowpublishers.com
This monograph portrays optimization as a process. In many practical applications the
environment is so complex that it is infeasible to lay out a comprehensive theoretical model …
environment is so complex that it is infeasible to lay out a comprehensive theoretical model …
Revisiting Frank-Wolfe: Projection-free sparse convex optimization
M Jaggi - International conference on machine learning, 2013 - proceedings.mlr.press
We provide stronger and more general primal-dual convergence results for Frank-Wolfe-
type algorithms (aka conditional gradient) for constrained convex optimization, enabled by a …
type algorithms (aka conditional gradient) for constrained convex optimization, enabled by a …
[書籍][B] First-order and stochastic optimization methods for machine learning
G Lan - 2020 - Springer
Since its beginning, optimization has played a vital role in data science. The analysis and
solution methods for many statistical and machine learning models rely on optimization. The …
solution methods for many statistical and machine learning models rely on optimization. The …
The multiplicative weights update method: a meta-algorithm and applications
Algorithms in varied fields use the idea of maintaining a distribution over a certain set and
use the multiplicative update rule to iteratively change these weights. Their analyses are …
use the multiplicative update rule to iteratively change these weights. Their analyses are …
Scalable semidefinite programming
Semidefinite programming (SDP) is a powerful framework from convex optimization that has
striking potential for data science applications. This paper develops a provably correct …
striking potential for data science applications. This paper develops a provably correct …
[PDF][PDF] Distance metric learning with eigenvalue optimization
The main theme of this paper is to develop a novel eigenvalue optimization framework for
learning a Mahalanobis metric. Within this context, we introduce a novel metric learning …
learning a Mahalanobis metric. Within this context, we introduce a novel metric learning …
[PDF][PDF] Projection-free online learning
The computational bottleneck in applying online learning to massive data sets is usually the
projection step. We present efficient online learning algorithms that eschew projections in …
projection step. We present efficient online learning algorithms that eschew projections in …
Faster rates for the Frank-Wolfe method over strongly-convex sets
Abstract The Frank-Wolfe method (aka conditional gradient algorithm) for smooth
optimization has regained much interest in recent years in the context of large scale …
optimization has regained much interest in recent years in the context of large scale …
[PDF][PDF] A simple algorithm for nuclear norm regularized problems
M Jaggi, M Sulovsk - Proceedings of the 27th international conference on …, 2010 - icml.cc
Optimization problems with a nuclear norm regularization, such as eg low norm matrix
factorizations, have seen many applications recently. We propose a new approximation …
factorizations, have seen many applications recently. We propose a new approximation …