Quantifying Algorithmic Friction in Automated Resume Screening Systems

• URL: http://arxiv.org/abs/2602.04087v1
• Date: Tue, 03 Feb 2026 23:49:03 GMT
• Title: Quantifying Algorithmic Friction in Automated Resume Screening Systems
• Authors: Ibrahim Denis Fofanah,
• Abstract summary: Keywords-based resume screening exhibits high levels of algorithmic friction.<n>Semantic representations substantially reduce false negative rejection without compromising precision.<n>This study provides an empirical basis for evaluating how recruitment system design affects matching efficiency in modern labor markets.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Automated resume screening systems are now a central part of hiring at scale, yet there is growing evidence that rigid screening logic can exclude qualified candidates before human review. In prior work, we introduced the concept of Artificial Frictional Unemployment to describe labor market inefficiencies arising from automated recruitment systems. This paper extends that framework by focusing on measurement. We present a method for quantifying algorithmic friction in resume screening pipelines by modeling screening as a classification task and defining friction as excess false negative rejection caused by semantic misinterpretation. Using controlled simulations, we compare deterministic keyword-based screening with vector-space semantic matching under identical qualification conditions. The results show that keyword-based screening exhibits high levels of algorithmic friction, while semantic representations substantially reduce false negative rejection without compromising precision. By treating algorithmic friction as a system-level property, this study provides an empirical basis for evaluating how recruitment system design affects matching efficiency in modern labor markets.

Related papers

• The Algorithmic Barrier: Quantifying Artificial Frictional Unemployment in Automated Recruitment Systems [0.0]
  The U.S. labor market exhibits a persistent coexistence of high job vacancy rates and prolonged unemployment duration.<n>This paper argues that a non-trivial portion of contemporary frictional unemployment is artificially induced by automated recruitment systems.
  arXiv  Detail & Related papers  (2026-01-20T23:08:06Z)
• Accelerate Speculative Decoding with Sparse Computation in Verification [49.74839681322316]
  Speculative decoding accelerates autoregressive language model inference by verifying multiple draft tokens in parallel.<n>Existing sparsification methods are designed primarily for standard token-by-token autoregressive decoding.<n>We propose a sparse verification framework that jointly sparsifies attention, FFN, and MoE components during the verification stage to reduce the dominant computation cost.
  arXiv  Detail & Related papers  (2025-12-26T07:53:41Z)
• A Hybrid Framework for Statistical Feature Selection and Image-Based Noise-Defect Detection [55.2480439325792]
  This paper presents a hybrid framework that integrates both statistical feature selection and classification techniques to improve defect detection accuracy.<n>We present around 55 distinguished features that are extracted from industrial images, which are then analyzed using statistical methods.<n>By integrating these methods with flexible machine learning applications, the proposed framework improves detection accuracy and reduces false positives and misclassifications.
  arXiv  Detail & Related papers  (2024-12-11T22:12:21Z)
• Bisimulation Learning [55.859538562698496]
  We compute finite bisimulations of state transition systems with large, possibly infinite state space. Our technique yields faster verification results than alternative state-of-the-art tools in practice.
  arXiv  Detail & Related papers  (2024-05-24T17:11:27Z)
• Noisy Correspondence Learning with Self-Reinforcing Errors Mitigation [63.180725016463974]
  Cross-modal retrieval relies on well-matched large-scale datasets that are laborious in practice. We introduce a novel noisy correspondence learning framework, namely textbfSelf-textbfReinforcing textbfErrors textbfMitigation (SREM)
  arXiv  Detail & Related papers  (2023-12-27T09:03:43Z)
• ReAct: Temporal Action Detection with Relational Queries [84.76646044604055]
  This work aims at advancing temporal action detection (TAD) using an encoder-decoder framework with action queries. We first propose a relational attention mechanism in the decoder, which guides the attention among queries based on their relations. Lastly, we propose to predict the localization quality of each action query at inference in order to distinguish high-quality queries.
  arXiv  Detail & Related papers  (2022-07-14T17:46:37Z)
• Large-Scale Sequential Learning for Recommender and Engineering Systems [91.3755431537592]
  In this thesis, we focus on the design of an automatic algorithms that provide personalized ranking by adapting to the current conditions. For the former, we propose novel algorithm called SAROS that take into account both kinds of feedback for learning over the sequence of interactions. The proposed idea of taking into account the neighbour lines shows statistically significant results in comparison with the initial approach for faults detection in power grid.
  arXiv  Detail & Related papers  (2022-05-13T21:09:41Z)
• Classification with abstention but without disparities [5.025654873456756]
  We build a general purpose classification algorithm, which is able to abstain from prediction, while avoiding disparate impact. We establish finite sample risk, fairness, and abstention guarantees for the proposed algorithm. Our method empirically shows that moderate abstention rates allow to bypass the risk-fairness trade-off.
  arXiv  Detail & Related papers  (2021-02-24T12:43:55Z)
• Prune Responsibly [0.913755431537592]
  Irrespective of the specific definition of fairness in a machine learning application, pruning the underlying model affects it. We investigate and document the emergence and exacerbation of undesirable per-class performance imbalances, across tasks and architectures, for almost one million categories considered across over 100K image classification models that undergo a pruning process. We demonstrate the need for transparent reporting, inclusive of bias, fairness, and inclusion metrics, in real-life engineering decision-making around neural network pruning.
  arXiv  Detail & Related papers  (2020-09-10T04:43:11Z)
• Neuromorphic Event-Based Slip Detection and suppression in Robotic Grasping and Manipulation [1.0674604700001966]
  A novel vision-based finger system for slip detection and suppression is proposed. A threshold method is devised to autonomously sample noise in real-time to improve slip detection. A fuzzy based suppression strategy using incipient slip feedback is proposed for regulating the grip force.
  arXiv  Detail & Related papers  (2020-04-15T23:12:30Z)

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.