Toward a traceable, explainable, and fairJD/Resume recommendation system

• URL: http://arxiv.org/abs/2202.08960v1
• Date: Wed, 2 Feb 2022 18:17:05 GMT
• Title: Toward a traceable, explainable, and fairJD/Resume recommendation system
• Authors: Amine Barrak, Bram Adams and Amal Zouaq
• Abstract summary: Development of an automatic recruitment system is still one of the main challenges. Our aim is to explore how modern language models can be combined with knowledge bases and datasets to enhance the JD/Resume matching process.
• Score: 10.820022470618234
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the last few decades, companies are interested to adopt an online automated recruitment process in an international recruitment environment. The problem is that the recruitment of employees through the manual procedure is a time and money consuming process. As a result, processing a significant number of applications through conventional methods can lead to the recruitment of clumsy individuals. Different JD/Resume matching model architectures have been proposed and reveal a high accuracy level in selecting relevant candidatesfor the required job positions. However, the development of an automatic recruitment system is still one of the main challenges. The reason is that the development of a fully automated recruitment system is a difficult task and poses different challenges. For example, providing a detailed matching explanation for the targeted stakeholders is needed to ensure a transparent recommendation. There are several knowledge bases that represent skills and competencies (e.g, ESCO, O*NET) that are used to identify the candidate and the required job skills for a matching purpose. Besides, modernpre-trained language models are fine-tuned for this context such as identifying lines where a specific feature was introduced. Typically, pre-trained language models use transfer-based machine learning models to be fine-tuned for a specific field. In this proposal, our aim is to explore how modern language models (based on transformers) can be combined with knowledge bases and ontologies to enhance the JD/Resume matching process. Our system aims at using knowledge bases and features to support the explainability of the JD/Resume matching. Finally, given that multiple software components, datasets, ontology, andmachine learning models will be explored, we aim at proposing a fair, ex-plainable, and traceable architecture for a Resume/JD matching purpose.

Related papers

• Can Long-Context Language Models Subsume Retrieval, RAG, SQL, and More? [54.667202878390526]
  Long-context language models (LCLMs) have the potential to revolutionize our approach to tasks traditionally reliant on external tools like retrieval systems or databases. We introduce LOFT, a benchmark of real-world tasks requiring context up to millions of tokens designed to evaluate LCLMs' performance on in-context retrieval and reasoning. Our findings reveal LCLMs' surprising ability to rival state-of-the-art retrieval and RAG systems, despite never having been explicitly trained for these tasks.
  arXiv  Detail & Related papers  (2024-06-19T00:28:58Z)
• Learning to Retrieve for Job Matching [22.007634436648427]
  We discuss applying learning-to-retrieve technology to enhance LinkedIns job search and recommendation systems. We leverage confirmed hire data to construct a graph that evaluates a seeker's qualification for a job, and utilize learned links for retrieval. In addition to a solution based on a conventional inverted index, we developed an on-GPU solution capable of supporting both KNN and term matching efficiently.
  arXiv  Detail & Related papers  (2024-02-21T00:05:25Z)
• Generative Judge for Evaluating Alignment [84.09815387884753]
  We propose a generative judge with 13B parameters, Auto-J, designed to address these challenges. Our model is trained on user queries and LLM-generated responses under massive real-world scenarios. Experimentally, Auto-J outperforms a series of strong competitors, including both open-source and closed-source models.
  arXiv  Detail & Related papers  (2023-10-09T07:27:15Z)
• Exploring Large Language Model for Graph Data Understanding in Online Job Recommendations [63.19448893196642]
  We present a novel framework that harnesses the rich contextual information and semantic representations provided by large language models to analyze behavior graphs. By leveraging this capability, our framework enables personalized and accurate job recommendations for individual users.
  arXiv  Detail & Related papers  (2023-07-10T11:29:41Z)
• BAD: BiAs Detection for Large Language Models in the context of candidate screening [6.47452771256903]
  This project aims to quantify the instances of social bias in ChatGPT and other OpenAI LLMs in the context of candidate screening. We will show how the use of these models could perpetuate existing biases and inequalities in the hiring process.
  arXiv  Detail & Related papers  (2023-05-17T17:47:31Z)
• Human-Centric Multimodal Machine Learning: Recent Advances and Testbed on AI-based Recruitment [66.91538273487379]
  There is a certain consensus about the need to develop AI applications with a Human-Centric approach. Human-Centric Machine Learning needs to be developed based on four main requirements: (i) utility and social good; (ii) privacy and data ownership; (iii) transparency and accountability; and (iv) fairness in AI-driven decision-making processes. We study how current multimodal algorithms based on heterogeneous sources of information are affected by sensitive elements and inner biases in the data.
  arXiv  Detail & Related papers  (2023-02-13T16:44:44Z)
• Neural model robustness for skill routing in large-scale conversational AI systems: A design choice exploration [34.29393761770914]
  We show how different modeling design choices impact the model robustness in the context of skill routing on a state-of-the-art commercial conversational AI system. We show that applying data augmentation can be a very effective and practical way to drastically improve model robustness.
  arXiv  Detail & Related papers  (2021-03-04T22:54:33Z)
• Decentralized Federated Learning Preserves Model and Data Privacy [77.454688257702]
  We propose a fully decentralized approach, which allows to share knowledge between trained models. Students are trained on the output of their teachers via synthetically generated input data. The results show that an untrained student model, trained on the teachers output reaches comparable F1-scores as the teacher.
  arXiv  Detail & Related papers  (2021-02-01T14:38:54Z)
• Efficient Neural Query Auto Completion [17.58784759652327]
  Three major challenges are observed for a query auto completion system. Traditional QAC systems rely on handcrafted features such as the query candidate frequency in search logs. We propose an efficient neural QAC system with effective context modeling to overcome these challenges.
  arXiv  Detail & Related papers  (2020-08-06T21:28:36Z)
• Analysis & Shortcomings of E-Recruitment Systems: Towards a Semantics-based Approach Addressing Knowledge Incompleteness and Limited Domain Coverage [0.0]
  The rapid development of the Internet has led to introducing new methods for e-recruitment and human resources management. The skill gap, i.e. the propensity to precisely detect and extract relevant skills in applicant resumes and job posts, still form a major obstacle for e-recruitment systems. An e-recruitment framework addressing current shortcomings through the use of multiple cooperative semantic resources is detailed.
  arXiv  Detail & Related papers  (2020-04-25T01:25:35Z)
• A System for Real-Time Interactive Analysis of Deep Learning Training [66.06880335222529]
  Currently available systems are limited to monitoring only the logged data that must be specified before the training process starts. We present a new system that enables users to perform interactive queries on live processes generating real-time information.
  arXiv  Detail & Related papers  (2020-01-05T11:33:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.