Unverified50% confidenceFactExact time
GP-UCB selects the point with the largest posterior mean plus β times the posterior standard deviation as the next exploration target, where β controls the aggressiveness of exploration, and this strategy theoretically guarantees sublinear regret.
1
Sources
50%
Confidence
Long-term
Relevance
10/28/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedStandard Bayesian optimization acquisition functions (such as GP-UCB, EI, Thompson sampling) are almost all designed to minimize cumulative regret, and therefore naturally favor exploitation over exploration.73% similarUnverifiedAn optimisation targeting one inference phase (such as operator fusion or KV cache strategy) can very well make another phase slower.68% similarUnverifiedOne approach to addressing the Goodhart problem is to construct a dual-objective evaluation that simultaneously tracks epistemic humility rate and uncertainty precision rate, replacing single-dimension optimization with an F1-style composite score.67% similarUnverifiedFirst proving the strongest almost sure convergence result can efficiently yield the weaker convergence-in-probability result, simplifying the solution path67% similarUnverifiedThe paper establishes non-asymptotic, high-probability upper bounds for the convergence of empirical occupation measures to the invariant measure, under the contraction assumption in kernel-induced geometry and the standard spectral gap assumption.67% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1106192API
curl https://kongchang.com/api/v1/knowledge/claims/1106192MCP
get_claim(id=1106192)