Unverified50% confidenceFactExact time
Per-operation relaxation (including linear bound propagation) computes, at the second-order term, the sum of the maxima of each operation rather than a coupled maximum, resulting in a loss of tightness.
1
Sources
50%
Confidence
Long-term
Relevance
11/3/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe 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 distribution75% similarUnverifiedWhen the conjugate gradient method solves symmetric positive definite linear systems, the number of iterations required for convergence is closely related to the condition number of the matrix—the larger the condition number, the slower the convergence.74% similarUnverifiedThe distribution shift problem in behavior cloning causes error accumulation, with the expected total loss after T steps being O(εT²) rather than the linear O(εT).73% similarUnverifiedIn leaf D (reroute-overflow branch), it is only valid when every entry carries an idempotency key and the reroute target produces comparable output; if either condition fails, it falls back to leaf C.73% similarUnverifiedThe PINN loss function is usually composed of a weighted sum of a data term, an equation residual term, and a boundary/initial condition term, and the choice of weights is itself a sensitive hyperparameter.72% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1129312API
curl https://kongchang.com/api/v1/knowledge/claims/1129312MCP
get_claim(id=1129312)