Solving constrained combinatorial optimization problems via MAP inference without high-order penalties
Date
2017
Authors
Zhang, Z.
Shi, Q.
McAuley, J.
Wei, W.
Zhang, Y.
Yao, R.
Van Den Hengel, A.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of the ... AAAI Conference on Artificial Intelligence. AAAI Conference on Artificial Intelligence, 2017, pp.3804-3810
Statement of Responsibility
Zhen Zhang, Qinfeng Shi, Julian McAuley, WeiWei, Yanning Zhang, Rui Yao, Anton van den Hengel
Conference Name
Thirty-first AAAI Conference on Artificial Intelligence (AAAI-17) (4 Feb 2017 - 9 Feb 2017 : San Francisco)
Abstract
Solving constrained combinatorial optimization problems via MAP inference is often achieved by introducing extra potential functions for each constraint. This can result in very high order potentials, e.g. a 2nd-order objective with pairwise potentials and a quadratic constraint over all N variables would correspond to an unconstrained objective with an order-N potential. This limits the practicality of such an approach, since inference with high order potentials is tractable only for a few special classes of functions. We propose an approach which is able to solve constrained combinatorial problems using belief propagation without increasing the order. For example, in our scheme the 2nd-order problem above remains order 2 instead of order N. Experiments on applications ranging from foreground detection, image reconstruction, quadratic knapsack, and the M-best solutions problem demonstrate the effectiveness and efficiency of our method. Moreover, we show several situations in which our approach outperforms commercial solvers like CPLEX and others designed for specific constrained MAP inference problems.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright © 2017, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.