arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.09121quant-ph
收藏

对称张量网络用于生成建模与约束组合优化

Symmetric Tensor Networks for Generative Modeling and Constrained Combinatorial Optimization

Javier Lopez-Piqueres, Jing Chen, Alejandro Perdomo-Ortiz

AI总结:

本研究将整数等式约束编码进U(1)对称张量网络,作为量子启发生成模型,仅输出有效样本,减少参数与计算成本,在约束组合优化中优于无约束对应模型。

摘要:

约束组合优化问题在工业界中比比皆是,从投资组合优化到物流。解决这些问题的主要障碍之一是存在非平凡硬约束,这些约束限制了有效的搜索空间。在一些启发式求解器中,这些问题通常通过在成本函数中引入某些拉格朗日乘子来处理,或以某种方式放松它们,甚至更糟的是,通过生成大量样本并仅保留有效样本,这导致非常昂贵且低效的搜索。在这项工作中,我们将形式为Ax=b的任意整数等式约束直接编码到U(1)对称张量网络(TNs)中,并利用它们作为量子启发生成模型的适用性来辅助搜索组合优化问题的解。这使我们能够利用TN生成模型的泛化能力,同时约束它们使其仅输出有效样本。我们的约束TN生成模型通过减少参数数量和计算成本来高效地捕获约束。我们发现,在具有任意等式约束的任务中,对称矩阵乘积态在寻找新颖且更好的组合优化问题解方面优于其标准的无约束对应模型。

英文摘要:

Constrained combinatorial optimization problems abound in industry, from portfolio optimization to logistics. One of the major roadblocks in solving these problems is the presence of non-trivial hard constraints which limit the valid search space. In some heuristic solvers, these are typically addressed by introducing certain Lagrange multipliers in the cost function, by relaxing them in some way, or worse yet, by generating many samples and only keeping valid ones, which leads to very expensive and inefficient searches. In this work, we encode arbitrary integer-valued equality constraints of the form Ax=b, directly into U(1) symmetric tensor networks (TNs) and leverage their applicability as quantum-inspired generative models to assist in the search of solutions to combinatorial optimization problems. This allows us to exploit the generalization capabilities of TN generative models while constraining them so that they only output valid samples. Our constrained TN generative model efficiently captures the constraints by reducing number of parameters and computational costs. We find that at tasks with constraints given by arbitrary equalities, symmetric Matrix Product States outperform their standard unconstrained counterparts at finding novel and better solutions to combinatorial optimization problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