Unverified50% confidenceFactExact time
The classic Hedge algorithm achieves O(√(T log N)) regret under oblivious input, and this bound is tight in general.
1
Sources
50%
Confidence
Long-term
Relevance
10/22/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThis universal lower bound delineates the boundary for kernel bandit algorithm design: the regret performance of any new algorithm cannot surpass Ω(√(Tγ_T/log T)).71% similarUnverifiedThe lower bound for the standard multi-armed bandit problem is O(√T), and ORUCB's extra log(T+1) factor stems from the complexity introduced by simultaneously learning the correction function.70% similarUnverifiedIn 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).69% similarUnverifiedThe Douglas-Peucker algorithm simplifies polylines by iteratively removing intermediate points whose deviation is below a threshold, with a time complexity of O(n log n).68% similarUnverifiedAlgorithms such as online gradient descent can guarantee O(√T) regret under convex or approximately convex assumptions.68% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1084199API
curl https://kongchang.com/api/v1/knowledge/claims/1084199MCP
get_claim(id=1084199)