2 citations · 3 across the 2 of their papers we have counts for
3 papers · 1 filter
Error Estimation for Sketched SVD via the Bootstrap
Miles E. Lopes, N. Benjamin Erichson, Michael W. Mahoney
In order to compute fast approximations to the singular value decompositions (SVD) of very large matrices, randomized sketching algorithms have become a leading approach. However,…
Measuring the Algorithmic Convergence of Randomized Ensembles: The Regression Setting
Miles E. Lopes, Suofei Wu, Thomas C. M. Lee
When randomized ensemble methods such as bagging and random forests are implemented, a basic question arises: Is the ensemble large enough? In particular, the practitioner desires…
Error Estimation for Randomized Least-Squares Algorithms via the Bootstrap
Miles E. Lopes, Shusen Wang, Michael W. Mahoney
Over the course of the past decade, a variety of randomized algorithms have been proposed for computing approximate least-squares (LS) solutions in large-scale settings. A longstan…