Complete ranking procedures with appropriate loss functions
From MaRDI portal
Recommendations
- Complete ranking procedures with quadratic loss
- Loss function based ranking in two-stage, hierarchical models
- Optimal full ranking from pairwise comparisons
- scientific article; zbMATH DE number 7108569
- Regularized ranking with convex losses and \(\ell^1\)-penalty
- Verification, Model Checking, and Abstract Interpretation
- Simple, Robust and Optimal Ranking from Pairwise Comparisons
- Ranking as function approximation
Cites work
- Complete ranking procedures with quadratic loss
- scientific article; zbMATH DE number 3984308 (Why is no real title available?)
- scientific article; zbMATH DE number 3727393 (Why is no real title available?)
- Optimum Sample Size for Choosing the Population Having the Smallest Variance (Large Sample Size Results)
Cited in
(6)- Optimal full ranking from pairwise comparisons
- Calibration and regret bounds for order-preserving surrogate losses in learning to rank
- Optimal transitive procedures for comparing large numbers of parameters
- Complete ranking procedures with quadratic loss
- scientific article; zbMATH DE number 7108569 (Why is no real title available?)
- Learning Theory
This page was built for publication: Complete ranking procedures with appropriate loss functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978040)