Structured Matrix Learning from Matrix-Vector Products
Linear Algebra seminar by Chris Musco, New York University
Hosted by Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University
Wednesday 16:30 New York (GMT-5)
Recording available
Abstract
Chris Musco studies how to approximate an unknown matrix by a structured one using a limited, adaptively chosen sequence of matrix-vector products. This models operator learning in scientific machine learning as well as computational algorithms. Randomized SVD provides strong guarantees for low-rank targets; analogous results for sparse and hierarchical structures are less developed. The talk presents progress on efficient algorithms for these classes and a broader complexity theory. Joint work with Noah Amsel, Pratyush Avi, Tyler Chen, Prathamesh Dharangutte, Chinmay Hegde, Feyza Duman Keles, Diana Halikias, Cameron Musco, and David Persson.
Topics
Related seminars
Structured Matrix Approximations via Tensor Decompositions
More on randomized algorithms
Fast randomized algorithms for structured matrices
More on low-rank and structured matrices and randomized algorithms
Subspace injections
More on randomized algorithms