Opening your learning space
Starting the app …
Opening your learning space
Starting the app …
For labels −1 and +1, hinge loss penalizes scores that lie inside the unit margin or on the wrong side of the separating hyperplane.
Free to browse · flashcards or a multiple-choice quiz · import from Essential
Formula
y and margin are dimensionless; wᵀx+b is a dimensionless score under consistent feature scaling
| Symbol | Meaning | Unit |
|---|---|---|
| Feature vector of one example | feature values | |
| Binary label in {−1,+1} | dimensionless | |
| Weight vector and bias of the decision boundary | scale-dependent | |
| Per-example hinge loss | dimensionless |
L_i=\max(0,1-y_i(w^Tx_i+b))The margin condition is y(wᵀx+b)≥1. Hinge loss max(0,1−y(wᵀx+b)) is zero outside the margin on the correct side and positive otherwise. A linear SVM balances margin violations against a regularization term. Scores are not calibrated probabilities; multiclass schemes and scaling conventions vary. Feature scaling can materially change the fitted separator and penalty tradeoff.
The margin condition is y(wᵀx+b)≥1. Hinge loss max(0,1−y(wᵀx+b)) is zero outside the margin on the correct side and positive otherwise. A linear SVM balances margin violations against a regularization term. Scores are not calibrated probabilities; multiclass schemes and scaling conventions vary. Feature scaling can materially change the fitted separator and penalty tradeoff.
For labels −1 and +1, hinge loss penalizes scores that lie inside the unit margin or on the wrong side of the separating hyperplane.
Defining relation
The equation states the defining relation within its stated domain.
Use the example for Linear support vector machine and hinge loss to explain which inputs determine the requested output.
The example connects concrete inputs to its result.
For labels −1 and +1, hinge loss penalizes scores that lie inside the unit margin or on the wrong side of the separating hyperplane.
The relation applies only under its stated assumptions.
Applying the relation to a different case without checking its stated assumptions.
Check the validity range before substituting values: The margin condition is y(wᵀx+b)≥1. Hinge loss max(0,1−y(wᵀx+b)) is zero outside the margin on the correct side and positive otherwise. A linear SVM balances margin violations against a regularization term..
Formula cluster
For labels −1 and +1, hinge loss penalizes scores that lie inside the unit margin or on the wrong side of the separating hyperplane.
For y=+1 and score 0.4, hinge loss is max(0,1−0.4)=0.6. At score 1.4 it is zero. For y=−1 and score 0.4, the signed margin is −0.4 and loss is 1.4. These cases check the label sign.
Fit a linear margin classifier and reason about support vectors and margin violations.
Here is how to work through a typical Linear support vector machine and hinge loss (Hinge-Loss = max(0, 1 − Label · Entscheidung)) task step by step:
Task
Use the example for Linear support vector machine and hinge loss to explain which inputs determine the requested output.
Solution path
The example connects concrete inputs to its result.
For labels −1 and +1, hinge loss penalizes scores that lie inside the unit margin or on the wrong side of the separating hyperplane.
The relation applies only under its stated assumptions.
The relation Li=\max(0,1-yi(w^Tx_i+b)) summarizes For labels −1 and +1, hinge loss penalizes scores that lie inside the unit margin or on the wrong side of the separating hyperplane. Read it as a model for defined quantities, not as an automatic claim about every real situation. In the example For y=+1 and score 0.4, hinge loss is max(0,1−0.4)=0.6. At score 1.4 it is zero. For y=−1 and score 0.4, the signed margin is −0.4 and loss is 1.4. These cases check the label sign., symbols are connected to concrete values and the result is interpreted in context. Validity limit: The margin condition is y(wᵀx+b)≥1. Hinge loss max(0,1−y(wᵀx+b)) is zero outside the margin on the correct side and positive otherwise. A linear SVM balances margin violations against a regularization term. Source: scikit-learn User Guide, §1.4 Support Vector Machines; binary linear SVM objective.
First write down the requested quantity and all given values with their symbols. Substitute them into the defining relation and check unit consistency. The example For y=+1 and score 0.4, hinge loss is max(0,1−0.4)=0.6. At score 1.4 it is zero. For y=−1 and score 0.4, the signed margin is −0.4 and loss is 1.4. These cases check the label sign. provides a worked check: formula and result must have compatible scale and meaning; round only at the end. Validity limit: The margin condition is y(wᵀx+b)≥1. Hinge loss max(0,1−y(wᵀx+b)) is zero outside the margin on the correct side and positive otherwise. A linear SVM balances margin violations against a regularization term. Source: scikit-learn User Guide, §1.4 Support Vector Machines; binary linear SVM objective.
The formula applies only when quantities are defined as in the source and background. Check boundary cases, measurement conditions and whether an approximation rather than equality is intended. Substitution can be algebraically correct yet technically wrong when assumptions fail or the population or system boundary changes. Validity limit: The margin condition is y(wᵀx+b)≥1. Hinge loss max(0,1−y(wᵀx+b)) is zero outside the margin on the correct side and positive otherwise. A linear SVM balances margin violations against a regularization term. Source: scikit-learn User Guide, §1.4 Support Vector Machines; binary linear SVM objective.
The stated units are: y and margin are dimensionless; wᵀx+b is a dimensionless score under consistent feature scaling. Convert values to a consistent unit system before substitution; counts, percentages and dimensionless ratios are not interchangeable. The variable list states the role of each symbol. Dimensional analysis catches many errors but does not replace checking the formula's assumptions. Validity limit: The margin condition is y(wᵀx+b)≥1. Hinge loss max(0,1−y(wᵀx+b)) is zero outside the margin on the correct side and positive otherwise. A linear SVM balances margin violations against a regularization term. Source: scikit-learn User Guide, §1.4 Support Vector Machines; binary linear SVM objective.
Comparison helps when both quantities address the same question but emphasize different properties. Report the definition, input data, threshold or averaging with the value. The source scikit-learn User Guide, §1.4 Support Vector Machines; binary linear SVM objective. supports the definition used here; other conventions can differ. Choose the measure to match the learning or analysis goal. Validity limit: The margin condition is y(wᵀx+b)≥1. Hinge loss max(0,1−y(wᵀx+b)) is zero outside the margin on the correct side and positive otherwise. A linear SVM balances margin violations against a regularization term. Source: scikit-learn User Guide, §1.4 Support Vector Machines; binary linear SVM objective.
Quanta exam set
Curated exam set for "Linear support vector machine and hinge loss":
Question (front)
Which formula describes Linear support vector machine and hinge loss?
Answer in your set
Question (front)
How do you rearrange Linear support vector machine and hinge loss for Defining relation?
Answer in your set
Question (front)
Which common mistake happens with Linear support vector machine and hinge loss?
Answer in your set
+ 7 more cards: units, variables, derivation, example, exam task
The formula set contains 10 cards. After importing, review them and start practicing; your ratings determine later review intervals.
This list names subject references and further reading. A page or section number appears when it is part of the reference; these are not verbatim quotations.
Create a curated FSRS exam set for Hinge-Loss = max(0, 1 − Label · Entscheidung): formula recall, variables, derivation, rearrangement, worked example, common mistakes and exam context.
Curated formula set · LaTeX · FSRS spaced repetition · import from Essential