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

Siqing Huo

dblp:350/0510 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0008-8043-0903ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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
Language models and text generation · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › evaluation
query performance prediction
1.012026
Optimal Re-Ranking Depth · SIGIR 2026
Information retrieval
ranking
1.012026
Optimal Re-Ranking Depth · SIGIR 2026
Information retrieval
reranking
1.012026
Optimal Re-Ranking Depth · SIGIR 2026
Information retrieval
retrieval evaluation
1.012026
Optimal Re-Ranking Depth · SIGIR 2026
Natural language and speech › Language models and text generation
large language model evaluation
0.812024
Assessing and Verifying Task Utility in LLM-Powered Applications · EMNLP 2024
Natural language and speech › Language models and text generation › large language model
large language model applications
0.212024
Assessing and Verifying Task Utility in LLM-Powered Applications · EMNLP 2024

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

LLM-based relevance judgments · 1.0task utility verification · 0.8
YearPublicationVenuePosition
2026 Optimal Re-Ranking Depth
abstract
Second-stage neural rankers are commonly applied with a fixed re-ranking depth, assuming that retrieval effectiveness saturates as depth increases. Prior research has questioned the assumption that increasing the re-ranking depth yields linear performance gains, further suggesting that optimal re-ranking depth varies considerably from query to query. In the past, studying such phenomena was methodologically difficult given the scale of manual annotation required. With the advent of LLM-based relevance judgments we can now more easily undertake such studies, in this case to pinpoint the optimal re-ranking depth on a per-query basis. Using dense LLM-based relevance judgments over a typical re-ranking pipeline, we show that many queries exhibit a well-defined optimal re-ranking depth, beyond which effectiveness stagnates or degrades. We formulate re-ranking depth as a query-specific property and study whether it can be predicted a priori from first-stage retrieval characteristics. Through a large-scale analysis, we find that most standard query performance prediction (QPP) methods are ineffective for this task. In contrast, a predictor derived from LLM-assessed first-stage ranking quality, which we term IR-DCG@10, can reduce the average re-ranking depth by up to a factor of 3 while preserving overall effectiveness, depending on the specific first- and second-stage rankers used. Under oracle selection of optimal depths, we further show that retrieval effectiveness can improve by more than 7% while reducing the average re-ranking depth by a factor of 5 on the MSMARCO DEV collection. Given our promising preliminary findings, we would encourage the use of automatic judgments to facilitate research otherwise infeasible under manual annotation. Towards this point, we release relevance judgments, our codebase, and experimental artefacts to support reproducibility and further research.
Siqing Huo, Andrew Parry, Debasis Ganguly, Charles L. A. Clarke
SIGIR1
2024 Assessing and Verifying Task Utility in LLM-Powered Applications
abstract
Negar Arabzadeh, Siqing Huo, Nikhil Mehta, Qingyun Wu, Chi Wang, Ahmed Hassan Awadallah, Charles L. A. Clarke, Julia Kiseleva. Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. 2024.
Negar Arabzadeh, Siqing Huo, Nikhil Mehta 0003, Qingyun Wu, Chi Wang 0001, Ahmed Awadallah 0001, Charles L. A. Clarke, Julia Kiseleva
EMNLP2