Fetching the paper…
Reading the bibliography…
Learning-to-Rank deals with maximizing the utility of a list of examples presented to the user, with items of higher relevance being prioritized.
Dropout: a simple way to prevent neural networks from overfitting
Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. 2014 · 1958
Earlier work this paper cites.
Optimum Polynomial Retrieval Functions Based on the Probability Ranking Principle
Norbert Fuhr. 1989 · 1989
Earlier work this paper cites.
Inferring Probability of Relevance Using the Method of Logistic Regression. In 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval . 222–231
Fredric C. Gey. 1994 · 1994
Earlier work this paper cites.
Convolutional networks for images, speech, and time series
Yann LeCun and Yoshua Bengio. 1995 · 1995
Earlier work this paper cites.
Greedy function approximation: a gradient boosting machine
Jerome H Friedman. 2001 · 2001
Earlier work this paper cites.
Cumulated gain-based evaluation of IR techniques
Kalervo Järvelin and Jaana Kekäläinen. 2002 · 2002
Earlier work this paper cites.
Optimizing Search Engines Using Clickthrough Data. In 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . 133–142
Thorsten Joachims. 2002 · 2002
Earlier work this paper cites.
Recall, precision and average precision
Mu Zhu. 2004 · 2004
Earlier work this paper cites.
Learning to rank using gradient descent. In 22nd International Conference on Machine Learning . 89–96
Chris Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, and Greg Hullender. 2005 · 2005
Earlier work this paper cites.
Preference Learning with Gaussian Processes. In 22nd International Conference on Machine Learning . 137–144
Wei Chu and Zoubin Ghahramani. 2005 · 2005
Earlier work this paper cites.
Accurately Interpreting Clickthrough Data As Implicit Feedback. In 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval . 154–161
Thorsten Joachims, Laura Granka, Bing Pan, Helene Hembrooke, and Geri Gay. 2005 · 2005
Earlier work this paper cites.
Direct maximization of rank-based metrics for information retrieval
Donald A Metzler, W Bruce Croft, and Andrew Mccallum. 2005 · 2005
Earlier work this paper cites.
Training linear SVMs in linear time. In 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . 217–226
Thorsten Joachims. 2006 · 2006
Earlier work this paper cites.
Learning to rank: from pairwise approach to listwise approach. In 24th International Conference on Machine Learning . 129–136
Zhe Cao, Tao Qin, Tie-Yan Liu, Ming-Feng Tsai, and Hang Li. 2007 · 2007
Earlier work this paper cites.
AdaRank: A Boosting Algorithm for Information Retrieval. In 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval . 391–398
Jun Xu and Hang Li. 2007 · 2007
Earlier work this paper cites.
SoftRank: Optimizing Non-smooth Rank Metrics. In 1st International Conference on Web Search and Web Data Mining . 77–86
Michael Taylor, John Guiver, Stephen Robertson, and Tom Minka. 2008 · 2008
Earlier work this paper cites.
Listwise Approach to Learning to Rank: Theory and Algorithm. In 25th International Conference on Machine Learning . 1192–1199
Fen Xia, Tie-Yan Liu, Jue Wang, Wensheng Zhang, and Hang Li. 2008 · 2008
Cited alongside, same era.
Expected Reciprocal Rank for Graded Relevance. In 18th ACM Conference on Information and Knowledge Management . 621–630
Olivier Chapelle, Donald Metzler, Ya Zhang, and Pierre Grinspan. 2009 · 2009
Cited alongside, same era.
Ranking Measures and Loss Functions in Learning to Rank
Wei Chen, Tie-Yan Liu, Yanyan Lan, Zhi-Ming Ma, and Hang Li. 2009 · 2009
Cited alongside, same era.
Mean reciprocal rank
Nick Craswell. 2009 · 2009
Cited alongside, same era.
From RankNet to LambdaRank to LambdaMART: An Overview
Christopher J.C. Burges. 2010 · 2010
Cited alongside, same era.
Rectified linear units improve restricted Boltzmann machines. In 27th International Conference on Machine Learning . 807–814
Tensorflow: a system for large-scale machine learning.. In 12th USENIX Symposium on Operating Systems Design and Implementation . 265–283
Martín Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, et al · 2016
Later among the works it cites.
Deep Learning
Ian Goodfellow, Yoshua Bengio, Aaron Courville, and Yoshua Bengio. 2016 · 2016
Later among the works it cites.
Learning to Rank with Selection Bias in Personal Search. In 39th International ACM SIGIR conference on Research and Development in Information Retrieval . 115–124
Xuanhui Wang, Michael Bendersky, Donald Metzler, and Marc Najork. 2016 · 2016
Later among the works it cites.
Tensorflow estimators: Managing simplicity vs. flexibility in high-level machine learning frameworks. In 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . 1763–1771
Heng-Tze Cheng, Zakaria Haque, Lichan Hong, Mustafa Ispir, Clemens Mewald, Illia Polosukhin, Georgios Roumpos, D Sculley, Jamie Smith, David Soergel, et al · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Vinod Nair and Geoffrey E Hinton. 2010 · 2010
Cited alongside, same era.
A General Approximation Framework for Direct Optimization of Information Retrieval Measures
Tao Qin, Tie-Yan Liu, and Hang Li. 2010 · 2010
Cited alongside, same era.
Beyond Position Bias: Examining Result Attractiveness As a Source of Presentation Bias in Clickthrough Data. In 19th International Conference on World Wide Web . 1011–1018
Yisong Yue, Rajan Patel, and Hein Roehrig. 2010 · 2010
Cited alongside, same era.
Adaptive subgradient methods for online learning and stochastic optimization
John Duchi, Elad Hazan, and Yoram Singer. 2011 · 2011
Cited alongside, same era.
Learning to rank for information retrieval and natural language processing
Hang Li. 2011 · 2011
Cited alongside, same era.
Representation learning: A review and new perspectives
Yoshua Bengio, Aaron Courville, and Pascal Vincent. 2013 · 2013
Cited alongside, same era.
Backpropagation: theory, architectures, and applications
Yves Chauvin and David E Rumelhart. 2013 · 2013
Cited alongside, same era.
Unbiased Learning-to-Rank with Biased Feedback. In 10th ACM International Conference on Web Search and Data Mining . 781–789
Thorsten Joachims, Adith Swaminathan, and Tobias Schnabel. 2017 · 2017
Later among the works it cites.
LightGBM: A highly efficient gradient boosting decision tree. In Advances in Neural Information Processing Systems 30 . 3146–3154
Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu. 2017 · 2017
Later among the works it cites.
Neural Models for Information Retrieval
Bhaskar Mitra and Nick Craswell. 2017 · 2017
Later among the works it cites.
TensorFlow-Serving: Flexible, high-performance ML serving
Christopher Olston, Noah Fiedel, Kiril Gorovoy, Jeremiah Harmsen, Li Lao, Fangwei Li, Vinu Rajashekhar, Sukriti Ramesh, and Jordan Soyke. 2017 · 2017
Later among the works it cites.
Automatic differentiation in PyTorch. In AutoDiff Workshop at NIPS 2017
Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer. 2017 · 2017
Later among the works it cites.
Quick Access: Building a Smart Experience for Google Drive. In 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . 1643–1651
Sandeep Tata, Alexandrin Popescul, Marc Najork, Mike Colagrosso, Julian Gibbons, Alan Green, Alexandre Mah, Michael Smith, Divanshu Garg, Cayden Meyer, et al · 2017
Later among the works it cites.
End-to-End Neural Ad-hoc Ranking with Kernel Pooling. In 40th International ACM SIGIR Conference on Research and Development in Information Retrieval . 55–64
Chenyan Xiong, Zhuyun Dai, Jamie Callan, Zhiyuan Liu, and Russell Power. 2017 · 2017
Later among the works it cites.
Situational Context for Ranking in Personal Search. In 26th International Conference on World Wide Web . 1531–1540
Hamed Zamani, Michael Bendersky, Xuanhui Wang, and Mingyang Zhang. 2017 · 2017
Later among the works it cites.
Unbiased Learning to Rank: Theory and Practice. In 2018 ACM SIGIR International Conference on Theory of Information Retrieval . 1–2
Qingyao Ai, Jiaxin Mao, Yiqun Liu, and W Bruce Croft. 2018a · 2018
Closest in time.
Learning Groupwise Scoring Functions Using Deep Neural Networks
Qingyao Ai, Xuanhui Wang, Nadav Golbandi, Michael Bendersky, and Marc Najork. 2018b · 2018
Closest in time.
Sound Analogies with Phoneme Embeddings
Miikka P Silfverberg, Lingshuang Jack Mao, and Mans Hulden. 2018 · 2018
Closest in time.