[KongchangAI]
Unverified50% confidenceFactExact time

For weakly observable graph bandits, the known minimax regret lower bound is Θ(T^{2/3}), where T is the total number of rounds.

1
Sources
50%
Confidence
Long-term
Relevance
11/4/2026
First Seen

Sources

Related Entities

Related Claims

Cite This Claim

Stable URI
https://kongchang.com/claim/1133667
API
curl https://kongchang.com/api/v1/knowledge/claims/1133667
MCP
get_claim(id=1133667)