Unverified50% confidenceBenchmarkExact time
The query complexity given in the paper for finding a Goldstein stationary point under first-order access (stochastic gradient queries) is O(δ⁻¹ε⁻³), where δ is the Goldstein radius and ε is the stationarity tolerance.
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe complexity given in the paper under zeroth-order access (function value queries) is O(dδ⁻¹ε⁻³), where d is the problem dimension.69% similarUnverifiedFor nonsmooth nonconvex problems, the known optimal first-order complexity is O(ε^{-3}) and the zeroth-order complexity is O(d ε^{-3}).68% similarUnverifiedRegardless of which regime applies, estimators based on compression complexity stably maintain a convergence rate of O(1/√N).66% similarUnverified直接在SO(3)上做卷积的朴素复杂度为O(B^6)，通过快速球面傅里叶变换（基于Driscoll-Healy或McEwen-Wiaux采样定理）可降低至O(B^5)甚至更低64% similarUnverifiedPerformer（2020）用随机正交特征将核函数分解为低秩形式实现 O(n) 复杂度63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1012942API
curl https://kongchang.com/api/v1/knowledge/claims/1012942MCP
get_claim(id=1012942)