Capter 4 - Training Models Exercise

1 .Which linear regression training algorithm can you use if you have a training set with millions of features?

Stochastic Gradient Descent or Mini-batch Gradient Descent

2. Suppose the features in your training set have very different scales. Which algorithms might suffer from this, and how? What can you do about it ?

If the features in your training set have very differnt scales, the cost function will have the shape of an elongated bowl, so the Gradient Descent algorithms will take a long time to converge. To solve this you should scale the data before training the model. Note that the Normal Equation or SVD approach will work just fine without scaling. Moreover, regularized modes may converge to suboptimal solution if the features are not scaled: since regularization penalized large weights, features with smaller value will tend to be ignored compared to features with large values.

3. Can gradient descent get stuck in a local minimum when training a logistic regression model?

Gradient Descent cannot get stuck in a local minimum when training a Logistic Regression model because the cost functioin convex.

4. Do all gradient descent algorithms lead to the same model, provided you let them run long enough?

If the optimization problem is convex(Such as Linear Regression or Logistic Regression), and assuming the learning rate is not too high, then all gradient Descent algorithms will approach the global optimum and end up producing fairly similar modes. However, unless you gradually reduce the learning rate, Stochastic GD and Mini-batch GD will nerver truly converge; instead, they will keep jumping back and forth around the global optimum. This means that even if you let them run for a very long time, these Gradient Descent algorithms will produce slightly differnt models.

5. Suppose you use batch gradient descent and you plot the validation error at every epoch. If you notice that the validation error consistently goes up, what is likely going on? How can you fix this?

If the validation error consistentlygose up after every epoch, the one possibility is that the learning rate is too hight and the algorithm is diverging. If the training error also goes up, then this clearly the problem and you should reduce the learning rate. However, if training error is not going up, then your model is overfitting the training set and you should stop training.

6. Is it a good idea to stop mini-batch gradient descent immediately when the validation error goes up?

Due to their random nature, neither Stochastic Gradient Descent nor Mini-batch Gradient Descent is guaranteed to make progress at every single training iteration. So if you immediately stop training when the validation error goes up, you may stop much too eraly, before the optimum is reached. A better option is to save the model at regular intervals; then, when it hs not improved for a long time(meaning it will problably never beet the record), you can revert to the best saved model.

7. Which gradient descent algorithm (among those we discussed) will reach the vicinity of the optimal solution the fastest? Which will actually converge? ow can you make the others converge as well?

Stochastic Gradient Descent has the fastest training iteration since it consider only one training instance at one time, so it generally the first to reach the vicinity of golbal optimum(or Mini-batch GD with a very small mini-batch size). However, only Batch Gradient Descent will actually converge, given enough training time.
As mention, Stochastic GD and Mini-batch GD will nounce around the optimum, unless you gradually reduce the learning rate.

8. Suppose you are using polynomial regression. You plot the learning curves and you notice that there is a large gap between the training error and the validation error. What is happening? What are three ways to solve this?

If the validation erro is much higher than the training error, this is likely because your model is overfitting the training set. One way to try to fix this is reduce the polynomial degree: a model with fewer degrees of freedom is less likely to overfit. Another thing you can try is to regularize the model-for example, by adding an l2 penaly(Ridge) or an l1 penalty(Lasso) to the cost function. This will also reduce the degrees of freedom of the model. Lastly, yopu can try to increase the size of the traniing set.

9. Suppose you are using ridge regression and you notice that the training error and the validation error are almost equal and fairly high. Would you say that the model suffers from high bias or high variance? Should you increase the regularization hyperparameter α or reduce it?

If both the training error and the validation error are almost equal and fairly high, the model is likely underfitting the tranining set, which mean it has a high bias. You should try reducing the regularization hyperarameter a.

10. Why would you want to use:
  1. Ridge regression instead of plain linear regression (i.e., without any regularization)?
    A model with some regularization typically performs better than without any regularization, so you should generally prefer Ridge Regression over plain Linear Regression.
  2. Lasso instead of ridge regression?
    Lasso Regression uses an L1 penalty, which tends to push the weights down to exactly zero. This leads to spares models, where all wights are zero except for the most import weights, this a way to perform feature selection automatically, which is good if you suspect the only a few features actually matter. When you are not sure, you should prefer Ridge Regression.
  3. Elastic net instead of lasso regression?
    Elastic Net is generally preferred over Lasso since Lasso may behave erratically in some cases(when several features are strongly correalated or when there are more features that training instances). However, it does add an extra hyperparameter to tune. if you want Lasso without the erratic behavior , you can just use Elasticv Net with an 11_ratio close to 1.
11. Suppose you want to classify pictures as outdoor/indoor and daytime/nighttime. Should you implement two logistic regression classifiers or one softmax regression classifier?

If you want to classify pictures as outdoor/indoor and daytime/nighttime , since these are not exclusive classes(i.e. all for combinations are possible) you should train two Logistic Regression classifiers.

