approximation algorithm

Strong Coresets for Hard and Soft Bregman Clustering with Applications to Exponential Family Mixtures AISTATS 2016 The Multi-fidelity Multi-armed Bandit NeurIPS 2016 The Power of Optimization from Samples NeurIPS 2016 Adaptive Stochastic Optimization: From Sets to Paths NeurIPS 2015 A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice NeurIPS 2015 Approximating Sparse PCA from Incomplete Data NeurIPS 2015 A PTAS for Agnostically Learning Halfspaces COLT 2015 Correlation Clustering in Data Streams ICML 2015 Correlation Clustering with Noisy Partial Information COLT 2015 Fast Distributed k-Center Clustering with Outliers on Massive Data NeurIPS 2015 Monotone k-Submodular Function Maximization with Size Constraints NeurIPS 2015 Parallel Correlation Clustering on Big Graphs NeurIPS 2015 Submodular Hamming Metrics NeurIPS 2015 Variable Selection is Hard COLT 2015 Anti-differentiating approximation algorithms:A case study with min-cuts, spectral, and flow ICML 2014 Concavity of reweighted Kikuchi approximation NeurIPS 2014 Coresets for k-Segmentation of Streaming Data NeurIPS 2014 Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost ICML 2014 Distributed Balanced Clustering via Mapping Coresets NeurIPS 2014 Nonnegative Sparse PCA with Provable Guarantees ICML 2014 Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm ICML 2014 Parallel Double Greedy Submodular Maximization NeurIPS 2014 Rounding-based Moves for Metric Labeling NeurIPS 2014 Stochastic Network Design in Bidirected Trees NeurIPS 2014 The Complexity of Learning Halfspaces using Generalized Linear Methods COLT 2014