Sublinear optimization for machine learning

DOI10.1145/2371656.2371658zbMath1281.68177arXiv1010.4408OpenAlexW2027560232MaRDI QIDQ5395692

David P. Woodruff, Elad Hazan, Kenneth L. Clarkson

Publication date: 17 February 2014

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.4408

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25)

Related Items

Sublinear time algorithms for approximate semidefinite programming ⋮ Unnamed Item ⋮ Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time ⋮ A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem ⋮ A nearly linear-time PTAS for explicit fractional packing and covering linear programs ⋮ Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices ⋮ A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training ⋮ Unnamed Item ⋮ Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach ⋮ On coresets for support vector machines ⋮ Unnamed Item ⋮ Streaming Algorithms with One-Sided Estimation ⋮ Distributionally robust optimization. A review on theory and applications