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
Preprint Near-Linear Sample Complexity for $L_p$ Polynomial Regression 2022 Meyer RA, Musco C, Musco C, Woodruff DP, Zhou S
Preprint Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions 2022 Mahankali AV, Woodruff DP, Zhang Z
Conference Noisy Boolean Hidden Matching with Applications 2022 • Leibniz International Proceedings in Informatics • 215: Kapralov M, Musipatla A, Tardos J, Woodruff DP, Zhou S
Preprint Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time 2022 Cherapanamjeri Y, Silwal S, Woodruff DP, Zhou S
Conference Optimal Query Complexities for Dynamic Trace Estimation 2022 • Advances in Neural Information Processing Systems Woodruff DP, Zhang F, Zhang QR
Journal Article Preface 2022 • Leibniz International Proceedings in Informatics • 229:XV-XVI Bojańczyk M, Merelli E, Woodruff DP
Conference Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra 2022 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162 Chepurko N, Clarkson KL, Horesh L, Lin H, Woodruff DP
Conference Sketching Algorithms and Lower Bounds for Ridge Regression 2022 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162 • 10539-10556 Kacham P, Woodruff DP
