On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms (Q1959594): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Convex analysis and nonlinear optimization. Theory and examples. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logistic regression, AdaBoost and Bregman distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244304773936072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive version of the boost by majority algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244301753683726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3148809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of boosting algorithms using the smooth margin function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5386442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting the margin: a new explanation for the effectiveness of voting methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual perspective of online learning algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy Regularized LPBoost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential greedy approximation for certain convex optimization problems / rank
 
Normal rank

Latest revision as of 06:49, 3 July 2024

scientific article
Language Label Description Also known as
English
On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms
scientific article

    Statements

    On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms (English)
    0 references
    0 references
    0 references
    7 October 2010
    0 references
    boosting
    0 references
    margin
    0 references
    linear separability
    0 references
    minimax theorem
    0 references

    Identifiers