Unverified50% confidenceFactExact time
Under mild conditions satisfied by common kernel functions, minimizing the kernel-specific upper bound yields a number of replications of Θ(log T).
1
Sources
50%
Confidence
Long-term
Relevance
10/14/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe paper proves that for the Matérn-ν kernel with parameter ν∈(0,2), the γ-exponential kernel with parameter γ∈(0,2), and certain piecewise polynomial kernels, the minimax optimal rate is precisely determined to be Θ(√(Tγ_T)), with upper and lower bounds matching within constant factors.66% similarUnverifiedThe orbital parameters encoded in a TLE include six Keplerian elements and their derivatives, such as inclination, eccentricity, and right ascension of the ascending node.58% similarUnverifiedThe gate sequence length given by the Solovay–Kitaev theorem is O(log^c(1/ε)), where the constant c is approximately 3.97, and subsequent work has improved this to near 1.58% similarUnverifiedTernary quantization theoretically requires only approximately 1.58 bits (log₂3) per weight for representation.56% similarUnverifiedThe paper derives the closed-form solution for the optimal guidance weight that minimizes mean squared error: λ*(T, δ, σ₀²) = σ₀² / (σ₀² + R_max² · δ² · T).56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1022915API
curl https://kongchang.com/api/v1/knowledge/claims/1022915MCP
get_claim(id=1022915)