Learning for Robust Combinatorial Optimization: Algorithm and Application

Learning to optimize (L2O) has recently emerged as a promising approach to solving optimization problems by exploiting the strong prediction power of neural networks and offering lower runtime complexity than conventional solvers. While L2O has been applied to various problems, a crucial yet challen...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annual Joint Conference of the IEEE Computer and Communications Societies S. 930 - 939
Hauptverfasser: Shao, Zhihui, Yang, Jianyi, Shen, Cong, Ren, Shaolei
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 02.05.2022
Schlagworte:
Complexity theory
Computational modeling
Linear programming
Neural networks
Robustness
Runtime
Training
ISSN:2641-9874
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Learning to optimize (L2O) has recently emerged as a promising approach to solving optimization problems by exploiting the strong prediction power of neural networks and offering lower runtime complexity than conventional solvers. While L2O has been applied to various problems, a crucial yet challenging class of problems - robust combinatorial optimization in the form of minimax optimization - have largely remained under-explored. In addition to the exponentially large decision space, a key challenge for robust combinatorial optimization lies in the inner optimization problem, which is typically non-convex and entangled with outer optimization. In this paper, we study robust combinatorial optimization and propose a novel learning-based optimizer, called LRCO (Learning for Robust Combinatorial Optimization), which quickly outputs a robust solution in the presence of uncertain context. LRCO leverages a pair of learning-based optimizers - one for the minimizer and the other for the maximizer - that use their respective objective functions as losses and can be trained without the need of labels for training problem instances. To evaluate the performance of LRCO, we perform simulations for the task offloading problem in vehicular edge computing. Our results highlight that LRCO can greatly reduce the worst-case cost and improve robustness, while having a very low runtime complexity.
ISSN:2641-9874
DOI:10.1109/INFOCOM48880.2022.9796715