aiqbench analysis
This research introduces ICNN-enhanced 2SP, a method using Input Convex Neural Networks to solve two-stage stochastic programming problems with significantly improved computational efficiency over traditional mixed-integer approaches. By enforcing convexity to enable exact linear programming inference, the technique eliminates integer variables while maintaining high solution quality even at large scales. The approach offers a scalable alternative for optimizing decision-making under uncertainty without relying on computationally intensive surrogates.
ICNN-enhanced 2SP: Leveraging input convex neural networks for solving two-stage stochastic programming
arXiv:2505.05261v4 Announce Type: replace-cross Abstract: Two-stage stochastic programming (2SP) offers a basic framework for modelling decision-making under uncertainty, yet scalability remains a challenge due to the computational complexity of recourse function evaluation. Existing learning-based methods like Neural Two-Stage Stochastic Programming (Neur2SP) employ neural networks (NNs) as recourse function surrogates but rely on computationally intensive mixed-integer programming (MIP) formulations. We propose ICNN-enhanced 2SP, a method that leverages Input Convex Neural Networks (ICNNs) to exploit linear programming (LP) representability in convex 2SP problems. By architecturally enforcing convexity and enabling exact inference through LP, our approach eliminates the need for integer variables inherent in the conventional MIP-based formulation while retaining an exact embedding of the ICNN surrogate within the 2SP framework. This results in a more computationally efficient alternative, and we show that good solution quality can be maintained. Comprehensive experiments reveal that ICNNs incur only marginally longer training times while achieving validation accuracy on par with their standard NN counterparts. Across benchmark problems, ICNN-enhanced 2SP often exhibits considerably faster solution times than the MIP-based formulations while preserving solution quality, with these advantages becoming significantly more pronounced as problem scale increases. For the most challenging instances, the method achieves speedups of up to 100$\times$ with solution quality superior to MIP-based formulations.
Abstract:Two-stage stochastic programming (2SP) offers a basic framework for modelling decision-making under uncertainty, yet scalability remains a challenge due to the computational complexity of recourse function evaluation. Existing learning-based methods like Neural Two-Stage Stochastic Programming (Neur2SP) employ neural networks (NNs) as recourse function surrogates but rely on computationally intensive mixed-integer programming (MIP) formulations. We propose ICNN-enhanced 2SP, a method that leverages Input Convex Neural Networks (ICNNs) to exploit linear programming (LP) representability in convex 2SP problems. By architecturally enforcing convexity and enabling exact inference through LP, our approach eliminates the need for integer variables inherent in the conventional MIP-based formulation while retaining an exact embedding of the ICNN surrogate within the 2SP framework. This results in a more computationally efficient alternative, and we show that good solution quality can be maintained. Comprehensive experiments reveal that ICNNs incur only marginally longer training times while achieving validation accuracy on par with their standard NN counterparts. Across benchmark problems, ICNN-enhanced 2SP often exhibits considerably faster solution times than the MIP-based formulations while preserving solution quality, with these advantages becoming significantly more pronounced as problem scale increases. For the most challenging instances, the method achieves speedups of up to 100$\times$ with solution quality superior to MIP-based formulations.
Optimization and Control (math.OC); Machine Learning (cs.LG)
arXiv:2505.05261 [math.OC]
(or arXiv:2505.05261v4 [math.OC] for this version)
https://doi.org/10.48550/arXiv.2505.05261 Focus to learn more arXiv-issued DOI via DataCite
EURO J. Comput. Optim. 14 (2026) 100141
https://doi.org/10.1016/j.ejco.2026.100141 Focus to learn more DOI(s) linking to related resources
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 316 words
Related coverage

News
Quantum Computing Report · Jul 25, 2026

Hybrid quantum-neural network beats classical machine learning
Quantum Zeitgeist · Aug 17, 2026

WiMi’s Quantum Circuits Boost Image Recognition Efficiency
Quantum Zeitgeist · May 28, 2026
Inductive Correlation Clustering with Graph Neural Networks
arXiv · Aug 28, 2026