arXiv (All)
open access
On the Two Faces of Adam in Separable Linear Classification
We consider the behavior of deterministic, full-batch, bias-corrected Adam in separable linear classification with softmax parametrization under log-loss. In this setting, under a wide range of conditions Adam is known to approach max-norm-margin optimality when its stability constant $ε$ is zero, w
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
- Sharp margin-based generalization bounds for realizable SVM#1011560
- Acceleration for Affine-coupling problems#1132198
- Binary Classification with the Maximum Score Model and Linear Programming#792646
- Binary Classification with the Maximum Score Model and Linear Programming#788646
- Near-Optimal Higher-Order Oracle Complexity for Convex--Concave Minimax Optimization#1064790
Record · ID 1118977
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