Conference Faster Algorithms for High-Dimensional Robust Covariance Estimation 2019 • CONFERENCE ON LEARNING THEORY, VOL 99 • 99: Cheng Y, Diakonikolas I, Ge R, Woodruff DP
Conference Learning Two Layer Rectified Neural Networks in Polynomial Time 2019 • Proceedings of Machine Learning Research • 99:195-268 Bakshi A, Jayaram R, Woodruff DP
Journal Article Non-Convex Matrix Completion and Related Problems via Strong Duality 2019 • Journal of machine learning research • 20: Balcan M-F, Liang Y, Song Z, Woodruff DP, Zhang H
Preprint Oblivious Sketching of High-Degree Polynomial Kernels 2019 Ahle TD, Kapralov M, Knudsen JBT, Pagh R, Velingker A, Woodruff D, Zandieh A
Journal Article ON APPROXIMATING MATRIX NORMS IN DATA STREAMS 2019 • SIAM journal on computing (Print) • 48(6):1643-1697 Li Y, Nguyen HL, Woodruff DP
Conference On coresets for logistic regression 2019 • Lecture Notes in Informatics • 294:267-268 Munteanu A, Schwiegelshohn C, Sohler C, Woodruff DP
Conference Optimal Sketching for Kronecker Product Regression and Low Rank Approximation 2019 • Advances in Neural Information Processing Systems • 32: Diao H, Jayaram R, Song Z, Sun W, Woodruff DP
Conference Querying a matrix through matrix-vector products 2019 • Leibniz International Proceedings in Informatics • 132: Sun X, Woodruff DP, Yang G, Zhang J
Conference Regularized Weighted Low Rank Approximation 2019 • Advances in Neural Information Processing Systems • 32: Ban F, Woodruff D, Zhang QR
Conference Relative Error Tensor Low Rank Approximation 2019 • PROCEEDINGS OF THE 2019 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA • 2772-2789 Song Z, Woodruff DP, Zhong P
Preprint Robust and Sample Optimal Algorithms for PSD Low-Rank Approximation 2019 Bakshi A, Chepurko N, Woodruff DP
Journal Article Robust communication-optimal distributed clustering algorithms 2019 • Leibniz International Proceedings in Informatics • 132: Awasthi P, Bakshi A, Balcan MF, White C, Woodruff DP
Preprint Sample-Optimal Low-Rank Approximation of Distance Matrices 2019 Indyk P, Vakilian A, Wagner T, Woodruff D
Conference Sample-Optimal Low-Rank Approximation of Distance Matrices 2019 • CONFERENCE ON LEARNING THEORY, VOL 99 • 99: Indyk P, Vakilian A, Wagner T, Woodruff DP
Conference Separating k-player from T-player one-way communication, with applications to data streams 2019 • Leibniz International Proceedings in Informatics • 132: Woodruff DP, Yang G
Preprint Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation 2019 Musco C, Musco C, Woodruff DP
Conference Sublinear Time Numerical Linear Algebra for Structured Matrices 2019 • Proceedings of the ... AAAI Conference on Artificial Intelligence. AAAI Conference on Artificial Intelligence • 4918-4925 Shi X, Woodruff DP
Conference Testing Matrix Rank, Optimally 2019 • PROCEEDINGS OF THE 2019 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA • 727-746 Balcan M-F, Li Y, Woodruff DP, Zhang H
Conference The one-way communication complexity of dynamic time warping distance 2019 • Leibniz International Proceedings in Informatics • 129: Braverman V, Charikar M, Kuszmaul W, Woodruff DP, Yang LF
Preprint The One-Way Communication Complexity of Dynamic Time Warping Distance 2019 Braverman V, Charikar M, Kuszmaul W, Woodruff DP, Yang LF
Conference The query complexity of mastermind with ℓp distances 2019 • Leibniz International Proceedings in Informatics • 145: Fernández MV, Woodruff DP, Yasuda T
Conference Tight bounds for `p oblivious subspace embeddings 2019 • Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms • 1825-1843 Wang R, Woodruff DP
Conference Tight dimensionality reduction for sketching low degree polynomial kernels 2019 • Advances in Neural Information Processing Systems • 32: Meister M, Sarlos T, Woodruff DP
Conference Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel <i>k</i>-means Clustering 2019 • INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97 • 97: Fernandez M, Woodruff DP, Yasuda T
