Unverified50% confidenceFactExact time
Classical results show that under convex losses, the cumulative regret of projected online gradient ascent is bounded by O(√T), where T is the number of rounds (Zinkevich, 2003).
1
Sources
50%
Confidence
Long-term
Relevance
10/16/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedIn standard regret minimization, the regret upper bound typically takes the form O(√T), whereas under the tilted sampling framework, sampling regret is dominated by the square of the confidence width, yielding logarithmic-level regret O(log T).74% similarUnverifiedThe distribution shift problem in behavior cloning causes error accumulation, with the expected total loss after T steps being O(εT²) rather than the linear O(εT).65% similarUnverified前景理论的核心发现是损失厌恶，损失曲线的斜率远陡于同等幅度收益曲线的斜率62% similarVerifiedGradient descent iteratively adjusts weights in the opposite direction of the loss function's gradient, causing the prediction error to converge progressively.62% similarUnverifiedThe parameter update rule for gradient descent is θ_{t+1} = θ_t - η·∇L(θ_t), where η is the learning rate, and updating parameters in the direction of the negative gradient reduces the loss function most rapidly.62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1046760API
curl https://kongchang.com/api/v1/knowledge/claims/1046760MCP
get_claim(id=1046760)