Corrigendum in “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory”

Gábor Braun,Cristóbal Guzmán,Sebastian Pokutta

IEEE Transactions on Information Theory（2024）

引用 0|浏览1

暂无评分

摘要

This note closes a gap in the proof of Theorem VI.3 from the paper “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory” (2017).

查看译文

关键词

Convex optimization,oracle complexity,lower complexity bounds,randomized algorithms,distributional and high-probability lower bounds

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要