Unverified50% confidenceFactExact time
Linear bandits are a generalization of the multi-armed bandit problem, whose reward model is r_t = ⟨a_t, θ*⟩ + η_t, where θ* is the unknown parameter vector and η_t is noise.
1
Sources
50%
Confidence
Long-term
Relevance
11/3/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe regret R_T is defined as the cumulative sum of the differences between the global optimum and the function values at the algorithm's query points over T rounds of interaction, i.e., R_T = Σ[f(x*) - f(x_t)].66% similarUnverifiedThe β_t schedule is the key hyperparameter controlling the pace of noise addition in the forward process; β_t is a pre-set sequence of small positive numbers that does not participate in training, typically growing from β_1≈1e-4 to β_T≈0.02 linearly or by cosine.64% similarUnverifiedIn the DDPM reverse process, the mean μ_θ is expressed as μ_θ(x_t, t) = (1/√α_t) · (x_t - (β_t / √(1 - ᾱ_t)) · ε_θ(x_t, t)), where ε_θ is the neural network to be trained.62% similarUnverifiedThe spiked Wigner model is a classic framework in random matrix theory: the observation matrix can be written as Y = λ x x^T + W, where x is the low-rank signal vector to be estimated and W is a real symmetric Wigner noise matrix (upper-triangular entries independent and identically distributed, with mean zero and variance 1/n), and λ controls the signal-to-noise ratio.62% similarUnverifiedDiffusion model training objectives typically involve predicting noise ε or velocity field v, and the noisy input can be expressed as x_t = α_t·x_0 + σ_t·ε.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1128916API
curl https://kongchang.com/api/v1/knowledge/claims/1128916MCP
get_claim(id=1128916)