Efficient Inference for Distributions on Permutations

December 2007

Efficient Inference for Distributions on Permutations

Authors:

Jonathan Huang, Carlos Ernesto Guestrin, and Leonidas Guibas
Conference Paper
Proceedings of (NeurIPS) Neural Information Processing Systems

Abstract:

Permutations are ubiquitous in many real world problems, such as voting, rankings and data association. Representing uncertainty over permutations is challenging, since there are n! possibilities, and typical compact representations such as graphical models cannot efficiently capture the mutual exclusivity constraints associated with permutations. In this paper, we use the "low-frequency" terms of a Fourier decomposition to represent such distributions compactly. We present Kronecker conditioning, a general and efficient approach for maintaining these distributions directly in the Fourier domain. Low order Fourier-based approximations can lead to functions that do not correspond to valid distributions. To address this problem, we present an efficient quadratic program defined directly in the Fourier domain to project the approximation onto a relaxed form of the marginal polytope. We demonstrate the effectiveness of our approach on a real camera-based multi-people tracking setting.
@conference{Huang-2007-17046,
author = {Jonathan Huang And Carlos Ernesto Guestrin And Leonidas Guibas},
title = {Efficient Inference for Distributions on Permutations},
booktitle = {Proceedings of (NeurIPS) Neural Information Processing Systems},
year = {2007},
month = {December},
pages = {697 - 704},
}
Copyright notice: 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. These works may not be reposted without the explicit permission of the copyright holder.