| Publication | Date of Publication | Type |
|---|
Sublinear time eigenvalue approximation via random sampling
| 2024-11-14 | Paper |
Small singular values can increase in lower precision
SIAM Journal on Matrix Analysis and Applications | 2024-08-24 | Paper |
Low‐rank updates of matrix square roots
Numerical Linear Algebra with Applications | 2024-04-11 | Paper |
A fast, provably accurate approximation algorithm for sparse principal component analysis reveals human genetic variation across the world
| 2022-08-30 | Paper |
On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming
| 2022-02-03 | Paper |
Sublinear Time Eigenvalue Approximation via Random Sampling
| 2021-09-15 | Paper |
Randomized Linear Algebra Approaches to Estimate the von Neumann Entropy of Density Matrices
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Lectures on randomized numerical linear algebra
| 2020-09-10 | Paper |
Feature Selection for Ridge Regression with Provable Guarantees
Neural Computation | 2019-06-04 | Paper |
Feature selection for linear SVM with provable guarantees
Pattern Recognition | 2019-05-29 | Paper |
Structural conditions for projection-cost preservation via randomized matrix multiplication
Linear Algebra and its Applications | 2019-05-29 | Paper |
The fast Cauchy transform and faster robust linear regression
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
An improved approximation algorithm for the column subset selection problem
| 2019-05-06 | Paper |
Low-Rank Matrix Approximations Do Not Need a Singular Value Gap
SIAM Journal on Matrix Analysis and Applications | 2019-03-12 | Paper |
Recovering PCA and sparse PCA via hybrid-\((\ell_1,\ell_2)\) sparse sampling of data elements
| 2018-04-17 | Paper |
Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
SIAM Journal on Matrix Analysis and Applications | 2018-04-06 | Paper |
A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix
Linear Algebra and its Applications | 2017-09-21 | Paper |
Near-Optimal Coresets for Least-Squares Regression
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
The fast Cauchy transform and faster robust linear regression
SIAM Journal on Computing | 2016-06-16 | Paper |
Near-optimal column-based matrix reconstruction
SIAM Journal on Computing | 2014-07-30 | Paper |
Near Optimal Column-Based Matrix Reconstruction
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Fast approximation of matrix coherence and statistical leverage
| 2014-04-01 | Paper |
A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality
Information Processing Letters | 2013-03-28 | Paper |
On the Nyström method for approximating a gram matrix for improved kernel-based learning
| 2011-10-12 | Paper |
CUR matrix decompositions for improved data analysis
Proceedings of the National Academy of Sciences | 2011-01-09 | Paper |
scientific article; zbMATH DE number 5764828 (Why is no real title available?)
| 2010-08-06 | Paper |
Competitive recommendation systems
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Sampling Algorithms and Coresets for $\ell_p$ Regression
SIAM Journal on Computing | 2009-11-06 | Paper |
Tensor-CUR Decompositions for Tensor-Based Data
SIAM Journal on Matrix Analysis and Applications | 2009-07-22 | Paper |
Random projections for the nonnegative least-squares problem
Linear Algebra and its Applications | 2009-07-02 | Paper |
CUR matrix decompositions for improved data analysis
Proceedings of the National Academy of Sciences | 2009-01-20 | Paper |
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
Random Structures & Algorithms | 2008-06-05 | Paper |
A randomized algorithm for a tensor-based generalization of the singular value decomposition
Linear Algebra and its Applications | 2007-01-09 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
SIAM Journal on Computing | 2006-06-01 | Paper |
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
SIAM Journal on Computing | 2006-06-01 | Paper |
Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
SIAM Journal on Computing | 2006-06-01 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Fast Universalization of Investment Strategies
SIAM Journal on Computing | 2005-02-21 | Paper |
Clustering large graphs via the singular value decomposition
Machine Learning | 2005-01-19 | Paper |
scientific article; zbMATH DE number 2086680 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2079343 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 1953870 (Why is no real title available?)
| 2003-07-28 | Paper |
scientific article; zbMATH DE number 1305418 (Why is no real title available?)
| 1999-06-17 | Paper |
Small singular values can increase in lower precision
| N/A | Paper |
WITHDRAWN: Identifying Influential Entries in a Matrix
| N/A | Paper |
