End-to-End Learning for Fair Multiobjective Optimization Under Uncertainty
Not on the map. Why?
Abstract (arXiv)
Many decision processes in artificial intelligence and operations research are modeled by parametric optimization problems whose defining parameters are unknown and must be inferred from observable data. The Predict-Then-Optimize (PtO) paradigm in machine learning aims to maximize downstream decision quality by training the parametric inference model end-to-end with the subsequent constrained optimization. This requires backpropagation through the optimization problem using approximation techniques specific to the problem's form, especially for nondifferentiable linear and mixed-integer programs. This paper extends the PtO methodology to optimization problems with nondifferentiable Ordered Weighted Averaging (OWA) objectives, known for their ability to ensure properties of fairness and robustness in decision models. Through a collection of training techniques and proposed application settings, it shows how optimization of OWA functions can be effectively integrated with parametric prediction for fair and robust optimization under uncertainty.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 17 of its 32 references that are in the map. First posted on arXiv 12 Feb 2024.
Builds on
17 of 32 references.
References · 17
- 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
- 2019Differentiable Convex Optimization Layerscited by 458
- 2016From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classificationcited by 337
- 2019Differentiation of Blackbox Combinatorial Solverscited by 224
- 2018Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimizationcited by 220
- 2020Fast Differentiable Sorting and Rankingcited by 196
- 2023Decision-Focused Learning: Foundations, State of the Art, Benchmark and Future Opportunitiescited by 129
- 2020Interior Point Solving for LP-based prediction+optimisationcited by 83
- 2019Differentiating Through a Cone Programcited by 72
- 2020Gradient Estimation with Stochastic Softmax Trickscited by 66
- 2021Two-sided fairness in rankings via Lorenz dominancecited by 28
- 2013The Complexity of Large-scale Convex Programming under a Linear Optimization Oraclecited by 27
5 more
- 2019The Limited Multi-Label Projection Layercited by 21
- 2021End-to-end Learning for Fair Ranking Systemscited by 18
- 2022Optimizing generalized Gini indices for fairness in rankingscited by 13
- 2023Backpropagation of Unrolled Solvers with Folded Optimizationcited by 13
- 2022Multi-Task Predict-then-Optimizecited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.