@conference {15310,
	title = {Learning to efficiently rank},
	booktitle = {Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval},
	series = {SIGIR {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {138 - 145},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {It has been shown that learning to rank approaches are capable of learning highly effective ranking functions. However, these approaches have mostly ignored the important issue of efficiency. Given that both efficiency and effectiveness are important for real search engines, models that are optimized for effectiveness may not meet the strict efficiency requirements necessary to deploy in a production environment. In this work, we present a unified framework for jointly optimizing effectiveness and efficiency. We propose new metrics that capture the tradeoff between these two competing forces and devise a strategy for automatically learning models that directly optimize the tradeoff metrics. Experiments indicate that models learned in this way provide a good balance between retrieval effectiveness and efficiency. With specific loss functions, learned models converge to familiar existing ones, which demonstrates the generality of our framework. Finally, we show that our approach naturally leads to a reduction in the variance of query execution times, which is important for query load balancing and user satisfaction.},
	keywords = {effectiveness and efficiency tradeoff, Learning to rank, Linear Models},
	isbn = {978-1-4503-0153-4},
	doi = {10.1145/1835449.1835475},
	url = {http://doi.acm.org/10.1145/1835449.1835475},
	author = {Wang,Lidan and Jimmy Lin and Metzler,Donald}
}
