| Publication | Date of Publication | Type |
|---|
Fast and accurate randomized algorithms for linear systems and eigenvalue problems
SIAM Journal on Matrix Analysis and Applications | 2024-06-25 | Paper |
Efficient Error and Variance Estimation for Randomized Matrix Computations
SIAM Journal on Scientific Computing | 2024-02-16 | Paper |
XT<scp>race</scp>: Making the Most of Every Sample in Stochastic Trace Estimation
SIAM Journal on Matrix Analysis and Applications | 2024-01-19 | Paper |
Learning to Forecast Dynamical Systems from Streaming Data
SIAM Journal on Applied Dynamical Systems | 2023-07-10 | Paper |
Randomized Nyström Preconditioning
SIAM Journal on Matrix Analysis and Applications | 2023-07-06 | Paper |
Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications
| 2023-06-21 | Paper |
Robust, randomized preconditioning for kernel ridge regression
| 2023-04-24 | Paper |
Randomized numerical linear algebra: Foundations and algorithms
Acta Numerica | 2023-04-14 | Paper |
Sparse random Hamiltonians are quantumly easy
| 2023-02-07 | Paper |
Matrix concentration for products
Foundations of Computational Mathematics | 2022-11-17 | Paper |
Sharp phase transitions in Euclidean integral geometry
| 2022-08-29 | Paper |
Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluations
| 2022-07-13 | Paper |
Low-rank Tucker approximation of a tensor from streaming data
SIAM Journal on Mathematics of Data Science | 2022-03-01 | Paper |
Randomized block Krylov methods for approximating extreme eigenvalues
Numerische Mathematik | 2022-01-19 | Paper |
An optimal-storage approach to semidefinite programming using approximate complementarity
SIAM Journal on Optimization | 2021-11-05 | Paper |
Fast & Accurate Randomized Algorithms for Linear Systems and Eigenvalue Problems
| 2021-10-29 | Paper |
Nonlinear matrix concentration via semigroup methods
Electronic Journal of Probability | 2021-07-21 | Paper |
From Poincaré inequalities to nonlinear matrix concentration
Bernoulli | 2021-07-09 | Paper |
Scalable semidefinite programming
SIAM Journal on Mathematics of Data Science | 2021-07-06 | Paper |
Binary component decomposition. I: The positive-semidefinite case
SIAM Journal on Mathematics of Data Science | 2021-07-06 | Paper |
Concentration for random product formulas
| 2020-08-26 | Paper |
Concentration of the intrinsic volumes of a convex body
Lecture Notes in Mathematics | 2020-08-21 | Paper |
Randomized Numerical Linear Algebra: Foundations & Algorithms
| 2020-02-04 | Paper |
Universality laws for randomized dimension reduction, with applications
Information and Inference: A Journal of the IMA | 2019-11-07 | Paper |
Streaming low-rank matrix approximation with an application to scientific simulation
SIAM Journal on Scientific Computing | 2019-08-28 | Paper |
Column subset selection, matrix factorization, and eigenvalue optimization
| 2019-05-06 | Paper |
Low-Rank Tucker Approximation of a Tensor From Streaming Data
| 2019-04-24 | Paper |
Simplicial faces of the set of correlation matrices
Discrete \& Computational Geometry | 2018-10-30 | Paper |
Second-order matrix concentration inequalities
Applied and Computational Harmonic Analysis | 2018-04-12 | Paper |
Practical sketching algorithms for low-rank matrix approximation
SIAM Journal on Matrix Analysis and Applications | 2017-12-20 | Paper |
Corrigendum in “Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise” [Mar 06 1030-1051]
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
The expected norm of a sum of independent random matrices: an elementary approach
High Dimensional Probability VII | 2017-01-11 | Paper |
Book Review: A mathematical introduction to compressive sensing
Bulletin of the American Mathematical Society | 2016-12-20 | Paper |
Efron-Stein inequalities for random matrices
The Annals of Probability | 2016-11-16 | Paper |
Convex Recovery of a Structured Signal from Independent Random Linear Measurements
Sampling Theory, a Renaissance | 2016-04-14 | Paper |
Integer factorization of a positive-definite matrix
SIAM Journal on Discrete Mathematics | 2015-10-02 | Paper |
An introduction to matrix concentration inequalities
Foundations and Trends® in Machine Learning | 2015-07-30 | Paper |
Robust computation of linear models by convex relaxation
Foundations of Computational Mathematics | 2015-06-26 | Paper |
Living on the edge: phase transitions in convex programs with random data
Information and Inference: A Journal of the IMA | 2015-03-06 | Paper |
From Steiner formulas for cones to concentration of intrinsic volumes
Discrete \& Computational Geometry | 2014-09-12 | Paper |
Sharp recovery bounds for convex demixing, with applications
Foundations of Computational Mathematics | 2014-09-04 | Paper |
Model-based scaling of the streamwise energy density in high-Reynolds-number turbulent channels
Journal of Fluid Mechanics | 2014-08-29 | Paper |
Matrix concentration inequalities via the method of exchangeable pairs
The Annals of Probability | 2014-05-19 | Paper |
Subadditivity of matrix \(\phi\)-entropy and concentration of random matrices
Electronic Journal of Probability | 2014-05-02 | Paper |
Paved with good intentions: analysis of a randomized block Kaczmarz method
Linear Algebra and its Applications | 2014-03-03 | Paper |
The masked sample covariance estimator: an analysis using matrix concentration inequalities
Information and Inference | 2014-01-06 | Paper |
The restricted isometry property for time-frequency structured random matrices
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2013-09-09 | Paper |
Two proposals for robust PCA using semidefinite programming
Electronic Journal of Statistics | 2013-05-28 | Paper |
Deriving Matrix Concentration Inequalities from Kernel Couplings
| 2013-05-02 | Paper |
User-friendly tail bounds for sums of random matrices
Foundations of Computational Mathematics | 2012-12-21 | Paper |
A comparison principle for functions of a uniformly random subspace
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2012-10-12 | Paper |
Restricted isometries for partial random circulant matrices
Applied and Computational Harmonic Analysis | 2012-05-04 | Paper |
From joint convexity of quantum relative entropy to a concavity theorem of Lieb
Proceedings of the American Mathematical Society | 2012-04-27 | Paper |
Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
SIAM Review | 2012-02-11 | Paper |
Improved analysis of the subsampled randomized Hadamard transform
Advances in Adaptive Data Analysis | 2011-11-29 | Paper |
Freedman's inequality for matrix martingales
Electronic Communications in Probability | 2011-09-09 | Paper |
The Masked Sample Covariance Estimator: An Analysis via Matrix Concentration Inequalities
| 2011-09-08 | Paper |
Tail bounds for all eigenvalues of a sum of random matrices
| 2011-04-22 | Paper |
Error Bounds for Random Matrix Approximation Schemes
| 2009-11-20 | Paper |
On the linear independence of spikes and sines
The Journal of Fourier Analysis and Applications | 2009-10-14 | Paper |
Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
SIAM Review | 2009-09-22 | Paper |
Algorithms for simultaneous sparse approximation. II: Convex relaxation
Signal Processing | 2009-07-01 | Paper |
Algorithms for simultaneous sparse approximation. I: Greedy pursuit
Signal Processing | 2009-07-01 | Paper |
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Applied and Computational Harmonic Analysis | 2009-04-21 | Paper |
The Metric Nearness Problem
SIAM Journal on Matrix Analysis and Applications | 2009-03-06 | Paper |
Norms of random submatrices and sparse approximation
Comptes Rendus. Mathématique. Académie des Sciences, Paris | 2009-01-08 | Paper |
scientific article; zbMATH DE number 5485456 (Why is no real title available?)
| 2009-01-05 | Paper |
Just relax: convex programming methods for identifying sparse signals in noise
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Greed is Good: Algorithmic Results for Sparse Approximation
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Designing structured tight frames via an alternating projection method
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Constructing Packings in Grassmannian Manifolds via Alternating Projection
Experimental Mathematics | 2008-12-18 | Paper |
Matrix Nearness Problems with Bregman Divergences
SIAM Journal on Matrix Analysis and Applications | 2008-11-06 | Paper |
On the conditioning of random subdictionaries
Applied and Computational Harmonic Analysis | 2008-07-01 | Paper |
The random paving property for uniformly bounded matrices
Studia Mathematica | 2008-02-22 | Paper |
On the existence of equiangular tight frames
Linear Algebra and its Applications | 2007-09-14 | Paper |
Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum
SIAM Journal on Matrix Analysis and Applications | 2005-09-19 | Paper |
Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data
| N/A | Paper |
Randomized matrix computations: Themes and variations
| N/A | Paper |
