Gradient boosting for convex cone predict and optimize problems

2022/04/14 by Butler, Andrew, Kwon, Roy H.
#FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.2204.06895

Abstract

Prediction models are typically optimized independently from decision optimization. A smart predict then optimize (SPO) framework optimizes prediction models to minimize downstream decision regret. In this paper we present dboost, the first general purpose implementation of smart gradient boosting for `predict, then optimize' problems. The framework supports convex quadratic cone programming and gradient boosting is performed by implicit differentiation of a custom fixed-point mapping. Experiments comparing with state-of-the-art SPO methods show that dboost can further reduce out-of-sample decision regret.

Related

• Optimization by gradient boosting
• CaVE: A Cone-Aligned Approach for Fast Predict-then-optimize with Binary Linear Programs
• Accelerated Gradient Boosting
• Smart "Predict, then Optimize"
• Learning Joint Models of Prediction and Optimization