![]() |
#1
|
|||
|
|||
![]()
Let's say I run my machine learning algorithm for my friend, taking care to ensure Ein(g) and Eout(g) are close enough, but I find that my Ein(g) = .5 or something terrible like that. What are my options for continuing to solve the machine learning problem? Is there any way for me to go back and change my hypothesis set without losing the theoretical guarantees that Ein(g) is close to Eout(g)?
|
#2
|
||||
|
||||
![]() Quote:
![]() ![]() ![]() Just because this uses a "hierarchy" of hypothesis sets (in this case the hierarchy being ![]() ![]() ![]() ![]()
__________________
Where everyone thinks alike, no one thinks very much |
#3
|
||||
|
||||
![]()
Just to elaborate a little on the last point in Yaser's answer.
Suppose your strategy is to use ![]() ![]() If ![]() ![]() ![]() The interesting case is if ![]() ![]() ![]() It is the option to use ![]() ![]() This is why to get a correct theoretical bound, you must always specify your entire strategy first. The simplest strategy is to fix a hypothesis set. If it fails, it fails and you are done. If in the back of your mind you are thinking about the possibility of changing hypothesis sets if it fails, then this has to be taken into account in the theoretical analysis from the very begining, in particular, even if the first hypothesis set succeeds. As mentioned by Yaser, one framework that is useful in analyzing such adaptive strategies is structural risk minimization. Quote:
__________________
Have faith in probability |
![]() |
Thread Tools | |
Display Modes | |
|
|