文献详情
Modeling the Parameter Interactions in Ranking SVM with Low-Rank Approximation
文献类型：期刊
通讯作者：Xu, J (reprint author), Renmin Univ China, Sch Informat, Beijing Key Lab Big Data Management & Anal Method, Beijing, Peoples R China.
期刊名称：IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING影响因子和分区
年：2019
卷：31
期：6
页码：1181-1193
ISSN：1041-4347
关键词：Learning to rank; ranking SVM; parameter interactions; low-rank approximation
所属部门：信息学院
摘要：Ranking SVM, which formalizes the problem of learning a ranking model as that of learning a binary SVM on preference pairs of documents, is a state-of-the-art ranking model in information retrieval. The dual form solution of a linear Ranking SVM model can be written as a linear combination of the preference pairs, i.e., w = Sigma((i,j)) alpha(ij) (x(i) - x(j)), where alpha(ij) denotes the Lagrange parameters associated with each preference pair (i, j). It is observed that there exist obvious int ...More
Ranking SVM, which formalizes the problem of learning a ranking model as that of learning a binary SVM on preference pairs of documents, is a state-of-the-art ranking model in information retrieval. The dual form solution of a linear Ranking SVM model can be written as a linear combination of the preference pairs, i.e., w = Sigma((i,j)) alpha(ij) (x(i) - x(j)), where alpha(ij) denotes the Lagrange parameters associated with each preference pair (i, j). It is observed that there exist obvious interactions among the document pairs because two preference pairs could share a same document as their items, e.g., preference pairs (d(1), d(2)) and (d(1), d(3)) share the document d(1). Thus it is natural to ask if there also exist interactions over the model parameters alpha(ij), which may be leveraged to construct better ranking models. This paper aims to answer the question. We empirically found that there exists a low-rank structure over the rearranged Ranking SVM model parameters alpha(ij), which indicates that the interactions do exist. Based on the discovery, we made modifications on the original Ranking SVM model by explicitly applying low-rank constraints to the Lagrange parameters, achieving two novel algorithms called Factorized Ranking SVM and Regularized Ranking SVM, respectively. Specifically, in Factorized Ranking SVM each parameter alpha(ij) is decomposed as a product of two low-dimensional vectors, i.e., alpha(ij) = < v(i), v(j)>, where vectors v(i) and v(j) correspond to document i and j, respectively; In Regularized Ranking SVM, a nuclear norm is applied to the rearranged parameters matrix for controlling its rank. Experimental results on three LETOR datasets show that both of the proposed methods can outperform state-of-the-art learning to rank models including the conventional Ranking SVM. ...Hide

DOI：10.1109/TKDE.2018.2851257
百度学术：Modeling the Parameter Interactions in Ranking SVM with Low-Rank Approximation
语言：外文
被引频次：1
基金：National Natural Science Foundation of China (NSFC)National Natural Science Foundation of China [61872338, 61773362, 61425016, 61472401, 61722211]; Youth Innovation Promotion Association CAS [20144310, 2016102]
作者其他论文



Multivariate Time Series Imputation with Generative Adversarial Networks.Luo, Yonghong, Cai, Xiangrui, Zhang, Ying, et al. .ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018). 2018, 31.
PSGAN: A Minimax Game for Personalized Search with Limited and Noisy Click Data.Lu, Shuqi, Dou, Zhicheng, Xu, Jun, et al. .PROCEEDINGS OF THE 42ND INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '19). 2019, 555-564.
Name Entity Recognition with Policy-Value Networks.Lao, Yadi, Xu, Jun, Gao, Sheng, et al. .PROCEEDINGS OF THE 42ND INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '19). 2019, 1245-1248.
Teaching Machines to Extract Main Content for Machine Reading Comprehension.Li, Zhaohui, Feng, Yue, Xu, Jun, et al. .THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE. 2019, 9973-9974.
Deep Learning for Matching in Search and Recommendation.Xu, Jun, He, Xiangnan, Li, Hang,.PROCEEDINGS OF THE TWELFTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM'19). 2019, 832-833.