More Web Proxy on the site http://driver.im/

article

Multi-task learning to rank for web search

Authors:

Zhaohui ZhengAuthors Info & Claims

Pattern Recognition Letters, Volume 33, Issue 2

Pages 173 - 181

https://doi.org/10.1016/j.patrec.2011.09.020

Published: 01 January 2012 Publication History

Abstract

Both the quality and quantity of training data have significant impact on the accuracy of rank functions in web search. With the global search needs, a commercial search engine is required to expand its well tailored service to small countries as well. Due to heterogeneous intrinsic of query intents and search results on different domains (i.e., for different languages and regions), it is difficult for a generic ranking function to satisfy all type of queries. Instead, each domain should use a specific well tailored ranking function. In order to train each ranking function for each domain with a scalable strategy, it is critical to leverage existing training data to enhance the ranking functions of those domains without sufficient training data. In this paper, we present a boosting framework for learning to rank in the multi-task learning context to attack this problem. In particular, we propose to learn non-parametric common structures adaptively from multiple tasks in a stage-wise way. An algorithm is developed to iteratively discover super-features that are effective for all the tasks. The estimation of the regression function for each task is then learned as linear combination of those super-features. We evaluate the accuracy of multi-task learning methods for web search ranking using data from multiple domains from a commercial search engine. Our results demonstrate that multi-task learning methods bring significant relevance improvements over existing baseline method.

References

[1]

Amini, M.R., Truong, T.-V., Goutte, C., 2008. A boosting algorithm for learning bipartite ranking functions with partially labeled data. In: Proc. 31st Annual Internat. ACM SIGIR Conf. on Research and Development in Information Retrieval.

[2]

Multi-task feature learning. Neural Inform. Process. Systems. v19.

[3]

Bai, J., Zhou, K., Xue, G.-R., Zha, H., Zheng, Z., and Chang, Y., 2009. Multi-task learning for learning to rank in web search. In: Proc. 18th ACM Conf. on Information and Knowledge Management.

[4]

Task clustering and gating for bayesian multitask learning. J. Machine Learn. Res. v4. 83-99.

[5]

A bayesian/information theoretic model of learning to learn via multiple task sampling. Machine Learn. v28 i1. 7-39.

[6]

Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., Hullender. G., 2005. Learning to rank using gradient descent. In: Proc. 22nd Internat. Conf. on Machine learning.

[7]

Learning to rank with nonsmooth cost functions. Neural Inform. Process. Systems. v19.

[8]

Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., Li, H., 2007. Learning to rank: From pairwise approach to listwise approach. In: Proc. 24th Internat. Conf. on Machine Learning.

[9]

Multitask learning. Machine Learn. v28 i1. 41-75.

[10]

Cortes, C., Mohri M., and Rastogi, A., 2007. Magnitude-preserving ranking algorithms. In: Proc. 24th ICML.

[11]

Duh, K., Kirchhoff, K., 2008. Learning to rank with partially-labeled data. In: Proc. 31st Annual Internat. ACM SIGIR Conf. on Research and Development in Information Retrieval.

[12]

Evgeniou, T., Pontil, M., 2004. Regularized multi-task learning. In: Proc. tenth ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining, New York, USA, pp. 109-117.

[13]

Learning multiple tasks with kernel methods. J. Machine Learn. Res. v6. 615-637.

[14]

Fung, G., Rosales, R., Krishnapuram, B., 2006. Learning rankings via convex hull separation. In: Neural Information Processing Systems, vol. 18.

[15]

Freund, Y., Iyer, R.D., Schapire R.E., Singer. Y., 1998. An efficient boosting algorithm for combining preferences. In: Proc. Fifteenth Internat. Conf. on Machine Learning.

[16]

Greedy function approximation: A gradient boosting machine. The Ann. Statist. v29 i5. 1189-1232.

[17]

Gao, J., Wu, Q., Burges, C., Svore, K., Su, Y., Khan, N., Shah S., Zhou, H., 2009. Model adaptation via model interpolation and boosting for web search ranking. In: Conf. on Empirical Methods in Natural Language Processing.

[18]

Guiver, J., Snelson, E., 2008. Learning to rank with SoftRank and Gaussian processes. In: Proc. 31st Annual Internat. ACM SIGIR Conf. on Research and Development in Information Retrieval.

[19]

Heskes, T., 2000. Empirical Bayes for learning to learn. In: Proc. 17th Internat. Conf. on Machine Learning.

[20]

Cumulated gain-based evaluation of IR techniques. ACM Trans. Inform. Systems. v20. 422-446.

[21]

Joachims, T., 2002. Optimizing search engines using clickthrough data. In: Proc. ACM SIGKDD.

[22]

Joachims, T., 2005. A support vector method for multivariate performance measures. In: Proc. 22nd Internat. Conf. on Machine Learning.

[23]

Lawrence, N.D., Platt, J.C., 2004. Learning to learn with the informative vector machine. In: Proc. 21st Internat. Conf. on Machine Learning.

[24]

