arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.02163cs.NEcs.LG
收藏

COIL:学习潜在空间中的约束优化:有效解的学习表示

COIL: Constrained Optimization in Learned Latent Space: Learning Representations for Valid Solutions

UCL(伦敦大学学院);Autodesk Research(欧特克研究院)

Peter J Bentley, Soo Ling Lim, Adam Gaier, Linh Tran

摘要:

约束优化问题可能是困难的,因为它们的搜索空间具有不利于搜索的性质,例如,多模态、不连续性或欺骗。为了解决这些困难,已经进行了大量的研究,创造新的进化算法或专门的遗传算子。然而,如果可以改变定义搜索空间的表示,使得其仅允许满足约束的有效解,则找到最优解的任务将变得更加可行,而不需要任何专门的优化算法。我们提出了约束优化的潜在空间(COIL),它使用VAE生成一个学习的潜在表示从数据集,包括样本的有效区域的搜索空间根据一个约束,从而使优化器找到目标在新的空间定义的学习表示。初步实验表明,与使用无法满足约束或找到合适解决方案的标准表示的相同GA相比,COIL及其学习的潜在表示可以完美地满足不同类型的约束,同时找到高适应度解决方案。

英文摘要:

Constrained optimization problems can be difficult because their search spaces have properties not conducive to search, e.g., multimodality, discontinuities, or deception. To address such difficulties, considerable research has been performed on creating novel evolutionary algorithms or specialized genetic operators. However, if the representation that defined the search space could be altered such that it only permitted valid solutions that satisfied the constraints, the task of finding the optimal would be made more feasible without any need for specialized optimization algorithms. We propose Constrained Optimization in Latent Space (COIL), which uses a VAE to generate a learned latent representation from a dataset comprising samples from the valid region of the search space according to a constraint, thus enabling the optimizer to find the objective in the new space defined by the learned representation. Preliminary experiments show promise: compared to an identical GA using a standard representation that cannot meet the constraints or find fit solutions, COIL with its learned latent representation can perfectly satisfy different types of constraints while finding high-fitness solutions.

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

↑