Unverified50% confidenceFactExact time
When α0=γ (the most benign case), KRR-RF is minimax optimal for all r∈(0,1].
1
Sources
50%
Confidence
Medium-term (~90 days)
Relevance
10/14/2026
First Seen
Valid until: 1/12/2027
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.67% similarUnverifiedThe core formula of RRF is RRF_score(d) = Σ 1 / (k + rank_i(d)), where k is a smoothing constant commonly set to 60.66% similarVerifiedThe F1 score is a special case of the Fβ score when β=1.66% similarUnverifiedThe new sample complexity bound matches the known lower bound in its exponential dependence on |β|/(1-γ).64% similarUnverifiedFor a Markov chain with spectral gap γ, the effective sample size is approximately nγ and the mixing time is approximately 1/γ.63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1022944API
curl https://kongchang.com/api/v1/knowledge/claims/1022944MCP
get_claim(id=1022944)