U-Processes and Preference Learning

DOI10.1162/NECO_a_00674zbMath1415.68170OpenAlexW2068115035WikidataQ50632922 ScholiaQ50632922MaRDI QIDQ5383812

Hong Li, Chuanbao Ren, Luoqing Li

Publication date: 20 June 2019

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/neco_a_00674

Mathematics Subject Classification ID

Asymptotic properties of nonparametric inference (62G20) Inequalities; stochastic orderings (60E15) General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

Concordance and value information criteria for optimal treatment decision ⋮ Refined Generalization Bounds of Gradient Learning over Reproducing Kernel Hilbert Spaces ⋮ Comments and Correction on ”U-Processes and Preference Learning” (Neural Computation Vol. 26, pp. 2896–2924, 2014) ⋮ Debiased magnitude-preserving ranking: learning rate and bias characterization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
• U-processes: Rates of convergence
• Limit theorems for \(U\)-processes
• Sharper bounds for Gaussian and empirical processes
• A Bernstein-type inequality for \(U\)-statistics and \(U\)-processes
• A Bennett concentration inequality and its application to suprema of empirical processes
• Concentration around the mean for maxima of empirical processes
• About the constants in Talagrand's concentration inequalities for empirical processes.
• Weak convergence and empirical processes. With applications to statistics
• Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
• Label ranking by learning pairwise preferences
• Ranking and empirical minimization of \(U\)-statistics
• Local Rademacher complexities
• Rademacher Chaos Complexities for Learning the Kernel Problem
• On Talagrand's deviation inequalities for product measures
• Concentration for self-bounding functions and an inequality of Talagrand
• Learning to Rank for Information Retrieval
• Statistical Analysis of Bayes Optimal Subset Ranking
• Uniform Central Limit Theorems
• A sharp concentration inequality with applications
• 10.1162/153244303321897690
• 10.1162/1532443041827916
• Learning Theory
• Some applications of concentration inequalities to statistics
• New concentration inequalities in product spaces

This page was built for publication: U-Processes and Preference Learning