arXiv (All)
open access
Gradient Descent on Logistic Regression with Non-Separable Data and Large Step Sizes
We study gradient descent (GD) dynamics on logistic regression problems with large, constant step sizes. For linearly-separable data, it is known that GD converges to the minimizer with arbitrarily large step sizes, a property which no longer holds when the problem is not separable. In fact, the beh
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Tight Transition Time Bounds for Separable Logistic Regression at the Edge of Stability#1156731
- A multiscale front-decoupling criterion for threshold cascades on unimodular random trees#1064516
- A unified analysis on the speedup of accelerated gradient methods: An inertial dynamics approach#999641
- Multidimensional parabolic equations with a logarithmic nonlinearity admitting exceptional Lie symmetries#1064354
- Third-Order Newton Methods with Semidefinite Programming#999615
Record · ID 821653
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive