Unverified50% confidenceFactExact time
The sample complexity upper bound of PRISMA is O~((L^2S^2+β^2)(1∨ρ*)/ε^2 · log(K)), where L, S, and β bound the feature norm, the reward parameter norm, and the reward noise, respectively.
1
Sources
50%
Confidence
Long-term
Relevance
10/16/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedFor nonsmooth nonconvex problems, the known optimal first-order complexity is O(ε^{-3}) and the zeroth-order complexity is O(d ε^{-3}).67% similarUnverifiedThe computational complexity of EKF-SLAM is O(n²) because the dimensions of the covariance matrix grow linearly with the number of landmarks66% similarUnverifiedThe H₁(P) complexity measure is a weighted sum of the reciprocal squared gaps between each suboptimal arm and the optimal arm.65% 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.63% similarUnverifiedThe Dice coefficient measures the degree of overlap between the predicted mask and the ground-truth annotation, ranging from 0 to 1, with the formula being twice the intersection divided by the sum of the total number of pixels (or voxels) of the two; it is sensitive to overlap in large-area regions, but tends to give overly optimistic scores on small targets or boundary regions.63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1042067API
curl https://kongchang.com/api/v1/knowledge/claims/1042067MCP
get_claim(id=1042067)