Perturb-and-MAP random fields: Using discrete optimization to learn and sample from energy models

We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding the global minimum of the perturbed energy function. The resulting Perturb-and-MAP random fields harness the power of modern discrete energy minimization algorithms, effectively transforming them into efficient random sampling algorithms, thus extending their scope beyond the usual deterministic setting. In this fashion we can enjoy the benefits of a sound probabilistic framework, such as the ability to represent the solution uncertainty or learn model parameters from training data, while completely bypassing costly Markov-chain Monte-Carlo procedures typically associated with discrete label Gibbs Markov random fields (MRFs). We study some interesting theoretical properties of the proposed model in juxtaposition to those of Gibbs MRFs and address the issue of principled design of the perturbation process. We present experimental results in image segmentation and scene labeling that illustrate the new qualitative aspects and the potential of the proposed model for practical computer vision applications.

Spatial Interaction andthe Statistical Analysi…Spatial Interaction and the Statistical Analysis of Lattice SystemsFast Approximate EnergyMinimization via Graph…Fast Approximate Energy Minimization via Graph CutsWhat Energy FunctionsCan Be Minimized via…What Energy Functions Can Be Minimized via Graph Cuts?Convex OptimizationConvex Optimization"GrabCut": interactiveforeground extraction…"GrabCut": interactive foreground extraction using iterated graph cutsRandom Walks for ImageSegmentationRandom Walks for Image SegmentationA Tutorial onEnergy-Based LearningA Tutorial on Energy-Based LearningMinimizing NonsubmodularFunctions with Graph…Minimizing Nonsubmodular Functions with Graph Cuts-A ReviewMeasuring uncertainty ingraph cut solutionsMeasuring uncertainty in graph cut solutionsLearning CRFs UsingGraph CutsLearning CRFs Using Graph CutsGaussian sampling bylocal perturbationsGaussian sampling by local perturbationsA generative perspectiveon MRFs in low-level…A generative perspective on MRFs in low-level visionOn the PartitionFunction and Random…On the Partition Function and Random Maximum A-Posteriori PerturbationsRandomized OptimumModels for Structured…Randomized Optimum Models for Structured PredictionDiverse M-Best Solutionsin Markov Random FieldsDiverse M-Best Solutions in Markov Random FieldsOn Sampling from theGibbs Distribution with…On Sampling from the Gibbs Distribution with Random Maximum A-Posteriori PerturbationsLearning EfficientRandom Maximum…Learning Efficient Random Maximum A-Posteriori Predictors with Non-Decomposable Loss FunctionsA* SamplingA* SamplingActive BoundaryAnnotation using Random…Active Boundary Annotation using Random MAP PerturbationsOn Measure Concentrationof Random Maximum…On Measure Concentration of Random Maximum A-Posteriori PerturbationsInferring M-Best DiverseLabelings in a Single…Inferring M-Best Diverse Labelings in a Single OneActive learning forstructured probabilisti…Active learning for structured probabilistic models with histogram approximationGradient Estimation withStochastic Softmax…Gradient Estimation with Stochastic Softmax TricksImplicit MLE:Backpropagating Through…Implicit MLE: Backpropagating Through Discrete Exponential Family DistributionsPerturb-and-MAP randomfields: Using discrete…Perturb-and-MAP random fields: Using discrete optimization to learn and sample from energy modelsEarlier referencesFocus paperCiting papersOlderNewer

Click a node to pin it, click the empty canvas to go back to this paper, or hover to preview. Open a node’s page from its title.