Abstract:
This note closes a gap in the proof of Theorem VI.3 from the article “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory” (2017...Show MoreMetadata
Abstract:
This note closes a gap in the proof of Theorem VI.3 from the article “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory” (2017).
Published in: IEEE Transactions on Information Theory ( Volume: 70, Issue: 7, July 2024)
Contents 