arXiv (All)
open access
Boundary Geometry and Global Rates of Cyclic Coordinate Descent for SVM Duals
Cyclic coordinate descent is widely used to train support vector machines, but global linear convergence alone gives limited guidance about the rate on a particular instance. We study exact cyclic coordinate minimization for box-constrained convex quadratics and develop global contraction bounds tha
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
- TIGER: Inverting Transformer Gradients via Embedding-Subspace Distance Optimization#287080
- The Maximum Singularity Degree for Linear and Semidefinite Programming#1013374
- Primal-Dual Inexact Newton-MR for Nonconvex Optimization with Equality Constraints#996513
- Double Descent in High-dimensional Linear Discriminant Analysis#1013270
- Global Linear Convergence of the Proximal Bundle Method under Unknown Piecewise Smoothness and Quadratic Growth#999009
Record · ID 1144207
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