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,657 papers · 148 categories

Trend · papers per month

8162432 · Jun 202019922001200920172026
48 results for worker skill

New model optimizes worker-task specialization for crowdsourcing.

problem Inferring correct labels from noisy answers across varying worker and task skills.
method Introduced a dd-type specialization model to account for varying worker and task types, and proposed algorithms achieving optimal sample complexity.
result Optimal label inference algorithms for crowdsourcing with unknown worker and task types.

The paper aims to explore the impacts of bi-demographic structure on the current account and growth. Using a SVAR modeling, we track the dynamic impacts between these underlying variables. New insights have been developed about the dynamic interrelation between population growth, current account and economic growth. Th…

2018-03-29abs ↗pdf ↗

Although freelancing work has grown substantially in recent years, in part facilitated by a number of online labor marketplaces, (e.g., Guru, Freelancer, Amazon Mechanical Turk), traditional forms of "in-sourcing" work continue being the dominant form of employment. This means that, at least for the time being, freelan…

2020-02-16abs ↗pdf ↗

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.

As freelancing work keeps on growing almost everywhere due to a sharp decrease in communication costs and to the widespread of Internet-based labour marketplaces (e.g., guru.com, feelancer.com, mturk.com, upwork.com), many researchers and practitioners have started exploring the benefits of outsourcing and crowdsourcin…

2020-02-14abs ↗pdf ↗

