Mathematicians hate words like “trivial, traditional, … “
Prelude
UBM1is a simple but ecient model in estimating position bias. The model
structures as following:
Figure 1 UBM: Multiple Browsing
The complete-data likelihood:
The incomplete-data likelihood:
The conditional distribution of
a,e
is Bernoulli:
With deterministic assumption:
The complete-data likelihood becomes:
The incomplete-data likelihood becomes:
The log-likelihood function becomes:
The so-called deterministic relationship c↔(a,e) and upon formula of log-likelihood are so misleading that at first I omited a,e as latent variables. Despite all kinds of tricks tried in M-step, I failed to deduce the iteration formulas appended in the paper.
Derivation in detail
E-step
Posterior distributions of latent variables after
t
-th iteration is:
, thus
M-step
The free energy with respect to
Qt
is:
Maximization over αuq,γrdm,μmq with contraint ∑mμmq=1 leads to the updating formulas:
for αuq ,
αt+1uq===∑r,d(S∙uqrd+S∘uqrdQt(a=1,e=0|c=0,r,d,u,q))∑r,d[S∙uqrd+S∘uqrd(Qt(a=1,e=0|c=0,r,d,u,q)+Qt(a=0|c=0,r,d,u,q))]∑r,d(S∙uqrd+S∘uqrdQt(a=1,e=0|c=0,r,d,u,q))∑r,d(S∙uqrd+S∘uqrd)1Suq(∑rdS∘uqrdαtuq(1−∑mγtrdmμtmq)1−αtuq∑mγtrdmμtmq+S∙uq)for γrdm ,
γt+1rdm=≡∑u,q(S∙uqrdQt(m|c=1,r,d,u,q)+S∘uqrdQt(e=1,m|c=0,r,d,u,q))∑u,q(S∙uqrdQt(m|c=1,r,d,u,q)+S∘uqrdQt(m|c=0,r,d,u,q))A/B,
in which,
AB====∑u,q(S∙uqrdQt(m|c=1,r,d,u,q)+S∘uqrdQt(e=1,m|c=0,r,d,u,q))∑u,q(S∘uqrd(1−αtuq)γtrdmμtmq1−αtuq∑mγtrdmμtmq+S∙uqrdγtrdmμtmq∑mγtrdmμtmq)∑u,q(S∙uqrdQt(m|c=1,r,d,u,q)+S∘uqrdQt(m|c=0,r,d,u,q))∑u,q(S∘uqrd(1−αtuqγtrdm)μtmq1−αtuq∑mγtrdmμtmq+S∙uqrdγtrdmμtmq∑mγtrdmμtmq)- for
μmq
,
μmq=λq∑u,r,d[S∙uqrdQt(m|c=1,r,d,u,q)+S∘uqrdQt(m|c=0,r,d,u,q)].
∑mμmq=1⟹λqSq=1⟹λq=1Sq , thus
μmq==1Sq∑u,r,d[S∘uqrd(1−αtuqγtrdm)μtmq1−αtuq∑mγtrdmμtmq+S∙uqrdγtrdmμtmq∑mγtrdmμtmq]μtmqSq∑u,r,d[S∘uqrd1−αtuqγtrdm1−αtuq∑mγtrdmμtmq+S∙uqrdγtrdm∑mγtrdmμtmq]
- G. Dupret and B. Piwowarski, A user browsing model to predict search engine click data from past observations, In ACM SIGIR Conference, 2008. ↩