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.

169,051 papers · 148 categories

Trend · papers per month

7.6%15.3%22.9%30.6% · Jun 202019922001200920172026
48 results for hiring optimization

New algorithms improve hiring decisions by optimizing tiered interview processes.

problem Optimizing tiered interview allocation for better hiring decisions.
method Casted tiered hiring as a combinatorial pure exploration (CPE) problem in the stochastic multi-armed bandit setting, presenting new algorithms in PAC and fixed-budget settings.
result Our algorithms select a near-optimal cohort with provable guarantees, making better hiring decisions or using less budget than the status quo.

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 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.

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 ↗

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.

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 ↗

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.

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.

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.

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 ↗

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 ↗

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.

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 ↗

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 ↗

New algorithm reduces regret and constraint violation in constrained bandit problems.

problem Optimizing under budget and stochastic constraints in resource-constrained settings.
method Lyapunov optimization methodology, tLyOn{ t LyOn} algorithm.
result Achieves O(KBlogB)O(\sqrt{K B\log B}) regret and zero constraint-violation for large BB.

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.

Study optimizes scoring rules for incentivizing agent's information gathering in online settings.

problem Optimizing incentives for agents to acquire information in online settings.
method Designing a sample-efficient algorithm that tailors the UCB algorithm to the strategic agent's model.
result Achieves sublinear T2/3T^{2/3}-regret after TT iterations, independent of the number of states.

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.

DEEPLY improves cloud service partitioning across multiple datasets and goals.

problem Finding a generally useful method to partition monolithic enterprise applications into cloud-based microservices.
method DEEPLY extends CO-GCN with a novel loss function and hyper-parameter optimization.
result DEEPLY outperforms prior work across multiple datasets and goals.

We consider a contracting problem in which a principal hires an agent to manage a risky project. When the agent chooses volatility components of the output process and the principal observes the output continuously, the principal can compute the quadratic variation of the output, but not the individual components. This…

2014-06-23abs ↗pdf ↗

New framework for fair online allocation in continuous time with deadlines.

problem Fair allocation under deadlines in continuous-time online learning.
method Continuous-time utility maximization, dual ascent optimization for time averages.
result Achieves ildeO(B1/2) ilde{O}(B^{-1/2}) regret bound in the absence of statistical knowledge.

This paper optimizes driver repositioning using MARL and reward design for better service and traffic management.

problem Unserved passenger requests due to drivers' cruising behavior during passenger seeking.
method Mean field multi-agent reinforcement learning (MARL) with a reward design scheme and Bayesian optimization (BO) to solve bilevel optimization problems.
result Optimal toll charges and service charges can improve platform and city planner objectives by significant margins, leading to better traffic conditions.

The study examines how hyperparameters affect prediction discrepancies in machine learning models.

problem Prediction inconsistencies across different machine learning models trained on the same dataset.
method Investigation of six models (Elastic Net, Decision Tree, k-NN, SVM, RF, XGBoost) on 21 benchmark datasets, focusing on key hyperparameters.
result Hyperparameter tuning improves model performance but increases prediction discrepancies, especially in Extreme Gradient Boosting.

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.

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 ↗

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 method reduces labeler costs by aggregating predictions from local classifiers.

problem Reduce labeler costs in multiclass classification.
method Model KK-class classification using smaller classifiers trained on subsets of tasks.
result Near-optimal scheme for designing classifier configurations reduces labeler costs.

Proposes a method to generate counterfactuals for ensemble models using entropic risk measures.

problem Finding a single counterfactual explanation for an ensemble of models.
method Incorporates entropic risk measure into a constrained optimization to generate counterfactuals valid for an adjustable fraction of models.
result Entropic risk measure allows generation of counterfactuals valid for all models in the ensemble under a limiting case.

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.

This paper improves QoS metric prediction in DTNs using diffusion models.

problem Improving QoS metric prediction in Delay-Tolerant Networks (DTNs) to enhance network performance.
method Formulates QoS metric prediction as a probabilistic forecasting problem on multivariate time series, incorporating latent temporal dynamics.
result The proposed approach outperforms traditional methods in QoS metric prediction for DTNs.

Paper tackles fairness in algorithms by predicting protected class from auxiliary data.

problem Protected class membership is often unobserved in data, leading to unfair algorithmic decisions.
method Use auxiliary datasets to predict protected class from proxy variables and provide characterizations of possible disparities.
result Common disparity measures are generally unidentifiable with auxiliary data, highlighting the need for robust assessments.

The paper tackles online learning with two types of losses and shows it's impossible without certain assumptions.

problem Online learning with primary and secondary losses where the secondary loss is bounded by a linear threshold.
method Analyzes the feasibility of achieving low regret with respect to the primary loss while keeping the secondary loss within a linear threshold.
result Achieving the goal is impossible without bounded variance assumption on the secondary loss.

Investigates fairness in pipeline models where individuals may drop out.

problem Fairness in pipeline models where individuals may drop out and subsequent stages depend on remaining individuals.
method Rigorous framework for evaluating fairness guarantees, showing that naïve auditing is insufficient and dependence must exist between stages.
result Fairness in pipelines can be arbitrary, even with just two stages, and requires dependence between stages.

This paper presents an approach for automation of interpretable feature selection for Internet Of Things Analytics (IoTA) using machine learning (ML) techniques. Authors have conducted a survey over different people involved in different IoTA based application development tasks. The survey reveals that feature selectio…

2017-07-13abs ↗pdf ↗