Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions

Dong, Yijun; Martinsson, Per-Gunnar

doi:10.1007/s10444-023-10061-z

Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions

Journal Article · 01 August 2023 · Advances in Computational Mathematics

DOI:https://doi.org/10.1007/s10444-023-10061-z· OSTI ID:2422113

Dong, Yijun ^[1];

OSTI

Not provided.

Research Organization:: Univ. of Texas, Austin, TX (United States)

Sponsoring Organization:: USDOE Office of Science (SC)

DOE Contract Number:: SC0022251

OSTI ID:: 2422113

Journal Information:: Advances in Computational Mathematics, Journal Name: Advances in Computational Mathematics Journal Issue: 4 Vol. 49; ISSN 1019-7168

Publisher:: Springer

Country of Publication:: United States

Language:: English

References (50)

Strong rank revealing LU factorizations Miranian, L.; Gu, M. Linear Algebra and its Applications, Vol. 367 https://doi.org/10.1016/S0024-3795(02)00572-4	journal	July 2003
Rank revealing QR factorizations Chan, Tony F. Linear Algebra and its Applications, Vol. 88-89 https://doi.org/10.1016/0024-3795(87)90103-0	journal	April 1987
A fast randomized algorithm for the approximation of matrices Woolfe, Franco; Liberty, Edo; Rokhlin, Vladimir Applied and Computational Harmonic Analysis, Vol. 25, Issue 3 https://doi.org/10.1016/j.acha.2007.12.002	journal	November 2008
Randomized LU decomposition Shabat, Gil; Shmueli, Yaniv; Aizenbud, Yariv Applied and Computational Harmonic Analysis, Vol. 44, Issue 2 https://doi.org/10.1016/j.acha.2016.04.006	journal	March 2018
Average-Case Stability of Gaussian Elimination Trefethen, Lloyd N.; Schreiber, Robert S. SIAM Journal on Matrix Analysis and Applications, Vol. 11, Issue 3 https://doi.org/10.1137/0611023	journal	July 1990
Efficient Volume Sampling for Row/Column Subset Selection Deshpande, Amit; Rademacher, Luis 2010 IEEE 51st Annual Symposium on Foundations of Computer Science https://doi.org/10.1109/FOCS.2010.38	conference	October 2010
OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings Nelson, Jelani; Nguyen, Huy L. 2013 IEEE 54th Annual Symposium on Foundations of Computer Science https://doi.org/10.1109/FOCS.2013.21	conference	October 2013
Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform Boutsidis, Christos; Gittens, Alex SIAM Journal on Matrix Analysis and Applications, Vol. 34, Issue 3 https://doi.org/10.1137/120874540	journal	January 2013
Twice-ramanujan sparsifiers Batson, Joshua D.; Spielman, Daniel A.; Srivastava, Nikhil Proceedings of the forty-first annual ACM symposium on Theory of computing https://doi.org/10.1145/1536414.1536451	conference	May 2009
Improved Guarantees and a Multiple-descent Curve for Column Subset Selection and the Nystrom Method (Extended Abstract) Dereziński, Michał; Khanna, Rajiv; Mahoney, Michael W. Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence https://doi.org/10.24963/ijcai.2021/647	conference	August 2021
On selecting a maximum volume sub-matrix of a matrix and related problems Çivril, Ali; Magdon-Ismail, Malik Theoretical Computer Science, Vol. 410, Issue 47-49 https://doi.org/10.1016/j.tcs.2009.06.018	journal	November 2009
Determinantal Point Processes in Randomized Numerical Linear Algebra Dereziński, Michał; Mahoney, Michael W. Notices of the American Mathematical Society, Vol. 68, Issue 01 https://doi.org/10.1090/noti2202	journal	January 2021
Efficient algorithms for cur and interpolative matrix decompositions Voronin, Sergey; Martinsson, Per-Gunnar Advances in Computational Mathematics, Vol. 43, Issue 3 https://doi.org/10.1007/s10444-016-9494-8	journal	November 2016
Approximation of boundary element matrices Bebendorf, Mario Numerische Mathematik, Vol. 86, Issue 4 https://doi.org/10.1007/PL00005410	journal	October 2000
Relative-Error $CUR$ Matrix Decompositions Drineas, Petros; Mahoney, Michael W.; Muthukrishnan, S. SIAM Journal on Matrix Analysis and Applications, Vol. 30, Issue 2 https://doi.org/10.1137/07070471X	journal	January 2008
The Adaptive Cross Approximation Algorithm for Accelerated Method of Moments Computations of EMC Problems Zhao, K.; Vouvakis, M. N.; Lee, J. -F. IEEE Transactions on Electromagnetic Compatibility, Vol. 47, Issue 4 https://doi.org/10.1109/TEMC.2005.857898	journal	November 2005
Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization Gu, Ming; Eisenstat, Stanley C. SIAM Journal on Scientific Computing, Vol. 17, Issue 4 https://doi.org/10.1137/0917055	journal	July 1996
Unitary Triangularization of a Nonsymmetric Matrix Householder, Alston S. Journal of the ACM (JACM), Vol. 5, Issue 4 https://doi.org/10.1145/320941.320947	journal	October 1958
LU Factorization with Partial Pivoting for a Multicore System with Accelerators Kurzak, J.; Luszczek, P.; Faverge, M. IEEE Transactions on Parallel and Distributed Systems, Vol. 24, Issue 8 https://doi.org/10.1109/TPDS.2012.242	journal	August 2013
CUR matrix decompositions for improved data analysis Mahoney, Michael W.; Drineas, Petros Proceedings of the National Academy of Sciences, Vol. 106, Issue 3 https://doi.org/10.1073/pnas.0803205106	journal	January 2009
Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection Cortinovis, Alice; Kressner, Daniel SIAM Journal on Matrix Analysis and Applications, Vol. 41, Issue 4 https://doi.org/10.1137/19M1281848	journal	January 2020
Numerically safe Gaussian elimination with no pivoting Pan, Victor Y.; Zhao, Liang Linear Algebra and its Applications, Vol. 527 https://doi.org/10.1016/j.laa.2017.04.007	journal	August 2017
Numerical Linear Algebra Kahan, W. Canadian Mathematical Bulletin, Vol. 9, Issue 05 https://doi.org/10.4153/CMB-1966-083-2	journal	December 1966
Invertibility of random matrices: norm of the inverse Rudelson, Mark Annals of Mathematics, Vol. 168, Issue 2 https://doi.org/10.4007/annals.2008.168.575	journal	September 2008
Optimal CUR matrix decompositions Boutsidis, Christos; Woodruff, David P. Proceedings of the forty-sixth annual ACM symposium on Theory of computing https://doi.org/10.1145/2591796.2591819	conference	May 2014
Near-Optimal Column-Based Matrix Reconstruction Boutsidis, Christos; Drineas, Petros; Magdon-Ismail, Malik SIAM Journal on Computing, Vol. 43, Issue 2 https://doi.org/10.1137/12086755X	journal	January 2014
Random multipliers numerically stabilize Gaussian and block Gaussian elimination: Proofs and an extension to low-rank approximation Pan, Victor Y.; Qian, Guoliang; Yan, Xiaodong Linear Algebra and its Applications, Vol. 481 https://doi.org/10.1016/j.laa.2015.04.021	journal	September 2015
On the stability of Gauss-Jordan elimination with pivoting Peters, G.; Wilkinson, J. H. Communications of the ACM, Vol. 18, Issue 1 https://doi.org/10.1145/360569.360653	journal	January 1975
Improved Analysis of the Subsampled Randomized Hadamard Transform Tropp, Joel A. Advances in Adaptive Data Analysis, Vol. 03, Issue 01n02 https://doi.org/10.1142/S1793536911000787	journal	April 2011
Matrix Computations Golub, Gene H.; Van Loan, Charles F. https://doi.org/10.56021/9781421407944	book	February 2013
Approximate nearest neighbors: towards removing the curse of dimensionality Indyk, Piotr; Motwani, Rajeev Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 https://doi.org/10.1145/276698.276876	conference	January 1998
Uniform Sampling for Matrix Approximation Cohen, Michael B.; Lee, Yin Tat; Musco, Cameron Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science https://doi.org/10.1145/2688073.2688113	conference	January 2015
Randomized algorithms for the low-rank approximation of matrices Liberty, E.; Woolfe, F.; Martinsson, P. -G. Proceedings of the National Academy of Sciences, Vol. 104, Issue 51 https://doi.org/10.1073/pnas.0709640104	journal	December 2007
Computational Advertising: Techniques for Targeting Relevant Ads Woodruff, David P. Foundations and Trends® in Theoretical Computer Science, Vol. 10, Issue 1-2 https://doi.org/10.1561/0400000060	journal	January 2014
A New Selection Operator for the Discrete Empirical Interpolation Method---Improved A Priori Error Bound and Extensions Drmač, Zlatko; Gugercin, Serkan SIAM Journal on Scientific Computing, Vol. 38, Issue 2 https://doi.org/10.1137/15M1019271	journal	January 2016
Randomized numerical linear algebra: Foundations and algorithms Martinsson, Per-Gunnar; Tropp, Joel A. Acta Numerica, Vol. 29 https://doi.org/10.1017/S0962492920000021	journal	May 2020
On the existence and computation of rank-revealing LU factorizations Pan, C. -T. Linear Algebra and its Applications, Vol. 316, Issue 1-3 https://doi.org/10.1016/S0024-3795(00)00120-8	journal	September 2000
Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix Çivril, Ali; Magdon-Ismail, Malik Algorithmica, Vol. 65, Issue 1 https://doi.org/10.1007/s00453-011-9582-6	journal	October 2011
A theory of pseudoskeleton approximations Goreinov, S. A.; Tyrtyshnikov, E. E.; Zamarashkin, N. L. Linear Algebra and its Applications, Vol. 261, Issue 1-3 https://doi.org/10.1016/S0024-3795(96)00301-1	journal	August 1997
Incomplete Cross Approximation in the Mosaic-Skeleton Method Tyrtyshnikov, E. Computing, Vol. 64, Issue 4 https://doi.org/10.1007/s006070070031	journal	June 2000
$LU$ Factorization Algorithms on Distributed-Memory Multiprocessor Architectures Geist, George A.; Romine, Charles H. SIAM Journal on Scientific and Statistical Computing, Vol. 9, Issue 4 https://doi.org/10.1137/0909042	journal	July 1988
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions Halko, N.; Martinsson, P. G.; Tropp, J. A. SIAM Review, Vol. 53, Issue 2 https://doi.org/10.1137/090771806	journal	January 2011
A fast randomized algorithm for overdetermined linear least-squares regression Rokhlin, V.; Tygert, M. Proceedings of the National Academy of Sciences, Vol. 105, Issue 36 https://doi.org/10.1073/pnas.0804869105	journal	September 2008
Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression Meng, Xiangrui; Mahoney, Michael W. Proceedings of the forty-fifth annual ACM symposium on Theory of Computing https://doi.org/10.1145/2488608.2488621	conference	June 2013
A DEIM Induced CUR Factorization Sorensen, D. C.; Embree, Mark SIAM Journal on Scientific Computing, Vol. 38, Issue 3 https://doi.org/10.1137/140978430	journal	January 2016
Randomized LU decomposition using sparse projections Aizenbud, Yariv; Shabat, Gil; Averbuch, Amir Computers & Mathematics with Applications, Vol. 72, Issue 9 https://doi.org/10.1016/j.camwa.2016.09.014	journal	November 2016
Low-Rank Approximation and Regression in Input Sparsity Time Clarkson, Kenneth L.; Woodruff, David P. Journal of the ACM, Vol. 63, Issue 6 https://doi.org/10.1145/3019134	journal	January 2017
Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation Tropp, Joel A.; Yurtsever, Alp; Udell, Madeleine SIAM Journal on Scientific Computing, Vol. 41, Issue 4 https://doi.org/10.1137/18M1201068	journal	January 2019
The approximation of one matrix by another of lower rank Eckart, Carl; Young, Gale Psychometrika, Vol. 1, Issue 3 https://doi.org/10.1007/BF02288367	journal	September 1936
CALU: A Communication Optimal LU Factorization Algorithm Grigori, Laura; Demmel, James W.; Xiang, Hua SIAM Journal on Matrix Analysis and Applications, Vol. 32, Issue 4 https://doi.org/10.1137/100788926	journal	October 2011

Similar Records

Randomized Interpolative Decomposition of Separated Representations

Journal Article · 2015 · Journal of Computational Physics · OSTI ID:1163409

Randomized interpolative decomposition of separated representations

Journal Article · 2014 · Journal of Computational Physics · OSTI ID:1703367

Efficient Bounds and Estimates for Canonical Angles in Randomized Subspace Approximations

Journal Article · 2024 · SIAM Journal on Matrix Analysis and Applications · OSTI ID:2580025

Related Subjects

Mathematics

Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions

Citation Formats

References (50)

Similar Records

Related Subjects