Forward-Backward Quantization of Scenario Processes in Multi-Stage Stochastic Optimization
Anna Timonina-Farkas

TL;DR
This paper introduces a novel approach for quantizing scenario processes in multi-stage stochastic optimization, improving approximation accuracy and computational efficiency by leveraging tree structures and gradient-based optimization.
Contribution
It develops new bounds for multi-stage optimal tree quantization and proposes an efficient backward-forward procedure using projected gradient descent.
Findings
Improved scenario approximation for multi-stage inventory control.
Demonstrated the effectiveness of the method on multi-dimensional demand problems.
Showed the importance of mitigation inventory in different product life cycle phases.
Abstract
Multi-stage stochastic optimization lies at the core of decision-making under uncertainty. As the analytical solution is available only in exceptional cases, dynamic optimization aims to efficiently find approximations but often neglects non-Markovian time-interdependencies. Methods on scenario trees can represent such interdependencies but are subject to the curse of dimensionality. To ease this problem, researchers typically approximate the uncertainty by smaller but more accurate trees. In this article, we focus on multi-stage optimal tree quantization methods of time-interdependent stochastic processes, for which we develop novel bounds and demonstrate that the upper bound can be minimized via projected gradient descent incorporating the tree structure as linear constraints. Consequently, we propose an efficient quantization procedure, which improves forward-looking samples using a…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
