arXiv (All)
open access
Exact oracle complexity for function-value suboptimality under weighted initial conditions
We determine the exact worst-case function-value suboptimality after $N$ first-order oracle calls on $L$-smooth, $μ$-strongly convex functions under a nonnegative weighted combination of the initial squared distance, function-value suboptimality, and squared gradient norm. Excluding the case where n
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
- Near-Optimal Exact-Value Zeroth-Order Complexity for Smooth Strongly Convex Optimization#1012895
- Tight Stochastic Condition-Number Dependence in Nonconvex-Strongly-Concave Minimax Optimization#1105436
- Silver Rate Is (Almost) Optimal for Gradient Descent: The Strongly Convex Case#1063084
- Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates#1034500
- Heavy-Tailed First-Order Optimization for Polyak-Łojasiewicz Condition: High-Dimensional Minimax Bounds, High-Probability Guarantee, and Fixed-Dimensional Improvements#926844
Record · ID 1118072
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