Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

18365371 · Jun 202019922001200920172026
48 results for hiring discrimination

The study uses a multi-armed bandit model to analyze and mitigate hiring discrimination.

problem Hiring discrimination due to insufficient data on worker skill and characteristics.
method Multi-armed bandit model to simulate firms' learning process and policy solutions.
result Temporary affirmative actions effectively alleviate discrimination caused by data insufficiency.

Study compares employers with and without anticipating strategic labor force responses.

problem Understanding and optimizing strategic interactions in labor markets.
method Formulation of causal strategic classification, theory, and experiments.
result Performatively optimal hiring policies improve employer and labor outcomes, but can also harm labor force utility.

The persistence of racial inequality in the U.S. labor market against a general backdrop of formal equality of opportunity is a troubling phenomenon that has significant ramifications on the design of hiring policies. In this paper, we show that current group disparate outcomes may be immovable even when hiring decisio…

2017-11-30abs ↗pdf ↗

Over the past two decades, the notion of implicit bias has come to serve as an important component in our understanding of discrimination in activities such as hiring, promotion, and school admissions. Research on implicit bias posits that when people evaluate others -- for example, in a hiring context -- their unconsc…

2018-01-04abs ↗pdf ↗

Threshold tests have recently been proposed as a useful method for detecting bias in lending, hiring, and policing decisions. For example, in the case of credit extensions, these tests aim to estimate the bar for granting loans to white and minority applicants, with a higher inferred threshold for minorities indicative…

2017-02-27abs ↗pdf ↗

New algorithm mitigates affinity bias in hiring feedback loops.

problem Mitigating affinity bias in hiring decisions to avoid unconscious favoritism.
method Introducing affinity bandits, a new bandit variant that accounts for evolving biased feedback.
result Elimination-style algorithm nearly matches the derived regret bound, outperforming classical algorithms.

The paper offers algorithms for managing freelancers and in-house workers in online labor markets.

problem Managing freelancers and in-house workers in online labor markets efficiently.
method Developed algorithms for team formation with outsourcing in an online setting.
result Efficient online algorithms for minimizing costs in hiring and outsourcing.

Given a huge set of applicants, how should a firm allocate sequential resume screenings, phone interviews, and in-person site visits? In a tiered interview process, later stages (e.g., in-person visits) are more informative, but also more expensive than earlier stages (e.g., resume screenings). Using accepted hiring mo…

2019-06-23abs ↗pdf ↗

A method selects candidates based on predictions with statistical control.

problem Screening candidates for resource-intensive steps like hiring or drug discovery.
method Wraps around any prediction model to produce a subset of candidates with controlled false selection rate.
result Empirically demonstrates selection of candidates whose predictions exceed a data-dependent threshold.

The widespread use of ML-based decision making in domains with high societal impact such as recidivism, job hiring and loan credit has raised a lot of concerns regarding potential discrimination. In particular, in certain cases it has been observed that ML algorithms can provide different decisions based on sensitive a…

2019-09-17abs ↗pdf ↗

This work facilitates ensuring fairness of machine learning in the real world by decoupling fairness considerations in compound decisions. In particular, this work studies how fairness propagates through a compound decision-making processes, which we call a pipeline. Prior work in algorithmic fairness only focuses on f…

2017-07-03abs ↗pdf ↗

In this paper, we consider a problem of contract theory in which several Principals hire a common Agent and we study the model in the continuous time setting. We show that optimal contracts should satisfy some equilibrium conditions and we reduce the optimisation problem of the Principals to a system of coupled Hamilto…

2017-06-09abs ↗pdf ↗

A fair policy for hiring candidates from different groups is proposed in a linear contextual bandit problem.

problem Selecting candidates from different sensitive groups in a fair manner.
method A greedy policy that constructs a ridge regression estimate and computes relative rank using empirical cumulative distribution function.
result The greedy policy achieves fair pseudo-regret of order dT\sqrt{dT} after TT rounds, satisfying demographic parity.

