LFD Book Forum

LFD Book Forum (http://book.caltech.edu/bookforum/index.php)
-   Chapter 3 - The Linear Model (http://book.caltech.edu/bookforum/forumdisplay.php?f=110)
-   -   The trap of local minimum/maximum for linear regression (http://book.caltech.edu/bookforum/showthread.php?t=4243)

barbacot 04-25-2013 02:10 AM

The trap of local minimum/maximum for linear regression
 
Hi,

I refer to the method of minimizing the Ein, as explained in the Lecture 3, slide 15.

When choosing the minimum as the point where the derivative (gradient) is zero, how can we be sure that we don't run over a local minimum, or worse, a local maximum?

Does the quadratic form of the error measure ensures Ein does not have such local maxima and minima, just one global minimum? Indeed, it seems that grad(Ein) = 0 has only one solution. Is this really the case?

If it really is the case, than choosing another error measure could yield such local minima/maxima. How can we avoid getting stuck into one of those points?

yaser 04-25-2013 11:02 AM

Re: The trap of local minimum/maximum for linear regression
 
Quote:

Originally Posted by barbacot (Post 10590)
When choosing the minimum as the point where the derivative (gradient) is zero, how can we be sure that we don't run over a local minimum, or worse, a local maximum?

Does the quadratic form of the error measure ensures Ein does not have such local maxima and minima, just one global minimum? Indeed, it seems that grad(Ein) = 0 has only one solution. Is this really the case?

If it really is the case, than choosing another error measure could yield such local minima/maxima. How can we avoid getting stuck into one of those points?

It is indeed a global minimum in this case. Once easy way to see that, as you observe, is that there is only one solution (when the matrix is invertible) and since that quadratic form is always non-negative, it has to have a minimum so that must be the unique, global minimum.

Other error measures may result in local minima and often no closed-form solution, and the situation is tackled with methods like gradient descent and heuristcs to reduce the impact of local minima. Finding the global minimum is a general problem in optimization that is unlikely to have an exact, tractable solution since it is NP-hard in the general case.


All times are GMT -7. The time now is 06:21 AM.

Powered by vBulletin® Version 3.8.3
Copyright ©2000 - 2019, Jelsoft Enterprises Ltd.
The contents of this forum are to be used ONLY by readers of the Learning From Data book by Yaser S. Abu-Mostafa, Malik Magdon-Ismail, and Hsuan-Tien Lin, and participants in the Learning From Data MOOC by Yaser S. Abu-Mostafa. No part of these contents is to be communicated or made accessible to ANY other person or entity.