Metraipolis › archive › dc_b19b930ba87b
Semantic Candidate-Job Matching: A Comparative Evaluation of Dense Embedding Models in Hybrid Retrieval — arXiv:2609.23307
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.23307
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T21:58:47.494Z
- SHA-256 of the archived text
1700afd12b2961ce3c4cfd4c41b37fa582ca3756d1987bf3a6c73b082c27e932- Stable URL of this page
https://metraipolis.com/documento/dc_b19b930ba87b
How to cite
Semantic Candidate-Job Matching: A Comparative Evaluation of Dense Embedding Models in Hybrid Retrieval — arXiv:2609.23307 — arXiv (en), https://arxiv.org/abs/2609.23307 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b19b930ba87b (Metraipolis archive dc_b19b930ba87b, sha256 1700afd12b2961ce3c4cfd4c41b37fa582ca3756d1987bf3a6c73b082c27e932)
BibTeX
@misc{dcb19b930ba87b,
title = {Semantic Candidate-Job Matching: A Comparative Evaluation of Dense Embedding Models in Hybrid Retrieval — arXiv:2609.23307},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.23307},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b19b930ba87b; sha256 1700afd12b2961ce3c4cfd4c41b37fa582ca3756d1987bf3a6c73b082c27e932},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23307. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper presents a comparative evaluation of dense embedding models for semantic candidate-job matching in high-volume staffing workflows. Incoming job descriptions are converted into structured English search text and language-specific keywords through LLM-based parsing, and candidate profiles are indexed as semantically enriched resume representations. We evaluate EmbeddingGemma (base) against EmbeddingGemma fine-tuned with Cached Multiple Negatives Ranking Loss (MNRL) within a unified hybrid retrieval pipeline that fuses vector similarity and full-text relevance via reciprocal rank fusion (RRF), and benchmark both against the MPNet model on a batch comparative evaluation dataset scored through the deployed job-candidate matching scoring pipeline. We further document, with mathematical detail, the broader set of contrastive fine-tuning objectives considered during model development (including AnglE/CoSENT-style refinement) and the empirical rationale for retaining Cached-MNRL-only adaptation as the preferred configuration. To support reproducible model selection, we define a broader evaluation framework comprising standard information retrieval metrics (Recall@K, mean reciprocal rank, nDCG) under the exact hybrid-retrieval protocol; the metrics used for the evaluation reported in this paper are fine-tuning convergence diagnostics and a batch comparative evaluation using the deployed AI-Match score and an independent LLM-as-a-Judge relevance score, and we state this scope explicitly rather than implying the full framework was measured. The paper addresses the gap between general-purpose embedding benchmarks and enterprise job-candidate matching constraints, providing a structured basis for comparing embedding strategies under realistic job-candidate retrieval conditions. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-22 in cs.IR). Categorie arXiv: Information Retrieval (cs.IR) ; Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2609.23307 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T21:45:02.212Z dalla pagina https://arxiv.org/catchup/cs.IR/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).