mlsanityData to 14 Oct 2026

Learning Scenario Reduction for Two-Stage Robust Optimization with Discrete Uncertainty

arXiv 2605.14494 ↗First posted 14 May 2026cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Two-Stage Robust Optimization (2RO) with discrete uncertainty is challenging, often rendering exact solutions prohibitive. Scenario reduction alleviates this issue by selecting a small, representative subset of scenarios to enable tractable computation. However, existing methods are largely problem-agnostic, operating solely on the uncertainty set without consulting the feasible region or recourse structure. In this paper, we introduce PRISE, a problem-driven sequential lookahead heuristic that constructs reduced scenario sets by evaluating the marginal impact of each scenario. While PRISE yields high-quality scenario subsets, each selection step requires solving multiple subproblems, making it computationally expensive at scale. To address this, we propose NeurPRISE, a neural surrogate model built on a GNN-Transformer backbone that encodes the per-scenario structure via graph convolution and captures cross-scenario interactions through attention. NeurPRISE is trained via imitation learning with a gain-aware ranking objective, which distills marginal gain information from PRISE into a learned scoring function for scenario ranking and selection. Extensive results on three 2RO problems show that NeurPRISE consistently achieves competitive regret relative to comprehensive methods, maintains strong calability with varying numbers of scenarios, and delivers 7-200x speedup over PRISE. NeurPRISE also exhibits strong zero-shot generalization, effectively handling instances with larger problem scales (up to 5x), more scenarios (up to 4x), and distribution shifts.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 35 references that are in the map. First posted on arXiv 14 May 2026.

Builds on

13 of 35 references.

References · 13

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2018How Powerful are Graph Neural Networks?cited by 4,393
  3. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
  4. 2019Strategies for Pre-training Graph Neural Networkscited by 971
  5. 2019Exact Combinatorial Optimization with Graph Convolutional Neural Networkscited by 318
  6. 2017K-Adaptability in Two-Stage Mixed-Integer Robust Optimizationcited by 6
  7. 2021Problem-Driven Scenario Clustering in Stochastic Optimizationcited by 6
  8. 2022Optimal Scenario Reduction for One- and Two-Stage Robust Optimizationcited by 3
  9. 2023A Machine Learning Approach to Two-Stage Adaptive Robust Optimizationcited by 3
  10. 2022Data-driven Prediction of Relevant Scenarios for Robust Combinatorial Optimizationcited by 2
  11. 2024A Deep Generative Learning Approach for Two-stage Adaptive Robust Optimizationcited by 2
  12. 2025HGCN2SP: Hierarchical Graph Convolutional Network for Two-Stage Stochastic Programmingcited by 2
1 more
  1. 2024Problem-Driven Scenario Reduction and Scenario Approximation for Robust Optimizationcited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2020Learning to Plan Optimistically: Uncertainty-Guided Deep Exploration via Latent Model Ensembles
  2. 2026Diff2SP: Diffusion Models for Correlated Scenario Generation in Stochastic Programming
  3. 2024UDUC: An Uncertainty-driven Approach for Learning-based Robust Control
  4. 2025Fast and Robust: Task Sampling with Posterior and Diversity Synergies for Adaptive Decision-Makers in Randomized Environments
  5. 2021Distributionally Robust Surrogate Optimal Control for High-Dimensional Systems
  6. 2023Achieving the Asymptotically Optimal Sample Complexity of Offline Reinforcement Learning: A DRO-Based Approach
  7. 2026Robust Peak-cost Constrained Reinforcement Learning
  8. 2021Differentiable Robust LQR Layers