LFD Book Forum The trap of local minimum/maximum for linear regression
 User Name Remember Me? Password
 Register FAQ Calendar Mark Forums Read

 Thread Tools Display Modes
#1
04-25-2013, 02:10 AM
 barbacot Junior Member Join Date: Apr 2013 Posts: 3
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?
#2
04-25-2013, 11:02 AM
 yaser Caltech Join Date: Aug 2009 Location: Pasadena, California, USA Posts: 1,478
Re: The trap of local minimum/maximum for linear regression

Quote:
 Originally Posted by barbacot 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.
__________________
Where everyone thinks alike, no one thinks very much

 Tags regression local minimum

 Thread Tools Display Modes Linear Mode

 Posting Rules You may not post new threads You may not post replies You may not post attachments You may not edit your posts BB code is On Smilies are On [IMG] code is On HTML code is Off Forum Rules
 Forum Jump User Control Panel Private Messages Subscriptions Who's Online Search Forums Forums Home General     General Discussion of Machine Learning     Free Additional Material         Dynamic e-Chapters         Dynamic e-Appendices Course Discussions     Online LFD course         General comments on the course         Homework 1         Homework 2         Homework 3         Homework 4         Homework 5         Homework 6         Homework 7         Homework 8         The Final         Create New Homework Problems Book Feedback - Learning From Data     General comments on the book     Chapter 1 - The Learning Problem     Chapter 2 - Training versus Testing     Chapter 3 - The Linear Model     Chapter 4 - Overfitting     Chapter 5 - Three Learning Principles     e-Chapter 6 - Similarity Based Methods     e-Chapter 7 - Neural Networks     e-Chapter 8 - Support Vector Machines     e-Chapter 9 - Learning Aides     Appendix and Notation     e-Appendices

All times are GMT -7. The time now is 04:15 AM.

 Contact Us - LFD Book - Top