Home > Machine Learning 101 > Quizzes > Machine Learning: Introduction to Optimization Techniques
Machine Learning: Introduction to Optimization Techniques
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 51% Most missed: “In descent methods, the particular choice of search direction does not matter so…”
Machine Learning: Introduction to Optimization Techniques
Time left 00:00
13 Questions

1. When Newton's method is started from a point near the solution, it will converge very quickly.
2. $f(x) = -\log x$ is self-concordant.
3. If $f$ is self-concordant, its Hessian is Lipschitz continuous.
4. Newton's method with step size $h=1$ always works.
5. Newton's method would probably require fewer iterations than the gradient method, but each iteration would be much more costly.
6. Using Newton's method to minimize $f(Ty)$, where $Ty=x$ and $T$ is nonsingular, can greatly improve the convergence speed when $T$ is chosen appropriately.
7. $f(x) = -\log x$ is self-concordant.
8. $f(x) = \exp x$ is self-concordant.
9. Newton's method would probably require fewer iterations than the gradient method, but each iteration would be much more costly.
10. In descent methods, the particular choice of line search does not matter so much.
11. Newton's method with step size $h=1$ always works.
12. In descent methods, the particular choice of search direction does not matter so much.
13. Using Newton's method to minimize $f(Ty)$, where $Ty=x$ and $T$ is nonsingular, can greatly improve the convergence speed when $T$ is chosen appropriately.