Coursera Machine Learning 第十周 quiz Large Scale Machine Learning

最新推荐文章于 2018-02-25 11:01:31 发布

哈特谢普苏特

最新推荐文章于 2018-02-25 11:01:31 发布

阅读量2k

点赞数

分类专栏：机器学习文章标签：机器学习

本文链接：https://blog.csdn.net/qq_31390999/article/details/78074332

版权

机器学习专栏收录该内容

17 篇文章 0 订阅

订阅专栏

Large Scale Machine Learning

5 个问题

1
point

1。

Suppose you are training a logistic regression classifier using stochastic gradient descent. You find that the cost (say, cost(θ,(x(i),y(i))) , averaged over the last 500 examples), plotted as a function of the number of iterations, is slowly increasing over time. Which of the following changes are likely to help?

Try averaging the cost over a larger number of examples (say 1000 examples instead of 500) in the plot.

Try using a larger learning rate α .

This is not an issue, as we expect this to occur with stochastic gradient descent.

Try using a smaller learning rate α .

1
point

2。

Which of the following statements about stochastic gradient

descent are true? Check all that apply.

One of the advantages of stochastic gradient descent is that it uses parallelization and thus runs much faster than batch gradient descent.

Before running stochastic gradient descent, you should randomly shuffle (reorder) the training set.

In order to make sure stochastic gradient descent is converging, we typically compute Jtrain(θ) after each iteration (and plot it) in order to make sure that the cost function is generally decreasing.

If you have a huge training set, then stochastic gradient descent may be much faster than batch gradient descent.

1
point

3。

Which of the following statements about online learning are true? Check all that apply.

One of the advantages of online learning is that if the function we're modeling changes over time (such as if we are modeling the probability of users clicking on different URLs, and user tastes/preferences are changing over time), the online learning algorithm will automatically adapt to these changes.

Online learning algorithms are usually best suited to problems were we have a continuous/non-stop stream of data that we want to learn from.

Online learning algorithms are most appropriate when we have a fixed training set of size m that we want to train on.

When using online learning, you must save every new training example you get, as you will need to reuse past examples to re-train the model even after you get new training examples in the future.

1
point

4。

Assuming that you have a very large training set, which of the

following algorithms do you think can be parallelized using

map-reduce and splitting the training set across different

machines? Check all that apply.

Computing the average of all the features in your training set μ=1m∑mi=1x(i) (say in order to perform mean normalization).

Logistic regression trained using batch gradient descent.

Logistic regression trained using stochastic gradient descent.

Linear regression trained using stochastic gradient descent.

1
point

5。

Which of the following statements about map-reduce are true? Check all that apply.

When using map-reduce with gradient descent, we usually use a single machine that accumulates the gradients from each of the map-reduce machines, in order to compute the parameter update for that iteration.

Because of network latency and other overhead associated with map-reduce, if we run map-reduce using N computers, we might get less than an N -fold speedup compared to using 1 computer.

If we run map-reduce using N computers, then we will always get at least an N -fold speedup compared to using 1 computer.

If you have only 1 computer with 1 computing core, then map-reduce is unlikely to help.

5题我选的是BD 是错误的

1
point

1。

Try averaging the cost over a larger number of examples (say 1000 examples instead of 500) in the plot.

Try using a larger learning rate α .

This is not an issue, as we expect this to occur with stochastic gradient descent.

Try using a smaller learning rate α .

1
point

2。

Which of the following statements about stochastic gradient

descent are true? Check all that apply.

One of the advantages of stochastic gradient descent is that it uses parallelization and thus runs much faster than batch gradient descent.

Before running stochastic gradient descent, you should randomly shuffle (reorder) the training set.

If you have a huge training set, then stochastic gradient descent may be much faster than batch gradient descent.

1
point

3。

Which of the following statements about online learning are true? Check all that apply.

Online learning algorithms are usually best suited to problems were we have a continuous/non-stop stream of data that we want to learn from.

Online learning algorithms are most appropriate when we have a fixed training set of size m that we want to train on.

When using online learning, you must save every new training example you get, as you will need to reuse past examples to re-train the model even after you get new training examples in the future.

1
point

4。

Assuming that you have a very large training set, which of the

following algorithms do you think can be parallelized using

map-reduce and splitting the training set across different

machines? Check all that apply.

Computing the average of all the features in your training set μ=1m∑mi=1x(i) (say in order to perform mean normalization).

Logistic regression trained using batch gradient descent.

Logistic regression trained using stochastic gradient descent.

Linear regression trained using stochastic gradient descent.

1
point

5。

Which of the following statements about map-reduce are true? Check all that apply.

Because of network latency and other overhead associated with map-reduce, if we run map-reduce using N computers, we might get less than an N -fold speedup compared to using 1 computer.