Stratified adaptive sampling for derivative-free stochastic trust-region optimization

There is emerging evidence that trust-region (TR) algorithms are very effective at solving derivative-free nonconvex stochastic optimization problems in which the objective function is a Monte Carlo (MC) estimate. A recent strand of methodologies adaptively adjusts the sample size of the MC estimates by keeping the estimation error below a measure of stationarity induced from the TR radius. In this work we explore stratified adaptive sampling strategies to equip the TR framework with accurate estimates of the objective function, thus optimizing the required number of MC samples to reach a given ε-accuracy of the solution. We prove a reduced sample complexity, confirm a superior efficiency via numerical tests and applications, and explore inexpensive implementations in high dimension.

💡 Research Summary

This paper introduces a stratified adaptive sampling scheme into the derivative‑free stochastic trust‑region (TR) framework, resulting in a new algorithm called SASTRO‑DF (Stratified Adaptive Sampling Trust‑Region Optimization – Derivative‑Free). The authors consider the problem of minimizing an expected objective f(θ)=E