{
  "id": "2106.09663",
  "version": "v1",
  "published": "2021-06-17T17:11:57.000Z",
  "updated": "2021-06-17T17:11:57.000Z",
  "title": "A Short Note of PAGE: Optimal Convergence Rates for Nonconvex Optimization",
  "authors": [
    "Zhize Li"
  ],
  "comment": "4 pages",
  "categories": [
    "math.OC",
    "cs.AI",
    "cs.DS",
    "cs.LG",
    "stat.ML"
  ],
  "abstract": "In this note, we first recall the nonconvex problem setting and introduce the optimal PAGE algorithm (Li et al., ICML'21). Then we provide a simple and clean convergence analysis of PAGE for achieving optimal convergence rates. Moreover, PAGE and its analysis can be easily adopted and generalized to other works. We hope that this note provides the insights and is helpful for future works.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2021-06-17T17:11:57.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "short note",
      "nonconvex optimization",
      "optimal page algorithm",
      "clean convergence analysis",
      "achieving optimal convergence rates"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}