The Initial Screening Order Problem

• URL: http://arxiv.org/abs/2307.15398v5
• Date: Thu, 02 Jan 2025 10:02:36 GMT
• Title: The Initial Screening Order Problem
• Authors: Jose M. Alvarez, Antonio Mastropietro, Salvatore Ruggieri,
• Abstract summary: We investigate the role of the initial screening order (ISO) in candidate screening.<n>The ISO refers to the order in which the screener searches the candidate pool when selecting $k$ candidates.
• Score: 20.105850916041952
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We investigate the role of the initial screening order (ISO) in candidate screening. The ISO refers to the order in which the screener searches the candidate pool when selecting $k$ candidates. Today, it is common for the ISO to be the product of an information access system, such as an online platform or a database query. The ISO has been largely overlooked in the literature, despite its impact on the optimality and fairness of the selected $k$ candidates, especially under a human screener. We define two problem formulations describing the search behavior of the screener given an ISO: the best-$k$, where it selects the top $k$ candidates; and the good-$k$, where it selects the first good-enough $k$ candidates. To study the impact of the ISO, we introduce a human-like screener and compare it to its algorithmic counterpart, where the human-like screener is conceived to be inconsistent over time. Our analysis, in particular, shows that the ISO, under a human-like screener solving for the good-$k$ problem, hinders individual fairness despite meeting group fairness, and hampers the optimality of the selected $k$ candidates. This is due to position bias, where a candidate's evaluation is affected by its position within the ISO. We report extensive simulated experiments exploring the parameters of the best-$k$ and good-$k$ problems for both screeners. Our simulation framework is flexible enough to account for multiple candidate screening tasks, being an alternative to running real-world procedures.

Related papers

• SEED-SET: Scalable Evolving Experimental Design for System-level Ethical Testing [17.31500098002456]
  SEED-SET is an experimental design framework that incorporates domain-specific objective evaluations, and subjective value judgments from stakeholders.<n>We validate our approach for ethical benchmarking of autonomous agents on two applications and find our method to perform the best.
  arXiv  Detail & Related papers  (2026-03-02T09:06:28Z)
• An External Fairness Evaluation of LinkedIn Talent Search [55.18656975953939]
  We conduct an independent, third-party audit for bias of LinkedIn's Talent Search ranking system.<n>We focus on potential ranking bias across two attributes: gender and race.<n>Our analysis reveals an under-representation of minority groups in early ranks.
  arXiv  Detail & Related papers  (2025-11-13T19:10:49Z)
• A Principled Approach to Randomized Selection under Uncertainty: Applications to Peer Review and Grant Funding [68.43987626137512]
  We propose a principled framework for randomized decision-making based on interval estimates of the quality of each item.<n>We introduce MERIT, an optimization-based method that maximizes the worst-case expected number of top candidates selected.<n>We prove that MERIT satisfies desirable axiomatic properties not guaranteed by existing approaches.
  arXiv  Detail & Related papers  (2025-06-23T19:59:30Z)
• Study of the influence of a biased database on the prediction of standard algorithms for selecting the best candidate for an interview [0.4241054493737716]
  We generate data mimicking external (discrimination) and internal biases (self-censorship)<n>We study the influence of the anonymisation of files on the quality of predictions.
  arXiv  Detail & Related papers  (2025-05-05T12:24:31Z)
• Task load dependent decision referrals for joint binary classification in human-automation teams [5.004501184476518]
  We consider the problem of optimal decision referrals in human-automation teams performing binary classification tasks. We provide a ranking scheme and a policy to determine the optimal set of tasks for referral. Results show statistically significant gains for the proposed optimal referral policy over a blind policy.
  arXiv  Detail & Related papers  (2025-04-05T19:09:04Z)
• Evaluating the Fairness of Discriminative Foundation Models in Computer Vision [51.176061115977774]
  We propose a novel taxonomy for bias evaluation of discriminative foundation models, such as Contrastive Language-Pretraining (CLIP) We then systematically evaluate existing methods for mitigating bias in these models with respect to our taxonomy. Specifically, we evaluate OpenAI's CLIP and OpenCLIP models for key applications, such as zero-shot classification, image retrieval and image captioning.
  arXiv  Detail & Related papers  (2023-10-18T10:32:39Z)
• PSDiff: Diffusion Model for Person Search with Iterative and Collaborative Refinement [59.6260680005195]
  We present a novel Person Search framework based on the Diffusion model, PSDiff. PSDiff formulates the person search as a dual denoising process from noisy boxes and ReID embeddings to ground truths. Following the new paradigm, we further design a new Collaborative Denoising Layer (CDL) to optimize detection and ReID sub-tasks in an iterative and collaborative way.
  arXiv  Detail & Related papers  (2023-09-20T08:16:39Z)
