arXiv (All)
open access
The Exponential Price of Determinism in Nonsmooth Nonconvex Optimization
We study the complexity of finding $(δ,ε)$-Goldstein stationary points of nonsmooth nonconvex Lipschitz functions. By now, it is known that randomized first-order algorithms can solve this task with a dimension-free oracle complexity [Zhang et al., 2020], whereas deterministic algorithms cannot, as
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
- Exponential Deterministic Query Complexity of Goldstein Stationarity#1142379
- Delta-AI: Local objectives for amortized inference in sparse graphical models#798538
- Delta-AI: Local objectives for amortized inference in sparse graphical models#797125
- Quantum Speedups for Sampling and Non-convex Optimization with Stochastic Oracles#924423
- Quantum Speedups for Sampling and Non-convex Optimization with Stochastic Oracles#920192
Record · ID 1050029
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