A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
From MaRDI portal
Publication:508681
DOI10.1016/j.ins.2014.03.059zbMath1355.68234arXiv1304.1014WikidataQ62047577 ScholiaQ62047577MaRDI QIDQ508681
Claudio Sartori, Emanuele Frandi, Héctor Allende, Ricardo Ñanculef
Publication date: 7 February 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.1014
quadratic programming; concave optimization; Frank-Wolfe methods; large-scale support vector machines; learning from massive datasets
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Support vector machine classification applied to the parametric design of centrifugal pumps, Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm, Unnamed Item, Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee, A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training, Scalable Gaussian kernel support vector machines with sublinear training time complexity, Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation, Insensitive stochastic gradient twin support vector machines for large scale problems, Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem, Selective bi-coordinate method for limit non-smooth resource allocation type problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
- Exploiting separability in large-scale linear support vector machine training
- Pegasos: primal estimated sub-gradient solver for SVM
- Kernel methods in machine learning
- An online core vector machine with adaptive MEB adjustment
- A conditional gradient method with linear rate of convergence for solving convex linear systems
- Optimal core-sets for balls
- A Linearly Convergent Linear-Time First-Order Algorithm for Support Vector Classification with a Core Set Result
- 10.1162/15324430260185619
- Online Learning and Online Convex Optimization
- Two Algorithms for the Minimum Enclosing Ball Problem
- Some comments on Wolfe's ‘away step’
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- A Parametric Optimization Method for Machine Learning
- Finding the Point of a Polyhedron Closest to the Origin
- Sequential greedy approximation for certain convex optimization problems
- 10.1162/1532443041827925
- Coresets for polytope distance
- Sublinear optimization for machine learning
- Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
- Advanced Lectures on Machine Learning
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
- Convergence of a generalized SMO algorithm for SVM classifier design
