Rademacher complexity in Neyman-Pearson classification (Q1034311): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3747485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4881152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Neyman–Pearson Approach to Statistical Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of stochastic processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rademacher penalties and structural risk minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model selection and error estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rademacher averages and phase transitions in Glivenko-Cantelli classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303321897690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Rademacher complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity regularization via localized random penalties / rank
 
Normal rank

Latest revision as of 04:29, 2 July 2024

scientific article
Language Label Description Also known as
English
Rademacher complexity in Neyman-Pearson classification
scientific article

    Statements

    Rademacher complexity in Neyman-Pearson classification (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Neyman-Pearson Lemma
    0 references
    VC classes
    0 references
    Rademacher complexity
    0 references
    Neyman-Pearson classification
    0 references
    0 references