?著作權(quán)歸作者所有,轉(zhuǎn)載或內(nèi)容合作請(qǐng)聯(lián)系作者
  • 序言:七十年代末辉浦,一起剝皮案震驚了整個(gè)濱河市渴邦,隨后出現(xiàn)的幾起案子旱眯,更是在濱河造成了極大的恐慌,老刑警劉巖鞠柄,帶你破解...
    沈念sama閱讀 216,496評(píng)論 6 501
  • 序言:濱河連續(xù)發(fā)生了三起死亡事件,死亡現(xiàn)場(chǎng)離奇詭異玉锌,居然都是意外死亡煞抬,警方通過(guò)查閱死者的電腦和手機(jī),發(fā)現(xiàn)死者居然都...
    沈念sama閱讀 92,407評(píng)論 3 392
  • 文/潘曉璐 我一進(jìn)店門(mén)碳柱,熙熙樓的掌柜王于貴愁眉苦臉地迎上來(lái)捡絮,“玉大人,你說(shuō)我怎么就攤上這事莲镣「N龋” “怎么了?”我有些...
    開(kāi)封第一講書(shū)人閱讀 162,632評(píng)論 0 353
  • 文/不壞的土叔 我叫張陵瑞侮,是天一觀的道長(zhǎng)的圆。 經(jīng)常有香客問(wèn)我鼓拧,道長(zhǎng),這世上最難降的妖魔是什么越妈? 我笑而不...
    開(kāi)封第一講書(shū)人閱讀 58,180評(píng)論 1 292
  • 正文 為了忘掉前任季俩,我火速辦了婚禮,結(jié)果婚禮上梅掠,老公的妹妹穿的比我還像新娘酌住。我一直安慰自己,他們只是感情好瓤檐,可當(dāng)我...
    茶點(diǎn)故事閱讀 67,198評(píng)論 6 388
  • 文/花漫 我一把揭開(kāi)白布赂韵。 她就那樣靜靜地躺著娱节,像睡著了一般挠蛉。 火紅的嫁衣襯著肌膚如雪。 梳的紋絲不亂的頭發(fā)上肄满,一...
    開(kāi)封第一講書(shū)人閱讀 51,165評(píng)論 1 299
  • 那天谴古,我揣著相機(jī)與錄音,去河邊找鬼稠歉。 笑死掰担,一個(gè)胖子當(dāng)著我的面吹牛,可吹牛的內(nèi)容都是我干的怒炸。 我是一名探鬼主播带饱,決...
    沈念sama閱讀 40,052評(píng)論 3 418
  • 文/蒼蘭香墨 我猛地睜開(kāi)眼,長(zhǎng)吁一口氣:“原來(lái)是場(chǎng)噩夢(mèng)啊……” “哼阅羹!你這毒婦竟也來(lái)了勺疼?” 一聲冷哼從身側(cè)響起,我...
    開(kāi)封第一講書(shū)人閱讀 38,910評(píng)論 0 274
  • 序言:老撾萬(wàn)榮一對(duì)情侶失蹤捏鱼,失蹤者是張志新(化名)和其女友劉穎执庐,沒(méi)想到半個(gè)月后,有當(dāng)?shù)厝嗽跇?shù)林里發(fā)現(xiàn)了一具尸體导梆,經(jīng)...
    沈念sama閱讀 45,324評(píng)論 1 310
  • 正文 獨(dú)居荒郊野嶺守林人離奇死亡轨淌,尸身上長(zhǎng)有42處帶血的膿包…… 初始之章·張勛 以下內(nèi)容為張勛視角 年9月15日...
    茶點(diǎn)故事閱讀 37,542評(píng)論 2 332
  • 正文 我和宋清朗相戀三年,在試婚紗的時(shí)候發(fā)現(xiàn)自己被綠了看尼。 大學(xué)時(shí)的朋友給我發(fā)了我未婚夫和他白月光在一起吃飯的照片递鹉。...
    茶點(diǎn)故事閱讀 39,711評(píng)論 1 348
  • 序言:一個(gè)原本活蹦亂跳的男人離奇死亡,死狀恐怖藏斩,靈堂內(nèi)的尸體忽然破棺而出躏结,到底是詐尸還是另有隱情,我是刑警寧澤灾茁,帶...
    沈念sama閱讀 35,424評(píng)論 5 343
  • 正文 年R本政府宣布窜觉,位于F島的核電站谷炸,受9級(jí)特大地震影響,放射性物質(zhì)發(fā)生泄漏禀挫。R本人自食惡果不足惜旬陡,卻給世界環(huán)境...
    茶點(diǎn)故事閱讀 41,017評(píng)論 3 326
  • 文/蒙蒙 一、第九天 我趴在偏房一處隱蔽的房頂上張望语婴。 院中可真熱鬧描孟,春花似錦、人聲如沸砰左。這莊子的主人今日做“春日...
    開(kāi)封第一講書(shū)人閱讀 31,668評(píng)論 0 22
  • 文/蒼蘭香墨 我抬頭看了看天上的太陽(yáng)缠导。三九已至廉羔,卻和暖如春,著一層夾襖步出監(jiān)牢的瞬間僻造,已是汗流浹背憋他。 一陣腳步聲響...
    開(kāi)封第一講書(shū)人閱讀 32,823評(píng)論 1 269
  • 我被黑心中介騙來(lái)泰國(guó)打工, 沒(méi)想到剛下飛機(jī)就差點(diǎn)兒被人妖公主榨干…… 1. 我叫王不留髓削,地道東北人竹挡。 一個(gè)月前我還...
    沈念sama閱讀 47,722評(píng)論 2 368
  • 正文 我出身青樓,卻偏偏與公主長(zhǎng)得像立膛,于是被迫代替她去往敵國(guó)和親揪罕。 傳聞我的和親對(duì)象是個(gè)殘疾皇子,可洞房花燭夜當(dāng)晚...
    茶點(diǎn)故事閱讀 44,611評(píng)論 2 353

推薦閱讀更多精彩內(nèi)容