Skip to content

Latest commit

 

History

History
50 lines (32 loc) · 3.18 KB

README.md

File metadata and controls

50 lines (32 loc) · 3.18 KB

PredictiveCO Benchmark

Official Implementation of NeurIPS 2024 Datasets and Benchmarks Track paper:
"Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime"

This repository provides the base code for Predictive-CO. The complete code will be comming soon.

Abstract

Predictive combinatorial optimization, where the parameters of combinatorial optimization (CO) are unknown at the decision-making time, is the precise modeling of many real-world applications, including energy cost-aware scheduling and budget allocation on advertising. Tackling such a problem usually involves a prediction model and a CO solver. These two modules are integrated into the predictive CO pipeline following two design principles: ''Predict-then-Optimize (PtO)'', which learns predictions by supervised training and subsequently solves CO using predicted coefficients, while the other, named ''Predict-and-Optimize (PnO)'', directly optimizes towards the ultimate decision quality and claims to yield better decisions than traditional PtO approaches. However, there lacks a systematic benchmark of both approaches, including the specific design choices at the module level, as well as an evaluation dataset that covers representative real-world scenarios. To this end, we develop a modular framework to benchmark 11 existing PtO/PnO methods on 8 problems, including a new industrial dataset for combinatorial advertising that will be released. Our study shows that PnO approaches are better than PtO on 7 out of 8 benchmarks, but there is no silver bullet found for the specific design choices of PnO. A comprehensive categorization of current approaches and integration of typical scenarios are provided under a unified benchmark. Therefore, this paper could serve as a comprehensive benchmark for future PnO approach development and also offer fast prototyping for application-focused development.

Predictive-CO Benchmark

example Example of combinatorial optimization under uncertain coefficients for energy cost-aware scheduling, and illustration of PtO and PnO.

Modular Framework

In this benchmark, we provide modular framework implementation where users can adopt their own deployments on specific problems, predictors, solvers, losses and evaluations.

modular

Use of Predictive-CO Benchmark

Install

Prior to running this benchmark, you could install this package locally using:

pip install -e .

Run of PtO and PnO algorithms

Please refer to the shell under ''shells/benchmarks'' folder for the specific problems.

Citation

If you find our work useful in your research, please consider citing:

@inproceedings{geng2024predictive,
  title={Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime},
  author={Geng, Haoyu and Ruan, Hang and Wang, Runzhong and Li, Yang and Wang, Yang and Chen, Lei and Yan, Junchi},
  booktitle={NeurIPS 2024 Datasets and Benchmarks Track},
  year={2024}
}

Acknowledgement

When you use this benchmark dataset, it indicates that you comply with the terms of use specified in Appendix C.