This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Search for Publication

Year(s) from:  to 
Keywords (separated by spaces):

Herding Generalizes Diverse M -Best Solutions

Ece Ozkan, Gemma Roig, Orcun Goksel, Xavier Boix
, 2016


We show that the algorithm to extract diverse M -solutions from a Conditional Random Field (called divMbest [1]) takes exactly the form of a Herding procedure [2], i.e. a deterministic dynamical system that produces a sequence of hypotheses that respect a set of observed moment constraints. This generalization enables us to invoke properties of Herding that show that divMbest enforces implausible constraints which may yield wrong assumptions for some problem settings. Our experiments in semantic segmentation demonstrate that seeing divMbest as an instance of Herding leads to better alternatives for the implausible constraints of divMbest.

Link to publisher's page
  author = {Ece Ozkan and Gemma Roig and Orcun Goksel and Xavier Boix},
  title = {Herding Generalizes Diverse M -Best Solutions},
  year = {2016},
  institution = {arXiv},
  keywords = {}