Differentiation of Multi-objective Data-driven Decision Pipeline
Li, Peng, Wu, Lixia, Feng, Chaoqun, Hu, Haoyuan, Fu, Lei, Ye, Jieping
–arXiv.org Artificial Intelligence
Real-world scenarios frequently involve multi-objective data-driven optimization problems, characterized by unknown problem coefficients and multiple conflicting objectives. Traditional two-stage methods independently apply a machine learning model to estimate problem coefficients, followed by invoking a solver to tackle the predicted optimization problem. The independent use of optimization solvers and prediction models may lead to suboptimal performance due to mismatches between their objectives. Recent efforts have focused on end-to-end training of predictive models that use decision loss derived from the downstream optimization problem. However, these methods have primarily focused on single-objective optimization problems, thus limiting their applicability. We aim to propose a multiobjective decision-focused approach to address this gap. In order to better align with the inherent properties of multi-objective optimization problems, we propose a set of novel loss functions. These loss functions are designed to capture the discrepancies between predicted and true decision problems, considering solution space, objective space, and decision quality, named landscape loss, Pareto set loss, and decision loss, respectively. Our experimental results demonstrate that our proposed method significantly outperforms traditional two-stage methods and most current decision-focused methods. Uncertain decision-making is prevalent in various real-life scenarios, such as personalized recommendationsLiu et al. (2023) and path planning Xu et al. (2023) based on route time prediction. These scenarios involve a workflow for handling data-driven decision problems where parameter coefficients are predicted based on environmental or historical information, and decisions are made using these predictions. For instance, in recommendation systems, click-through rate prediction and sorting or top-K recommendation based on click-through rates are common examples. Obtaining a perfect prediction model is often unachievable. The problem coefficients generated by the prediction model are frequently noisy.
arXiv.org Artificial Intelligence
Jun-2-2024
- Country:
- Oceania > Australia
- New South Wales > Sydney (0.04)
- North America
- United States
- Ohio (0.04)
- New York > New York County
- New York City (0.04)
- California > Orange County
- Anaheim (0.04)
- Canada > Quebec
- Montreal (0.04)
- United States
- Oceania > Australia
- Genre:
- Research Report > New Finding (1.00)
- Technology: