Unverified50% confidenceFactExact time
The complexity results in the paper are exactly consistent with the optimal complexity of non-composite nonsmooth nonconvex optimization problems, indicating that the additional convex regularizer does not make the oracle complexity worse.
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedFor nonsmooth nonconvex problems, the known optimal first-order complexity is O(ε^{-3}) and the zeroth-order complexity is O(d ε^{-3}).72% similarUnverified内点法在理论上具有多项式时间复杂度保证，而单纯形法最坏情况下呈指数级复杂度71% similarUnverifiedThe explicit complexity bounds in the paper usually hide large constant factors, and the actual implementation is also affected by numerical stability and errors in condition number estimation.71% similarUnverifiedCommonly used regularization strategies (such as L1, L2, or more general convex penalties) do not make the optimization problem inherently harder to solve at the level of oracle complexity.69% similarUnverifiedKolmogorov complexity refers to the true length of a piece of data being equal to the length of the shortest program that can generate it.68% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1012944API
curl https://kongchang.com/api/v1/knowledge/claims/1012944MCP
get_claim(id=1012944)