Conference In-Database Regression in Input Sparsity Time 2021 • Proceedings of Machine Learning Research • 139:4797-4806 Jayaram R, Samadian A, Woodruff DP, Ye P
Preprint Learning a Latent Simplex in Input-Sparsity Time 2021 Bakshi A, Bhattacharyya C, Kannan R, Woodruff DP, Zhou S
Conference LEARNING A LATENT SIMPLEX IN INPUT-SPARSITY TIME 2021 • ICLR 2021 - 9th International Conference on Learning Representations Bakshi A, Bhattacharyya C, Kannan R, Woodruff DP, Zhou S
Preprint Learning-Augmented $k$-means Clustering 2021 Ergun JC, Feng Z, Silwal S, Woodruff DP, Zhou S
Conference Linear and Kernel Classification in the Streaming Model: Improved Bounds for Heavy Hitters 2021 • Advances in Neural Information Processing Systems • 18:14407-14420 Mahankali A, Woodruff DP
Preprint Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time 2021 Chepurko N, Clarkson KL, Kacham P, Woodruff DP
Preprint Noisy Boolean Hidden Matching with Applications 2021 Kapralov M, Musipatla A, Tardos J, Woodruff DP, Zhou S
Conference Non-PSD Matrix Sketching with Applications to Regression and Optimization 2021 • Proceedings of Machine Learning Research • 161:1841-1851 Feng Z, Roosta F, Woodruff DP
Conference Non-PSD Matrix Sketching with Applications to Regression and Optimization 2021 • 37th Conference on Uncertainty in Artificial Intelligence, UAI 2021 • 1841-1851 Feng Z, Roosta F, Woodruff DP
Conference Oblivious Sketching for Logistic Regression 2021 • Proceedings of Machine Learning Research • 139:7861-7871 Munteanu A, Omlor S, Woodruff DP
Journal Article Optimal l<inf>1</inf> column subset selection and a fast PTAS for low rank approximation 2021 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 560-578 Mahankali AV, Woodruff DP
Conference Optimal Sketching for Trace Estimation 2021 • Advances in Neural Information Processing Systems • 34: Jiang S, Pham H, Woodruff DP, Zhang QR
Journal Article PERFECT <i>L<sub>p</sub></i> SAMPLING IN A DATA STREAM 2021 • SIAM journal on computing (Print) • 50(2):382-439 Jayaram R, Woodruff D
Journal Article Querying a Matrix through Matrix-Vector Products 2021 • ACM Transactions on Algorithms (TALG) • 17(4): Sun X, Woodruff DP, Yang G, Zhang J
Conference Reduced-Rank Regression with Operator Norm Error 2021 • Proceedings of Machine Learning Research • 134:2679-2716 Kacham P, Woodruff DP
Conference Separations for estimating large frequency moments on data streams 2021 • Leibniz International Proceedings in Informatics • 198: Woodruff DP, Zhou S
Conference Simple heuristics yield provable algorithms for masked low-rank approximation 2021 • Leibniz International Proceedings in Informatics • 185: Musco C, Musco C, Woodruff DP
Conference Single Pass Entrywise-Transformed Low Rank Approximation 2021 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139 • 139: Jiang Y, Li Y, Sun Y, Wang J, Woodruff DP
Conference Streaming and Distributed Algorithms for Robust Column Subset Selection 2021 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139 • 139: Jiang S, Li D, Li IM, Mahankali AV, Woodruff DP
Conference Subspace exploration: Bounds on projected frequency estimation 2021 • Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems • 273-284 Cormode G, Dickens C, Woodruff DP
Conference The product of Gaussian matrices is close to Gaussian 2021 • Leibniz International Proceedings in Informatics • 207: Li Y, Woodruff DP
Journal Article TIGHT BOUNDS FOR THE SUBSPACE SKETCH PROBLEM WITH APPLICATIONS 2021 • SIAM journal on computing (Print) • 50(4):1287-1335 Li Y, Wang R, Woodruff DP
Preprint Truly Perfect Samplers for Data Streams and Sliding Windows 2021 Jayaram R, Woodruff DP, Zhou S
Preprint A Framework for Adversarially Robust Streaming Algorithms 2020 Ben-Eliezer O, Jayaram R, Woodruff DP, Yogev E
Conference A Framework for Adversarially Robust Streaming Algorithms 2020 • Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems • 63-80 Ben-Eliezer O, Jayaram R, Woodruff DP, Yogev E
