Get our free extension to see links to code for papers anywhere online!

Chrome logo Add to Chrome

Firefox logo Add to Firefox

Picture for Joel A. Tropp

Tensor Random Projection for Low Memory Dimension Reduction

Apr 30, 2021
Yiming Sun, Yang Guo, Joel A. Tropp, Madeleine Udell

* In NeurIPS Workshop on Relational Representation Learning (2018) 

  Access Paper or Ask Questions

An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity

Feb 09, 2019
Lijun Ding, Alp Yurtsever, Volkan Cevher, Joel A. Tropp, Madeleine Udell

* 29 pages and 4 figures 

  Access Paper or Ask Questions

Practical sketching algorithms for low-rank matrix approximation

Jan 02, 2018
Joel A. Tropp, Alp Yurtsever, Madeleine Udell, Volkan Cevher

* SIAM J. Matrix Analysis and Applications, Vol. 38, num. 4, pp. 1454-1485, Dec. 2017 

  Access Paper or Ask Questions

Universality laws for randomized dimension reduction, with applications

Sep 17, 2017
Samet Oymak, Joel A. Tropp

* v2 and v3 with technical corrections. Code for reproducing figures available at 

  Access Paper or Ask Questions

Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data

Jun 18, 2017
Joel A. Tropp, Alp Yurtsever, Madeleine Udell, Volkan Cevher

  Access Paper or Ask Questions

Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage

Feb 22, 2017
Alp Yurtsever, Madeleine Udell, Joel A. Tropp, Volkan Cevher

  Access Paper or Ask Questions

An Introduction to Matrix Concentration Inequalities

Jan 07, 2015
Joel A. Tropp

* 163 pages. To appear in Foundations and Trends in Machine Learning 

  Access Paper or Ask Questions

Robust computation of linear models by convex relaxation

Aug 11, 2014
Gilad Lerman, Michael McCoy, Joel A. Tropp, Teng Zhang

* Foundations of Computational Mathematics, April 2015, Volume 15, Issue 2, pp 363-410 
* Formerly titled "Robust computation of linear models, or How to find a needle in a haystack" 

  Access Paper or Ask Questions

Factoring nonnegative matrices with linear programs

Feb 02, 2013
Victor Bittorf, Benjamin Recht, Christopher Re, Joel A. Tropp

* 17 pages, 10 figures. Modified theorem statement for robust recovery conditions. Revised proof techniques to make arguments more elementary. Results on robustness when rows are duplicated have been superseded by 

  Access Paper or Ask Questions