Unverified50% confidenceFactExact time
For constant mappings and a constant-mapping prior, the exponential base of the identification regret is exactly β_★ (about 3.583), rather than the 4 suggested by the moment range; for monotone mappings, this base lies in the interval [2, β_★].
1
Sources
50%
Confidence
Long-term
Relevance
10/14/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe current best regret upper bound scales as √(Tγ_T) up to logarithmic factors.70% similarVerifiedNumerical gradient checking approximates gradients using the central difference formula (f(θ+ε) - f(θ-ε)) / (2ε) and compares them with analytical gradients; a relative error below 1e-5 is considered correct, while an error above 1e-3 almost certainly indicates a bug.67% similarUnverifiedThe 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.65% similarUnverifiedAfter re-evaluating with non-overlapping anchors, the net advantage instead grew from +4.1pp to +5.5pp, but significance dropped from 2.4 standard errors to 1.4 standard errors; the inflation factor is about 2.4x, exactly equal to sqrt(912/163).64% similarUnverifiedThe paper derives the closed-form solution for the optimal guidance weight that minimizes mean squared error: λ*(T, δ, σ₀²) = σ₀² / (σ₀² + R_max² · δ² · T).62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1022933API
curl https://kongchang.com/api/v1/knowledge/claims/1022933MCP
get_claim(id=1022933)