Unverified50% confidenceFactExact time
IAFTRL's regret upper bound in stochastic environments is ~O(C* log T), where C* is the information-acquisition complexity.
1
Sources
50%
Confidence
Long-term
Relevance
11/3/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedMLS uses a tree-based key agreement structure (TreeKEM), reducing the computational complexity of adding or removing members from a group from O(n) to O(log n).61% similarUnverifiedEmbedding models map text to high-dimensional dense vectors (typically 768 to 3072 dimensions), and ANN algorithms (such as HNSW and IVF-PQ) reduce retrieval complexity from O(n) to approximately O(log n).60% similarUnverifiedPure vector search (embedding retrieval) tends to lose rare but precise tokens such as error codes, ticket IDs, SKUs, and function names, because embeddings blur rare tokens when compressing text into a single point.59% similarUnverifiedThe BSP algorithm reduces rendering complexity from O(n²) to O(n log n).58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1128908API
curl https://kongchang.com/api/v1/knowledge/claims/1128908MCP
get_claim(id=1128908)