mlsanityData to 7 Oct 2026

Differentiable Distributionally Robust Optimization Layers

arXiv 2406.16571 ↗First posted 24 Jun 2024math.OC cs.AI cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

In recent years, there has been a growing research interest in decision-focused learning, which embeds optimization problems as a layer in learning pipelines and demonstrates a superior performance than the prediction-focused approach. However, for distributionally robust optimization (DRO), a popular paradigm for decision-making under uncertainty, it is still unknown how to embed it as a layer, i.e., how to differentiate decisions with respect to an ambiguity set. In this paper, we develop such differentiable DRO layers for generic mixed-integer DRO problems with parameterized second-order conic ambiguity sets and discuss its extension to Wasserstein ambiguity sets. To differentiate the mixed-integer decisions, we propose a novel dual-view methodology by handling continuous and discrete parts of decisions via different principles. Specifically, we construct a differentiable energy-based surrogate to implement the dual-view methodology and use importance sampling to estimate its gradient. We further prove that such a surrogate enjoys the asymptotic convergency under regularization. As an application of the proposed differentiable DRO layers, we develop a novel decision-focused learning pipeline for contextual distributionally robust decision-making tasks and compare it with the prediction-focused approach in experiments.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 26 of its 39 references that are in the map. First posted on arXiv 24 Jun 2024.

Builds on

26 of 39 references.

References · 26

  1. 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
  2. 2019Differentiable Convex Optimization Layerscited by 458
  3. 2017Smart "Predict, then Optimize"cited by 332
  4. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 285
  5. 2019Differentiation of Blackbox Combinatorial Solverscited by 224
  6. 2018Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimizationcited by 220
  7. 2014From Predictive to Prescriptive Analyticscited by 142
  8. 2023Decision-Focused Learning: Foundations, State of the Art, Benchmark and Future Opportunitiescited by 129
  9. 2021Implicit MLE: Backpropagating Through Discrete Exponential Family Distributionscited by 97
  10. 2019MIPaaL: Mixed Integer Program as a Layercited by 93
  11. 2020Interior Point Solving for LP-based prediction+optimisationcited by 83
  12. 2023A Survey of Contextual Optimization Methods for Decision Making under Uncertaintycited by 81
14 more
  1. 2019Distributionally Robust Optimization: A Reviewcited by 75
  2. 2019Differentiating Through a Cone Programcited by 72
  3. 2021Decision-Focused Learning: Through the Lens of Learning to Rankcited by 61
  4. 2020Contrastive Losses and Solution Caching for Predict-and-Optimizecited by 52
  5. 2022Learning with Combinatorial Optimization Layers: a Probabilistic Approachcited by 28
  6. 2018Solution Refinement at Regular Points of Conic Problemscited by 21
  7. 2020Stochastic Optimization Forestscited by 20
  8. 2022End-to-End Stochastic Optimization with Energy-Based Modelcited by 19
  9. 2022Distributionally Robust End-to-End Portfolio Constructioncited by 17
  10. 2023Predict-then-Calibrate: A New Perspective of Robust Contextual LPcited by 17
  11. 2023Landscape Surrogate: Learning Decision Losses for Mathematical Optimization Under Partial Informationcited by 17
  12. 2024End-to-end Conditional Robust Optimizationcited by 17
  13. 2019Optimization under Uncertainty in the Era of Big Data and Deep Learning: When Machine Learning Meets Mathematical Programmingcited by 13
  14. 2021Distributionally Robust Prescriptive Analytics with Wasserstein Distancecited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 6.

8 papers.