[11] Rachel Grotheer, Shuang Li, Anna Ma, Deanna Needell, and Jing Qin. Iterative hard thresholding for low cp-rank tensor models. Linear and Multilinear Algebra, pages 1-17, 2021. 5
[12] Ming Gu. Subspace iteration randomization and singular value problems. SIAM Journal on Scientific Computing, 37(3):A1139-A1173, 2015. 3, 23, 26
[13] Wooseok Ha and Rina Foygel Barber. Robust pca with compressed data. Advances in Neural Information Processing Systems, 28, 2015. 8
[14] Piotr Indyk, Eric Price, and David P. Woodruff. On the power of adaptivity in sparse recovery. In IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. IEEE Computer Society, 2011. 2
[15] Praneeth Kacham and David Woodruff. Reduced-rank regression with operator norm error. In Conference on Learning Theory, pages 2679-2716. PMLR, 2021. 27
[16] Akshay Kamath and Eric Price. Adaptive sparse recovery with limited adaptivity. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2729-2744. SIAM, Philadelphia, PA, 2019. doi: 10.1137/1.9781611975482.169.2
[17] Beatrice Laurent and Pascal Massart. Adaptive estimation of a quadratic functional by model selection. Annals of Statistics, pages 1302-1338, 2000. 15, 20, 22
[18] Yi Li and David P. Woodruff. Tight bounds for sketching the operator norm, Schatten norms, and subspace embeddings. In Approximation, randomization, and combinatorial optimization. Algorithms and techniques, volume 60 of LIPics. Leibniz Int. Proc. Inform., pages Art. No. 39, 11. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2016. 8
[19] Yi Li, Huy L. Nguyen, and David P. Woodruff. On sketching matrix norms and the top singular vector. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014, pages 1562-1581. SIAM, 2014. 24
[20] Cameron Musco and Christopher Musco. Randomized block krylov methods for stronger and faster approximate singular value decomposition. Advances in neural information processing systems, 28, 2015. 26, 27
[21] Vasileios Nakos, Xiaofei Shi, David P. Woodruff, and Hongyang Zhang. Improved algorithms for adaptive compressed sensing. In 45th International Colloquium on Automata, Languages, and Programming, volume 107 of LIPics. Leibniz Int. Proc. Inform., pages Art. No. 90, 14. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2018. 2
[22] Eric Price and David P. Woodruff.  $(1 + \varepsilon)$ -approximate sparse recovery. In 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science—FOCS 2011, pages 295-304. IEEE Computer Soc., Los Alamitos, CA, 2011. doi: 10.1109/FOCS.2011.92.2
[23] Eric Price and David P. Woodruff. Lower bounds for adaptive sparse recovery. In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 652-663. SIAM, Philadelphia, PA, 2012. 2, 8
[24] Cyrus Rashtchian, David P. Woodruff, and Hanlin Zhu. Vector-matrix-vector queries for solving linear algebra, statistics, and graph problems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, volume 176 of LIPics, pages 26:1-26:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. 4
[25] Holger Rauhut, Reinhold Schneider, and Željka Stojanac. Low rank tensor recovery via iterative hard thresholding. Linear Algebra Appl., 523:220-262, 2017. ISSN 0024-3795. doi: 10.1016/j.laa.2017.02.028. 5
[26] Mark Rudelson and Roman Vershynin. Smallest singular value of a random rectangular matrix. Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences, 62(12):1707-1739, 2009. 15, 20, 22