Unverified50% confidenceFactExact time
The information-acquisition complexity C* is a key quantity characterizing instance-dependent optimal regret for linear bandits, related to the geometric structure of the action set (such as the gaps between the optimal action and suboptimal actions) and to the variance of parameter estimation.
1
Sources
50%
Confidence
Long-term
Relevance
11/3/2026
First Seen
Sources
Related Entities
Related Claims
VerifiedKolmogorov complexity refers to the true length of a piece of data being equal to the length of the shortest program that can generate it.72% similarUnverifiedThere is an essential separation between the information-theoretically optimal regret Õ(md+k) and the regret achievable in polynomial time; this gap is inherent to computational complexity rather than a shortcoming of algorithm design.68% similarUnverifiedThe d·log p sample complexity is the advantageous order possessed by previous sharp methods that relied on subset search, and HOST achieves this level without sacrificing polynomial runtime.67% similarUnverifiedThe computational complexity of EKF-SLAM is O(n²) because the dimensions of the covariance matrix grow linearly with the number of landmarks67% similarUnverified圈复杂度衡量代码中独立执行路径的数量，与缺陷密度存在显著正相关67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1128914API
curl https://kongchang.com/api/v1/knowledge/claims/1128914MCP
get_claim(id=1128914)