.png){kind=icon}
返回
Spectral Ranking Regression
.png){kind=icon}
PRE
AI
DOI：10.1145/3530693.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study the problem of ranking regression, in which a dataset of rankings is used to learn Plackett-Luce scores as functions of sample features. We propose a novel spectral algorithm to accelerate learning in ranking regression. Our main technical contribution is to show that the Plackett-Luce negative log-likelihood augmented with a proximal penalty has stationary points that satisfy the balance equations of a Markov Chain. This allows us to tackle the ranking regression problem via an efficient spectral algorithm by using the Alternating Directions Method of Multipliers (ADMM). ADMM separates the learning of scores and model parameters, and in turn, enables us to devise fast spectral algorithms for ranking regression via both shallow and deep neural network (DNN) models. For shallow models, our algorithms are up to 579 times faster than the Newton's method. For DNN models, we extend the standard ADMM via a Kullback-Leibler proximal penalty and show that this is still amenable to fast inference via a spectral approach. Compared to a state-of-the-art siamese network, our resulting algorithms are up to 175 times faster and attain better predictions by up to 26% Top-1 Accuracy and 6% Kendall-Tau correlation over five real-life ranking datasets.
Keyword:
Plackett-Luce
ranking
spectral methods
Markov Chain
ADMM
期刊
IF:
4.8
论文数:
1.3K
被引数:
4.4K
机构
引用论文
Correction: Empty Seeds Are Not Always Bad: Simultaneous Effect of Seed Emptiness and Masting on Animal Seed Predation勘误：空种子并非总是有害的：种子空壳与 mast seeding 对动物种子捕食的同步影响.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏A Distributed, Asynchronous, and Incremental Algorithm for Nonconvex Optimization: An ADMM Approach用于非凸优化的分布式，异步和增量算法: ADMM方法
OAAI
OAAI分享收藏Visualising basins of attraction for the cross-entropy and the squared error neural network loss functionsNEUROCOMPUTINGOAAI
NEUROCOMPUTINGIF6.5
OAAI分享收藏
查看更多内容