default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoel A. Tropp
Person information
- affiliation: California Institute of Technology, Pasadena, USA
- award: Presidential Early Career Award for Scientists and Engineers
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j40]Ethan N. Epperly
, Joel A. Tropp, Robert J. Webber:
XTrace: Making the Most of Every Sample in Stochastic Trace Estimation. SIAM J. Matrix Anal. Appl. 45(1): 1-23 (2024)- [j39]Yuji Nakatsukasa, Joel A. Tropp:
Fast and Accurate Randomized Algorithms for Linear Systems and Eigenvalue Problems. SIAM J. Matrix Anal. Appl. 45(2): 1183-1214 (2024) - [j38]Ethan N. Epperly, Joel A. Tropp:
Efficient Error and Variance Estimation for Randomized Matrix Computations. SIAM J. Sci. Comput. 46(1): 508- (2024) - [i42]Anastasia Kireeva, Joel A. Tropp:
Randomized matrix computations: Themes and variations. CoRR abs/2402.17873 (2024) - [i41]Ethan N. Epperly, Joel A. Tropp, Robert J. Webber:
Embrace rejection: Kernel matrix approximation by accelerated randomly pivoted Cholesky. CoRR abs/2410.03969 (2024) - 2023
- [j37]Dimitrios Giannakis, Amelia Henriksen, Joel A. Tropp, Rachel A. Ward:
Learning to Forecast Dynamical Systems from Streaming Data. SIAM J. Appl. Dyn. Syst. 22(2): 527-558 (2023) - [j36]Zachary Frangella, Joel A. Tropp, Madeleine Udell:
Randomized Nyström Preconditioning. SIAM J. Matrix Anal. Appl. 44(2): 718-752 (2023) - [i40]Ethan N. Epperly, Joel A. Tropp, Robert J. Webber:
XTrace: Making the most of every sample in stochastic trace estimation. CoRR abs/2301.07825 (2023) - [i39]Mateo Díaz, Ethan N. Epperly, Zachary Frangella, Joel A. Tropp, Robert J. Webber:
Robust, randomized preconditioning for kernel ridge regression. CoRR abs/2304.12465 (2023) - [i38]Joel A. Tropp, Robert J. Webber:
Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications. CoRR abs/2306.12418 (2023) - 2022
- [j35]De Huang, Jonathan Niles-Weed, Joel A. Tropp, Rachel A. Ward:
Matrix Concentration for Products. Found. Comput. Math. 22(6): 1767-1799 (2022) - [j34]Joel A. Tropp:
Randomized block Krylov methods for approximating extreme eigenvalues. Numerische Mathematik 150(1): 217-255 (2022) - [i37]Ethan N. Epperly, Joel A. Tropp:
Jackknife Variability Estimation For Randomized Matrix Computations. CoRR abs/2207.06342 (2022) - [i36]Yifan Chen, Ethan N. Epperly, Joel A. Tropp, Robert J. Webber:
Randomly pivoted Cholesky: Practical approximation of a kernel matrix with few entry evaluations. CoRR abs/2207.06503 (2022) - 2021
- [j33]Lijun Ding, Alp Yurtsever, Volkan Cevher, Joel A. Tropp, Madeleine Udell:
An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity. SIAM J. Optim. 31(4): 2695-2725 (2021) - [j32]Alp Yurtsever, Joel A. Tropp, Olivier Fercoq, Madeleine Udell, Volkan Cevher:
Scalable Semidefinite Programming. SIAM J. Math. Data Sci. 3(1): 171-200 (2021) - [j31]Richard Kueng, Joel A. Tropp:
Binary Component Decomposition Part I: The Positive-Semidefinite Case. SIAM J. Math. Data Sci. 3(2): 544-572 (2021) - [c18]Aviad Levis, Daeyoung Lee, Joel A. Tropp, Charles F. Gammie, Katherine L. Bouman:
Inference of Black Hole Fluid-Dynamics from Sparse Interferometric Measurements. ICCV 2021: 2320-2329 - [i35]Yiming Sun, Yang Guo, Joel A. Tropp, Madeleine Udell:
Tensor Random Projection for Low Memory Dimension Reduction. CoRR abs/2105.00105 (2021) - [i34]Dimitris Giannakis, Amelia Henriksen, Joel A. Tropp, Rachel A. Ward:
Learning to Forecast Dynamical Systems from Streaming Data. CoRR abs/2109.09703 (2021) - [i33]Joel A. Tropp:
Randomized block Krylov methods for approximating extreme eigenvalues. CoRR abs/2110.00649 (2021) - [i32]Zachary Frangella, Joel A. Tropp, Madeleine Udell:
Randomized Nyström Preconditioning. CoRR abs/2110.02820 (2021) - [i31]Yuji Nakatsukasa, Joel A. Tropp:
Fast & Accurate Randomized Algorithms for Linear Systems and Eigenvalue Problems. CoRR abs/2111.00113 (2021) - 2020
- [j30]Per-Gunnar Martinsson, Joel A. Tropp:
Randomized numerical linear algebra: Foundations and algorithms. Acta Numer. 29: 403-572 (2020) - [j29]Yiming Sun, Yang Guo, Charlene Luo, Joel A. Tropp, Madeleine Udell:
Low-Rank Tucker Approximation of a Tensor from Streaming Data. SIAM J. Math. Data Sci. 2(4): 1123-1150 (2020) - [i30]Per-Gunnar Martinsson, Joel A. Tropp:
Randomized Numerical Linear Algebra: Foundations & Algorithms. CoRR abs/2002.01387 (2020)
2010 – 2019
- 2019
- [j28]Joel A. Tropp, Alp Yurtsever, Madeleine Udell, Volkan Cevher:
Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation. SIAM J. Sci. Comput. 41(4): A2430-A2463 (2019) - [i29]Lijun Ding, Alp Yurtsever, Volkan Cevher, Joel A. Tropp, Madeleine Udell:
An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity. CoRR abs/1902.03373 (2019) - [i28]Joel A. Tropp, Alp Yurtsever, Madeleine Udell, Volkan Cevher:
Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation. CoRR abs/1902.08651 (2019) - [i27]Yiming Sun, Yang Guo, Charlene Luo, Joel A. Tropp, Madeleine Udell:
Low-Rank Tucker Approximation of a Tensor From Streaming Data. CoRR abs/1904.10951 (2019) - [i26]Richard Kueng, Joel A. Tropp:
Binary component decomposition Part II: The asymmetric case. CoRR abs/1907.13602 (2019) - [i25]Richard Kueng, Joel A. Tropp:
Binary Component Decomposition Part I: The Positive-Semidefinite Case. CoRR abs/1907.13603 (2019) - 2018
- [j27]Joel A. Tropp:
Simplicial Faces of the Set of Correlation Matrices. Discret. Comput. Geom. 60(2): 512-529 (2018) - [i24]Madalin Guta, Jonas Kahn, Richard Kueng, Joel A. Tropp:
Fast state tomography with optimal error bounds. CoRR abs/1809.11162 (2018) - [i23]Martin Lotz, Michael B. McCoy, Ivan Nourdin, Giovanni Peccati, Joel A. Tropp:
Concentration of the Intrinsic Volumes of a Convex Body. CoRR abs/1810.12412 (2018) - 2017
- [j26]Joel A. Tropp, Alp Yurtsever, Madeleine Udell, Volkan Cevher:
Practical Sketching Algorithms for Low-Rank Matrix Approximation. SIAM J. Matrix Anal. Appl. 38(4): 1454-1485 (2017) - [c17]Alp Yurtsever, Madeleine Udell, Joel A. Tropp, Volkan Cevher:
Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage. AISTATS 2017: 1188-1196 - [c16]Joel A. Tropp, Alp Yurtsever, Madeleine Udell, Volkan Cevher:
Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data. NIPS 2017: 1225-1234 - [i22]Joel A. Tropp, Alp Yurtsever, Madeleine Udell, Volkan Cevher:
Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data. CoRR abs/1706.05736 (2017) - 2016
- [i21]Joel A. Tropp, Alp Yurtsever, Madeleine Udell, Volkan Cevher:
Randomized single-view algorithms for low-rank matrix approximation. CoRR abs/1609.00048 (2016) - 2015
- [j25]Gilad Lerman, Michael B. McCoy, Joel A. Tropp, Teng Zhang:
Robust Computation of Linear Models by Convex Relaxation. Found. Comput. Math. 15(2): 363-410 (2015) - [j24]Joel A. Tropp:
An Introduction to Matrix Concentration Inequalities. Found. Trends Mach. Learn. 8(1-2): 1-230 (2015) - [j23]John J. Bruer, Joel A. Tropp, Volkan Cevher, Stephen Becker:
Designing Statistical Estimators That Balance Sample Size, Risk, and Computational Cost. IEEE J. Sel. Top. Signal Process. 9(4): 612-624 (2015) - [j22]Joel A. Tropp:
Integer Factorization of a Positive-Definite Matrix. SIAM J. Discret. Math. 29(4): 1783-1791 (2015) - [i20]Joel A. Tropp:
An Introduction to Matrix Concentration Inequalities. CoRR abs/1501.01571 (2015) - [i19]Samet Oymak, Joel A. Tropp:
Universality laws for randomized dimension reduction, with applications. CoRR abs/1511.09433 (2015) - 2014
- [j21]Michael B. McCoy, Joel A. Tropp:
From Steiner Formulas for Cones to Concentration of Intrinsic Volumes. Discret. Comput. Geom. 51(4): 926-963 (2014) - [j20]Michael B. McCoy, Joel A. Tropp:
Sharp Recovery Bounds for Convex Demixing, with Applications. Found. Comput. Math. 14(3): 503-567 (2014) - [c15]John J. Bruer, Joel A. Tropp, Volkan Cevher, Stephen Becker:
Time-Data Tradeoffs by Aggressive Smoothing. NIPS 2014: 1664-1672 - [i18]Joel A. Tropp:
Convex recovery of a structured signal from independent random linear measurements. CoRR abs/1405.1102 (2014) - 2013
- [i17]Dennis Amelunxen, Martin Lotz, Michael B. McCoy, Joel A. Tropp:
Living on the edge: A geometric theory of phase transitions in convex optimization. CoRR abs/1303.6672 (2013) - [i16]Joel A. Tropp, Richard Y. Chen:
Subadditivity of Matrix phi-Entropy and Concentration of Random Matrices. CoRR abs/1308.2952 (2013) - [i15]Michael B. McCoy, Joel A. Tropp:
The achievable performance of convex demixing. CoRR abs/1309.7478 (2013) - 2012
- [j19]Joel A. Tropp:
User-Friendly Tail Bounds for Sums of Random Matrices. Found. Comput. Math. 12(4): 389-434 (2012) - [c14]Ben Recht, Christopher Ré, Joel A. Tropp, Victor Bittorf:
Factoring nonnegative matrices with linear programs. NIPS 2012: 1223-1231 - [i14]Gilad Lerman, Michael B. McCoy, Joel A. Tropp, Teng Zhang:
Robust computation of linear models, or How to find a needle in a haystack. CoRR abs/1202.4044 (2012) - [i13]Michael B. McCoy, Joel A. Tropp:
Sharp recovery bounds for convex deconvolution, with applications. CoRR abs/1205.1580 (2012) - [i12]Victor Bittorf, Benjamin Recht, Christopher Ré, Joel A. Tropp:
Factoring nonnegative matrices with linear programs. CoRR abs/1206.1270 (2012) - [i11]Deanna Needell, Joel A. Tropp:
Paved with Good Intentions: Analysis of a Randomized Block Kaczmarz Method. CoRR abs/1208.3805 (2012) - 2011
- [j18]Joel A. Tropp:
Improved Analysis of the subsampled Randomized Hadamard Transform. Adv. Data Sci. Adapt. Anal. 3(1-2): 115-126 (2011) - [j17]Nathan Halko, Per-Gunnar Martinsson, Joel A. Tropp:
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions. SIAM Rev. 53(2): 217-288 (2011) - [i10]Joel A. Tropp:
From joint convexity of quantum relative entropy to a concavity theorem of Lieb. CoRR abs/1101.1070 (2011) - [i9]Götz E. Pfander, Holger Rauhut, Joel A. Tropp:
The restricted isometry property for time-frequency structured random matrices. CoRR abs/1106.3184 (2011) - 2010
- [j16]Deanna Needell, Joel A. Tropp:
CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Commun. ACM 53(12): 93-100 (2010) - [j15]Joel A. Tropp, Stephen J. Wright:
Computational Methods for Sparse Solution of Linear Inverse Problems. Proc. IEEE 98(6): 948-958 (2010) - [j14]Joel A. Tropp, Jason N. Laska, Marco F. Duarte, Justin K. Romberg, Richard G. Baraniuk:
Beyond Nyquist: efficient sampling of sparse bandlimited signals. IEEE Trans. Inf. Theory 56(1): 520-544 (2010) - [c13]Joel A. Tropp:
The sparsity gap: Uncertainty principles proportional to dimension. CISS 2010: 1-6 - [c12]Jason D. Lee, Ben Recht, Ruslan Salakhutdinov, Nathan Srebro, Joel A. Tropp:
Practical Large-Scale Optimization for Max-norm Regularization. NIPS 2010: 1297-1305 - [i8]Joel A. Tropp:
The Sparsity Gap: Uncertainty Principles Proportional to Dimension. CoRR abs/1003.0415 (2010) - [i7]Holger Rauhut, Justin K. Romberg, Joel A. Tropp:
Restricted Isometries for Partial Random Circulant Matrices. CoRR abs/1010.1847 (2010) - [i6]Joel A. Tropp:
Improved analysis of the subsampled randomized Hadamard transform. CoRR abs/1011.1595 (2010)
2000 – 2009
- 2009
- [c11]Joel A. Tropp:
Column subset selection, matrix factorization, and eigenvalue optimization. SODA 2009: 978-986 - [i5]Moshe Mishali, Yonina C. Eldar, Joel A. Tropp:
Efficient Sampling of Sparse Wideband Analog Signals. CoRR abs/0901.3950 (2009) - [i4]Joel A. Tropp, Jason N. Laska, Marco F. Duarte, Justin K. Romberg, Richard G. Baraniuk:
Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals. CoRR abs/0902.0026 (2009) - 2008
- [j13]Inderjit S. Dhillon, Robert W. Heath Jr., Thomas Strohmer, Joel A. Tropp:
Constructing Packings in Grassmannian Manifolds via Alternating Projection. Exp. Math. 17(1): 9-35 (2008) - [j12]Justin Brickell, Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp:
The Metric Nearness Problem. SIAM J. Matrix Anal. Appl. 30(1): 375-396 (2008) - [j11]Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp:
A Tutorial on Fast Fourier Sampling. IEEE Signal Process. Mag. 25(2): 57-66 (2008) - [c10]Deanna Needell, Joel A. Tropp, Roman Vershynin:
Greedy signal recovery review. ACSCC 2008: 1048-1050 - [i3]Joel A. Tropp, Deanna Needell:
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. CoRR abs/0803.2392 (2008) - [i2]Deanna Needell, Joel A. Tropp, Roman Vershynin:
Greedy Signal Recovery Review. CoRR abs/0812.2202 (2008) - 2007
- [j10]Inderjit S. Dhillon, Joel A. Tropp:
Matrix Nearness Problems with Bregman Divergences. SIAM J. Matrix Anal. Appl. 29(4): 1120-1146 (2007) - [j9]Joel A. Tropp, Anna C. Gilbert:
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit. IEEE Trans. Inf. Theory 53(12): 4655-4666 (2007) - [c9]Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin:
One sketch for all: fast algorithms for compressed sensing. STOC 2007: 237-246 - 2006
- [j8]Joel A. Tropp, Anna C. Gilbert, Martin J. Strauss:
Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit. Signal Process. 86(3): 572-588 (2006) - [j7]Joel A. Tropp:
Algorithms for simultaneous sparse approximation. Part II: Convex relaxation. Signal Process. 86(3): 589-602 (2006) - [j6]Joel A. Tropp:
Just relax: convex programming methods for identifying sparse signals in noise. IEEE Trans. Inf. Theory 52(3): 1030-1051 (2006) - [c8]Joel A. Tropp:
Random Filters for Compressive Sampling. CISS 2006: 216-217 - [c7]Kyle Herrity, Anna C. Gilbert, Joel A. Tropp:
Sparse Approximation Via Iterative Thresholding. ICASSP (3) 2006: 624-627 - [c6]Suvrit Sra, Joel A. Tropp:
Row-Action Methods for Compressed Sensing. ICASSP (3) 2006: 868-871 - [c5]Joel A. Tropp, Michael B. Wakin, Marco F. Duarte, Dror Baron, Richard G. Baraniuk:
Random Filters for Compressive Sampling and Reconstruction. ICASSP (3) 2006: 872-875 - [i1]Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin:
Algorithmic linear dimension reduction in the l_1 norm for sparse vectors. CoRR abs/cs/0608079 (2006) - 2005
- [j5]Inderjit S. Dhillon, Robert W. Heath Jr., Mátyás A. Sustik, Joel A. Tropp:
Generalized Finite Algorithms for Constructing Hermitian Matrices with Prescribed Diagonal and Spectrum. SIAM J. Matrix Anal. Appl. 27(1): 61-71 (2005) - [j4]Joel A. Tropp, Inderjit S. Dhillon, Robert W. Heath Jr., Thomas Strohmer:
Designing structured tight frames via an alternating projection method. IEEE Trans. Inf. Theory 51(1): 188-209 (2005) - [j3]Joel A. Tropp:
Recovery of short, complex linear combinations via 𝓁1 minimization. IEEE Trans. Inf. Theory 51(4): 1568-1570 (2005) - [c4]Joel A. Tropp, Anna C. Gilbert, Martin J. Strauss:
Simultaneous sparse approximation via greedy pursuit. ICASSP (5) 2005: 721-724 - [c3]Anna C. Gilbert, Joel A. Tropp:
Applications of sparse approximation in communications. ISIT 2005: 1000-1004 - 2004
- [j2]Joel A. Tropp:
Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inf. Theory 50(10): 2231-2242 (2004) - [j1]Joel A. Tropp, Inderjit S. Dhillon, Robert W. Heath Jr.:
Finite-Step Algorithms for Constructing Optimal CDMA Signature Sequences. IEEE Trans. Inf. Theory 50(11): 2916-2921 (2004) - [c2]Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp:
Triangle Fixing Algorithms for the Metric Nearness Problem. NIPS 2004: 361-368 - 2003
- [c1]Joel A. Tropp, Anna C. Gilbert, S. Muthukrishnan, Martin Strauss:
Improved sparse approximation over quasiincoherent dictionaries. ICIP (1) 2003: 37-40
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
