@article{https://authors.library.caltech.edu/records/dxyhq-kee31,
    title = "Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluations",
    journal = "Communications on Pure and Applied Mathematics",
    year = "2024",
    url = "https://authors.library.caltech.edu/records/dxyhq-kee31",
    id = "record",
    issn = "0010-3640",
    doi = "10.1002/cpa.22234"
}


@other{https://authors.library.caltech.edu/records/4v7j7-msj10,
    title = "Randomized matrix computations: themes and variations",
    year = "2024",
    url = "https://authors.library.caltech.edu/records/4v7j7-msj10",
    id = "record",
    doi = "10.7907/7yade-5k351"
}


@article{https://authors.library.caltech.edu/records/j56b4-c9j08,
    title = "Sparse Random Hamiltonians Are Quantumly Easy",
    journal = "Physical Review X",
    year = "2024",
    url = "https://authors.library.caltech.edu/records/j56b4-c9j08",
    id = "record",
    issn = "2160-3308",
    doi = "10.1103/physrevx.14.011014",
    volume = "14"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20220412-221302767,
    title = "ACM 217: Probability in High Dimensions",
    year = "2022",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220412-221302767",
    id = "record",
    doi = "10.7907/mxr0-c422"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20220412-221559139,
    title = "ACM 204: Matrix Analysis",
    year = "2022",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220412-221559139",
    id = "record",
    doi = "10.7907/m421-yb89"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20220412-220319430,
    title = "ACM 204: Lectures on Convex Geometry",
    year = "2022",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220412-220319430",
    id = "record",
    doi = "10.7907/geda-h205"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20220107-890431800,
    title = "Randomized block Krylov methods for approximating extreme eigenvalues",
    journal = "Numerische Mathematik",
    year = "2022",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220107-890431800",
    id = "record",
    issn = "0029-599X",
    doi = "10.1007/s00211-021-01250-3",
    volume = "150"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20220909-161413582,
    title = "Fast \& accurate randomized algorithms for linear systems and eigenvalue problems",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220909-161413582",
    id = "record",
    doi = "10.7907/cmyh-va31"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20220204-680252000,
    title = "An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity",
    journal = "SIAM Journal of Optimization",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220204-680252000",
    id = "record",
    issn = "1052-6234",
    doi = "10.1137/19m1244603",
    volume = "31"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20220307-188412000,
    title = "2021 IEEE/CVF International Conference on Computer Vision (ICCV)",
    chapter = "Inference of Black Hole Fluid-Dynamics from Sparse Interferometric Measurements",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220307-188412000",
    id = "record",
    isbn = "978-1-6654-2812-5",
    doi = "10.1109/iccv48922.2021.00234"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20201218-154434116,
    title = "Matrix Concentration for Products",
    journal = "Foundations of Computational Mathematics",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20201218-154434116",
    id = "record",
    issn = "1615-3375",
    doi = "10.1007/s10208-021-09533-9"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20201218-154430753,
    title = "From Poincaré inequalities to nonlinear matrix concentration",
    journal = "Bernoulli",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20201218-154430753",
    id = "record",
    issn = "1350-7265",
    doi = "10.3150/20-BEJ1289",
    volume = "27"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20210621-223135493,
    title = "Tensor Random Projection for Low Memory Dimension Reduction",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20210621-223135493",
    id = "record",
    doi = "10.48550/arXiv.2105.00105"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20210421-101607288,
    title = "ACM 204: Randomized Algorithms for Matrix Computations",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20210421-101607288",
    id = "record",
    doi = "10.7907/nwsv-df59"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20201218-154427353,
    title = "Nonlinear matrix concentration via semigroup methods",
    journal = "Electronic Journal of Probability",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20201218-154427353",
    id = "record",
    issn = "1083-6489",
    doi = "10.1214/20-EJP578",
    volume = "26"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20201218-154423869,
    title = "Quantum simulation via randomized product formulas: Low gate complexity with accuracy guarantees",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20201218-154423869",
    id = "record",
    doi = "10.48550/arXiv.2008.11751"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200821-083421883,
    title = "Geometric Aspects of Functional Analysis: Israel Seminar (GAFA) 2017-2019 Volume II",
    chapter = "Concentration of the Intrinsic Volumes of a Convex Body",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200821-083421883",
    id = "record",
    isbn = "978-3-030-46761-6",
    doi = "10.1007/978-3-030-46762-3\_6"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20220829-181401723,
    title = "Sharp phase transitions in Euclidian integral geometry",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220829-181401723",
    id = "record",
    doi = "10.7907/9rja-rh15"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190212-160252658,
    title = "Fast state tomography with optimal error bounds",
    journal = "Journal of Physics A: Mathematical and General",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190212-160252658",
    id = "record",
    issn = "0305-4470",
    doi = "10.1088/1751-8121/ab8111",
    volume = "53"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20201217-104322985,
    title = "Randomized numerical linear algebra: Foundations and algorithms",
    journal = "Acta Numerica",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20201217-104322985",
    id = "record",
    issn = "0962-4929",
    doi = "10.1017/s0962492920000021",
    volume = "29"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20201218-154437706,
    title = "Scalable Semidefinite Programming",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20201218-154437706",
    id = "record",
    doi = "10.48550/arXiv.1912.02949"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20201218-154444454,
    title = "Binary component decomposition. Part II: The asymmetric case",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20201218-154444454",
    id = "record",
    doi = "10.48550/arXiv.1907.13602"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20201218-154441081,
    title = "Binary Component Decomposition. Part I: The Positive-Semidefinite Case",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20201218-154441081",
    id = "record",
    doi = "10.48550/arXiv.1907.13603"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190920-085459909,
    title = "Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation",
    journal = "SIAM Journal on Scientific Computing",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190920-085459909",
    id = "record",
    issn = "1064-8275",
    doi = "10.1137/18m1201068",
    volume = "41"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190715-125341188,
    title = "Matrix Concentration \& Computational Linear Algebra",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190715-125341188",
    id = "record",
    doi = "10.7907/nbx6-vm05"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20220826-183609942,
    title = "More practical sketching algorithms for low-rank matrix approximation",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220826-183609942",
    id = "record",
    doi = "10.7907/bb7w-ve61"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20180103-154009197,
    title = "Simplicial Faces of the Set of Correlation Matrices",
    journal = "Discrete and Computational Geometry",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180103-154009197",
    id = "record",
    issn = "0179-5376",
    doi = "10.1007/s00454-017-9961-0",
    volume = "60"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20210624-180721369,
    title = "Analysis of randomized block Krylov methods",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20210624-180721369",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20180111-134219270,
    title = "Practical Sketching Algorithms for Low-Rank Matrix Approximation",
    journal = "SIAM Journal on Matrix Analysis and Applications",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180111-134219270",
    id = "record",
    issn = "0895-4798",
    doi = "10.1137/17M1111590",
    volume = "38"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20180829-073029156,
    title = "Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180829-073029156",
    id = "record",
    doi = "10.48550/arXiv.1706.05736"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190826-161640394,
    title = "Wavelets and Sparsity XVII",
    chapter = "Sketchy decisions: convex optimization with optimal storage (Conference Presentation)",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190826-161640394",
    id = "record",
    isbn = "9781510612457",
    doi = "10.1117/12.2281058"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20170620-081901312,
    title = "Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170620-081901312",
    id = "record",
    doi = "10.7907/QJE2-RP11"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20180828-145534045,
    title = "Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180828-145534045",
    id = "record",
    doi = "10.48550/arXiv.1702.06838"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20170314-110228775,
    title = "The Achievable Performance of Convex Demixing",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170314-110228775",
    id = "record",
    doi = "10.7907/4KWM-5N31"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170913-080352752,
    title = "A mathematical introduction to compressive sensing [Book Review]",
    journal = "Bulletin of the American Mathematical Society",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170913-080352752",
    id = "record",
    issn = "0273-0979",
    doi = "10.1090/bull/1546",
    volume = "54"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20170215-154809329,
    title = "Randomized Single-View Algorithms for Low-Rank Matrix Approximation",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170215-154809329",
    id = "record",
    doi = "10.7907/Z9HT2M9C"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170214-075417526,
    title = "High Dimensional Probability VII",
    chapter = "The Expected Norm of a Sum of Independent Random Matrices: An Elementary Approach",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170214-075417526",
    id = "record",
    isbn = "978-3-319-40517-9",
    doi = "10.1007/978-3-319-40519-3\_8"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20161103-151616710,
    title = "Efron–Stein inequalities for random matrices",
    journal = "Annals of Probability",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161103-151616710",
    id = "record",
    issn = "0091-1798",
    doi = "10.1214/15-AOP1054",
    volume = "44"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20180831-112137332,
    title = "Universality laws for randomized dimension reduction, with applications",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180831-112137332",
    id = "record",
    doi = "10.48550/arXiv.1511.09433"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160115-141425609,
    title = "Integer Factorization of a Positive-Definite Matrix",
    journal = "SIAM Journal on Discrete Mathematics",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160115-141425609",
    id = "record",
    issn = "0895-4801",
    doi = "10.1137/15M1024718",
    volume = "29"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150611-103104163,
    title = "Designing Statistical Estimators That Balance Sample Size, Risk, and Computational Cost",
    journal = "IEEE Journal of Selected Topics in Signal Processing",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150611-103104163",
    id = "record",
    issn = "1932-4553",
    doi = "10.1109/JSTSP.2015.2400412",
    volume = "9"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150714-140245621,
    title = "An Introduction to Matrix Concentration Inequalities",
    journal = "Foundations and Trends in Machine Learning",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150714-140245621",
    id = "record",
    issn = "1935-8237",
    doi = "10.1561/2200000048",
    volume = "8"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150619-160809918,
    title = "Solving ptychography with a convex relaxation",
    journal = "New Journal of Physics",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150619-160809918",
    id = "record",
    issn = "1367-2630",
    doi = "10.1088/1367-2630/17/5/053044",
    volume = "17",
    pmcid = "PMC4486359"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20180831-112133957,
    title = "Second-Order Matrix Concentration Inequalities",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180831-112133957",
    id = "record",
    doi = "10.48550/arXiv.1504.05919"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150416-134303719,
    title = "Robust Computation of Linear Models by Convex Relaxation",
    journal = "Foundations of Computational Mathematics",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150416-134303719",
    id = "record",
    issn = "1615-3375",
    doi = "10.1007/s10208-014-9221-0",
    volume = "15"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160818-084011981,
    title = "Sampling Theory, a Renaissance: Compressive Sensing and Other Developments",
    chapter = "Convex Recovery of a Structured Signal from Independent Random Linear Measurements",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160818-084011981",
    id = "record",
    isbn = "978-3-319-19748-7",
    doi = "10.1007/978-3-319-19749-4\_2"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20180831-112157832,
    title = "A foundation for analytical developments in the logarithmic region of turbulent channels",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180831-112157832",
    id = "record",
    doi = "10.48550/arXiv.1409.6047"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150422-120051110,
    title = "Living on the edge: phase transitions in convex programs with random data",
    journal = "Information and Inference",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150422-120051110",
    id = "record",
    issn = "2049-8772",
    doi = "10.1093/imaiai/iau005",
    volume = "3"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20140828-082707636,
    title = "Error Bounds for Random Matrix Approximation Schemes",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140828-082707636",
    id = "record",
    doi = "10.7907/03an-qj61"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20140828-084239607,
    title = "Tail Bounds for All Eigenvalues of a Sum of Random Matrices",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140828-084239607",
    id = "record",
    doi = "10.7907/tz8n-h623"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140606-140701312,
    title = "Sharp Recovery Bounds for Convex Demixing, with Applications",
    journal = "Foundations of Computational Mathematics",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140606-140701312",
    id = "record",
    issn = "1615-3375",
    doi = "10.1007/s10208-014-9191-2",
    volume = "14"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140703-103651135,
    title = "From Steiner Formulas for Cones to Concentration of Intrinsic Volumes",
    journal = "Discrete and Computational Geometry",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140703-103651135",
    id = "record",
    issn = "0179-5376",
    doi = "10.1007/s00454-014-9595-4",
    volume = "51"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140605-070821101,
    title = "Matrix concentration inequalities via the method of exchangeable pairs",
    journal = "Annals of Probability",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140605-070821101",
    id = "record",
    issn = "0091-1798",
    doi = "10.1214/13-AOP892",
    volume = "42"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140519-153243814,
    title = "A low-order decomposition of turbulent channel flow via resolvent analysis and convex optimization",
    journal = "Physics of Fluids",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140519-153243814",
    id = "record",
    issn = "1070-6631",
    doi = "10.1063/1.4876195",
    volume = "26"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140918-084717665,
    title = "Subadditivity of matrix φ-entropy and concentration of random matrices",
    journal = "Electronic Journal of Probability",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140918-084717665",
    id = "record",
    issn = "1083-6489",
    doi = "10.1214/EJP.v19-2964",
    volume = "19"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140207-094442254,
    title = "Paved with good intentions: Analysis of a randomized block Kaczmarz method",
    journal = "Linear Algebra and its Applications",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140207-094442254",
    id = "record",
    issn = "0024-3795",
    doi = "10.1016/j.laa.2012.12.022",
    volume = "441"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140320-104900351,
    title = "Compact representation of wall-bounded turbulence using compressive sampling",
    journal = "Physics of Fluids",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140320-104900351",
    id = "record",
    issn = "1070-6631",
    doi = "10.1063/1.4862303",
    volume = "26"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160401-170735760,
    chapter = "Time–Data Tradeoffs by Aggressive Smoothing",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160401-170735760",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20131121-132351952,
    title = "Model-based scaling of the streamwise energy density in high-Reynolds-number turbulent channels",
    journal = "Journal of Fluid Mechanics",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20131121-132351952",
    id = "record",
    issn = "0022-1120",
    doi = "10.1017/jfm.2013.457",
    volume = "734"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20180831-112130540,
    title = "The achievable performance of convex demixing",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180831-112130540",
    id = "record",
    doi = "10.48550/arXiv.1309.7478"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20130815-130448316,
    title = "The restricted isometry property for time-frequency structured random matrices",
    journal = "Probability Theory and Related Fields",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130815-130448316",
    id = "record",
    issn = "0178-8051",
    doi = "10.1007/s00440-012-0441-4",
    volume = "156"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20150218-094025300,
    title = "On effectiveness of a rank-1 model of turbulent channels for representing the velocity spectra",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150218-094025300",
    id = "record",
    doi = "10.2514/6.2013-2480"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20180831-112127106,
    title = "Deriving Matrix Concentration Inequalities from Kernel Couplings",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180831-112127106",
    id = "record",
    doi = "10.48550/arXiv.1305.0612"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120820-074343297,
    title = "A comparison principle for functions of a uniformly random subspace",
    journal = "Probability Theory and Related Fields",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120820-074343297",
    id = "record",
    issn = "0178-8051",
    doi = "10.1007/s00440-011-0360-9",
    volume = "153"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120821-072332716,
    title = "User-Friendly Tail Bounds for Sums of Random Matrices",
    journal = "Foundations of Computational Mathematics",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120821-072332716",
    id = "record",
    issn = "1615-3375",
    doi = "10.1007/s10208-011-9099-z",
    volume = "12"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120515-094709707,
    title = "From joint convexity of quantum relative entropy to a concavity theorem of Lieb",
    journal = "Proceedings of the American Mathematical Society",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120515-094709707",
    id = "record",
    issn = "0002-9939",
    doi = "10.1090/S0002-9939-2011-11141-9",
    volume = "140"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120302-134838002,
    title = "Restricted isometries for partial random circulant matrices",
    journal = "Applied and Computational Harmonic Analysis",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120302-134838002",
    id = "record",
    issn = "1063-5203",
    doi = "10.1016/j.acha.2011.05.001",
    volume = "32"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20120411-102106234,
    title = "The Masked Sample Covariance Estimator: An Analysis via the Matrix Laplace Transform",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120411-102106234",
    id = "record",
    doi = "10.7907/6rfh-ce56"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160401-165447853,
    title = "Advances in Neural Information Processing Systems 25 (NIPS 2012)",
    chapter = "Factoring nonnegative matrices with linear programs",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160401-165447853",
    id = "record",
    isbn = "978-1-62748-003-1",
    doi = "10.48550/arXiv.1206.1270"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20180831-112123699,
    title = "The Masked Sample Covariance Estimator: An Analysis via Matrix Concentration Inequalities",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180831-112123699",
    id = "record",
    doi = "10.48550/arXiv.1109.1637"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20220826-185558571,
    title = "Large-Scales PCA with Sparsity Constraints",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220826-185558571",
    id = "record",
    doi = "10.7907/51g8-zc61"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20110606-111746280,
    title = "Freedman's Inequality for Matrix Martingales",
    journal = "Electronic Communications in Probability",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110606-111746280",
    id = "record",
    issn = "1083-589X",
    doi = "10.1214/ECP.v16-1624",
    volume = "16"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120105-135621556,
    title = "Freedman's inequality for matrix martingales",
    journal = "Electronic Communications in Probability",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120105-135621556",
    id = "record",
    issn = "1083-589X",
    doi = "10.1214/ECP.v16-1624",
    volume = "16"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20180831-112120288,
    title = "Improved analysis of the subsampled randomized Hadamard transform",
    journal = "Advances in Adaptive Data Analysis",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180831-112120288",
    id = "record",
    issn = "1793-5369",
    doi = "10.1142/S1793536911000787",
    volume = "3"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20111012-114710310,
    title = "User-friendly Tail Bounds for Matrix Martingales",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111012-114710310",
    id = "record",
    doi = "10.7907/62v9-yh77"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20111021-161307161,
    title = "Two proposals for robust PCA using semidefinite programming",
    journal = "Electronic Journal of Statistics",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111021-161307161",
    id = "record",
    issn = "1935-7524",
    doi = "10.1214/11-EJS636",
    volume = "5"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120321-092826256,
    title = "Improved Analysis of the Subsamples Randomized Hadamard Transform",
    journal = "Advances in Adaptive Data Analysis",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120321-092826256",
    id = "record",
    issn = "1793-5369",
    doi = "10.1142/S1793536911000787",
    volume = "3"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20111025-085943917,
    title = "Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions",
    journal = "SIAM Review",
    year = "2011",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111025-085943917",
    id = "record",
    issn = "0036-1445",
    doi = "10.1137/090771806",
    volume = "53"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20110201-090245482,
    title = "CoSaMP: iterative signal recovery from incomplete and inaccurate samples",
    journal = "Communications of the ACM",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110201-090245482",
    id = "record",
    issn = "0001-0782",
    doi = "10.1145/1859204.1859229",
    volume = "53"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20100608-080853280,
    title = "Computational Methods for Sparse Solution of Linear Inverse Problems",
    journal = "Proceedings of the IEEE",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100608-080853280",
    id = "record",
    issn = "0018-9219",
    doi = "10.1109/JPROC.2010.2044010",
    volume = "98"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20111012-112125900,
    title = "User-Friendly Tail Bounds for Sums of Random Matrices",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111012-112125900",
    id = "record",
    doi = "10.7907/A14X-R435"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20180831-112116678,
    title = "2010 44th Annual Conference on Information Sciences and Systems (CISS)",
    chapter = "The sparsity gap: Uncertainty principles proportional to dimension",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180831-112116678",
    id = "record",
    isbn = "978-1-4244-7416-5",
    doi = "10.1109/CISS.2010.5464824"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20100119-103356110,
    title = "Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals",
    journal = "IEEE Transactions on Information Theory",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100119-103356110",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2009.2034811",
    volume = "56"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160331-164724199,
    title = "Advances in Neural Information Processing Systems 23",
    chapter = "Practical Large-Scale Optimization for Max-Norm Regularization",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160331-164724199",
    id = "record",
    isbn = "9781617823800"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20111012-111324407,
    title = "Finding Structure with Randomness: Stochastic Algorithms for Constructing Approximate matrix Decompositions",
    year = "2009",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111012-111324407",
    id = "record",
    doi = "10.7907/PK8V-V047"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20090706-113128889,
    title = "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples",
    journal = "Applied and Computational Harmonic Analysis",
    year = "2009",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090706-113128889",
    id = "record",
    issn = "1063-5203",
    doi = "10.1016/j.acha.2008.07.002",
    volume = "26"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20111011-163243421,
    title = "Computational Methods for Sparse Solution of Linear Inverse Problems",
    year = "2009",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111011-163243421",
    id = "record",
    doi = "10.7907/QF0D-J303"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100921-101535590,
    title = "Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms",
    chapter = "Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization",
    year = "2009",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100921-101535590",
    id = "record",
    isbn = "978-0-898716-80-1",
    doi = "10.48550/arXiv.0806.4404"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROjfaa08,
    title = "On the Linear Independence of Spikes and Sines",
    journal = "Journal of Fourier Analysis and Applications",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROjfaa08",
    id = "record",
    issn = "1069-5869",
    doi = "10.1007/s00041-008-9042-0",
    volume = "14"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20180831-112113124,
    title = "2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel",
    chapter = "Efficient Sampling of Sparse Wideband Analog Signals",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180831-112113124",
    id = "record",
    isbn = "978-1-4244-2481-8",
    doi = "10.1109/EEEI.2008.4736707"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROcrm08,
    title = "Norms of random submatrices and sparse approximation",
    journal = "Comptes Rendus Mathematique",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROcrm08",
    id = "record",
    issn = "1631-073X",
    doi = "10.1016/j.crma.2008.10.008",
    volume = "346"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20180831-112109709,
    title = "2008 42nd Asilomar Conference on Signals, Systems and Computers",
    chapter = "Greedy Signal Recovery Review",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180831-112109709",
    id = "record",
    isbn = "978-1-4244-2941-7",
    doi = "10.1109/ACSSC.2008.5074572"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20111011-160707642,
    title = "CoSaMP: Iterative Signal Recovery from Incomplete and Inaccurate Samples",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111011-160707642",
    id = "record",
    doi = "10.7907/KE0N-TN13"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20111011-161421093,
    title = "Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111011-161421093",
    id = "record",
    doi = "10.7907/82PQ-TF75"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20110513-152152857,
    title = "The Metric Nearness Problem",
    journal = "SIAM Journal on Matrix Analysis and Applications",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110513-152152857",
    id = "record",
    issn = "0895-4798",
    doi = "10.1137/060653391",
    volume = "30"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:GILieeespm08,
    title = "A Tutorial on Fast Fourier Sampling [How to apply it to problems]",
    journal = "IEEE Signal Processing Magazine",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:GILieeespm08",
    id = "record",
    issn = "1053-5888",
    doi = "10.1109/MSP.2007.915000",
    volume = "25"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170408-150838584,
    title = "The random paving property for uniformly bounded matrices",
    journal = "Studia Mathematica",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170408-150838584",
    id = "record",
    issn = "1730-6337",
    doi = "10.4064/sm185-1-4",
    volume = "185"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20180831-112106252,
    title = "Constructing Packings in Grassmannian Manifolds via Alternating Projection",
    journal = "Experimental Mathematics",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180831-112106252",
    id = "record",
    issn = "1058-6458",
    doi = "10.1080/10586458.2008.10129018",
    volume = "17"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit07,
    title = "Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit",
    journal = "IEEE Transactions on Information Theory",
    year = "2007",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit07",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2007.909108",
    volume = "53"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:DHIsiamjmaa07,
    title = "Matrix Nearness Problems with Bregman Divergences",
    journal = "SIAM Journal on Matrix Analysis and Applications",
    year = "2007",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:DHIsiamjmaa07",
    id = "record",
    issn = "0895-4798",
    doi = "10.1137/060649021",
    volume = "29"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20111010-134929077,
    title = "Signal Recovery from Random Measurements Via Orthogonal Matching Pursuit: The Gaussian Case",
    year = "2007",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111010-134929077",
    id = "record",
    doi = "10.7907/EG9R-Y984"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:TROciss06.975,
    title = "Conference on Information Sciences and Systems, 40th (CISS 2006), Princeton, NJ, 22-24 March 2006",
    chapter = "Random Filters for Compressive Sampling",
    year = "2007",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROciss06.975",
    id = "record",
    isbn = "1-4244-0350-2",
    doi = "10.1109/CISS.2006.286465"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20180828-150010838,
    title = "Algorithmic linear dimension reduction in the ℓ\_1 norm for sparse vectors",
    year = "2006",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180828-150010838",
    id = "record",
    doi = "10.48550/arXiv.0608079"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:HERicassp06.876,
    title = "International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2006), Toulouse, France, 14-19 May 2006",
    chapter = "Sparse Approximation Via Iterative Thresholding",
    year = "2006",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:HERicassp06.876",
    id = "record",
    isbn = "1-4244-0469-X",
    doi = "10.1109/ICASSP.2006.1660731"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:SRAicassp06.963,
    title = "International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2006), Toulouse, France, 14-19 May 2006",
    chapter = "Row-Action Methods for Compressed Sensing",
    year = "2006",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:SRAicassp06.963",
    id = "record",
    isbn = "1-4244-0469-X",
    doi = "10.1109/ICASSP.2006.1660792"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:TROicassp06.977,
    title = "International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2006), Toulouse, France, 14-19 May 2006",
    chapter = "Random Filters for Compressive Sampling and Reconstruction",
    year = "2006",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROicassp06.977",
    id = "record",
    isbn = "1-4244-0469-X",
    doi = "10.1109/ICASSP.2006.1660793"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit06,
    title = "Just relax: convex programming methods for identifying sparse signals in noise",
    journal = "IEEE Transactions on Information Theory",
    year = "2006",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit06",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2005.864420",
    volume = "52"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:GILisit05,
    title = "International Symposium on Information Theory (ISIT '05), Adelaide, Australia, 4-9 September 2005",
    chapter = "Applications of sparse approximation in communications",
    year = "2005",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:GILisit05",
    id = "record",
    isbn = "0-7803-9151-9",
    doi = "10.1109/ISIT.2005.1523488"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:DHIsiamjmaa05,
    title = "Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum",
    journal = "SIAM Journal on Matrix Analysis and Applications",
    year = "2005",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:DHIsiamjmaa05",
    id = "record",
    issn = "0895-4798",
    doi = "10.1137/S0895479803438183",
    volume = "27"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:TROicassp05,
    title = "IEEE International Conference on Acoustic, Speech, and Signal Processing (ICASSP '05), Philadelphia, PA, 18-23 March 2005",
    chapter = "Simultaneous sparse approximation via greedy pursuit",
    year = "2005",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROicassp05",
    id = "record",
    isbn = "0-7803-8874-7",
    doi = "10.1109/ICASSP.2005.1416405"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit05b,
    title = "Recovery of short, complex linear combinations via ℓ1 minimization",
    journal = "IEEE Transactions on Information Theory",
    year = "2005",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit05b",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2005.844057",
    volume = "2005"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:HEAissta04,
    title = "International Symposium on Spread Spectrum Techniques and Applications, 8th, Sydney, Australia, 30 August - 2 September 2004",
    chapter = "Construction of equiangular signatures for synchronous CDMA systems",
    year = "2005",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:HEAissta04",
    id = "record",
    isbn = "0-7803-8408-3"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:TROissta04,
    title = "International Symposium on Spread Spectrum Techniques and Applications, 8th, Sydney, Australia, 30 August - 2 September 2004",
    chapter = "Optimal CDMA signatures: a finite-step approach",
    year = "2005",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROissta04",
    id = "record",
    isbn = "0-7803-8408-3"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit05a,
    title = "Designing structured tight frames via an alternating projection method",
    journal = "IEEE Transactions on Information Theory",
    year = "2005",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit05a",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2004.839492",
    volume = "51"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit04b,
    title = "Finite-step algorithms for constructing optimal CDMA signature sequences",
    journal = "IEEE Transactions on Information Theory",
    year = "2004",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit04b",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2004.836698",
    volume = "50"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit04a,
    title = "Greed is good: algorithmic results for sparse approximation",
    journal = "IEEE Transactions on Information Theory",
    year = "2004",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROieeetit04a",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2004.834793",
    volume = "50"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:TROasilo03,
    title = "Asilomar Conference on Signals, Systems and Computers, 37th, Pacific Grove, CA, 9-12 November 2003",
    chapter = "CDMA signature sequences with low peak-to-average-power ratio via alternating projection",
    year = "2004",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROasilo03",
    id = "record",
    isbn = "0-7803-8104-1",
    doi = "10.1109/ACSSC.2003.1291956"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:TROisit03,
    title = "International Symposium on Information Theory (ISIT '03), Yokohama, Japan, 29 June - 4 July 2003",
    chapter = "Optimal CDMA signature sequences, inverse eigenvalue problems and alternating minimization",
    year = "2003",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROisit03",
    id = "record",
    isbn = "0-7803-7728-1",
    doi = "10.1109/ISIT.2003.1228424"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:TROicip03,
    title = "International Conference on Image Processing (ICIP '03), Barcelona, Spain, 14-17 September 2003",
    chapter = "Improved sparse approximation over quasi-incoherent dictionaries",
    year = "2003",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:TROicip03",
    id = "record",
    isbn = "0-7803-7750-8"
}