Discrete Optimization

An LP View of the M-best MAP problem NeurIPS 2009 Beyond Convexity: Online Submodular Minimization NeurIPS 2009 Local Rules for Global MAP: When Do They Work ? NeurIPS 2009 Randomized Pruning: Efficiently Calculating Expectations in Large Dynamic Programs NeurIPS 2009 An Online Algorithm for Maximizing Submodular Functions NeurIPS 2008 Clustering via LP-based Stabilities NeurIPS 2008 Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation NeurIPS 2008 Inferring rankings under constrained sensing NeurIPS 2008 Learning Balls of Strings from Edit Corrections JMLR 2008 MDPs with Non-Deterministic Policies NeurIPS 2008 One sketch for all: Theory and Application of Conditional Random Sampling NeurIPS 2008 An Analysis of Convex Relaxations for MAP Estimation NeurIPS 2007 A Randomized Algorithm for Large Scale Support Vector Learning NeurIPS 2007 Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning RSS 2007 Efficient Inference for Distributions on Permutations NeurIPS 2007 Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations NeurIPS 2007 Linear programming analysis of loopy belief propagation for weighted matching NeurIPS 2007 Local Algorithms for Approximate Inference in Minor-Excluded Graphs NeurIPS 2007 Progressive mixture rules are deviation suboptimal NeurIPS 2007 Selecting Observations against Adversarial Objectives NeurIPS 2007 Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints NeurIPS 2006