Talent search and recommendation systems at LinkedIn strive to match the potential candidates to the hiring needs of a recruiter or a hiring manager expressed in terms of a search query or a job posting. Recent work in this domain has mainly focused on linear models, which do not take complex relationships between feat…

2018-09-17abs ↗pdf ↗

Proposes a new method for fairness in machine learning with multiple protected attributes.

problem Ensuring fairness in machine learning models with continuous and multiple protected attributes.
method Distance covariance regularisation framework to mitigate association between model predictions and protected attributes.
result Demonstrates effectiveness in mitigating fairness gerrymandering in regression tasks.

Students hiring ghostwriters to write their assignments is an increasing problem in educational institutions all over the world, with companies selling these services as a product. In this work, we develop automatic techniques with special focus on detecting such ghostwriting in high school assignments. This is done by…

2019-06-04abs ↗pdf ↗

User strategization undermines algorithmic trustworthiness.

problem User strategic behavior corrupts algorithmic data and trust.
method Modeling user-platform interactions as a game, analyzing strategic behavior's short-term benefits and long-term harms.
result User strategization can initially benefit platforms but ultimately harms their ability to make accurate decisions.

Model proposes how regulators should oversee complex algorithms in high-stakes applications.

problem Regulating complex algorithms used in high-stakes applications like lending, testing, and hiring.
method Proposes a model where regulators are limited in learning about complex algorithms with misaligned preferences, and explores different regulatory approaches.
result Complex algorithms can improve welfare, but regulation should focus on the source of incentive misalignment for optimal results.

Study evaluates fairness of machine learning models on Kaggle and finds some optimization techniques can induce unfairness.

problem Ensuring fairness of machine learning models used in important decisions.
method Empirical evaluation of 40 top-rated models from Kaggle on 5 tasks, applying 7 mitigation techniques.
result Some model optimization techniques induce unfairness; mitigation in pre-processing is preferred.

New job recommendation system improves job seekers' welfare through field experiments.

problem Current job recommendation systems focus on clicks and applications, not job seekers' welfare.
method Developed a job-search model with two dimensions: utility and success probability. Conducted field experiments to validate model predictions.
result Welfare-optimal job recommendation algorithms outperform existing approaches and perform close to the benchmark.

Study shows how online personalization can lead to unfair models due to biased user responses.

problem Fairness issues in online personalization systems due to biased user responses.
method Formulated a regularization-based approach to mitigate biases in machine learning models.
result Demonstrated that online personalization can cause models to learn unfair behavior from biased user responses.

Study fair team formation in online labor marketplaces.

problem Design fair algorithms for team formation in online labor marketplaces.
method Define and analyze the Fair Team Formation problem, provide inapproximability results, and develop four algorithms.
result Developed four algorithms for fair team formation in online labor marketplaces.

Was it fair that Harry was hired but not Barry? Was it fair that Pam was fired instead of Sam? How can one ensure fairness when an intelligent algorithm takes these decisions instead of a human? How can one ensure that the decisions were taken based on merit and not on protected attributes like race or sex? These are t…

2019-05-17abs ↗pdf ↗

Crowdsourcing provides a popular paradigm for data collection at scale. We study the problem of selecting subsets of workers from a given worker pool to maximize the accuracy under a budget constraint. One natural question is whether we should hire as many workers as the budget allows, or restrict on a small number of …

2015-02-03abs ↗pdf ↗

The study quantifies and compares aleatoric and epistemic discrimination in ML models.

problem Sources of discrimination in ML models and their impact on performance.
method Quantifying aleatoric and epistemic discrimination using statistical experiments and model accuracy.
result State-of-the-art fairness interventions are effective at removing epistemic discrimination but not aleatoric discrimination in datasets with missing values.

