A hybrid ranker outperforms a typed knowledge graph for skill retrieval, because the graph's edges are generated from the same embedding neighborhood the ranker already uses, limiting the graph to the ranker's own candidate set.
Proceedings of ReNeuIR 2025: 4th Workshop on Reaching Efficiency in Neural Information Retrieval, at SIGIR 2025 , year =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.AI 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Comparative Approaches to Agent Retrieval over Large Skill Libraries
A hybrid ranker outperforms a typed knowledge graph for skill retrieval, because the graph's edges are generated from the same embedding neighborhood the ranker already uses, limiting the graph to the ranker's own candidate set.