Efficient gradient descent algorithm for sparse models with application in learning-to-rank-Reference-Cited by-同舟云学术

Efficient gradient descent algorithm for sparse models with application in learning-to-rank

Published:2013-09 Issue: Volume:49 Page:190-198
ISSN:0950-7051
Container-title:Knowledge-Based Systems
language:en
Short-container-title:Knowledge-Based Systems

Author:

Lai Hanjiang,Pan Yan,Tang Yong,Liu Ning

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Management Information Systems,Software

Reference30 articles.

1. Sparse learning-to-rank via an efficient primal–dual algorithm;Lai;IEEE Transactions on Computers,2013

2. Introductory Lectures on Convex Optimization;Nesterov,2004

3. A. Nemirovski, Efficient methods in convex programming, Lecture Notes, Faculty of Industrial Engineering and Management, Technion-Israel Institute of Technology, 1994.

4. Learning to rank with document ranks and scores;Pan;Knowledge-Based Systems,2011

5. Efficient algorithms for ranking with SVMs;Chapelle;Information Retrieval Journal,2010

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal Gradient Descent Algorithm for LSTM Neural Network Learning;2024 IEEE 4th International Conference on Smart Information Systems and Technologies (SIST);2024-05-15

2. A graph-based feature selection method for learning to rank using spectral clustering for redundancy minimization and biased PageRank for relevance analysis;Computer Science and Information Systems;2022

3. A review on instance ranking problems in statistical learning;Machine Learning;2021-11-18

4. Cost-Sensitive ListMLE Ranking Approach Based on Sparse Representation;J INF SCI ENG;2019

5. EGRank: An exponentiated gradient algorithm for sparse learning-to-rank;Information Sciences;2018-10