Unverified50% confidenceFactExact time
The best upper bound previously given by Liu et al. in the strong corruption setting was O~(√(d^3 T) + dC), whose leading term has an extra √d factor compared with the corruption-free optimal rate O~(d√T).
1
Sources
50%
Confidence
Long-term
Relevance
10/30/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe current best regret upper bound scales as √(Tγ_T) up to logarithmic factors.54% similarVerifiedThe formula for a cubic Bézier curve is B(t) = (1-t)³P₀ + 3(1-t)²tP₁ + 3(1-t)t²P₂ + t³P₃, where t∈[0,1] is the parameter and P₀ through P₃ are four control points54% similarUnverifiedKaratsuba算法将n位乘法分解为三次n/2位乘法，复杂度从O(n²)降至O(n^1.585)52% similarUnverifiedFor spherical bias ReLU features of dimension d, when the initialization scale τ≥1, the spectral decay exponent α = (d+2)/(d-1), and κ_0^* = 4√2 τ(d+1)/d; under ridge leverage sampling, κ_1^* = 1.52% similarUnverifiedQ4_K_M采用分组量化策略，将权重张量划分为64或256维子块并独立计算缩放因子与零点，能将困惑度损失控制在1–3%以内52% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1114880API
curl https://kongchang.com/api/v1/knowledge/claims/1114880MCP
get_claim(id=1114880)