Unverified50% confidenceOpinionExact time
The exploration-exploitation trade-off directly determines whether an algorithm can converge to the global optimum, and it is also the main subject of study in the multi-armed bandit problem.
1
Sources
50%
Confidence
Long-term
Relevance
10/27/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedOnline constrained optimization is a class of optimization problems in which decisions are made step by step over a time sequence and each decision incurs a constraint cost, and the algorithm must trade off exploration and exploitation.73% similarUnverifiedThe multi-armed bandit problem is the most simplified model of the exploration-exploitation dilemma, and strategies such as ε-greedy, UCB, and Thompson Sampling are each different solutions to that dilemma.72% similarUnverified父子分块策略用小块做检索、用大块喂给模型，在检索精度和上下文完整性之间取得平衡71% similarUnverifiedThe sequence found by sequence search is a fixed solution for a specific level, which is fundamentally different in nature from a reactive policy capable of generalizing to different situations.71% similarUnverifiedIn agentic architectures, retrieval is often invoked repeatedly in sub-steps such as planning, tool selection, and verification, which significantly amplifies the cumulative latency effect of a single retrieval call.70% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1102861API
curl https://kongchang.com/api/v1/knowledge/claims/1102861MCP
get_claim(id=1102861)