Embedding Decision Diagrams into Generative Adversarial Networks

3Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Many real-world decision-making problems do not possess a clearly defined objective function, but instead aim to find solutions that capture implicit user preferences. This makes it challenging to directly apply classical optimization technology such as integer programming or constraint programming. Machine learning provides an alternative by learning the agents’ decision-making implicitly via neural networks. However, solutions generated by neural networks often fail to satisfy physical or operational constraints. We propose a hybrid approach, DDGan, that embeds a Decision Diagram (DD) into a Generative Adversarial Network (GAN). In DDGan, the solutions generated from the neural network are filtered through a decision diagram module to ensure feasibility. DDGan thus combines the benefits of machine learning and constraint reasoning. When applied to the problem of schedule generation, we demonstrate that DDGan generates schedules that reflect the agents’ implicit preferences, and better satisfy operational constraints.

Cite

CITATION STYLE

APA

Xue, Y., & van Hoeve, W. J. (2019). Embedding Decision Diagrams into Generative Adversarial Networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11494 LNCS, pp. 616–632). Springer Verlag. https://doi.org/10.1007/978-3-030-19212-9_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free