Radial basis function network for multi-task learning. In: Neural Information Processing Systems, vol. 18. MIT Press, Cambridge, MA. pp. 795-802.

[25]

. Foundation and Trends on Information Retrieval, 2009.Now Publishers.

[26]

Obozinski, G., Taskar B., Jordan. M., 2007. Multi-task Feature Selection. In: UC Berkeley Technical Report.

[27]

Xia, F., Liu, T., Wang, J., Zhang, W., Li, H., 2008. Listwise approach to learning to rank: Theory and algorithm. In: Proc. 25th Annual Internat. Conf. Machine.

[28]

Xu, J., Li, H., 2007. Adarank: A boosting algorithm for information retrieval. In: Proc. 30th ACM SIGIR.

[29]

Xu, J., Liu, T.Y., Lu, M., Li, H., Ma, W.Y., 2008. Directly optimizing evaluation measures in learning to rank. In: Proc. 31st Annual Internat. ACM SIGIR Conf. on Research and Development in Information Retrieval.

[30]

Multi-task learning for classification with dirichlet process priors. J. Machine Learn. Res. v8. 35-63.

[31]

Yu, K., Tresp, V., Schwaighofer, A., 2005. Learning gaussian processes from multiple tasks. In: Proc. 22nd Internat. Conf. on Machine Learning.

[32]

Yue, Y., Finley, T., Radlinski, F., Joachims, T., 2007. A support vector method for optimizing average precision. In: Proc. ACM SIGIR.

[33]

Zha, H., Zheng, Z., Fu, H., and Sun, G., 2006. Incorporating query difference for learning retrieval functions in world wide web search. In: Proc. 15th ACM CIKM Conf., pp. 307-316.

[34]

Boosting with early stopping: Convergence and consistency. Ann. Statist. v33. 1538

[35]

Zheng, Z., Chen, K., Sun, G., Zha, H., 2007. A regression framework for learning ranking functions using relative relevance judgments. In: Proc. 30th ACM SIGIR Conf.

[36]

A general boosting method and its application to learning ranking functions for web search. In: Neural Information Processing Systems, vol. 20. MIT Press, Cambridge, MA. pp. 1697-1704.

Cited By

Milliken LMotomarry SKulkarni A(2019)ARtPMJournal of Biomedical Informatics10.1016/j.jbi.2019.10322495:COnline publication date: 1-Jul-2019
https://dl.acm.org/doi/10.1016/j.jbi.2019.103224
Soleimani AAraabi BFouladi K(2016)Deep Multitask Metric Learning for Offline Signature VerificationPattern Recognition Letters10.1016/j.patrec.2016.05.02380:C(84-90)Online publication date: 1-Sep-2016
https://dl.acm.org/doi/10.1016/j.patrec.2016.05.023
Li DHu GWang YPan Z(2015)Network traffic classification via non-convex multi-task feature learningNeurocomputing10.1016/j.neucom.2014.10.061152:C(322-332)Online publication date: 25-Mar-2015
https://dl.acm.org/doi/10.1016/j.neucom.2014.10.061

Multi-task learning to rank for web search
1. Computing methodologies
2. Information systems

Recommendations

Multi-task learning for learning to rank in web search
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge management

Both the quality and quantity of training data have significant impact on the performance of ranking functions in the context of learning to rank for web search. Due to resource constraints, training data for smaller search engine markets are scarce and ...
Learning to rank code examples for code search engines

Source code examples are used by developers to implement unfamiliar tasks by learning from existing solutions. To better support developers in finding existing solutions, code search engines are designed to locate and rank code examples relevant to user'...
On Application of Learning to Rank for E-Commerce Search
SIGIR '17: Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval

E-Commerce (E-Com) search is an emerging important new application of information retrieval. Learning to Rank (LETOR) is a general effective strategy for optimizing search engines, and is thus also a key technology for E-Com search. While the use of ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Pattern Recognition Letters

Pattern Recognition Letters Volume 33, Issue 2

January, 2012

125 pages

ISSN:0167-8655

Issue’s Table of Contents

Copyright © Elsevier B.V. © 2011.

Publisher

Elsevier Science Inc.

United States

Publication History

Published: 01 January 2012

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 21 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Milliken LMotomarry SKulkarni A(2019)ARtPMJournal of Biomedical Informatics10.1016/j.jbi.2019.10322495:COnline publication date: 1-Jul-2019
https://dl.acm.org/doi/10.1016/j.jbi.2019.103224
Soleimani AAraabi BFouladi K(2016)Deep Multitask Metric Learning for Offline Signature VerificationPattern Recognition Letters10.1016/j.patrec.2016.05.02380:C(84-90)Online publication date: 1-Sep-2016
https://dl.acm.org/doi/10.1016/j.patrec.2016.05.023
Li DHu GWang YPan Z(2015)Network traffic classification via non-convex multi-task feature learningNeurocomputing10.1016/j.neucom.2014.10.061152:C(322-332)Online publication date: 25-Mar-2015
https://dl.acm.org/doi/10.1016/j.neucom.2014.10.061

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents