A Single-Timescale Method for Stochastic Bilevel Optimization
A Single-Timescale Method for Stochastic Bilevel Optimization
复制标题
DOI:
--
复制
发表时间:
2021-02
期刊:
影响因子:
--
通讯作者:
Tianyi Chen;Yuejiao Sun;Quan-Wu Xiao;W. Yin
中科院分区:
文献类型:
--
作者:
Tianyi Chen;Yuejiao Sun;Quan-Wu Xiao;W. Yin
Stochastic bilevel optimization generalizes the classic stochastic optimization from the minimization of a single objective to the minimization of an objective function that depends on the solution of another optimization problem. Recently, bilevel optimization is regain-ing popularity in emerging machine learning applications such as hyper-parameter optimization and model-agnostic meta learning. To solve this class of optimization problems, existing methods require either double-loop or two-timescale updates, which are some-times less efficient. This paper develops a new optimization method for a class of stochastic bilevel problems that we term Single-Timescale stochAstic BiLevEl optimization ( STABLE ) method. STABLE runs in a single loop fashion, and uses a single-timescale update with a fixed batch size. To achieve an (cid:15) -stationary point of the bilevel problem, STABLE requires O ( (cid:15) − 2 ) samples in total; and to achieve an (cid:15) -optimal solution in the strongly convex case, STABLE requires O ( (cid:15) − 1 ) samples. To the best of our knowledge, when STABLE was proposed, it is the first bilevel optimization algorithm achieving the same order of sample complexity as SGD for single-level stochastic optimization.