Combinatorial Optimization

Hierarchical Clustering via Spreading Metrics NeurIPS 2016 Horizontally Scalable Submodular Maximization ICML 2016 How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods COLT 2016 Improved Learning Complexity in Combinatorial Pure Exploration Bandits AISTATS 2016 Joint M-Best-Diverse Labelings as a Parametric Submodular Minimization NeurIPS 2016 Joint Probabilistic Matching Using m-Best Solutions CVPR 2016 Kinematic Structure Correspondences via Hypergraph Matching CVPR 2016 Large-Scale Price Optimization via Network Flow NeurIPS 2016 Learning Combinatorial Functions from Pairwise Comparisons COLT 2016 Learning Sparse Additive Models with Interactions in High Dimensions AISTATS 2016 Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization ICML 2016 Learning Tree Structured Potential Games NeurIPS 2016 Leveraging Sparsity for Efficient Submodular Data Summarization NeurIPS 2016 Linear Relaxations for Finding Diverse Elements in Metric Spaces NeurIPS 2016 Maximization of Approximately Submodular Functions NeurIPS 2016 Memory Efficient Max Flow for Multi-Label Submodular MRFs CVPR 2016 Moral Lineage Tracing CVPR 2016 Multiple Model Fitting as a Set Coverage Problem CVPR 2016 On the Reducibility of Submodular Functions AISTATS 2016 On Valid Optimal Assignment Kernels and Applications to Graph Classification NeurIPS 2016 Optimal Tagging with Markov Chain Optimization NeurIPS 2016 Pruning Random Forests for Prediction on a Budget NeurIPS 2016 Pure Exploration of Multi-armed Bandit Under Matroid Constraints COLT 2016 Relaxation-Based Preprocessing Techniques for Markov Random Field Inference CVPR 2016 Rounding-based Moves for Semi-Metric Labeling JMLR 2016