GenCO: Generating Diverse Solutions to Design Problems with Combinatorial Nature

23 Sept 2023 (modified: 11 Feb 2024)Submitted to ICLR 2024EveryoneRevisionsBibTeX
Primary Area: optimization
Code Of Ethics: I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics.
Keywords: generative models, combinatorial optimization, end-to-end learning
Submission Guidelines: I certify that this submission complies with the submission instructions as described on https://iclr.cc/Conferences/2024/AuthorGuide.
TL;DR: We are proposing an end-to-end learning framework for deep generative models that produce objects with intricate combinatorial properties.
Abstract: The generation of diverse but realistic objects that have combinatorial properties has various practical applications across several fields, including computer graphics, animation, industrial design, material science, etc. For instance, we might want to restrict the output of the generator so that it satisfies discrete constraints or encourage certain combinatorial properties as a penalty. However, existing generative models and optimization solvers often struggle to concurrently ensure solution diversity and uphold the underlying combinatorial nature. To address this, we propose $GenCO$, a novel framework that conducts end-to-end training of deep generative models integrated with embedded combinatorial solvers, aiming to uncover high-quality solutions aligned with nonlinear objectives. While structurally akin to conventional generative models, $GenCO$ diverges in its role - it focuses on generating instances of combinatorial optimization problems rather than final objects (e.g., images). This shift allows finer control over the generated outputs, enabling assessments of their feasibility and introducing an additional combinatorial loss component. We demonstrate the effectiveness of our approach on a variety of generative tasks characterized by combinatorial intricacies, including game level generation and map creation for path planning, consistently demonstrating its capability to yield diverse, high-quality solutions that reliably adhere to user-specified combinatorial properties.
Anonymous Url: I certify that there is no URL (e.g., github page) that could be used to find authors' identity.
Supplementary Material: pdf
No Acknowledgement Section: I certify that there is no acknowledgement section in this submission for double blind review.
Submission Number: 6999
Loading