Pages that link to "Item:Q488690"
From MaRDI portal
The following pages link to Generalization performance of bipartite ranking algorithms with convex losses (Q488690):
Displaying 10 items.
- PAC-Bayesian high dimensional bipartite ranking (Q1642737) (← links)
- Approximation analysis of gradient descent algorithm for bipartite ranking (Q1760585) (← links)
- Learning layered ranking functions with structured support vector machines (Q1932121) (← links)
- Calibration and regret bounds for order-preserving surrogate losses in learning to rank (Q2251435) (← links)
- Generalization bounds for ranking algorithms via algorithmic stability (Q2880888) (← links)
- Bias corrected regularization kernel method in ranking (Q4615656) (← links)
- Learning Theory (Q5473628) (← links)
- Learning Theory (Q5473639) (← links)
- Optimality of regularized least squares ranking with imperfect kernels (Q6125450) (← links)
- Analysis of regularized least squares ranking with centered reproducing kernel (Q6591691) (← links)