Unverified50% confidenceFactExact time
The weight update formula in AdaBoost derives from the step-by-step minimization of the exponential loss function L=Σ_i e^(-y_i F(x_i)).
1
Sources
50%
Confidence
Long-term
Relevance
10/5/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe load balancing loss uses the sum of squares of all expert selection frequencies L=ΣFi², and by the Cauchy–Schwarz inequality the loss is minimized when all Fi=1/N.72% similarUnverifiedIn AdaBoost, correctly classified sample weights are multiplied by e^(-α_t), misclassified sample weights are multiplied by e^(+α_t), and then all weights are normalized.71% similarUnverifiedThe weak learner weight formula in AdaBoost is α_t = (1/2)ln((1-ε_t)/ε_t), where ε_t is the weighted error rate for that round.71% similarUnverifiedBayesian decision theory selects the action a* that minimizes expected loss, i.e., a* = argmin_a E[L(θ, a)|x], where the expectation is taken with respect to the posterior distribution p(θ|x).71% similarUnverified损失函数中 tanh(β·E1·E2) 取 β=10，当 β 足够大时将乘积符号信息锐化为接近 ±1 的值69% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/977409API
curl https://kongchang.com/api/v1/knowledge/claims/977409MCP
get_claim(id=977409)