2010 MultiTaskLearningforBoostingwit

From GM-RKB
Jump to navigation Jump to search

Subject Headings:

Notes

Cited By

Quotes

Author Keywords

Abstract

In this paper we propose a novel algorithm for multi-task learning with boosted decision trees. We learn several different learning tasks with a joint model, explicitly addressing the specifics of each learning task with task-specific parameters and the commonalities between them through shared parameters. This enables implicit data sharing and regularization. We evaluate our learning method on web-search ranking data sets from several countries. Here, multitask learning is particularly helpful as data sets from different countries vary largely in size because of the cost of editorial judgments. experiments validate that learning various tasks jointly can lead to significant improvements in performance with surprising reliability.

References

,

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2010 MultiTaskLearningforBoostingwitOlivier Chapelle
Pannagadatta Shivaswamy
Srinivas Vadrevu
Kilian Weinberger
Ya Zhang
Belle Tseng
Multi-task Learning for Boosting with Application to Web Search RankingKDD-2010 Proceedings10.1145/1835804.18359532010