Generalization performance of bipartite ranking algorithms with convex losses
From MaRDI portal
Publication:488690
DOI10.1016/J.JMAA.2013.03.033zbMATH Open1304.62044OpenAlexW2083125986MaRDI QIDQ488690FDOQ488690
Authors: Fangchao He, Hong Chen 
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
Recommendations
Cites Work
- Theory of Reproducing Kernels
- Learning Theory
- 10.1162/153244302760200704
- On the mathematical foundations of learning
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ranking and empirical minimization of \(U\)-statistics
- 10.1162/153244303321897690
- Title not available (Why is that?)
- Generalization bounds for ranking algorithms via algorithmic stability
- Margin-based ranking and an equivalence between AdaBoost and RankBoost
- Generalization bounds for the area under the ROC curve
- 10.1162/1532443041827916
- Estimation of gradients and coordinate covariation in classification
- Statistical Analysis of Bayes Optimal Subset Ranking
- Adaptive partitioning schemes for bipartite ranking
- On the ERA ranking representability of pairwise bipartite ranking functions
- A transitivity analysis of bipartite rankings in pairwise multi-class classification
- The convergence rate of a regularized ranking algorithm
- Gradient iteration with \(\ell _{p}\)-norm constraints
- Learning to rank on graphs
- Learning gradients by a gradient descent algorithm
- The \(p\)-norm push: a simple convex ranking algorithm that concentrates at the top of the list
- Generalization performance of least-square regularized regression algorithm with Markov chain samples
Cited In (17)
- Calibration and regret bounds for order-preserving surrogate losses in learning to rank
- Concentration inequalities for two-sample rank processes with application to bipartite ranking
- Analysis of regularized least squares ranking with centered reproducing kernel
- Analysis of \(k\)-partite ranking algorithm in area under the receiver operating characteristic curve criterion
- Surrogate regret bounds for bipartite ranking via strongly proper losses
- Learning Theory
- PAC-Bayesian high dimensional bipartite ranking
- Bias corrected regularization kernel method in ranking
- Approximation analysis of gradient descent algorithm for bipartite ranking
- Bipartite ranking: a risk-theoretic perspective
- Generalization bounds for the area under the ROC curve
- Learning layered ranking functions with structured support vector machines
- Strong and weak stability of \(k\)-partite ranking algorithms
- Generalization bounds for ranking algorithms via algorithmic stability
- Learning Theory
- On ranking and generalization bounds
- Optimality of regularized least squares ranking with imperfect kernels
This page was built for publication: Generalization performance of bipartite ranking algorithms with convex losses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488690)
