Showing 2021Show all
2 papers · 1 filter
cs.LG2021
Sublinear Time Approximation of Text Similarity Matrices
Archan Ray, Nicholas Monath, Andrew McCallum +1
We study algorithms for approximating pairwise similarity matrices that arise in natural language processing. Generally, computing a similarity matrix for data points requires…
cs.DS2021
Sublinear Time Eigenvalue Approximation via Random Sampling
Rajarshi Bhattacharjee, Gregory Dexter, Petros Drineas +2
We study the problem of approximating the eigenspectrum of a symmetric matrix with bounded entries (i.e., ).…