Algorithms

Near-Optimal Entrywise Sampling of Numerically Sparse Matrices COLT 2021 Random Graph Matching with Improved Noise Robustness COLT 2021 Learning-Augmented Data Stream Algorithms ICLR 2020 ODE-Inspired Analysis for the Biological Version of Oja’s Rule in Solving Streaming PCA COLT 2020 A2BCD: Asynchronous Acceleration with Optimal Complexity ICLR 2019 An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors NeurIPS 2019 Distributed PageRank Computation: An Improved Theoretical Study AAAI 2019 Practical Locally Private Heavy Hitters NeurIPS 2017 Algorithms and matching lower bounds for approximately-convex optimization NeurIPS 2016 Recovery Guarantee of Non-negative Matrix Factorization via Alternating Updates NeurIPS 2016 The Multi-fidelity Multi-armed Bandit NeurIPS 2016 Column Selection via Adaptive Sampling NeurIPS 2015 Fast, Provable Algorithms for Isotonic Regression in all L_p-norms NeurIPS 2015 Learning Causal Graphs with Small Interventions NeurIPS 2015 On the Optimality of Classifier Chain for Multi-label Classification NeurIPS 2015 Practical and Optimal LSH for Angular Distance NeurIPS 2015 SubmodBoxes: Near-Optimal Search for a Set of Diverse Object Proposals NeurIPS 2015 Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's NeurIPS 2015 An Accelerated Proximal Coordinate Gradient Method NeurIPS 2014 Consistency of Spectral Partitioning of Uniform Hypergraphs under Planted Partition Model NeurIPS 2014 Constrained convex minimization via model-based excessive gap NeurIPS 2014 Fast and Robust Least Squares Estimation in Corrupted Linear Models NeurIPS 2014 Provable Submodular Minimization using Wolfe's Algorithm NeurIPS 2014 Streaming, Memory Limited Algorithms for Community Detection NeurIPS 2014 The Noisy Power Method: A Meta Algorithm with Applications NeurIPS 2014