Skip to content

Author

Ethan N. Epperly

University of California, Berkeley

We have 2 of 36 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

A new analysis of the randomly pivoted Cholesky algorithm

The randomly pivoted Cholesky algorithm is one of the leading methods for computing a low-rank approximation to a large positive-semidefinite matrix. However, while it consistently achieves accuracy comparable to or better than competing methods of its type in experiments, its theoretical analysis lags somewhat behind...

Ethan N. Epperly · 0 citations
Preprint Aug 2026

Fast Length-Squared Sampling for Positive-Semidefinite Matrices

We describe a simple rejection-sampling-based algorithm to perform length-squared sampling on an $n \times n$ positive-semidefinite (psd) matrix: that is, to sample a column with probability proportional to its squared $\ell_2$-norm. The algorithm runs in just $O(n)$ expected time, which is significantly sublinear in t...

Rajarshi Bhattacharjee, Ethan N. Epperly, Cameron Musco et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.