Unverified50% confidenceFactExact time
Theoretical analysis shows that when the delay window is no more than O(√T), the high-probability regret upper bound of the Warm-Start UCB algorithm is Õ(Tε ∧ d√T), where T is the total number of rounds, ε is the initialization error, and d is the feature dimension.
1
Sources
50%
Confidence
Long-term
Relevance
10/19/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedOn every sub-exponential instance, for g(t)=ω(log t) satisfying mild feasibility conditions, the expected pseudo-regret of EL-F is bounded by g(T)∑Δ_i + C_P, where C_P is an instance-dependent constant independent of the time T.65% similarUnverified幂律延迟成本下 EXPONENT = 1/(p+1) 的替代形式也被证伪:相关性 +0.773,平均误差 0.072,原因是延迟成本曲线在扫描窗口内不是幂律。63% similarUnverifiedUnder large-resolution initialization, applying constant-step gradient descent on m tasks (each containing n samples) yields a frozen estimator with error Õ((m∧n)^(-1) + N^(-1))63% similarUnverified当推理延迟 τ = d_max/2 时,可行执行视界窗口坍缩为零,不存在可行解,称为延迟墙。63% similarUnverifiedε-prediction is prone to numerical instability at large embedding dimensions, because when α_bar_t approaches zero the scaling factor 1/sqrt(α_bar_t) tends to infinity, amplifying prediction errors.63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1065525API
curl https://kongchang.com/api/v1/knowledge/claims/1065525MCP
get_claim(id=1065525)