Efficient learning of sparse ranking functions

DOI10.1007/978-3-642-41136-6_22MaRDI QIDQ5264107zbMATH OpenOpenAlexFDO

Authors Mark R. Stevens, Samy Bengio, Yoram Singer

Publication date 20 July 2015

Published in Empirical Inference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-41136-6_22

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• An efficient algorithm for learning to rank from preference graphs
• Ranking as function approximation
• Large-scale linear rankSVM
• Preference-based learning to rank
• Learning Theory

Cited in

(12)

• An efficient algorithm for learning to rank from preference graphs
• Efficient regularized least-squares algorithms for conditional ranking on relational data
• On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization
• Learning linear ranking functions for beam search with application to planning
• Ranking as function approximation
• scientific article; zbMATH DE number 1315581 (Why is no real title available?)
• Research advances and prospects of learning to rank
• 10.1162/153244303322533188
• Large-scale linear rankSVM
• Ranked bandits in metric spaces: learning diverse rankings over large document collections
• Large Scale Ranking Using Stochastic Gradient Descent
• How to build high quality L2R training data: unsupervised compression-based selective sampling for learning to rank

This page was built for publication: Efficient learning of sparse ranking functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264107)