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

75151226301 · May 202619922001200920172026
48 results for construction workers

Neural network predicts nonlinear safety behavior based on personality traits.

problem Predicting construction workers' unsafe behaviors based on personality traits.
method Developed a forecasting model using neural network algorithms.
result Nonlinear relationship exists between personality traits and safety behavior.

In this paper, we present a novel sequential paradigm for classification in crowdsourcing systems. Considering that workers are unreliable and they perform the tests with errors, we study the construction of decision trees so as to minimize the probability of mis-classification. By exploiting the connection between pro…

2018-05-01abs ↗pdf ↗

Improves distributed SGD convergence speed with reduced computation load.

problem Mitigating stragglers in distributed SGD to speed up convergence.
method Modeling communication and computation times, adapting number of workers and computation load dynamically.
result Significantly reduces computation load while improving convergence speed.

We construct a theoretical model for equilibrium distribution of workers across sectors with different labor productivity, assuming that a sector can accommodate a limited number of workers which depends only on its productivity. A general formula for such distribution of productivity is obtained, using the detail-bala…

2012-05-11abs ↗pdf ↗

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.

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 ↗

Low dimensional embeddings that capture the main variations of interest in collections of data are important for many applications. One way to construct these embeddings is to acquire estimates of similarity from the crowd. However, similarity is a multi-dimensional concept that varies from individual to individual. Ex…

2017-09-22abs ↗pdf ↗

Large-scale labeled dataset is the indispensable fuel that ignites the AI revolution as we see today. Most such datasets are constructed using crowdsourcing services such as Amazon Mechanical Turk which provides noisy labels from non-experts at a fair price. The sheer size of such datasets mandates that it is only feas…

2019-06-08abs ↗pdf ↗

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 ↗

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 ↗

Paper tackles noisy annotations by considering workers' attention levels.

problem Noisy annotations from workers with varying expertise.
method Proposes a probabilistic model that incorporates workers' attention for accurate label quality estimation.
result Improves aggregated labels by quantifying the relationship between workers' attention and label quality.

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.

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.

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 ↗

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.

New algorithm reduces communication traffic in decentralized learning.

problem Communication bottleneck in decentralized learning for low-bandwidth workers.
method Sparsification and adaptive peer selection to reduce communication traffic.
result Significant reduction in communication traffic compared to existing methods.

Crowdsourcing systems, in which numerous tasks are electronically distributed to numerous "information piece-workers", have emerged as an effective paradigm for human-powered solving of large scale problems in domains such as image classification, data entry, optical character recognition, recommendation, and proofread…

2011-10-17abs ↗pdf ↗

VRL-SGD reduces communication complexity in non-identical data settings.

problem Training machine learning models with non-identical data distribution.
method VRL-SGD, which eliminates gradient variance dependency and achieves linear speedup with lower communication complexity.
result VRL-SGD reduces communication complexity from $O(T^{ rac{3}{4}} N^{ rac{3}{4}})$ to $O(T^{ rac{1}{2}} N^{ rac{3}{2}})$.

Ringmaster ASGD improves Asynchronous SGD's efficiency under varying worker times.

problem Suboptimal performance of Asynchronous SGD under heterogeneous worker computation times.
method Ringmaster ASGD, a novel Asynchronous SGD method with optimal time complexity.
result Ringmaster ASGD achieves optimal time complexity under arbitrary worker heterogeneity.

This paper revisits optimal investment strategies for defined contribution pension schemes using forward preferences.

problem Optimal investment strategies derived from backward models are not time-consistent and sub-optimal in real scenarios.
method Introduces forward preferences and solves optimal investment strategies for defined contribution pension schemes.
result Constructs optimal investment strategies for defined contribution pension schemes using forward preferences.

Asynchronous distributed machine learning solutions have proven very effective so far, but always assuming perfectly functioning workers. In practice, some of the workers can however exhibit Byzantine behavior, caused by hardware failures, software bugs, corrupt data, or even malicious attacks. We introduce \emph{Karda…

2018-02-22abs ↗pdf ↗

Partial model averaging improves Federated Learning performance.

problem Periodic model averaging causes significant model discrepancy in Federated Learning.
method Proposes a partial model averaging framework that encourages local models to stay close to each other.
result Partial averaging achieves up to 2.2% higher validation accuracy than full averaging.

Machine Learning (ML) solutions are nowadays distributed and are prone to various types of component failures, which can be encompassed in so-called Byzantine behavior. This paper introduces LiuBei, a Byzantine-resilient ML algorithm that does not trust any individual component in the network (neither workers nor serve…

2019-11-18abs ↗pdf ↗

COMRADE is a communication-efficient, Byzantine-resilient second-order optimization algorithm.

problem Byzantine failures in distributed optimization.
method COMRADE is a communication-efficient, second-order optimization algorithm that uses a simple norm-based thresholding rule to filter out Byzantine workers.
result COMRADE achieves linear-quadratic convergence and is robust against Byzantine workers.

LocalNewton reduces communication in distributed learning.

problem Communication bottleneck in distributed optimization.
method LocalNewton is a distributed second-order algorithm with local averaging, updating models locally and communicating once every few iterations.
result LocalNewton reduces communication rounds and end-to-end running time compared to state-of-the-art algorithms.

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 ↗

Crowdsourcing platforms emerged as popular venues for purchasing human intelligence at low cost for large volume of tasks. As many low-paid workers are prone to give noisy answers, a common practice is to add redundancy by assigning multiple workers to each task and then simply average out these answers. However, to fu…

2017-02-28abs ↗pdf ↗