Unverified50% confidenceFactExact time
The 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.
1
Sources
50%
Confidence
Long-term
Relevance
10/9/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe paper derives the closed-form solution for the optimal guidance weight that minimizes mean squared error: λ*(T, δ, σ₀²) = σ₀² / (σ₀² + R_max² · δ² · T).74% similarUnverifiedThe current best regret upper bound scales as √(Tγ_T) up to logarithmic factors.69% similarUnverifiedThe new sample complexity bound matches the known lower bound in its exponential dependence on |β|/(1-γ).69% similarUnverifiedThe Lovász condition is ‖b*ₖ‖² ≥ (δ - μ²ₖ,ₖ₋₁)·‖b*ₖ₋₁‖², where δ is typically set to 3/4.64% similarUnverifiedThe condition number is defined as the ratio of the matrix's largest eigenvalue to its smallest eigenvalue, κ = λmax/λmin.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/990867API
curl https://kongchang.com/api/v1/knowledge/claims/990867MCP
get_claim(id=990867)