In this paper, we propose novel algorithms for inferring the Maximum a Posteriori (MAP) solution of discrete pairwise random field models under multiple constraints. We show how this constrained discrete optimization problem can be formulated as a multi-dimensional parametric mincut problem via its Lagrangian dual, and prove that our algorithm isolates all constraint instances for which the problem can be solved exactly. These multiple solutions enable us to even deal with `soft constraints' (higher order penalty functions). Moreover, we propose two practical variants of our algorithm to solve problems with hard constraints. We also show how our method can be applied to solve various constrained discrete optimization problems such as submodular minimization and shortest path computation. Experimental evaluation using the foreground-background image segmentation problem with statistic constraints reveals that our method is faster and its results are closer to the ground truth labellings compared with the popular continuous relaxation based methods.
Mirror Descent Using the Tempesta Generalized Multi-parametric Logarithms
Systems Research Institute of Polish Academy of Science(波兰科学院系统研究所);Nicolaus Copernicus University in Torun (UMK)(托伦 Nicolaus Copernicus 大学);Global Innovation Research Institute of Tokyo University of Agriculture and Technology(东京大学农业技术大学校全球创新研究所);Riken AIP(理化学研究所AIP)
Learning Constrained Adaptive Differentiable Predictive Control Policies With Guarantees
Pacific Northwest National Laboratory(太平洋西北国家实验室)
我们提出了可微预测控制(DPC),学习约束的线性系统的概率性能保证的神经控制策略的方法。我们采用自动微分获得直接的政策梯度反向传播的模型预测控制(MPC)的损失函数和约束的惩罚,通过可微的闭环系统动力学模型。我们证明了所提出的方法可以学习参数约束控制策略来稳定具有不稳定动态的系统,跟踪时变参考,并满足非线性状态和输入约束。与基于模仿学习的方法相比,我们的方法不依赖于监督控制器。最重要的是,我们证明,在不损失性能的情况下,我们的方法是可扩展的,计算效率比隐式,显式和近似MPC。IEEE Transactions on Automatic Control(IEEE自动控制学报)