Fetching the paper…
Reading the bibliography…
In the subspace approximation problem, we seek a k-dimensional subspace F of R^d that minimizes the sum of p-th powers of Euclidean distances to a given set of n points a_1, ..., a_n in R^d, for p >= 1.
Computers and Intractability: A Guide to the Theory of NP-Completeness
M. R. Garey and David S. Johnson · 1979
Earlier work this paper cites.
On the combinatorial and algebraic complexity of quantifier elimination
Saugata Basu, Richard Pollack, and Marie-Françoise Roy · 1996
Earlier work this paper cites.
An Elementary Introduction to Modern Convex Geometry
Keith Ball · 1997
Earlier work this paper cites.
Subgradient and sampling algorithms for ℓ 1 \ell_{1} regression
Kenneth L. Clarkson · 2006
Earlier work this paper cites.
Adaptive sampling and fast low-rank matrix approximation
Amit Deshpande and Santosh Vempala · 2006
Earlier work this paper cites.
R 1 {R}_{1} -PCA: rotational invariant L 1 {L}_{1} -norm principal component analysis for robust subspace factorization
Chris Ding, Ding Zhou, Xiaofeng He, and Hongyuan Zha · 2006
Earlier work this paper cites.
Improved approximation algorithms for large matrices via random projections
Tamás Sarlós · 2006
Earlier work this paper cites.
Sampling-based dimension reduction for subspace approximation
Amit Deshpande and Kasturi R. Varadarajan · 2007
Earlier work this paper cites.
Efficient subspace approximation algorithms
Nariankadu D. Shyamalkumar and Kasturi R. Varadarajan · 2007
Earlier work this paper cites.
Reliable eigenspectra for new generation surveys
T. Budavári, V. Wild, A. S. Szalay, L. Dobos, and C.-W. Yip · 2009
Earlier work this paper cites.
Numerical linear algebra in the streaming model
Kenneth L. Clarkson and David P. Woodruff · 2009
Earlier work this paper cites.
Sampling algorithms and coresets for lp regression
Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, and Michael W. Mahoney · 2009
Cited alongside, same era.
Coresets and sketches for high dimensional subspace approximation problems
Dan Feldman, Morteza Monemizadeh, Christian Sohler, and David P. Woodruff · 2010
Cited alongside, same era.
Algorithms and hardness for subspace approximation
Amit Deshpande, Madhur Tulsiani, and Nisheeth K. Vishnoi · 2011
Cited alongside, same era.
A unified framework for approximating and clustering data
Dan Feldman and Michael Langberg · 2011
Cited alongside, same era.
Subadditive periodic functions
J. Matkowski · 2011
Cited alongside, same era.
Subspace embeddings for the l1-norm with applications
Christian Sohler and David P. Woodruff · 2011
Cited alongside, same era.
Simple and deterministic matrix sketching
Edo Liberty · 2013
Later among the works it cites.
Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
Xiangrui Meng and Michael W. Mahoney · 2013
Later among the works it cites.
OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings
Jelani Nelson and Huy L. Nguyen · 2013
Later among the works it cites.
Subspace embeddings and ℓ p \ell_{p} -regression using exponential random variables
David P. Woodruff and Qin Zhang · 2013
Later among the works it cites.
Personal communication, 2014
Dan Feldman · 2014
Later among the works it cites.
Relative errors for deterministic low-rank matrix approximations
Mina Ghashami and Jeff M. Phillips · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Data reduction for weighted and outlier-resistant clustering
Dan Feldman and Leonard J. Schulman · 2012
Cited alongside, same era.
Bypassing UGC from some optimal geometric inapproximability results
Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, and Yi Wu · 2012
Cited alongside, same era.
On the sensitivity of shape fitting problems
Kasturi Varadarajan and Xin Xiao · 2012
Cited alongside, same era.
Toward a unified theory of sparse dimensionality reduction in Euclidean space
Jean Bourgain and Jelani Nelson · 2013
Cited alongside, same era.
Low rank approximation and regression in input sparsity time
Kenneth L. Clarkson and David P. Woodruff · 2013
Cited alongside, same era.
Later among the works it cites.
Sparser Johnson-Lindenstrauss transforms
Daniel M. Kane and Jelani Nelson · 2014
Later among the works it cites.
Toward a unified theory of sparse dimensionality reduction in Euclidean space
Jean Bourgain and Jelani Nelson · 2015
Closest in time.
Sketching for M M -estimators: A unified approach to robust regression
Kenneth Clarkson and David P. Woodruff · 2015
Closest in time.
L p {}_{\mbox{p}} row sampling by lewis weights
Michael B. Cohen and Richard Peng · 2015
Closest in time.