Understanding the Variance Dichotomy in Continuous Simulation Optimization: A Minimax Lower Bound Perspective
Jianzhong Du, L. Jeff Hong

TL;DR
This paper analyzes the complexity of continuous simulation optimization, revealing how variance and simulation budget influence convergence rates, especially in low-noise and finite-budget scenarios.
Contribution
It introduces a minimax lower-bound analysis that explains the variance dichotomy and transition in convergence regimes based on noise and budget.
Findings
Low-noise stochastic CSO has similar complexity to deterministic CSO at small budgets.
As budget increases, the variance-dependent term dominates, slowing convergence.
The analysis clarifies the transition from deterministic-like to noise-influenced convergence behavior.
Abstract
This paper studies the variance dichotomy in continuous simulation optimization (CSO). Existing literature shows a sharp contrast between deterministic CSO and stochastic CSO, with convergence rates in stochastic settings appearing insensitive to the magnitude of the noise variance. However, this asymptotic view does not fully explain the behavior of CSO under finite simulation budgets, especially in low-noise settings. To address this gap, this work develops a minimax lower-bound analysis and shows that the complexity is decided by the maximum of a variance-dependent term and a variance-independent term. When the simulation budget is not very large and the noise variance is low, the variance-independent term dominates, implying that low-noise stochastic CSO has essentially the same complexity as deterministic CSO. As the budget increases, the variance-dependent term becomes dominant,…
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.
