Fetching the paper…
Reading the bibliography…
Learning to Rank (LTR) algorithms are usually evaluated using Information Retrieval metrics like Normalised Discounted Cumulative Gain (NDCG) or Mean Average Precision.
Robbins, H., Monro, S.: A stochastic approximation method. Annals of Mathematical Statistics 22
1951
Earlier work this paper cites.
Sinkhorn, R.: A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann. Math. Statist. 35
1964
Earlier work this paper cites.
Rumelhart, D.E., Hinton, G.E., Williams, R.J.: Learning internal representations by error propagation. Tech. rep., California Univ San Diego La Jolla Inst for Cognitive Science (1985)
1985
Earlier work this paper cites.
Baeza-Yates, R.A., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA (1999)
1999
Earlier work this paper cites.
Friedman, J.H.: Greedy function approximation: A gradient boosting machine. Annals of Statistics 29
2000
Earlier work this paper cites.
Järvelin, K., Kekäläinen, J.: Cumulated gain-based evaluation of ir techniques. ACM Trans. Inf. Syst. 20
2002
Earlier work this paper cites.
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., Hullender, G.: Learning to rank using gradient descent. In: Proceedings of the 22Nd International Conference on Machine Learning. pp. 89–96. ICML ’05, ACM, New York, NY, USA (2005). https://doi.org/10.1145/1102351.1102363, http://doi.acm.org/10.1145/1102351.1102363
2005
Earlier work this paper cites.
Burges, C.J., Ragno, R., Le, Q.V.: Learning to rank with nonsmooth cost functions. In: Schölkopf, B., Platt, J.C., Hoffman, T. (eds.) Advances in Neural Information Processing Systems 19, pp. 193–200. MIT Press (2007), http://papers.nips.cc/paper/2971-learning-to-rank-with-nonsmooth-cost-functions.pdf
2007
Earlier work this paper cites.
Cao, Z., Qin, T., Liu, T.Y., Tsai, M.F., Li, H.: Learning to rank: From pairwise approach to listwise approach. In: Proceedings of the 24th International Conference on Machine Learning. pp. 129–136. ICML ’07, ACM, New York, NY, USA (2007). https://doi.org/10.1145/1273496.1273513, http://doi.acm.org/10.1145/1273496.1273513
2007
Earlier work this paper cites.
Xu, J., Li, H.: Adarank: a boosting algorithm for information retrieval. In: Proceedings of the 30th annual ACM SIGIR conference. pp. 391–398. ACM, Amsterdam, The Netherlands (2007). https://doi.org/10.1145/1277741.1277809
2007
Earlier work this paper cites.
Yue, Y., Finley, T., Radlinski, F., Joachims, T.: A support vector method for optimizing average precision. In: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. p. 271–278. SIGIR ’07, Association for Computing Machinery, New York, NY, USA (2007). https://doi.org/10.1145/1277741.1277790, https://doi.org/10.1145/1277741.1277790
2007
Earlier work this paper cites.
Chakrabarti, S., Khanna, R., Sawant, U., Bhattacharyya, C.: Structured learning for non-smooth ranking losses. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. p. 88–96. KDD ’08, Association for Computing Machinery, New York, NY, USA (2008). https://doi.org/10.1145/1401890.1401906, https://doi.org/10.1145/1401890.1401906
2008
Cited alongside, same era.
Taylor, M., Guiver, J., Robertson, S., Minka, T.: Softrank: optimizing non-smooth rank metrics. pp. 77–86 (01 2008). https://doi.org/10.1145/1341531.1341544
2008
Cited alongside, same era.
Xia, F., Liu, T.Y., Wang, J., Zhang, W., Li, H.: Listwise approach to learning to rank: Theory and algorithm. In: Proceedings of the 25th International Conference on Machine Learning. pp. 1192–1199. ICML ’08, ACM, New York, NY, USA (2008). https://doi.org/10.1145/1390156.1390306, http://doi.acm.org/10.1145/1390156.1390306
2008
Cited alongside, same era.
Liu, T.Y.: Learning to rank for information retrieval. Found. Trends Inf. Retr. 3
Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q., Liu, T.Y.: Lightgbm: A highly efficient gradient boosting decision tree. In: Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R. (eds.) Advances in Neural Information Processing Systems 30, pp. 3146–3154. Curran Associates, Inc. (2017), http://papers.nips.cc/paper/6907-lightgbm-a-highly-efficient-gradient-boosting-decision-tree.pdf
2017
Later among the works it cites.
Paszke, A., Gross, S., Chintala, S., Chanan, G., Yang, E., DeVito, Z., Lin, Z., Desmaison, A., Antiga, L., Lerer, A.: Automatic differentiation in PyTorch. In: NIPS Autodiff Workshop (2017)
2017
Later among the works it cites.
Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L.u., Polosukhin, I.: Attention is all you need. In: Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R. (eds.) Advances in Neural Information Processing Systems 30, pp. 5998–6008. Curran Associates, Inc. (2017), http://papers.nips.cc/paper/7181-attention-is-all-you-need.pdf
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…
2009
Cited alongside, same era.
Burges, C.J.C.: From RankNet to LambdaRank to LambdaMART: An overview. Tech. rep., Microsoft Research (2010), http://research.microsoft.com/en-us/um/people/cburges/tech_reports/MSR-TR-2010-82.pdf
2010
Cited alongside, same era.
Qin, T., Liu, T.Y., Li, H.: A general approximation framework for direct optimization of information retrieval measures. Inf. Retr. 13
2010
Cited alongside, same era.
Qin, T., Liu, T.M.: Introducing letor 4.0 datasets. ArXiv abs/1306.2597
2013
Cited alongside, same era.
2015
Cited alongside, same era.
Chen, T., Guestrin, C.: Xgboost: A scalable tree boosting system. In: Proceedings of the 22Nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. pp. 785–794. KDD ’16, ACM, New York, NY, USA (2016). https://doi.org/10.1145/2939672.2939785, http://doi.acm.org/10.1145/2939672.2939785
2016
Cited alongside, same era.
Dato, D., Lucchese, C., Nardini, F.M., Orlando, S., Perego, R., Tonellotto, N., Venturini, R.: Fast ranking with additive ensembles of oblivious and non-oblivious regression trees. ACM Trans. Inf. Syst. 35
2016
Cited alongside, same era.
Bruch, S.: An alternative cross entropy loss for learning-to-rank (2019)
2019
Later among the works it cites.
Bruch, S., Wang, X., Bendersky, M., Najork, M.: An analysis of the softmax cross entropy loss for learning-to-rank with binary relevance. In: Proceedings of the 2019 ACM SIGIR International Conference on Theory of Information Retrieval. p. 75–78. ICTIR ’19, Association for Computing Machinery, New York, NY, USA (2019). https://doi.org/10.1145/3341981.3344221, https://doi.org/10.1145/3341981.3344221
2019
Later among the works it cites.
Bruch, S., Zoghi, M., Bendersky, M., Najork, M.: Revisiting approximate metric optimization in the age of deep neural networks. In: Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval. p. 1241–1244. SIGIR’19, Association for Computing Machinery, New York, NY, USA (2019). https://doi.org/10.1145/3331184.3331347, https://doi.org/10.1145/3331184.3331347
2019
Later among the works it cites.
Cuturi, M., Teboul, O., Vert, J.P.: Differentiable ranking and sorting using optimal transport. In: Wallach, H., Larochelle, H., Beygelzimer, A., d Alche-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems 32, pp. 6858–6868. Curran Associates, Inc. (2019), http://papers.nips.cc/paper/8910-differentiable-ranking-and-sorting-using-optimal-transport.pdf
2019
Later among the works it cites.
Engilberge, M., Chevallier, L., Perez, P., Cord, M.: Sodeep: A sorting deep net to learn ranking loss surrogates. In: The IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (June 2019)
2019
Later among the works it cites.
Grover, A., Wang, E., Zweig, A., Ermon, S.: Stochastic optimization of sorting networks via continuous relaxations. In: International Conference on Learning Representations (2019), https://openreview.net/forum?id=H1eSS3CcKX
2019
Later among the works it cites.
Pobrotyn, P., Bartczak, T., Synowiec, Mikołaj an Białobrzeski, R., Bojar, J.: Context-aware learning to rank with self-attention. In: SIGIR eCom ’20. Virtual Event, China. (2020)
2020
Later among the works it cites.