arXiv (All)
open access
Gradient Descent on Logistic Regression: Do Large Step-Sizes Work with Data on the Sphere?
Gradient descent on logistic regression has many fascinating properties not fully captured by classical analyses. For linearly separable data, the iterates converge in direction to the maximum-margin separator regardless of how large the step size is. For non-separable data, however, cycles may occu
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
- Gradient Descent on Logistic Regression with Non-Separable Data and Large Step Sizes#821653
- Tight Transition Time Bounds for Separable Logistic Regression at the Edge of Stability#1156731
- Improved Convergence of Large Stepsize Gradient Descent for Logistic Regression#1215767
- Improved Convergence of Large Stepsize Gradient Descent for Logistic Regression#1194447
- Improved large-scale graph learning through ridge spectral sparsification#1199807
Record · ID 1411719
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