• LEAPS: End-to-End One-Step Person Search With Learnable Proposals [50.39493100627476]
  We propose an end-to-end one-step person search approach with learnable proposals, named LEAPS. Given a set of sparse and learnable proposals, LEAPS employs a dynamic person search head to directly perform person detection and corresponding re-id feature generation without non-maximum suppression post-processing.
  arXiv  Detail & Related papers  (2023-03-21T13:59:32Z)
• Proxy-based Zero-Shot Entity Linking by Effective Candidate Retrieval [3.1498833540989413]
  We show that pairing a proxy-based metric learning loss with an adversarial regularizer provides an efficient alternative to hard negative sampling in the candidate retrieval stage. In particular, we show competitive performance on the recall@1 metric, thereby providing the option to leave out the expensive candidate ranking step.
  arXiv  Detail & Related papers  (2023-01-30T22:43:21Z)
• Personality Detection of Applicants And Employees Using K-mode Algorithm And Ocean Model [0.0]
  A model is created to identify applicants' personality types so that employers may find qualified candidates by examining a person's facial expression, speech intonation, and resume. Employee attitudes and behaviour towards each set of questions are being examined and analysed. K-Modes clustering method is used to predict employee well-being, including job pressure, the working environment, and relationships with peers.
  arXiv  Detail & Related papers  (2022-12-27T11:00:58Z)
• OIMNet++: Prototypical Normalization and Localization-aware Learning for Person Search [34.460973847554364]
  We address the task of person search, that is, localizing and re-identifying query persons from a set of raw scene images. Recent approaches are typically built upon OIMNet, a pioneer work on person search, that learns joint person representations for performing both detection and person re-identification tasks. We introduce a novel normalization layer, dubbed ProtoNorm, that calibrates features from pedestrian proposals, while considering a long-tail distribution of person IDs.
  arXiv  Detail & Related papers  (2022-07-21T06:34:03Z)
• Choosing an algorithmic fairness metric for an online marketplace: Detecting and quantifying algorithmic bias on LinkedIn [0.21756081703275995]
  We derive an algorithmic fairness metric from the fairness notion of equal opportunity for equally qualified candidates. We use the proposed method to measure and quantify algorithmic bias with respect to gender of two algorithms used by LinkedIn.
  arXiv  Detail & Related papers  (2022-02-15T10:33:30Z)
• UniCon: Unified Context Network for Robust Active Speaker Detection [111.90529347692723]
  We introduce a new efficient framework, the Unified Context Network (UniCon), for robust active speaker detection (ASD) Our solution is a novel, unified framework that focuses on jointly modeling multiple types of contextual information. A thorough ablation study is performed on several challenging ASD benchmarks under different settings.
  arXiv  Detail & Related papers  (2021-08-05T13:25:44Z)
• MS-Ranker: Accumulating Evidence from Potentially Correct Candidates for Answer Selection [59.95429407899612]
  We propose a novel reinforcement learning based multi-step ranking model, named MS-Ranker. We explicitly consider the potential correctness of candidates and update the evidence with a gating mechanism. Our model significantly outperforms existing methods that do not rely on external resources.
  arXiv  Detail & Related papers  (2020-10-10T10:36:58Z)
• Exploration in two-stage recommender systems [79.50534282841618]
  Two-stage recommender systems are widely adopted in industry due to their scalability and maintainability. A key challenge of this setup is that optimal performance of each stage in isolation does not imply optimal global performance. We propose a method of synchronising the exploration strategies between the ranker and the nominators.
  arXiv  Detail & Related papers  (2020-09-01T16:52:51Z)
• Intersectional Affirmative Action Policies for Top-k Candidates Selection [3.4961413413444817]
  We study the problem of selecting the top-k candidates from a pool of applicants, where each candidate is associated with a score indicating his/her aptitude. We consider a situation in which some groups of candidates experience historical and present disadvantage that makes their chances of being accepted much lower than other groups. We propose two algorithms to solve this problem, analyze them, and evaluate them experimentally using a dataset of university application scores and admissions to bachelor degrees in an OECD country.
  arXiv  Detail & Related papers  (2020-07-29T12:27:18Z)
• Towards Model-Agnostic Post-Hoc Adjustment for Balancing Ranking Fairness and Algorithm Utility [54.179859639868646]
  Bipartite ranking aims to learn a scoring function that ranks positive individuals higher than negative ones from labeled data. There have been rising concerns on whether the learned scoring function can cause systematic disparity across different protected groups. We propose a model post-processing framework for balancing them in the bipartite ranking scenario.
  arXiv  Detail & Related papers  (2020-06-15T10:08:39Z)

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.