Upper bounds and aggregation in bipartite ranking
From MaRDI portal
Publication:1951156
DOI10.1214/13-EJS805zbMath1336.62068MaRDI QIDQ1951156
Publication date: 29 May 2013
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.ejs/1367242158
Nonparametric regression and quantile regression (62G08) Minimax procedures in statistical decision theory (62C20) Statistical ranking and selection procedures (62F07)
Related Items (2)
PAC-Bayesian high dimensional bipartite ranking ⋮ A reduced-rank approach to predicting multiple binary responses through machine learning
Cites Work
- Unnamed Item
- Unnamed Item
- Exponential screening and optimal rates of sparse estimation
- Overlaying classifiers: A practical approach to optimal scoring
- Risk bounds for statistical learning
- Fast learning rates for plug-in classifiers
- Optimal spatial adaptation to inhomogeneous smoothness: An approach based on kernel estimates with variable bandwidth selectors
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Optimal aggregation of classifiers in statistical learning.
- Classification via local multi-resolution projections
- Classification with minimax fast rates for classes of Bayes rules with sparse representation
- PAC-Bayesian bounds for sparse regression estimation with exponential weights
- Fast learning rates in statistical inference through aggregation
- Ranking and empirical minimization of \(U\)-statistics
- Theory of Classification: a Survey of Some Recent Advances
- Uniform Central Limit Theorems
- 10.1162/1532443041827916
- Tree-Based Ranking Methods
- Ranking with a P-Norm Push
- Prediction, Learning, and Games
- Learning Theory
- Convexity, Classification, and Risk Bounds
- Some applications of concentration inequalities to statistics
This page was built for publication: Upper bounds and aggregation in bipartite ranking
