← notes

아이템 임베딩 평균의 일관성에 대해

2025-08-12 · recsys, representation-learning

On the Consistency of Average Embeddings for Item Recommendation (2023)

배경

일관성

Consistencyk(X)=EUXk[Precisionk(U)],wherePrecisionk(U)=Xk(μU)Uk\text{Consistency}_k(X) = \mathbb{E}_{U \in X_k} \big[ \text{Precision}_k(U) \big], \quad \text{where} \quad \text{Precision}_k(U) = \frac{|X_k(\mu_U) \cap U|}{k}

이론

P(s(uin,μU)>s(uout,μU))=12[1+erf(dσ22(2(k1)+κ)σ2+2kγμσ+2k2μ2)]\mathbb{P}\left( s(u_{\text{in}}, \mu_U) \gt s(u_{\text{out}}, \mu_U) \right) = \frac{1}{2}\left[ 1 + \operatorname{erf}\left( \frac{d \sigma^2}{2} \sqrt{ \frac{ \left( 2(k-1) + \kappa \right) \sigma^2 + 2k \gamma \mu \sigma + 2k^2 \mu^2 } {}} \right) \right]

📈 벡터의 차원 수가 커질수록 내적 유사도(ss)의 분포는 정규분포에 가까워짐

Consistencyk(X)=1ki=1kfin,(i)(x)Fout,(ki+1)(x)dx\text{Consistency}_k(X) = \frac{1}{k} \sum_{i=1}^k \int_{-\infty}^\infty f_{\text{in},(i)}(x) \cdot F_{\text{out},(k - i + 1)}(x) \, dx

실험

추가적인 생각