Continuation Methods and Curriculum Learning for Learning to Rank

In this paper we explore the use of Continuation Methods and Curriculum Learning techniques in the area of Learning to Rank. The basic idea is to design the training process as a learning path across increasingly complex training instances and objective functions. We propose to instantiate continuation methods in Learning to Rank by changing the IR measure to optimize during training, and we present two different curriculum learning strategies to identify easy training examples. Experimental results show that simple continuation methods are more promising than curriculum learning ones since they allow for slightly improving the performance of state-of-the-art λ-MART models and provide a faster convergence speed.

[1]  Gregory N. Hullender,et al.  Learning to rank using gradient descent , 2005, ICML.

[2]  Ryozo Nagamune A robust solver using a continuation method for Nevanlinna-Pick interpolation with degree constraint , 2003, IEEE Trans. Autom. Control..

[3]  Bintong Chen,et al.  A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen-Mangasarian Smoothing Functions , 1999, SIAM J. Optim..

[4]  Alexander Zien,et al.  A continuation method for semi-supervised SVMs , 2006, ICML.

[5]  E. Allgower,et al.  Numerical Continuation Methods , 1990 .

[6]  Tie-Yan Liu,et al.  Learning to Rank for Information Retrieval , 2011 .

[7]  B. Berne,et al.  The calculation of transport properties in quantum liquids using the maximum entropy numerical analytic continuation method: Application to liquid para-hydrogen , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Thomas F. Coleman,et al.  Parallel continuation-based global optimization for molecular conformation and protein folding , 1994, J. Glob. Optim..

[9]  Xinlei Chen,et al.  Webly Supervised Learning of Convolutional Networks , 2015, 2015 IEEE International Conference on Computer Vision (ICCV).

[10]  Tao Qin,et al.  Introducing LETOR 4.0 Datasets , 2013, ArXiv.

[11]  Stephen E. Robertson,et al.  SoftRank: optimizing non-smooth rank metrics , 2008, WSDM '08.

[12]  Jason Weston,et al.  Curriculum learning , 2009, ICML '09.

[13]  Jiawei Han,et al.  Curriculum Learning for Heterogeneous Star Network Embedding via Deep Reinforcement Learning , 2018, WSDM.

[14]  Eugene L. Allgower,et al.  Numerical continuation methods - an introduction , 1990, Springer series in computational mathematics.

[15]  Jorge J. Moré,et al.  Global Continuation for Distance Geometry Problems , 1995, SIAM J. Optim..