Journal Article Technical Perspective: Tapping the Link between Algorithmic Model Counting and Streaming 2023 • Communications of the ACM • 66(9):94-94 Woodruff DP
Conference The ℓ<inf>p</inf>-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines 2023 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 2023-January:850-877 Li Y, Lin H, Woodruff DP
Journal Article Towards Optimal Moment Estimation in Streaming and Distributed Models 2023 • ACM Transactions on Algorithms (TALG) • 19(3):1-35 Jayaram R, Woodruff DP
Conference ℓ<inf>p</inf>-Regression in the Arbitrary Partition Model of Communication 2023 • Proceedings of Machine Learning Research • 195:4902-4928 Li Y, Lin H, Woodruff D
Chapter A Fast, Provably Accurate Approximation Algorithm for Sparse Principal Component Analysis Reveals Human Genetic Variation Across the World 2022 • Lecture Notes in Computer Science • 13278:86-106 Chowdhury A, Bose A, Zhou S, Woodruff DP, Drineas P
Journal Article A Framework for Adversarially Robust Streaming Algorithms 2022 • Journal of the ACM • 69(2):1-33 Ben-Eliezer O, Jayaram R, Woodruff DP, Yogev E
Conference Active Linear Regression for l<sub>p</sub> Norms and Beyond 2022 • Annual Symposium on Foundations of Computer Science • 744-753 Musco C, Musco C, Woodruff DP, Yasuda T
Preprint Adaptive Sketches for Robust Regression with Importance Sampling 2022 Mahabadi S, Woodruff DP, Zhou S
Conference Adaptive Sketches for Robust Regression with Importance Sampling 2022 • Leibniz International Proceedings in Informatics • 245: Mahabadi S, Woodruff DP, Zhou S
Conference An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes 2022 • Leibniz International Proceedings in Informatics • 215: Baweja A, Jia J, Woodruff DP
Conference Bounding the Width of Neural Networks via Coupled Initialization - A Worst Case Analysis 2022 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162 Munteanu A, Omlor S, Song Z, Woodruff DP
Preprint Bounding the Width of Neural Networks via Coupled Initialization -- A Worst Case Analysis 2022 Munteanu A, Omlor S, Song Z, Woodruff DP
Conference FAST REGRESSION FOR STRUCTURED INPUTS 2022 • ICLR 2022 - 10th International Conference on Learning Representations Meyer RA, Musco C, Musco C, Woodruff DP, Zhou S
Conference Frequency Estimation with One-Sided Error 2022 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 2022-January:695-707 Indyk P, Narayanan S, Woodruff DP
Conference High-Dimensional Geometric Streaming in Polynomial Space 2022 • Annual Symposium on Foundations of Computer Science • 732-743 Woodruff DP, Yasuda T
Conference Improved Algorithms for Low Rank Approximation from Sparsity 2022 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 2358-2403 Woodruff DP, Yasuda T
Conference Learning-Augmented Binary Search Trees 2022 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162 Lin H, Luo T, Woodruff DP
Conference LEARNING-AUGMENTED k-MEANS CLUSTERING 2022 • ICLR 2022 - 10th International Conference on Learning Representations Ergun JC, Feng Z, Silwal S, Woodruff DP, Zhou S
Conference Leverage Score Sampling for Tensor Product Matrices in Input Sparsity Time 2022 • Proceedings of Machine Learning Research • 162:23933-23964 Woodruff DP, Zandieh A
Preprint Leverage Score Sampling for Tensor Product Matrices in Input Sparsity Time 2022 Woodruff DP, Zandieh A
Preprint Low-Rank Approximation with $1/\epsilon^{1/3}$ Matrix-Vector Products 2022 Bakshi A, Clarkson KL, Woodruff DP
Conference Low-rank approximation with 1/𝜖 1/3 matrix-vector products 2022 • Annual ACM Symposium on Theory of Computing • 1130-1143 Bakshi A, Clarkson KL, Woodruff DP
Conference Memory Bounds for the Experts Problem 2022 • Annual ACM Symposium on Theory of Computing • 1158-1171 Srinivas V, Woodruff DP, Xu Z, Zhou S
