Duality and DeepMartingale for High-Dimensional Optimal Switching: Computable Upper Bounds and Approximation-Expressivity Guarantees
Junyan Ye, Hoi Ying Wong

TL;DR
This paper introduces a deep-learning framework for high-dimensional optimal switching problems, providing computable upper bounds, approximation guarantees, and practical strategies, demonstrated through numerical experiments.
Contribution
It extends DeepMartingale to optimal switching, establishes convergence and expressivity guarantees, and avoids the curse of dimensionality under certain structural assumptions.
Findings
Deep dual bounds are small and accurate in high dimensions.
Neural networks of size polynomial in dimension approximate the true value within epsilon.
Numerical experiments show favorable performance and practical hedging strategies.
Abstract
We study finite-horizon optimal switching with discrete intervention dates on a general filtration, allowing continuous-time observations between decision dates, and develop a deep-learning-based dual framework with computable upper bounds. We first derive a dual representation for multiple switching by introducing a family of martingale penalties. The minimal penalty is characterized by the Doob martingales of the continuation values, which yields a fully computable upper bound. We then extend DeepMartingale from optimal stopping to optimal switching and establish convergence under both the upper-bound loss and an -surrogate loss. We also provide an expressivity analysis: under the stated structural assumptions, for any target accuracy , there exist neural networks of size at most whose induced dual upper bound approximates the true value…
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.
