Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Cailan Jiang

dblp:407/9578 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › ranking
learning to rank
0.912025
NeuralLoss: A Learnable Pretrained Surrogate Loss for Learning to Rank · IEEE Trans. Knowl. Data Eng. 2025
Information retrieval › ranking
ranking optimization
0.912025
NeuralLoss: A Learnable Pretrained Surrogate Loss for Learning to Rank · IEEE Trans. Knowl. Data Eng. 2025
Information retrieval
surrogate loss
0.912025
NeuralLoss: A Learnable Pretrained Surrogate Loss for Learning to Rank · IEEE Trans. Knowl. Data Eng. 2025
Machine learning › Deep learning architectures and training
transformer
0.312025
NeuralLoss: A Learnable Pretrained Surrogate Loss for Learning to Rank · IEEE Trans. Knowl. Data Eng. 2025

Methods — techniques the papers use, named apart from their topics

transformer · 1.7permutation invariance · 1.7gradient descent · 1.7
YearPublicationVenuePosition
2025 NeuralLoss: A Learnable Pretrained Surrogate Loss for Learning to Rank
abstract
Learning to Rank (LTR) aims to develop a ranking model from supervised data to rank a set of items using machine learning techniques. However, since the losses and ranking metrics involved in LTR are both based on ranking, they are neither continuous nor differentiable, making it challenging to optimize them using gradient descent algorithms. Various surrogate losses have been proposed to address this issue, yet their connection with ranking metrics is often loose, leading to inconsistencies between optimization objectives and evaluation metrics. In this study, we introduce NeuralLoss, a learnable and pretrained surrogate loss. By undergoing training on data structured around ranking metrics, NeuralLoss approximates these ranking metrics, aligning its optimization objectives with evaluation metrics. We employ Transformer to construct the surrogate model and ensure permutation invariance. The pretrained surrogate loss facilitates end-to-end training of ranking models using gradient descent algorithms and can approximate various ranking metrics by adjusting the training data. In this paper, we employ NeuralLoss to approximate NDCG and Recall, demonstrating its performance in both document retrieval and cross-modal retrieval tasks. Experimental results indicate that our approach achieves excellent performance and exhibits strong competitiveness across these tasks.
Chen Liu 0038, Cailan Jiang
IEEE Trans. Knowl. Data Eng.2