Unverified50% confidenceFactExact time
E2D.PMSide adopts an ε-greedy strategy in the globally observable setting, achieving the optimal regret bound at extremely low computational cost.
1
Sources
50%
Confidence
Long-term
Relevance
10/15/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe doubly logarithmic expected cost is possible because the strategy allows full n-round sampling to be executed with vanishingly small probability.70% similarUnverified成本优化核心在于减少错误输出导致的重复调用，而非压低单次调用价格66% similarUnverifiedbase-stock 策略在需求服从独立同分布、提前期固定的假设下可被严格证明是最小化总成本的解析最优解66% similarUnverifiedFor heterogeneous asynchronous MMAB, a polynomial-time greedy algorithm can achieve a 1/e approximation ratio relative to the optimal centralized assignment.65% similarUnverifiedExperiments on open-source LLMs reported in the paper show that adopting the optimal threshold strategy can achieve substantial cost reductions while meeting pre-specified performance budgets.65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1037392API
curl https://kongchang.com/api/v1/knowledge/claims/1037392MCP
get_claim(id=1037392)