Generalization performance of bipartite ranking algorithms with convex losses
From MaRDI portal
Publication:488690
DOI10.1016/j.jmaa.2013.03.033zbMath1304.62044OpenAlexW2083125986MaRDI QIDQ488690
Publication date: 26 January 2015
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2013.03.033
Related Items
Optimality of regularized least squares ranking with imperfect kernels ⋮ Bias corrected regularization kernel method in ranking
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive partitioning schemes for bipartite ranking
- Gradient iteration with \(\ell _{p}\)-norm constraints
- A transitivity analysis of bipartite rankings in pairwise multi-class classification
- On the ERA ranking representability of pairwise bipartite ranking functions
- Generalization performance of least-square regularized regression algorithm with Markov chain samples
- The convergence rate of a regularized ranking algorithm
- Learning to rank on graphs
- Ranking and empirical minimization of \(U\)-statistics
- Learning gradients by a gradient descent algorithm
- On the mathematical foundations of learning
- Learning Theory
- Statistical Analysis of Bayes Optimal Subset Ranking
- 10.1162/153244302760200704
- 10.1162/153244303321897690
- 10.1162/1532443041827916
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Theory of Reproducing Kernels
