Combinatorial Optimization

Sample Complexity of Automated Mechanism Design NeurIPS 2016 Solving Marginal MAP Problems with NP Oracles and Parity Constraints NeurIPS 2016 Solving Temporal Puzzles CVPR 2016 Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices JMLR 2016 Structured Sparse Regression via Greedy Hard Thresholding NeurIPS 2016 Tensor Power Iteration for Multi-Graph Matching CVPR 2016 The Chordal Graph Polytope for Learning Decomposable Models PGM 2016 The Power of Optimization from Samples NeurIPS 2016 The Product Cut NeurIPS 2016 Tightness of LP Relaxations for Almost Balanced Models AISTATS 2016 Trust No One: Low Rank Matrix Factorization Using Hierarchical RANSAC CVPR 2016 Video-Story Composition via Plot Analysis CVPR 2016 A Flexible Tensor Block Coordinate Ascent Scheme for Hypergraph Matching CVPR 2015 A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice NeurIPS 2015 Algorithms for the Hard Pre-Image Problem of String Kernels and the General Problem of String Prediction ICML 2015 A Matrix Decomposition Perspective to Multiple Graph Matching ICCV 2015 An Active Learning Framework using Sparse-Graph Codes for Sparse Polynomials and Graph Sketching NeurIPS 2015 A Nearly-Linear Time Framework for Graph-Structured Sparsity ICML 2015 Book2Movie: Aligning Video Scenes With Book Chapters CVPR 2015 Clique-Graph Matching by Preserving Global & Local Structure CVPR 2015 Computational Complexity of Linear Large Margin Classification With Ramp Loss AISTATS 2015 Computational Lower Bounds for Community Detection on Random Graphs COLT 2015 Correlation Clustering with Noisy Partial Information COLT 2015 Discrete Hyper-Graph Matching CVPR 2015 Discrete Optimization of Ray Potentials for Semantic 3D Reconstruction CVPR 2015