Unverified50% confidenceTradeoffExact time
The 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.
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe paper requires the algebraic complete intersection to have a specified dimension, bounded degree, and bounded condition number; this restriction sets a threshold for computability and statistical stability, at the cost that the hypothesis class is narrowed and may fail to cover some real complex data distributions.75% similarUnverifiedThe results in the paper are in the sense of asymptotic complexity, and the constant factors and actual convergence speed still need to be further evaluated through experiments.75% similarUnverifiedThe deconvolution problem can be formulated as a division operation in the frequency domain, and its difficulty depends on the decay rate of the characteristic function of the error distribution71% similarUnverifiedThe 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.71% similarUnverifiedSystematic magnitude errors are more insidious and more dangerous than random errors, because the answers appear numerically plausible in structure yet deviate by an order of magnitude.70% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1012919API
curl https://kongchang.com/api/v1/knowledge/claims/1012919MCP
get_claim(id=1012919)