Ethan N. Epperly

Ethan N. Epperly

Auto-generated profile, based on publicly available information

Ethan N. Epperly

Department of Computing and Mathematical Sciences, California Institute of Technology, Pasadena, CA 91125 USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2022 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
EEEthan N. Epperly
Ethan N. Epperly
LLLin Lin
Lin Lin
YNYuji Nakatsukasa
Yuji Nakatsukasa
Quantum subspace diagonalization methods are an exciting new class of algorithms for solving large-scale eigenvalue problems using quantum computers. Unfortunately, these methods require the soluti...

3 January 2024 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
EEEthan N. Epperly
Ethan N. Epperly
JTJoel A. Tropp
Joel A. Tropp
RWRobert Webber
Robert Webber
The implicit trace estimation problem asks for an approximation of the trace of a square matrix, accessed via matrix-vector products (matvecs). This paper designs new randomized algorithms, XTrace and XNysTrace, for the trace estimation problem by exploiting both variance reduction and the exchangeability principle. For a fixed budget of matvecs, numerical experiments show that the new methods can achieve errors that are orders of magnitude smaller than existing algorithms, such as the Girard–Hutchinson estimator or the Hutch++ estimator. A theoretical analysis confirms the benefits by offering a precise description of the performance of these algorithms as a function of the spectrum of the input matrix. The paper also develops an exchangeable estimator, XDiag, for approximating the diagonal of a square matrix using matvecs.

1 July 2020 in Acta Materialia
Verified
Journal Article
Closed access
EEE.N. Epperly
E.N. Epperly
RSRyan Sills
Ryan Sills

7 October 2024 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
EEEthan N. Epperly
Ethan N. Epperly
Iterative sketching and sketch-and-precondition are randomized algorithms used for solving overdetermined linear least-squares problems. When implemented in exact arithmetic, these algorithms produce high-accuracy solutions to least-squares problems faster than standard direct methods based on QR factorization. Recently, Meier et al. demonstrated numerical instabilities in a version of sketch-and-precondition in floating point arithmetic. The work of Meier et al. raises the question, is there a randomized least-squares solver that is both fast and stable? This paper resolves this question in the affirmative by proving that iterative sketching, appropriately implemented, is forward stable. Numerical experiments confirm the theoretical findings, demonstrating that iterative sketching is stable and faster than QR -based solvers for large problem instances.

8 February 2024 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
EEEthan N. Epperly
Ethan N. Epperly
JTJoel A. Tropp
Joel A. Tropp
Randomized matrix algorithms have become workhorse tools in scientific computing and machine learning. To use these algorithms safely in applications, they should be coupled with posterior error estimates to assess the quality of the output. To meet this need, this paper proposes two diagnostics: a leave-one-out error estimator for randomized low-rank approximations and a jackknife resampling method to estimate the variance of the output of a randomized matrix computation. Both of these diagnostics are rapid to compute for randomized low-rank approximation algorithms such as the randomized SVD and randomized Nyström approximation, and they provide useful information that can be used to assess the quality of the computed output and guide algorithmic parameter choices.

17 November 2025 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
EEEthan N. Epperly
Ethan N. Epperly
JTJoel A. Tropp
Joel A. Tropp
RWRobert Webber
Robert Webber
Randomly pivoted Cholesky (RPCholesky) is an algorithm for constructing a low-rank approximation of a positive-semidefinite matrix using a small number of columns. This paper develops an accelerated version of RPCholesky that employs block matrix computations and rejection sampling to efficiently simulate the execution of the original algorithm. For the task of approximating a kernel matrix, the accelerated algorithm can run over [Formula: see text] faster. The paper contains implementation details, theoretical guarantees, experiments on benchmark data sets, and an application to computational chemistry. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SIMAX and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/eepperly/Randomly-Pivoted-Cholesky and in the supplementary materials ( github-repo.zip [82.9KB]). [Formula: see text]