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

Sanaz Keshvari

dblp:325/2548 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0002-1403-6712ORCID · corroborated

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

Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 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%

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

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval models
ad-hoc retrieval
0.812024
A Self-Distilled Learning to Rank Model for Ad Hoc Retrieval · ACM Trans. Inf. Syst. 2024
Information retrieval › ranking
learning to rank
0.812024
A Self-Distilled Learning to Rank Model for Ad Hoc Retrieval · ACM Trans. Inf. Syst. 2024

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

knowledge distillation · 0.8confidence weighting · 0.8
YearPublicationVenuePosition
2024 A Self-Distilled Learning to Rank Model for Ad Hoc Retrieval
abstract
Learning to rank models are broadly applied in ad hoc retrieval for scoring and sorting documents based on their relevance to textual queries. The generalizability of the trained model in the learning to rank approach, however, can have an impact on the retrieval performance, particularly when data includes noise and outliers, or is incorrectly collected or measured. In this paper, we introduce a Self-Distilled Learning to Rank (SDLR) framework for ad hoc retrieval, and analyze its performance over a range of retrieval datasets and also in the presence of features’ noise. SDLR assigns a confidence weight to each training sample, aiming at reducing the impact of noisy and outlier data in the training process. The confidence weight is approximated based on the feature’s distributions derived from the values observed for the features of the documents labeled for a query in a listwise training sample. SDLR includes a distillation process that facilitates passing on the underlying patterns in assigning confidence weights from the teacher model to the student one. We empirically illustrate that SDLR outperforms state-of-the-art learning to rank models in ad hoc retrieval. We thoroughly investigate the SDLR performance in different settings including when no distillation strategy is applied; when different portion of data are used for training the teacher and the student models, and when both teacher and student models are trained over identical data. We show that SDLR is more effective when training data are split between a teacher and a student model. We also show that SDLR’s performance is robust when data features are noisy.
Sanaz Keshvari, Farzan Saeedi, Hadi Sadoghi Yazdi, Faezeh Ensan
ACM Trans. Inf. Syst.1
2022 ListMAP: Listwise learning to rank as maximum a posteriori estimation
Sanaz Keshvari, Faezeh Ensan, Hadi Sadoghi Yazdi
Inf. Process. Manag.1