Discrete Optimization

Minimizing Sparse High-Order Energies by Submodular Vertex-Cover NeurIPS 2012 Near-Optimal MAP Inference for Determinantal Point Processes NeurIPS 2012 On Bisubmodular Maximization AISTATS 2012 Online Sum-Product Computation Over Trees NeurIPS 2012 QBoost: Large Scale Classifier Training withAdiabatic Quantum Optimization ACML 2012 Randomized Optimum Models for Structured Prediction AISTATS 2012 Selecting Diverse Features via Spectral Regularization NeurIPS 2012 Submodular-Bregman and the Lovász-Bregman Divergences with Applications NeurIPS 2012 (weak) Calibration is Computationally Hard COLT 2012 Learning Higher-Order Graph Structure with Features by Structure Penalty NeurIPS 2011 On fast approximate submodular minimization NeurIPS 2011 Phase transition in the family of p-resistances NeurIPS 2011 Prismatic Algorithm for Discrete D.C. Programming Problem NeurIPS 2011 Scalable Training of Mixture Models via Coresets NeurIPS 2011 Submodular Multi-Label Learning NeurIPS 2011 Decomposing Isotonic Regression for Efficiently Solving Large Problems NeurIPS 2010 Efficient Minimization of Decomposable Submodular Functions NeurIPS 2010 Generalized roof duality and bisubmodular functions NeurIPS 2010 MAP estimation in Binary MRFs via Bipartite Multi-cuts NeurIPS 2010 Minimum Average Cost Clustering NeurIPS 2010 Optimal Web-Scale Tiering as a Flow Problem NeurIPS 2010 Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching AISTATS 2010 Segmentation as Maximum-Weight Independent Set NeurIPS 2010 Solving the Uncapacitated Facility Location Problem Using Message Passing Algorithms AISTATS 2010 Worst-case bounds on the quality of max-product fixed-points NeurIPS 2010