General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization

Kwangjun Ahn, Gagik Magakyan, Ashok Cutkosky
2/14/2026

No confident code implementation found for this paper. 1 possible match can be shown below.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization

82% match2024

Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism

74% match2025

Meta-Black-Box-Optimization through Offline Q-function Learning

71% match1 repo72026

A Nonstochastic Control Approach to Optimization

70% match2023

Analysis of Schedule-Free Nonconvex Optimization

70% match2025

From SWE-ZERO to SWE-HERO: Execution-free to Execution-based Fine-tuning for Software Engineering Agents

70% match2026

Cite this paper

@article{ahn2026general,
  title  = {General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization},
  author = {Kwangjun Ahn and Gagik Magakyan and Ashok Cutkosky},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:4fc176d2f12b472ab08bde93383e043ef6a4c11d},
  journal = {ICML 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/4fc176d2f12b472ab08bde93383e043ef6a4c11d.svg)](https://codeofpaper.com/paper/4fc176d2f12b472ab08bde93383e043ef6a4c11d)

Discussion