Technical Note—On Adaptivity in Nonstationary Stochastic Optimization with Bandit Feedback
设计并分析了一种无需预先知道函数变化幅度的优化算法，用于处理强凸/强凹且光滑的函数序列，仅依赖单点噪声函数值，并证明了算法的最优性。
Optimal Nonstationary Optimization Without Knowing Function Changes Nonstationary stochastic optimization plays a vital role in a number of computer science and operations research applications. It is known how to design and analyze algorithms that optimize a sequence of strongly convex/concave and smooth functions with access to only one-point noisy function values with the underlying function sequence subject to maximum magnitude of function changes. In recent work from Wang titled “Technical Note: On Adaptivity in Nonstationary Stochastic Optimization with Bandit Feedback,” an optimization algorithm is designed and analyzed without assuming the magnitude of function changes is known in advance. Optimality of the designed algorithm is demonstrated.