CRF條件隨機(jī)場(chǎng)

線性鏈條件隨機(jī)場(chǎng)

DEFINITION

p(\mathbf{y} | \mathbf{x})=\frac{1}{Z(\mathbf{x})} \prod_{t=1}^{T} \exp \left\{\sum_{k=1}^{K} \theta_{k} f_{k}\left(y_{t}, y_{t-1}, \mathbf{x}_{t}\right)\right\}
Z(\mathbf{x})=\sum_{\mathbf{y}} \prod_{t=1}^{T} \exp \left\{\sum_{k=1}^{K} \theta_{k} f_{k}\left(y_{t}, y_{t-1}, \mathbf{x}_{t}\right)\right\}

ESTIMATION

損失函數(shù)為
\ell(\theta)=\sum_{i=1}^{N} \log p\left(\mathbf{y}^{(i)} | \mathbf{x}^{(i)} ; \theta\right)
\ell(\theta)=\sum_{i=1}^{N} \sum_{t=1}^{T} \sum_{k=1}^{K} \theta_{k} f_{k}\left(y_{t}^{(i)}, y_{t-1}^{(i)}, \mathbf{x}_{t}^{(i)}\right)-\sum_{i=1}^{N} \log Z\left(\mathbf{x}^{(i)}\right)
對(duì)\theta_k求導(dǎo)結(jié)果為
\begin{aligned} \frac{\partial \ell}{\partial \theta_{k}}=& \sum_{i=1}^{N} \sum_{t=1}^{T} f_{k}\left(y_{t}^{(i)}, y_{t-1}^{(i)}, \mathbf{x}_{t}^{(i)}\right) \\ &-\sum_{i=1}^{N} \sum_{t=1}^{T} \sum_{y, y^{\prime}} f_{k}\left(y, y^{\prime}, \mathbf{x}_{t}^{(i)}\right) p\left(y, y^{\prime} | \mathbf{x}^{(i)}\right)\end{aligned}
關(guān)注一下p\left(y, y^{\prime} | \mathbf{x}^{(i)}\right)是怎么得來(lái)的:
\begin{aligned} \frac{\partial \log Z\left(\mathbf{x}^{(i)}\right)}{\partial \theta_{k}} &= \frac {1}{Z\left(\mathbf{x}^{(i)}\right)} \sum_{\mathbf{y}} \frac{\partial \left\{ \prod_{t=1}^{T} \exp \left\{\sum_{k=1}^{K} \theta_{k} f_{k}\left(y_{t}, y_{t-1}, \mathbf{x}_{t}\right)\right\} \right\} } {\partial \theta_k} \\ &=\frac {1}{Z\left(\mathbf{x}^{(i)}\right)} \sum_{\mathbf{y}} \left\{ \prod_{t=1}^{T} \exp \left\{\sum_{k=1}^{K} \theta_{k} f_{k}\left(y_{t}, y_{t-1}, \mathbf{x}_{t}\right)\right\} * \sum_{t=1}^{T} f_{k}\left(y_{t}, y_{t-1}, \mathbf{x}_{t}\right) \right\} \\ &= \sum_{\mathbf{y}} \left\{ p\left( \mathbf{y} | \mathbf{x}^{(i)}\right) * \sum_{t=1}^{T} f_{k}\left(y_t, y_{t-1}, \mathbf{x}_{t}^{(i)}\right) \right\} \\ &= \sum_{t=1}^{T} \sum_{y, y^{\prime}} f_{k}\left(y, y^{\prime}, \mathbf{x}_{t}^{(i)}\right) p\left(y, y^{\prime} | \mathbf{x}^{(i)}\right) \end{aligned}
解釋:
從第一行到第二行可以將累乘符號(hào)轉(zhuǎn)換為exp中的累加即得。
從第三行到第四行是將中括號(hào)內(nèi)部的求和符號(hào)放在外面去。然后進(jìn)行邊緣概率的計(jì)算。

理解清楚這里就可以利用prml里面的sum-product algorithm來(lái)進(jìn)行優(yōu)化求導(dǎo)。

?著作權(quán)歸作者所有,轉(zhuǎn)載或內(nèi)容合作請(qǐng)聯(lián)系作者
【社區(qū)內(nèi)容提示】社區(qū)部分內(nèi)容疑似由AI輔助生成,瀏覽時(shí)請(qǐng)結(jié)合常識(shí)與多方信息審慎甄別。
平臺(tái)聲明:文章內(nèi)容(如有圖片或視頻亦包括在內(nèi))由作者上傳并發(fā)布,文章內(nèi)容僅代表作者本人觀點(diǎn),簡(jiǎn)書系信息發(fā)布平臺(tái),僅提供信息存儲(chǔ)服務(wù)。

相關(guān)閱讀更多精彩內(nèi)容

友情鏈接更多精彩內(nèi)容