| Publication | Date of Publication | Type |
|---|
| Fast and accurate randomized algorithms for linear systems and eigenvalue problems | 2024-06-25 | Paper |
| Efficient Error and Variance Estimation for Randomized Matrix Computations | 2024-02-16 | Paper |
| XT<scp>race</scp>: Making the Most of Every Sample in Stochastic Trace Estimation | 2024-01-19 | Paper |
| Learning to Forecast Dynamical Systems from Streaming Data | 2023-07-10 | Paper |
| Randomized Nyström Preconditioning | 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 | 2023-04-14 | Paper |
| Sparse random Hamiltonians are quantumly easy | 2023-02-07 | Paper |
| Matrix concentration for products | 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 | 2022-03-01 | Paper |
| Randomized block Krylov methods for approximating extreme eigenvalues | 2022-01-19 | Paper |
| An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity | 2021-11-05 | Paper |
| Fast & Accurate Randomized Algorithms for Linear Systems and Eigenvalue Problems | 2021-10-29 | Paper |
| Nonlinear matrix concentration via semigroup methods | 2021-07-21 | Paper |
| From Poincaré inequalities to nonlinear matrix concentration | 2021-07-09 | Paper |
| Scalable Semidefinite Programming | 2021-07-06 | Paper |
| Binary Component Decomposition Part I: The Positive-Semidefinite Case | 2021-07-06 | Paper |
| Concentration for random product formulas | 2020-08-26 | Paper |
| Concentration of the Intrinsic Volumes of a Convex Body | 2020-08-21 | Paper |
| Randomized Numerical Linear Algebra: Foundations & Algorithms | 2020-02-04 | Paper |
| Universality laws for randomized dimension reduction, with applications | 2019-11-07 | Paper |
| Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation | 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 | 2018-10-30 | Paper |
| Second-order matrix concentration inequalities | 2018-04-12 | Paper |
| Practical Sketching Algorithms for Low-Rank Matrix Approximation | 2017-12-20 | Paper |
| Corrigendum in “Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise” [Mar 06 1030-1051] | 2017-08-08 | Paper |
| Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals | 2017-07-27 | Paper |
| The Expected Norm of a Sum of Independent Random Matrices: An Elementary Approach | 2017-01-11 | Paper |
| Book Review: A mathematical introduction to compressive sensing | 2016-12-20 | Paper |
| Efron-Stein inequalities for random matrices | 2016-11-16 | Paper |
| Convex Recovery of a Structured Signal from Independent Random Linear Measurements | 2016-04-14 | Paper |
| Integer Factorization of a Positive-Definite Matrix | 2015-10-02 | Paper |
| An Introduction to Matrix Concentration Inequalities | 2015-07-30 | Paper |
| Robust computation of linear models by convex relaxation | 2015-06-26 | Paper |
| Living on the edge: phase transitions in convex programs with random data | 2015-03-06 | Paper |
| From Steiner formulas for cones to concentration of intrinsic volumes | 2014-09-12 | Paper |
| Sharp recovery bounds for convex demixing, with applications | 2014-09-04 | Paper |
| Model-based scaling of the streamwise energy density in high-Reynolds-number turbulent channels | 2014-08-29 | Paper |
| Matrix concentration inequalities via the method of exchangeable pairs | 2014-05-19 | Paper |
| Subadditivity of matrix \(\phi\)-entropy and concentration of random matrices | 2014-05-02 | Paper |
| Paved with good intentions: analysis of a randomized block Kaczmarz method | 2014-03-03 | Paper |
| The masked sample covariance estimator: an analysis using matrix concentration inequalities | 2014-01-06 | Paper |
| The restricted isometry property for time-frequency structured random matrices | 2013-09-09 | Paper |
| Two proposals for robust PCA using semidefinite programming | 2013-05-28 | Paper |
| Deriving Matrix Concentration Inequalities from Kernel Couplings | 2013-05-02 | Paper |
| User-friendly tail bounds for sums of random matrices | 2012-12-21 | Paper |
| A comparison principle for functions of a uniformly random subspace | 2012-10-12 | Paper |
| Restricted isometries for partial random circulant matrices | 2012-05-04 | Paper |
| From joint convexity of quantum relative entropy to a concavity theorem of Lieb | 2012-04-27 | Paper |
| Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions | 2012-02-11 | Paper |
| IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM | 2011-11-29 | Paper |
| Freedman's inequality for matrix martingales | 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 | 2009-10-14 | Paper |
| Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions | 2009-09-22 | Paper |
| Algorithms for simultaneous sparse approximation. I: Greedy pursuit | 2009-07-01 | Paper |
| Algorithms for simultaneous sparse approximation. II: Convex relaxation | 2009-07-01 | Paper |
| CoSaMP: Iterative signal recovery from incomplete and inaccurate samples | 2009-04-21 | Paper |
| The Metric Nearness Problem | 2009-03-06 | Paper |
| Norms of random submatrices and sparse approximation | 2009-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549618 | 2009-01-05 | Paper |
| Greed is Good: Algorithmic Results for Sparse Approximation | 2008-12-21 | Paper |
| Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization | 2008-12-21 | Paper |
| Just relax: convex programming methods for identifying sparse signals in noise | 2008-12-21 | Paper |
| Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences | 2008-12-21 | Paper |
| Designing structured tight frames via an alternating projection method | 2008-12-21 | Paper |
| Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit | 2008-12-21 | Paper |
| Constructing Packings in Grassmannian Manifolds via Alternating Projection | 2008-12-18 | Paper |
| Matrix Nearness Problems with Bregman Divergences | 2008-11-06 | Paper |
| On the conditioning of random subdictionaries | 2008-07-01 | Paper |
| The random paving property for uniformly bounded matrices | 2008-02-22 | Paper |
| On the existence of equiangular tight frames | 2007-09-14 | Paper |
| Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum | 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 |
