Unverified50% confidenceFactExact time
When α > ν, the lower bound on the minimum number of simulation evaluations required by any algorithm to simultaneously identify the near-optimal regions for all tolerances is Ω(η^{-(2+d/ν)} min{1, KT^{d/α}}).
1
Sources
50%
Confidence
Long-term
Relevance
11/11/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedNumerical gradient checking approximates the derivative via finite differences: for each parameter θ, compute [L(θ+ε) - L(θ-ε)] / (2ε), where ε is a very small number (such as 1e-4).72% 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.72% similarUnverifiedThe new sample complexity bound matches the known lower bound in its exponential dependence on |β|/(1-γ).68% similarUnverifiedThe paper derives the closed-form solution for the optimal guidance weight that minimizes mean squared error: λ*(T, δ, σ₀²) = σ₀² / (σ₀² + R_max² · δ² · T).68% similarUnverifiedFor weakly observable graph bandits, the known minimax regret lower bound is Θ(T^{2/3}), where T is the total number of rounds.67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1158419API
curl https://kongchang.com/api/v1/knowledge/claims/1158419MCP
get_claim(id=1158419)