Statistical Analysis of Bayes Optimal Subset Ranking
From MaRDI portal
Publication:3604977
Recommendations
Cited in
(18)- Approximation analysis of gradient descent algorithm for bipartite ranking
- Extreme learning machine for ranking: generalization analysis and applications
- Subset Ranking Using Regression
- The asymptotics of ranking algorithms
- On the consistency of multi-label learning
- Reduction from cost-sensitive ordinal ranking to weighted binary classification
- On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization
- Active evaluation of ranking functions based on graded relevance
- Learning to rank on graphs
- U-Processes and Preference Learning
- Calibration and regret bounds for order-preserving surrogate losses in learning to rank
- Sequential event prediction
- Generic subset ranking using binary classifiers
- The convergence rate of a regularized ranking algorithm
- Tune and mix: learning to rank using ensembles of calibrated multi-class classifiers
- Moment-Matching-Based Conjugacy Approximation for Bayesian Ranking and Selection
- Online learning to rank with top-k feedback
- Generalization performance of bipartite ranking algorithms with convex losses
This page was built for publication: Statistical Analysis of Bayes Optimal Subset Ranking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604977)