arXiv (All)
open access
Improved Convergence of Large Stepsize Gradient Descent for Logistic Regression
We study gradient descent (GD) with a large constant stepsize for logistic regression on linearly separable data. Existing analysis shows an accelerated rate of $\widetilde{O}(1/\sqrtε)$ to reach loss $ε$ with an aggressive stepsize, although the loss may initially oscillate. Tighter control of the
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
- Improved Convergence of Large Stepsize Gradient Descent for Logistic Regression#1194447
- When the Preconditioning Exponent Turns Negative: Learning-Rate Coupling and Cross-Environment Generalization#1104470
- Optimal Learning Rate Schedules under Functional Scaling Laws: Power Decay and Warmup-Stable-Decay#1109783
- Accelerating Branch MPC with Two-Level Parallel Direct Solves on GPUs#1078048
Record · ID 1215767
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