Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms
DGX agentarXiv:2404.08073v3 Announce Type: replace-cross Abstract: Bregman proximal-type algorithms (BPs), such as mirror descent, have become popular tools in machine learning and data science for exploiting