Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness

Ankit Garg, Robin Kothari, Praneeth Netrapalli, Suhail Sherif. Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness. In Marc'Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, Jennifer Wortman Vaughan, editors, Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual. pages 29874-29884, 2021. [doi]

@inproceedings{GargKNS21-0,
  title = {Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness},
  author = {Ankit Garg and Robin Kothari and Praneeth Netrapalli and Suhail Sherif},
  year = {2021},
  url = {https://proceedings.neurips.cc/paper/2021/hash/fa6c94460e902005a0b660266190c8ba-Abstract.html},
  researchr = {https://researchr.org/publication/GargKNS21-0},
  cites = {0},
  citedby = {0},
  pages = {29874-29884},
  booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual},
  editor = {Marc'Aurelio Ranzato and Alina Beygelzimer and Yann N. Dauphin and Percy Liang and Jennifer Wortman Vaughan},
}