TL;DR
This paper introduces Shrunken-SAA, a novel data-pooling algorithm that combines data across unrelated stochastic optimization problems, outperforming decoupling even without structural links, especially when many small-data problems are involved.
Contribution
The paper proves that data pooling can outperform separate problem solving in stochastic optimization, even without prior problem structure, and introduces a practical algorithm with theoretical guarantees.
Findings
Data pooling can outperform decoupling in unrelated problems.
Shrunken-SAA effectively learns when pooling is beneficial.
Real-world application shows practical advantages of data pooling.
Abstract
Managing large-scale systems often involves simultaneously solving thousands of unrelated stochastic optimization problems, each with limited data. Intuition suggests one can decouple these unrelated problems and solve them separately without loss of generality. We propose a novel data-pooling algorithm called Shrunken-SAA that disproves this intuition. In particular, we prove that combining data across problems can outperform decoupling, even when there is no a priori structure linking the problems and data are drawn independently. Our approach does not require strong distributional assumptions and applies to constrained, possibly non-convex, non-smooth optimization problems such as vehicle-routing, economic lot-sizing or facility location. We compare and contrast our results to a similar phenomenon in statistics (Stein's Phenomenon), highlighting unique features that arise in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
