Complexities of convex combinations and bounding the generalization error in classification (Q2583410): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: math/0405356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303768966111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregated estimators and empirical complexity for least square regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Rademacher complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity, Classification, and Risk Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/1532443041424319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bagging predictors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arcing classifiers. (With discussion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4881152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform Central Limit Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process consistency for AdaBoost. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on margin distributions in learning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empirical margin distributions and bounding the generalization error of combined classifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory and Kernel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the generalization error of convex combinations of classifiers: Balancing the dimensionality and the margins. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bayes-risk consistency of regularized boosting methods. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of concentration inequalities to statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Talagrand's concentration inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some extensions of an inequality of Vapnik and Chervonenkis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetrization approach to concentration inequalities for empirical processes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952642 / 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: Improved boosting algorithms using confidence-rated predictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/1532443041827925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory and Kernel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak convergence and empirical processes. With applications to statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical behavior and consistency of classification methods based on convex risk minimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting with early stopping: convergence and consistency / rank
 
Normal rank

Latest revision as of 14:19, 11 June 2024

scientific article
Language Label Description Also known as
English
Complexities of convex combinations and bounding the generalization error in classification
scientific article

    Statements

    Complexities of convex combinations and bounding the generalization error in classification (English)
    0 references
    16 January 2006
    0 references
    convex combination
    0 references
    convex hull
    0 references
    empirical process
    0 references
    empirical margin distribution
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references