Fetching the paper…
Reading the bibliography…
We give a deterministic nearly-linear time algorithm for approximating any point inside a convex polytope with a sparse convex combination of the polytope's vertices.
A note on analytic functions in the unit circle
R Paley and A Zygmund · 1932
Earlier work this paper cites.
On general minimax theorems
Maurice Sion · 1958
Earlier work this paper cites.
On convergence proofs on perceptrons
A.B.J. Novikoff · 1962
Earlier work this paper cites.
Convex Analysis
R.T. Rockafellar · 1970
Earlier work this paper cites.
Finding the nearest point in a polytope
Philip Wolfe · 1976
Earlier work this paper cites.
Remarques sur un résultat non publié de b. maurey
Gilles Pisier · 1980
Earlier work this paper cites.
Submodular systems and related topics
Satoru Fujishige · 1984
Earlier work this paper cites.
Fast approximation algorithms for fractional packing and covering problems
Serge A. Plotkin, David B. Shmoys, and Éva Tardos · 1991
Earlier work this paper cites.
Multiterminal global routing: A deterministic approximation scheme
Prabhakar Raghavan and Clark D. Thompson · 1991
Earlier work this paper cites.
New support vector algorithms
Bernhard Schölkopf, Alexander J. Smola, Robert C. Williamson, and Peter L. Bartlett · 2000
Earlier work this paper cites.
Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications
A. Ben-Tal and A. Nemirovski · 2001
Earlier work this paper cites.
Sequential and parallel algorithms for mixed packing and covering
N.E. Young · 2001
Cited alongside, same era.
The robustness of the p-norm algorithms
Claudio Gentile · 2003
Cited alongside, same era.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2004
Cited alongside, same era.
Online Learning: Theory, Algorithms, and Applications
Shai Shalev-Shwartz · 2007
Cited alongside, same era.
LIBLINEAR: A library for large linear classification
Rong-En Fan, Kai-Wei Chang, Cho-Jui Hsieh, Xiang-Rui Wang, and Chih-Jen Lin · 2008
Cited alongside, same era.
P-packsvm: Parallel primal gradient descent kernel SVM
Zeyuan Allen Zhu, Weizhu Chen, Gang Wang, Chenguang Zhu, and Zheng Chen · 2009
Cited alongside, same era.
Toward a unified theory of sparse dimensionality reduction in euclidean space
Jean Bourgain and Jelani Nelson · 2013
Later among the works it cites.
Playing non-linear games with linear oracles
Dan Garber and Elad Hazan · 2013
Later among the works it cites.
Submodular Function Minimization
S McCormick · 2013
Later among the works it cites.
Theory of convex optimization for machine learning
Sébastien Bubeck · 2014
Later among the works it cites.
Provable submodular minimization using wolfe’s algorithm
Deeparnab Chakrabarty, Prateek Jain, and Pravesh Kothari · 2014
Later among the works it cites.
Exact SVM training by wolfe’s minimum norm point algorithm
Masashi Kitamura, Akiko Takeda, and Satoru Iwata · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Convex analysis and optimization with submodular functions: a tutorial
Francis Bach · 2010
Cited alongside, same era.
A submodular function minimization algorithm based on the minimum-norm base
Satoru Fujishige and Shigueo Isotani · 2011
Cited alongside, same era.
Pegasos: primal estimated sub-gradient solver for SVM
Shai Shalev-Shwartz, Yoram Singer, Nathan Srebro, and Andrew Cotter · 2011
Cited alongside, same era.
Sparse choice models
Vivek F Farias, Srikanth Jagabathula, and Devavrat Shah · 2012
Cited alongside, same era.
Regularization techniques for learning with matrices
Sham M. Kakade, Shai Shalev-Shwartz, and Ambuj Tewari · 2012
Cited alongside, same era.
http://submodularity.org/
Andreas Krause
Cited in the paper.
Later among the works it cites.
Approximating nash equilibria and dense bipartite subgraphs via an approximate version of caratheodory’s theorem
Siddharth Barman · 2015
Closest in time.
Donggu Kang and James Payor · 2015
Closest in time.
On the number of iterations for dantzig-wolfe optimization and packing-covering approximation algorithms
Philip N. Klein and Neal E. Young · 2015
Closest in time.
Sparse approximation via generating point sets
Avrim Blum, Sariel Har-Peled, and Benjamin Raichel · 2016
Closest in time.