17. Large scale machine learning

Large scale machine learning

Learining with large datasets

Stochastic gradient descent

Batch gradient descent:

J_{train}(\theta)=\frac{1}{2m}\sum\limits_{i=1}^m(h_\theta(x^{(i)}-y^{(i)})^2
Repeat{
\theta_j:=\theta_j-\alpha\frac{1}{m}\sum\limits_{i=1}^m(h_\theta(x^{(i)}-y^{(i)})x_j^{(i)}
}

Stochastic gradient descent:

cost(\theta,(x^{)i)},y^{(i)}))=\frac{1}{2}(h_\theta(x^{(i)}-y^{(i)})^2
J_{train}(\theta)=\frac{1}{m}\sum\limits_{i=1}^m cost(\theta,(x^{)i)},y^{(i)}))

  1. Randomly shaffle dataset
  2. Repeat{for{}}

Mini-batch gradient descent

Mini-batch gradient descent: Use b examples in each iteration.

b = mini-batch size

\Theta_j:=\Theta_j-\alpha\frac{1}{10}\sum_{k=i}^{i+9}(h_\theta(x^{(k)})-y^{(k)})x_j^{(k)}

Stochastic gradient descent convergence

Checking for convergence:

  • Batch gradient descent:
  • Stochastic gradient descent: Every 1000 iterations (say), plot cost(\theta,(x^{(i)},y^{(i)})) averaged ove the last 1000 examples processed by algorithm.

For Stochastic gradient descent: Learning rate \alpha istypically held constant. Can slowly decrease \alpha over time if we want \theta to converge. (E.g. \alpha = \frac{const1}{iterationNmuber +const2})

Online learning

operate one data once.

Predicte CTR (click through rate)

Map-reduce and data parallelism

divide all work into many parts and calculate them at the same time with different machine.

Map-reduce and summation over the training set:

Many learining algorithms can be expressed as computing sums of functions over the training set.

Multi-core machines:

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

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

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