Conference A simple proof of a new set disjointness with applications to data streams 2021 • Leibniz International Proceedings in Informatics • 200: Kamath A, Price E, Woodruff DP
Conference A very sketchy talk 2021 • Leibniz International Proceedings in Informatics • 198: Woodruff DP
Preprint Active Linear Regression for $\ell_p$ Norms and Beyond 2021 Musco C, Musco C, Woodruff DP, Yasuda T
Preprint Average-Case Communication Complexity of Statistical Problems 2021 Rashtchian C, Woodruff DP, Ye P, Zhu H
Conference Average-Case Communication Complexity of Statistical Problems 2021 • Proceedings of Machine Learning Research • 134:3859-3886 Rashtchian C, Woodruff DP, Ye P, Zhu H
Conference Dimensionality Reduction for Sum-of-Distances Metric 2021 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139 • 139: Peng Z, Kacham P, Woodruff DP
Conference Exponentially Improved Dimensionality Reduction for l<sub>1</sub>: Subspace Embeddings and Independence Testing 2021 • CONFERENCE ON LEARNING THEORY, VOL 134 • 134: Li Y, Woodruff DP, Yasuda T
Conference Fast Sketching of Polynomial Kernels of Polynomial Degree 2021 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139 • 139: Song Z, Woodruff DP, Yu Z, Zhang L
Preprint Fast Sketching of Polynomial Kernels of Polynomial Degree 2021 Song Z, Woodruff DP, Yu Z, Zhang L
Conference Few-Shot Data-Driven Algorithms for Low Rank Approximation 2021 • Advances in Neural Information Processing Systems • 13:10678-10690 Indyk P, Wagner T, Woodruff DP
Journal Article How to Reduce Dimension With PCA and Random Projections? 2021 • IEEE Transactions on Information Theory • 67(12):8154-8189 Yang F, Liu S, Dobriban E, Woodruff DP
Conference Hutch<sup>++</sup>: Optimal Stochastic Trace Estimation 2021 • 4th Symposium on Simplicity in Algorithms, SOSA 2021 • 142-155 Meyer RA, Musco C, Musco C, Woodruff DP
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 • UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, VOL 161 • 161: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