Discrimination-aware classification is receiving an increasing attention in data science fields. The pre-process methods for constructing a discrimination-free classifier first remove discrimination from the training data, and then learn the classifier from the cleaned data. However, they lack a theoretical guarantee f…

2017-02-28abs ↗pdf ↗

Discriminator guidance improves autoregressive diffusion models for generating molecular graphs.

problem Improving the accuracy of autoregressive diffusion models for generating molecular graphs.
method Deriving ways to use a discriminator with a pretrained generative model in the discrete case, including optimal and sub-optimal scenarios.
result Using a discriminator can correct pretrained models and improve exact sampling from the data distribution.

Kernel discriminant analysis uses nonlinear embeddings to improve classification.

problem Limited effectiveness of linear discriminant analysis in capturing nonlinear features.
method Study of nonlinear embeddings in kernel discriminant analysis using polynomial and Gaussian kernels, solving generalized eigenvalue problems.
result Polynomial and Gaussian discriminants capture class differences through population moments and randomized projections.

The paper shows how demographic data can lead to biased predictions, proposing 'Affirmative Information' as a solution.

problem Bias in predictions due to demographic data.
method Characterization of error types and conditions leading to disparate impact.
result Demographic variables in data can lead to biased predictions, with higher average outcomes receiving higher false positive rates.

Large language models correlate in errors, even with different architectures and providers.

problem Lack of empirical evidence on whether different large language models differ meaningfully.
method Empirical evaluation of over 350 large language models using two leaderboards and a resume-screening task.
result Large language models have substantial correlation in errors, even with distinct architectures and providers.

Pairwise discriminators stabilize adversarial training by ensuring the generator's alignment is preserved.

problem Stability issues in adversarial training when using sub-optimal discriminators.
method Introducing a family of objectives using pairwise discriminators, ensuring the generator's alignment is preserved.
result Only the generator needs to converge, and the alignment is preserved with any discriminator.

Machine learning can impact people with legal or ethical consequences when it is used to automate decisions in areas such as insurance, lending, hiring, and predictive policing. In many of these scenarios, previous decisions have been made that are unfairly biased against certain subpopulations, for example those of a …

2017-03-20abs ↗pdf ↗

PBN combines generative and discriminative capabilities in a neural network.

problem Combining generative and discriminative capabilities in neural networks.
method Convolutional PBN, sharing FF-NN embodiment, combining generative and discriminative qualities.
result PBN shows excellent qualities from either generative or discriminative viewpoint.

Study infinite Euclidean distance discriminants of algebraic varieties.

problem Understanding the structure of data points with infinitely many critical points in Euclidean distance correspondence.
method Developed computer code to compute discriminants and proved properties of fibers.
result Infinite Euclidean distance discriminants contain all data points with infinitely many critical points for the nearest-point problem.

Generalized dual discriminator GANs improve upon traditional GANs by using two discriminators and a flexible loss function.

problem Mode collapse in GANs.
method Introducing dual discriminator αα-GANs and extending the approach to arbitrary functions.
result The approach reduces the optimization problem to a linear combination of an ff-divergence and a reverse ff-divergence.

We study two important concepts in adversarial deep learning---adversarial training and generative adversarial network (GAN). Adversarial training is the technique used to improve the robustness of discriminator by combining adversarial attacker and discriminator in the training phase. GAN is commonly used for image ge…

2018-07-27abs ↗pdf ↗

Paper proposes distributed sparse multicategory discriminant analysis for classification.

problem Sparse multicategory classification with distributed data.
method Convex formulation, distributed setting, invariant discriminant subspace recovery.
result Distributed sparse multicategory linear discriminant analysis performs as good as centralized version after a few rounds of communications.

Generative Adversarial Networks (GANs) can successfully approximate a probability distribution and produce realistic samples. However, open questions such as sufficient convergence conditions and mode collapse still persist. In this paper, we build on existing work in the area by proposing a novel framework for trainin…

2018-07-31abs ↗pdf ↗