Fetching the paper…
Reading the bibliography…
A distance matrix $A \in \mathbb R^{n \times m}$ represents all pairwise distances, $A_{ij}=\mathrm{d}(x_i,y_j)$, between two point sets $x_1,...,x_n$ and $y_1,...,y_m$ in an arbitrary metric space $(\mathcal Z, \mathrm{d})$.
RC Thompson, The behavior of eigenvalues and singular values under perturbations of restricted rank , Linear Algebra and its Applications 13
1976
Earlier work this paper cites.
Liisa Holm and Chris Sander, Protein structure comparison by alignment of distance matrices , Journal of molecular biology 233
1993
Earlier work this paper cites.
Piotr Indyk, A sublinear time approximation scheme for clustering in metric spaces , Foundations of Computer Science, 1999. 40th Annual Symposium on, IEEE, 1999, pp. 154–159
1999
Earlier work this paper cites.
Joshua B Tenenbaum, Vin De Silva, and John C Langford, A global geometric framework for nonlinear dimensionality reduction , science 290
2000
Earlier work this paper cites.
Alan J Hoffman and Helmut W Wielandt, The variation of the spectrum of a normal matrix , Selected Papers Of Alan J Hoffman: With Commentary, World Scientific, 2003, pp. 118–120
2003
Earlier work this paper cites.
Alan Frieze, Ravi Kannan, and Santosh Vempala, Fast monte-carlo algorithms for finding low-rank approximations , Journal of the ACM (JACM) 51
2004
Earlier work this paper cites.
Kilian Q Weinberger and Lawrence K Saul, Unsupervised learning of image manifolds by semidefinite programming , International journal of computer vision 70
2006
Earlier work this paper cites.
Ke Chen, On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications , SIAM Journal on Computing 39
2009
Cited alongside, same era.
Emmanuel J Candès and Benjamin Recht, Exact matrix completion via convex optimization , Foundations of Computational mathematics 9
2009
Cited alongside, same era.
Ohad N Feldheim and Sasha Sodin, A universality result for the smallest eigenvalues of certain sample covariance matrices , Geometric And Functional Analysis 20
2010
Cited alongside, same era.
Mark Rudelson and Roman Vershynin, Non-asymptotic theory of random matrices: extreme singular values , Proceedings of the International Congress of Mathematicians 2010 (ICM 2010) (In 4 Volumes) Vol. I: Plenary Lectures and Ceremonies Vols. II–IV: Invited Lectures, World Scientific, 2010, pp. 1576–1602
2010
Cited alongside, same era.
David P Woodruff, Sketching as a tool for numerical linear algebra , Foundations and Trends® in Theoretical Computer Science 10
2014
Later among the works it cites.
Ivan Dokmanic, Reza Parhizkar, Juri Ranieri, and Martin Vetterli, Euclidean distance matrices: essential theory, algorithms, and applications , IEEE Signal Processing Magazine 32
2015
Later among the works it cites.
Mark Braverman, Ankit Garg, Denis Pankratov, and Omri Weinstein, Information lower bounds via self-reducibility , Theory of Computing Systems 59
2016
Later among the works it cites.
2017
Later among the works it cites.
Kenneth L Clarkson and David P Woodruff, Low-rank approximation and regression in input sparsity time , Journal of the ACM (JACM) 63
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Terence Tao, 254a, notes 3a: Eigenvalues and sums of hermitian matrices , https://terrytao.wordpress.com/2010/01/12/254a-notes-3a-eigenvalues-and-sums-of-hermitian-matrices , 2010
2010
Cited alongside, same era.
Michael W Mahoney, Randomized algorithms for matrices and data , Foundations and Trends® in Machine Learning 3
2011
Cited alongside, same era.
Mark Braverman and Anup Rao, Information equals amortized communication , IEEE Transactions on Information Theory 60
2014
Cited alongside, same era.
2017
Later among the works it cites.
Cameron Musco and David P Woodruff, Sublinear time low-rank approximation of positive semidefinite matrices , Foundations of Computer Science (FOCS), 2017 IEEE 58th Annual Symposium on, IEEE, 2017, pp. 672–683
2017
Later among the works it cites.
Ainesh Bakshi and David Woodruff, Sublinear time low-rank approximation of distance matrices , Advances in Neural Information Processing Systems, 2018, pp. 3786–3796
2018
Later among the works it cites.