combinatorial optimization

Experimental Design on a Budget for Sparse Linear Models and Applications ICML 2016 Hardness of Online Sleeping Combinatorial Optimization Problems NeurIPS 2016 Importance Weighting Without Importance Weights: An Efficient Algorithm for Combinatorial Semi-Bandits JMLR 2016 Improved Learning Complexity in Combinatorial Pure Exploration Bandits AISTATS 2016 Joint Probabilistic Matching Using m-Best Solutions CVPR 2016 Learning Combinatorial Functions from Pairwise Comparisons COLT 2016 Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization ICML 2016 Maximization of Approximately Submodular Functions NeurIPS 2016 Min Norm Point Algorithm for Higher Order MRF-MAP Inference CVPR 2016 Phased Exploration with Greedy Exploitation in Stochastic Combinatorial Partial Monitoring Games NeurIPS 2016 Pruning Random Forests for Prediction on a Budget NeurIPS 2016 Relaxation-Based Preprocessing Techniques for Markov Random Field Inference CVPR 2016 Rounding-based Moves for Semi-Metric Labeling JMLR 2016 Solving Temporal Puzzles CVPR 2016 Tensor Power Iteration for Multi-Graph Matching CVPR 2016 The Chordal Graph Polytope for Learning Decomposable Models PGM 2016 The Effect of Combination Functions on the Complexity of Relational Bayesian Networks PGM 2016 The Product Cut NeurIPS 2016 Tightness of LP Relaxations for Almost Balanced Models AISTATS 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 Combinatorial Cascading Bandits NeurIPS 2015 Correlation Clustering with Noisy Partial Information COLT 2015 Discrete Hyper-Graph Matching CVPR 2015