1 h 4 min
Sketching for Linear Algebra III: Randomized Hadamard, Kernel Methods
Computational Mathematics, Linear Algebra and seminar by Ken Clarkson, IBM Almaden
Tuesday 09:30–10:30 Los Angeles (GMT-7)
Recording available
Berkeley, United States
Recording
Abstract
Building on the preceding linear-algebra tutorials, this lecture presents two further approaches to matrix sketching: leverage-score sampling and the Subsampled Randomized Hadamard Transform. It examines how these methods produce effective compressed matrix representations for a variety of applications.
Topics
leverage-score samplingSubsampled Randomized Hadamard Transformmatrix sketching