用偏好优化提升招聘匹配模型的文本理解能力
RankPO: Preference Optimization for Job-Talent Matching
- 分两阶段训练:先基于规则数据对比学习,再用新方法优化偏好
- 改进后模型在文本理解上得分提升至0.78,规则任务仍保持0.706
- 适合需要精准理解简历与职位匹配的招聘系统研发者
将职位描述(JD)与候选人简历匹配,需模型不仅理解文本相似性,还需考虑地理位置、学术资历等上下文因素。为此,我们提出一种大语言模型的两阶段训练框架。第一阶段采用对比学习,在基于真实匹配规则(如地理位置一致、研究领域重叠)构建的数据集上训练模型。该模型虽在规则数据上表现良好(nDCG@20 = 0.706),但对文本理解能力弱(与AI标注对齐度为0.46)。第二阶段引入受直接偏好优化(DPO)启发的新型偏好微调方法——RankPO,强化模型对文本语义的理解。实验表明,经RankPO微调后,模型在保留原有任务性能的同时,显著提升与人工标注偏好的一致性,对齐度达0.78。代码与数据已开源。
原文摘要 · Abstract (English)
Matching job descriptions (JDs) with suitable talent requires models capable of understanding not only textual similarities between JDs and candidate resumes but also contextual factors such as geographical location and academic seniority. To address this challenge, we propose a two-stage training framework for large language models (LLMs). In the first stage, a contrastive learning approach is used to train the model on a dataset constructed from real-world matching rules, such as geographical alignment and research area overlap. While effective, this model primarily learns patterns that defined by the matching rules. In the second stage, we introduce a novel preference-based fine-tuning method inspired by Direct Preference Optimization (DPO), termed Rank Preference Optimization (RankPO), to align the model with AI-curated pairwise preferences emphasizing textual understanding. Our experiments show that while the first-stage model achieves strong performance on rule-based data (nDCG@20 = 0.706), it lacks robust textual understanding (alignment with AI annotations = 0.46). By fine-tuning with RankPO, we achieve a balanced model that retains relatively good performance in the original tasks while significantly improving the alignment with AI preferences. The code and data are available at https://github.com/yflyzhang/RankPO.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。