An adaptive randomized pivoting strategy for low-rank approximation
Linear Algebra seminar by Alice Cortinovis, University of Pisa
Hosted by Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University
Thursday 14:30 New York (GMT-5)
Recording available
Abstract
Alice Cortinovis presents Adaptive Randomized Pivoting for selecting representative matrix columns through adaptive leverage-score sampling. Its expected Frobenius approximation error matches the optimal existence guarantee. The method is a randomized counterpart to an approach by Osinsky and offers a simpler, less costly alternative to volume sampling with the same theoretical guarantee. The talk extends the strategy to the Discrete Empirical Interpolation Method, cross or skeleton approximation, and Nyström approximation of positive-semidefinite matrices.
Topics
Related seminars
Estimating a matrix's singular values with interpolative decompositions
More on randomized algorithms
Recent Advances in Positive Semidefinite Matrix Approximation
Related research
Randomized Numerical Linear Algebra
Related research