Combinatorial Optimization

Support Recovery for Orthogonal Matching Pursuit: Upper and Lower bounds NeurIPS 2018 The Computational Complexity of Distinctive Feature Minimization in Phonology NAACL 2018 The Edge Density Barrier: Computational-Statistical Tradeoffs in Combinatorial Inference ICML 2018 The Price of Usability: Designing Operationalizable Strategies for Security Games IJCAI 2018 The Weighted Kendall and High-order Kernels for Permutations ICML 2018 Time-Space Tradeoffs for Learning Finite Functions from Random Evaluations, with Applications to Polynomials COLT 2018 Topkapi: Parallel and Fast Sketches for Finding Top-K Frequent Elements NeurIPS 2018 Towards Improving the Expressivity and Scalability of Distributed Constraint Optimization Problems IJCAI 2018 Unary Integer Linear Programming with Structural Restrictions IJCAI 2018 Variable-Delay Controllability IJCAI 2018 Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? ICML 2018 WHInter: A Working set algorithm for High-dimensional sparse second order Interaction models ICML 2018 Winning a Tournament by Any Means Necessary IJCAI 2018 A Combinatorial Solution to Non-Rigid 3D Shape-To-Image Matching CVPR 2017 A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems CVPR 2017 Affinity Clustering: Hierarchical Clustering at Scale NeurIPS 2017 A Greedy Approach for Budgeted Maximum Inner Product Search NeurIPS 2017 Alternating Direction Graph Matching CVPR 2017 A Message Passing Algorithm for the Minimum Cost Multicut Problem CVPR 2017 Analysis and Optimization of Graph Decompositions by Lifted Multicuts ICML 2017 Approximate Supermodularity Bounds for Experimental Design NeurIPS 2017 Approximation Algorithms for ℓ_0-Low Rank Approximation NeurIPS 2017 A SAT Approach to Branchwidth IJCAI 2017 A Scalable Approach to Chasing Multiple Moving Targets with Multiple Agents IJCAI 2017 A Screening Rule for l1-Regularized Ising Model Estimation NeurIPS 2017