USCO-Solver: Solving Undetermined Stochastic Combinatorial Optimization ProblemsDownload PDF

21 May 2021, 20:41 (modified: 20 Oct 2021, 15:59)NeurIPS 2021 PosterReaders: Everyone
Keywords: structured prediction, combinatorial optimization, generalization bound
TL;DR: A learning framework for solving undetermined stochastic combinatorial optimization problems
Abstract: Real-world decision-making systems are often subject to uncertainties that have to be resolved through observational data. Therefore, we are frequently confronted with combinatorial optimization problems of which the objective function is unknown and thus has to be debunked using empirical evidence. In contrast to the common practice that relies on a learning-and-optimization strategy, we consider the regression between combinatorial spaces, aiming to infer high-quality optimization solutions from samples of input-solution pairs -- without the need to learn the objective function. Our main deliverable is a universal solver that is able to handle abstract undetermined stochastic combinatorial optimization problems. For learning foundations, we present learning-error analysis under the PAC-Bayesian framework using a new margin-based analysis. In empirical studies, we demonstrate our design using proof-of-concept experiments, and compare it with other methods that are potentially applicable. Overall, we obtain highly encouraging experimental results for several classic combinatorial problems on both synthetic and real-world datasets.
Supplementary Material: zip
Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.
Code: https://github.com/cdslabamotong/USCO-Solver
9 Replies

Loading