Gen-DFL: Decision-Focused Generative Learning for Robust Decision Making
Prince Zizhuang Wang, Jinhao Liang, Shuyi Chen, Ferdinando Fioretto, Shixiang Zhu
TL;DR
Gen-DFL addresses uncertainty in high-dimensional, risk-sensitive decision problems by learning the conditional distribution $p(c|x)$ with conditional normalizing flows and optimizing tail-risk via CVaR. It pairs a generate-then-optimize paradigm with a joint loss that blends decision-focused regret and generative-model objectives, enabling adaptive sampling from high-risk regions without over-conservatism. Theoretical results bound the surrogate-regret gap via distributional distance and quantify improvement over traditional Pred-DFL, especially as problem dimensionality and tail risk increase. Empirically, Gen-DFL outperforms baselines on portfolio management, knapsack, shortest-path, and energy scheduling tasks, demonstrating enhanced robustness and decision quality in diverse settings.
Abstract
Decision-focused learning (DFL) integrates predictive models with downstream optimization, directly training machine learning models to minimize decision errors. While DFL has been shown to provide substantial advantages when compared to a counterpart that treats the predictive and prescriptive models separately, it has also been shown to struggle in high-dimensional and risk-sensitive settings, limiting its applicability in real-world settings. To address this limitation, this paper introduces decision-focused generative learning (Gen-DFL), a novel framework that leverages generative models to adaptively model uncertainty and improve decision quality. Instead of relying on fixed uncertainty sets, Gen-DFL learns a structured representation of the optimization parameters and samples from the tail regions of the learned distribution to enhance robustness against worst-case scenarios. This approach mitigates over-conservatism while capturing complex dependencies in the parameter space. The paper shows, theoretically, that Gen-DFL achieves improved worst-case performance bounds compared to traditional DFL. Empirically, it evaluates Gen-DFL on various scheduling and logistics problems, demonstrating its strong performance against existing DFL methods.
