This paper argues that randomized linear sketching is a natural tool for on-the-fly compression of data matrices that arise from large-scale scientific simulations and data collection. The technical contribution consists in a new algorithm for constructing an accurate low-rank approximation of a matrix from streaming data. This method is accompanied by an a priori analysis that allows the user to set algorithm parameters with confidence and an a posteriori error estimator that allows the user to validate the quality of the reconstructed matrix. In comparison to previous techniques, the new method achieves smaller relative approximation errors and is less sensitive to parameter choices. As concrete applications, the paper outlines how the al...
Matrices of huge size and low rank are encountered in applications from the real world where large s...
We prove that any real matrix A contains a subset of at most 4k/ɛ+2k log(k+1) rows whose span “conta...
A data stream is a transiently observed sequence of data elements that arrive unordered, with repeti...
This paper argues that randomized linear sketching is a natural tool for on-the-fly compression of d...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
This paper develops a suite of algorithms for constructing low-rank approximations of an input matri...
This paper describes a suite of algorithms for constructing low-rank approximations of an input matr...
In this paper, we revisit the problem of constructing a near-optimal rank k approximation of a matri...
A common approach for compressing large-scale data is through matrix sketching. In this work, we con...
Low-rank matrix approximation is an integral component of tools such as principal component analysis...
As the amount of data collected in our world increases, reliable compression algorithms are needed w...
The purpose of this text is to provide an accessible introduction to a set of recently developed alg...
Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequen...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
This thesis is focused on using low rank matrices in numerical mathematics. We introduce conjugate g...
Matrices of huge size and low rank are encountered in applications from the real world where large s...
We prove that any real matrix A contains a subset of at most 4k/ɛ+2k log(k+1) rows whose span “conta...
A data stream is a transiently observed sequence of data elements that arrive unordered, with repeti...
This paper argues that randomized linear sketching is a natural tool for on-the-fly compression of d...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
This paper develops a suite of algorithms for constructing low-rank approximations of an input matri...
This paper describes a suite of algorithms for constructing low-rank approximations of an input matr...
In this paper, we revisit the problem of constructing a near-optimal rank k approximation of a matri...
A common approach for compressing large-scale data is through matrix sketching. In this work, we con...
Low-rank matrix approximation is an integral component of tools such as principal component analysis...
As the amount of data collected in our world increases, reliable compression algorithms are needed w...
The purpose of this text is to provide an accessible introduction to a set of recently developed alg...
Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequen...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
This thesis is focused on using low rank matrices in numerical mathematics. We introduce conjugate g...
Matrices of huge size and low rank are encountered in applications from the real world where large s...
We prove that any real matrix A contains a subset of at most 4k/ɛ+2k log(k+1) rows whose span “conta...
A data stream is a transiently observed sequence of data elements that arrive unordered, with repeti...