Learning Theory
From MaRDI portal
Publication:5473628
DOI10.1007/b137542zbMath1137.68513OpenAlexW4246660828MaRDI QIDQ5473628
Shivani Agarwal, Partha Niyogi
Publication date: 22 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b137542
Related Items (13)
Learning from binary labels with instance-dependent noise ⋮ Learning rates for regularized least squares ranking algorithm ⋮ Analysis of convergence performance of neural networks ranking algorithm ⋮ Generalization Bounds for Some Ordinal Regression Algorithms ⋮ Preference-based learning to rank ⋮ An efficient algorithm for learning to rank from preference graphs ⋮ Stability and optimization error of stochastic gradient descent for pairwise learning ⋮ U-Processes and Preference Learning ⋮ The risk of trivial solutions in bipartite top ranking ⋮ Bounding the difference between RankRC and RankSVM and application to multi-level rare class kernel ranking ⋮ Approximation analysis of gradient descent algorithm for bipartite ranking ⋮ Stability analysis of learning algorithms for ontology similarity computation ⋮ Robust reductions from ranking to classification
This page was built for publication: Learning Theory
