Unverified50% confidenceFactExact time
The KL-UCB-Transfer algorithm obtains a better leading constant under the condition μ'_a < μ_1 - L_a, and degrades to the guarantee of classical KL-UCB when this condition is not satisfied.
1
Sources
50%
Confidence
Long-term
Relevance
10/16/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe KL-UCB algorithm constructs confidence upper bounds based on KL divergence and, compared with algorithms such as UCB1 that are based on Hoeffding's inequality, can achieve tighter regret bounds under Bernoulli rewards.73% similarUnverifiedUnbalanced optimal transport allows marginal constraints to be softly satisfied by introducing penalty terms such as KL divergence into the objective function, giving lower-confidence matches smaller weights.61% similarUnverifiedStable Diffusion系列使用KL-regularized VAE，通过正则化约束潜空间的平滑性来缓解误差放大，但不能完全消除放大效应57% similarUnverified对于KYC等对特定操作点极度敏感的应用，应关注固定误报率下的召回率而非笼统的AUC56% similarUnverifiedIn Dreamer V1, the KL divergence term is used to constrain the distance between the posterior distribution q(z_t|h_t,o_t) and the prior distribution p(z_t|h_t); if the KL weight is too large, the posterior is forced to approach the prior, causing the latent variables to lose observational information (information loss), and if the weight is too small, the transition model cannot generate meaningful imagined trajectories from the prior (posterior collapse).56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1046785API
curl https://kongchang.com/api/v1/knowledge/claims/1046785MCP
get_claim(id=1046785)