Corrections to “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory”
- 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).
| Author: | Gábor Braun, Cristóbal Guzmán, Sebastian Pokutta |
|---|---|
| Document Type: | Article |
| Parent Title (English): | IEEE Transactions on Information Theory |
| Volume: | 70 |
| Issue: | 7 |
| First Page: | 5408 |
| Last Page: | 5409 |
| Year of first publication: | 2024 |
| DOI: | https://doi.org/10.1109/TIT.2024.3357200 |