Most of the prior work on multi-agent reinforcement learning (MARL) achieves optimal collaboration by directly controlling the agents to maximize a common reward. In this paper, we aim to address this from a different angle. In particular, we consider scenarios where there are self-interested agents (i.e., worker agent…

2018-09-29abs ↗pdf ↗

We discuss the distribution of commuting distances and its relation to income. Using data from Denmark, the UK, and the US, we show that the commuting distance is (i) broadly distributed with a slow decaying tail that can be fitted by a power law with exponent γ3γ\approx 3 and (ii) an average growing slowly as a power …

2016-02-04abs ↗pdf ↗

An online labor platform faces an online learning problem in matching workers with jobs and using the performance on these jobs to create better future matches. This learning problem is complicated by the rise of complex tasks on these platforms, such as web development and product design, that require a team of worker…

2018-09-18abs ↗pdf ↗

Optimizes task allocation for financial analysts to balance work efficiency and well-being.

problem Balancing business goals with financial analysts' well-being in error resolution tasks.
method Used a Genetic Algorithm (GA) to optimize task allocation considering both business goals and analyst well-being.
result GA model outperforms existing methods and is applicable to various real-world scenarios.

Employers actively look for talents having not only specific hard skills but also various soft skills. To analyze the soft skill demands on the job market, it is important to be able to detect soft skill phrases from job advertisements automatically. However, a naive matching of soft skill phrases can lead to false pos…

2018-07-20abs ↗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 ↗

A new algorithm reduces training time for distributed machine learning by dynamically assigning backup workers.

problem Time-consuming synchronization phase due to slow workers (stragglers).
method Dynamic allocation of backup workers to minimize waiting time.
result Achieves linear speedup in convergence performance with more workers.

Due to concerns about human error in crowdsourcing, it is standard practice to collect labels for the same data point from multiple internet workers. We here show that the resulting budget can be used more effectively with a flexible worker assignment strategy that asks fewer workers to analyze easy-to-label data and m…

2019-01-11abs ↗pdf ↗

Consider unsupervised clustering of objects drawn from a discrete set, through the use of human intelligence available in crowdsourcing platforms. This paper defines and studies the problem of universal clustering using responses of crowd workers, without knowledge of worker reliability or task difficulty. We model sto…

2016-10-05abs ↗pdf ↗

Study analyzes AI's impact on firms, markets, and workers using large language model data.

problem Understanding AI's effect on firms, markets, and workers.
method Used 380 trillion tokens from 400+ large language models to analyze AI's impact.
result Firms with higher AI exposure earn higher returns, creating an AI premium.

We propose Zeno++, a new robust asynchronous Stochastic Gradient Descent~(SGD) procedure which tolerates Byzantine failures of the workers. In contrast to previous work, Zeno++ removes some unrealistic restrictions on worker-server communications, allowing for fully asynchronous updates from anonymous workers, arbitrar…

2019-03-17abs ↗pdf ↗

While training a machine learning model using multiple workers, each of which collects data from their own data sources, it would be most useful when the data collected from different workers can be {\em unique} and {\em different}. Ironically, recent analysis of decentralized parallel stochastic gradient descent (D-PS…

2018-03-19abs ↗pdf ↗

We introduce the Adaptive Skills, Adaptive Partitions (ASAP) framework that (1) learns skills (i.e., temporally extended actions or options) as well as (2) where to apply them. We believe that both (1) and (2) are necessary for a truly general skill learning framework, which is a key building block needed to scale up t…

2016-02-10abs ↗pdf ↗

The number of Italian firms in function of the number of workers is well approximated by an inverse power law up to 15 workers but shows a clear downward deflection beyond this point, both when using old pre-1999 data and when using recent (2014) data. This phenomenon could be associated with employent protection legis…

2014-12-02abs ↗pdf ↗

The paper explains how language models acquire complex skills through scaling laws and statistical analysis.

problem Understanding how language models acquire new skills as their size and training data increase.
method Statistical framework and mathematical analysis of scaling laws.
result Language models can learn complex skills efficiently due to a strong inductive bias.

DynBRO learns robustly from dynamic Byzantine workers.

problem Fault-tolerant distributed learning with dynamic Byzantine workers.
method Multi-level Monte Carlo (MLMC) gradient estimation and adaptive learning rate.
result DynaBRO nearly matches static setting's convergence rate with O(T)\mathcal{O}(\sqrt{T}) Byzantine worker changes.

Researchers study how skills are learned in neural networks using physics principles.

problem Understanding how skills are sequentially learned in neural networks.
method Abstract and simplify the problem using physics principles, proposing three models: Geometry, Resource, and Domino.
result Models reveal insights into neural scaling laws, learning dynamics, and the benefits of modularity.

A method to robustly federate learning with non-i.i.d. data and Byzantine workers.

problem Byzantine workers sending malicious messages in federated learning with non-i.i.d. data.
method Resampling strategy to reduce inner and outer variation, stochastic average gradient, robust geometric median aggregation.
result The method reaches a neighborhood of the optimal solution at a linear convergence rate and learning error depends on the number of Byzantine workers.

Crowdsourcing is a relatively economic and efficient solution to collect annotations from the crowd through online platforms. Answers collected from workers with different expertise may be noisy and unreliable, and the quality of annotated data needs to be further maintained. Various solutions have been attempted to ob…

2019-12-24abs ↗pdf ↗

To accelerate the training of machine learning models, distributed stochastic gradient descent (SGD) and its variants have been widely adopted, which apply multiple workers in parallel to speed up training. Among them, Local SGD has gained much attention due to its lower communication cost. Nevertheless, when the data …

2019-12-30abs ↗pdf ↗

We consider the problem faced by a service platform that needs to match limited supply with demand but also to learn the attributes of new users in order to match them better in the future. We introduce a benchmark model with heterogeneous "workers" (demand) and a limited supply of "jobs" that arrive over time. Job typ…

2016-03-15abs ↗pdf ↗

The paper examines skill estimation and variance under model misspecification in IRT.

problem Underestimation and overestimation of skills when non-compensatory model is misspecified as compensatory.
method Theoretical approach to analyze underestimation and overestimation of skills and variance.
result Overestimation of skills occurs around the origin and asymptotic variance differs under model misspecification.

Acquiring new robot motor skills is cumbersome, as learning a skill from scratch and without prior knowledge requires the exploration of a large space of motor configurations. Accordingly, for learning a new task, time could be saved by restricting the parameter search space by initializing it with the solution of a si…

2019-08-11abs ↗pdf ↗

Paper improves communication in distributed optimization, reducing worker-to-server data exchanges.

problem Efficiency in server-to-worker communication in distributed optimization.
method MARINA-P, a novel downlink compression method using correlated compressors; M3, combining MARINA-P with uplink compression.
result MARINA-P achieves provably superior server-to-worker communication complexity with increasing number of workers.

RelaySum improves decentralized deep learning by uniformly distributing data across workers.

problem Handling data heterogeneity in decentralized deep learning.
method RelaySum uses spanning trees to distribute information exactly uniformly across all workers with finite delays.
result RelaySum is independent of data heterogeneity and scales to many workers, enabling highly accurate decentralized deep learning.