Skip to main navigation Skip to search Skip to main content

On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization.

  • Nicolas Emmenegger
  • , Rasmus Kyng
  • , Ahad N. Zehmakan

Research output: Contribution to conference › Paper › peer-review

Original languageEnglish
Pages10718-10752
Publication statusPublished - 2022

Cite this