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

Thumbnail Image
Files
Corrigendum in “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory”.pdf(2.1 KB)
Date
2024
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
Keywords
Citation
URI
https://doi.org/10.1109/TIT.2024.3357200
 https://repositorio.uc.cl/handle/11534/83914
Collections
Artículos de revistas