arXiv (All)
open access
Saddle-Point Problems with a Low-Dimensional Block Do Not Need Accurate Inner Solves
Many learning problems couple a high-dimensional block of parameters with a handful of adversarial or dual variables: worst-group risk over a few groups, or learning under a few constraints. We consider $\min_{x\in X}\max_{y\in Y} f(x,y)$ with $X\subseteq\mathbb{R}^n$, a compact convex set and stron
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 avoids strict saddles with a simple line-search method too#1061612
- Bridging Spherical Black-Box Optimizers#307034
- A Kernel-Aware Two-Grid Preconditioner for Cell-Centered Nearly Incompressible Elasticity#1143472
- Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity#180625
- Verifying Well-Posedness of Linear PDEs using Convex Optimization#1012174
Record · ID 1116772
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