Question about the proof that ${h_a: h_a(x) = 1 text{ if } x < a, a in Bbb R }$ is learnable.
$begingroup$
From Understanding Machine Learning :
My three questions about the proof in the below image are:
(1.) In the red box below, why is $(b_0, b_1)$ a valid interval?
(2.) How does $b_s$ being a threshold corresponding to an ERM hypothesis $h_S$ imply that $b_s in (b_0,
b_1)$?
(3.) In the blue box, what makes this condition sufficient?
Assume $S={(x, y)}_{sampled}$ is some training set. Order all the $2$-tuples by their $x$ component and just write the $y$ values to get $S=(y_{x_0}, y_{x_1}, dots, y_{x_n}).$ As an example suppose we have $S=(1,0,1,0)$. Then we have $large S = (1, 0_{b_1}, 1_{b_0}, 0)$. But then we have improper interval notation.
What am I misunderstanding in the proof of this lemma?
probability proof-explanation machine-learning
$endgroup$
add a comment |
$begingroup$
From Understanding Machine Learning :
My three questions about the proof in the below image are:
(1.) In the red box below, why is $(b_0, b_1)$ a valid interval?
(2.) How does $b_s$ being a threshold corresponding to an ERM hypothesis $h_S$ imply that $b_s in (b_0,
b_1)$?
(3.) In the blue box, what makes this condition sufficient?
Assume $S={(x, y)}_{sampled}$ is some training set. Order all the $2$-tuples by their $x$ component and just write the $y$ values to get $S=(y_{x_0}, y_{x_1}, dots, y_{x_n}).$ As an example suppose we have $S=(1,0,1,0)$. Then we have $large S = (1, 0_{b_1}, 1_{b_0}, 0)$. But then we have improper interval notation.
What am I misunderstanding in the proof of this lemma?
probability proof-explanation machine-learning
$endgroup$
add a comment |
$begingroup$
From Understanding Machine Learning :
My three questions about the proof in the below image are:
(1.) In the red box below, why is $(b_0, b_1)$ a valid interval?
(2.) How does $b_s$ being a threshold corresponding to an ERM hypothesis $h_S$ imply that $b_s in (b_0,
b_1)$?
(3.) In the blue box, what makes this condition sufficient?
Assume $S={(x, y)}_{sampled}$ is some training set. Order all the $2$-tuples by their $x$ component and just write the $y$ values to get $S=(y_{x_0}, y_{x_1}, dots, y_{x_n}).$ As an example suppose we have $S=(1,0,1,0)$. Then we have $large S = (1, 0_{b_1}, 1_{b_0}, 0)$. But then we have improper interval notation.
What am I misunderstanding in the proof of this lemma?
probability proof-explanation machine-learning
$endgroup$
From Understanding Machine Learning :
My three questions about the proof in the below image are:
(1.) In the red box below, why is $(b_0, b_1)$ a valid interval?
(2.) How does $b_s$ being a threshold corresponding to an ERM hypothesis $h_S$ imply that $b_s in (b_0,
b_1)$?
(3.) In the blue box, what makes this condition sufficient?
Assume $S={(x, y)}_{sampled}$ is some training set. Order all the $2$-tuples by their $x$ component and just write the $y$ values to get $S=(y_{x_0}, y_{x_1}, dots, y_{x_n}).$ As an example suppose we have $S=(1,0,1,0)$. Then we have $large S = (1, 0_{b_1}, 1_{b_0}, 0)$. But then we have improper interval notation.
What am I misunderstanding in the proof of this lemma?
probability proof-explanation machine-learning
probability proof-explanation machine-learning
edited Jan 15 at 16:01
Oliver G
asked Jan 15 at 15:45
Oliver GOliver G
1,5791530
1,5791530
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
$S=(1,0,1,0)$ is not in the function class. If $h_a(x_1)=1$ and $h_a(x_2)=0$, then $x_1<x_2$. So $b_0$ is always smaller than $b_1$.
$endgroup$
$begingroup$
That answers $1$ and $2$. Do you have any idea about $3$? I can't see why those conditions are sufficient.
$endgroup$
– Oliver G
Jan 16 at 15:34
$begingroup$
Recall that at $a^*$ the loss is zero. If you move the threshold to $a_0$ or $a_1$, the loss will be $epsilon$. Take into account that the loss funtion is monotonous (in this case, not in general) and you see that it is sufficient
$endgroup$
– Micky Messer
Jan 19 at 8:51
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3074568%2fquestion-about-the-proof-that-h-a-h-ax-1-text-if-x-a-a-in-bbb-r%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
$S=(1,0,1,0)$ is not in the function class. If $h_a(x_1)=1$ and $h_a(x_2)=0$, then $x_1<x_2$. So $b_0$ is always smaller than $b_1$.
$endgroup$
$begingroup$
That answers $1$ and $2$. Do you have any idea about $3$? I can't see why those conditions are sufficient.
$endgroup$
– Oliver G
Jan 16 at 15:34
$begingroup$
Recall that at $a^*$ the loss is zero. If you move the threshold to $a_0$ or $a_1$, the loss will be $epsilon$. Take into account that the loss funtion is monotonous (in this case, not in general) and you see that it is sufficient
$endgroup$
– Micky Messer
Jan 19 at 8:51
add a comment |
$begingroup$
$S=(1,0,1,0)$ is not in the function class. If $h_a(x_1)=1$ and $h_a(x_2)=0$, then $x_1<x_2$. So $b_0$ is always smaller than $b_1$.
$endgroup$
$begingroup$
That answers $1$ and $2$. Do you have any idea about $3$? I can't see why those conditions are sufficient.
$endgroup$
– Oliver G
Jan 16 at 15:34
$begingroup$
Recall that at $a^*$ the loss is zero. If you move the threshold to $a_0$ or $a_1$, the loss will be $epsilon$. Take into account that the loss funtion is monotonous (in this case, not in general) and you see that it is sufficient
$endgroup$
– Micky Messer
Jan 19 at 8:51
add a comment |
$begingroup$
$S=(1,0,1,0)$ is not in the function class. If $h_a(x_1)=1$ and $h_a(x_2)=0$, then $x_1<x_2$. So $b_0$ is always smaller than $b_1$.
$endgroup$
$S=(1,0,1,0)$ is not in the function class. If $h_a(x_1)=1$ and $h_a(x_2)=0$, then $x_1<x_2$. So $b_0$ is always smaller than $b_1$.
answered Jan 15 at 20:06
Micky MesserMicky Messer
287
287
$begingroup$
That answers $1$ and $2$. Do you have any idea about $3$? I can't see why those conditions are sufficient.
$endgroup$
– Oliver G
Jan 16 at 15:34
$begingroup$
Recall that at $a^*$ the loss is zero. If you move the threshold to $a_0$ or $a_1$, the loss will be $epsilon$. Take into account that the loss funtion is monotonous (in this case, not in general) and you see that it is sufficient
$endgroup$
– Micky Messer
Jan 19 at 8:51
add a comment |
$begingroup$
That answers $1$ and $2$. Do you have any idea about $3$? I can't see why those conditions are sufficient.
$endgroup$
– Oliver G
Jan 16 at 15:34
$begingroup$
Recall that at $a^*$ the loss is zero. If you move the threshold to $a_0$ or $a_1$, the loss will be $epsilon$. Take into account that the loss funtion is monotonous (in this case, not in general) and you see that it is sufficient
$endgroup$
– Micky Messer
Jan 19 at 8:51
$begingroup$
That answers $1$ and $2$. Do you have any idea about $3$? I can't see why those conditions are sufficient.
$endgroup$
– Oliver G
Jan 16 at 15:34
$begingroup$
That answers $1$ and $2$. Do you have any idea about $3$? I can't see why those conditions are sufficient.
$endgroup$
– Oliver G
Jan 16 at 15:34
$begingroup$
Recall that at $a^*$ the loss is zero. If you move the threshold to $a_0$ or $a_1$, the loss will be $epsilon$. Take into account that the loss funtion is monotonous (in this case, not in general) and you see that it is sufficient
$endgroup$
– Micky Messer
Jan 19 at 8:51
$begingroup$
Recall that at $a^*$ the loss is zero. If you move the threshold to $a_0$ or $a_1$, the loss will be $epsilon$. Take into account that the loss funtion is monotonous (in this case, not in general) and you see that it is sufficient
$endgroup$
– Micky Messer
Jan 19 at 8:51
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3074568%2fquestion-about-the-proof-that-h-a-h-ax-1-text-if-x-a-a-in-bbb-r%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown