Constraints in SVM optimization problem
$begingroup$
I am studying SVM optimization problem for SMO algorithm.
When we are constructing optimization problem, we say, that we are searching for such separating hyperplane, so that we rescale $w$ and $b$, so that $|w^T x + b|=1$ for those points in each class nearest to the hyperplane.
After the rescaling, the distance from the nearest point in each class to the hyperplane is $frac{1}{||W||}$.
So we state optimization problem
$$min_{ w, b} frac{1}{2}{||W||^2}$$
s.t. :
$$y^{(i)}(w^Tx^{(i)}+b)geq 1, i=1,dots m.$$
Question: I don't see which constraint ensures, that for the nearest point to hyperplane in each class is going to hold $y^i(w^Tx^{(i)}+b)= 1$. I understand that there will be some point for which $y^{(i)}(w^Tx^{(i)}+b)=1$, but I don't understand which constraint ensures that on both sides of margin there will be such point.
I think I don't understand something simple here. If you have any explanation for this I would appreciate it very much.
optimization machine-learning
$endgroup$
add a comment |
$begingroup$
I am studying SVM optimization problem for SMO algorithm.
When we are constructing optimization problem, we say, that we are searching for such separating hyperplane, so that we rescale $w$ and $b$, so that $|w^T x + b|=1$ for those points in each class nearest to the hyperplane.
After the rescaling, the distance from the nearest point in each class to the hyperplane is $frac{1}{||W||}$.
So we state optimization problem
$$min_{ w, b} frac{1}{2}{||W||^2}$$
s.t. :
$$y^{(i)}(w^Tx^{(i)}+b)geq 1, i=1,dots m.$$
Question: I don't see which constraint ensures, that for the nearest point to hyperplane in each class is going to hold $y^i(w^Tx^{(i)}+b)= 1$. I understand that there will be some point for which $y^{(i)}(w^Tx^{(i)}+b)=1$, but I don't understand which constraint ensures that on both sides of margin there will be such point.
I think I don't understand something simple here. If you have any explanation for this I would appreciate it very much.
optimization machine-learning
$endgroup$
add a comment |
$begingroup$
I am studying SVM optimization problem for SMO algorithm.
When we are constructing optimization problem, we say, that we are searching for such separating hyperplane, so that we rescale $w$ and $b$, so that $|w^T x + b|=1$ for those points in each class nearest to the hyperplane.
After the rescaling, the distance from the nearest point in each class to the hyperplane is $frac{1}{||W||}$.
So we state optimization problem
$$min_{ w, b} frac{1}{2}{||W||^2}$$
s.t. :
$$y^{(i)}(w^Tx^{(i)}+b)geq 1, i=1,dots m.$$
Question: I don't see which constraint ensures, that for the nearest point to hyperplane in each class is going to hold $y^i(w^Tx^{(i)}+b)= 1$. I understand that there will be some point for which $y^{(i)}(w^Tx^{(i)}+b)=1$, but I don't understand which constraint ensures that on both sides of margin there will be such point.
I think I don't understand something simple here. If you have any explanation for this I would appreciate it very much.
optimization machine-learning
$endgroup$
I am studying SVM optimization problem for SMO algorithm.
When we are constructing optimization problem, we say, that we are searching for such separating hyperplane, so that we rescale $w$ and $b$, so that $|w^T x + b|=1$ for those points in each class nearest to the hyperplane.
After the rescaling, the distance from the nearest point in each class to the hyperplane is $frac{1}{||W||}$.
So we state optimization problem
$$min_{ w, b} frac{1}{2}{||W||^2}$$
s.t. :
$$y^{(i)}(w^Tx^{(i)}+b)geq 1, i=1,dots m.$$
Question: I don't see which constraint ensures, that for the nearest point to hyperplane in each class is going to hold $y^i(w^Tx^{(i)}+b)= 1$. I understand that there will be some point for which $y^{(i)}(w^Tx^{(i)}+b)=1$, but I don't understand which constraint ensures that on both sides of margin there will be such point.
I think I don't understand something simple here. If you have any explanation for this I would appreciate it very much.
optimization machine-learning
optimization machine-learning
asked Dec 28 '18 at 9:23
User1999User1999
5910
5910
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
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%2f3054718%2fconstraints-in-svm-optimization-problem%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3054718%2fconstraints-in-svm-optimization-problem%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