Simulated annealing for optimization of graphs and sequences
Xianggen Liu, Pengyong Li, Fandong Meng, Hao Zhou, Huasong Zhong, Jie, Zhou, Lili Mou, Sen Song

TL;DR
This paper introduces SAGS, a novel neural network-guided simulated annealing framework for optimizing graphs and sequences, effectively handling complex constraints in discrete structures for applications like paraphrase and molecule generation.
Contribution
SAGS integrates neural networks into simulated annealing to improve discrete structure optimization by guiding local edits with learned proposals, addressing complex constraints.
Findings
Achieves state-of-the-art results in paraphrase generation.
Significantly outperforms previous methods in molecule generation.
Effective in handling complex syntax and semantic constraints.
Abstract
Optimization of discrete structures aims at generating a new structure with the better property given an existing one, which is a fundamental problem in machine learning. Different from the continuous optimization, the realistic applications of discrete optimization (e.g., text generation) are very challenging due to the complex and long-range constraints, including both syntax and semantics, in discrete structures. In this work, we present SAGS, a novel Simulated Annealing framework for Graph and Sequence optimization. The key idea is to integrate powerful neural networks into metaheuristics (e.g., simulated annealing, SA) to restrict the search space in discrete optimization. We start by defining a sophisticated objective function, involving the property of interest and pre-defined constraints (e.g., grammar validity). SAGS searches from the discrete space towards this objective by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
