<i>U</i>-Processes and Preference Learning (Q5383812): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q50632922, #quickstatements; #temporary_batch_1710862453543
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bernstein-type inequality for \(U\)-statistics and \(U\)-processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit theorems for \(U\)-processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Rademacher complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244303321897690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp concentration inequality with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bennett concentration inequality and its application to suprema of empirical processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking and empirical minimization of \(U\)-statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Analysis of Bayes Optimal Subset Ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform Central Limit Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/1532443041827916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Label ranking by learning pairwise preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration around the mean for maxima of empirical processes / 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: Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Talagrand's deviation inequalities for product measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning to Rank for Information Retrieval / 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: About the constants in Talagrand's concentration inequalities for empirical processes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration for self-bounding functions and an inequality of Talagrand / rank
 
Normal rank
Property / cites work
 
Property / cites work: U-processes: Rates of convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5405164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharper bounds for Gaussian and empirical processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New concentration inequalities in product spaces / 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: Q4261789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rademacher Chaos Complexities for Learning the Kernel Problem / rank
 
Normal rank

Revision as of 14:24, 19 July 2024

scientific article; zbMATH DE number 7068984
Language Label Description Also known as
English
<i>U</i>-Processes and Preference Learning
scientific article; zbMATH DE number 7068984

    Statements

    <i>U</i>-Processes and Preference Learning (English)
    0 references
    0 references
    0 references
    0 references
    20 June 2019
    0 references
    0 references
    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