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

Trend · papers per month

471114 · Oct 201919922001200920172026
48 results for worker reallocation

LineFlow is a framework for training RL agents to control production lines.

problem Designing control systems for production lines is challenging.
method Introduces LineFlow, an extensible Python framework for simulating and training RL agents.
result RL agents approach optimal performance in well-understood scenarios but face challenges in complex industrial lines.

Studies of wealth inequality often assume that an observed wealth distribution reflects a system in equilibrium. This constraint is rarely tested empirically. We introduce a simple model that allows equilibrium but does not assume it. To geometric Brownian motion (GBM) we add reallocation: all individuals contribute in…

2016-05-18abs ↗pdf ↗

Study finds cryptoasset markets inefficient due to capital reallocation frictions.

problem Inefficiency in cryptoasset markets due to capital reallocation frictions.
method Examined investments with dominant and secondary risk factors, derived equilibrium restrictions, and tested empirically.
result Empirical results strongly reject necessary equilibrium restrictions, indicating market inefficiency.

Optimizes liquidity provision intervals for profitable AMM participation.

problem Financial losses from poor liquidity provision intervals and reallocation costs.
method Developed a tractable stochastic optimization problem.
result Computes optimal liquidity provision intervals for profitable liquidity concentration.
Ponzi Fundsq-fin.GN

Funds inflate their returns due to price pressure, leading to wealth reallocation and market crashes.

problem Funds inflate their returns due to price pressure, leading to wealth reallocation and market crashes.
method Decomposed fund returns into price pressure and fundamental components, and identified the impact of price chasing on fund flows.
result Funds' self-inflated returns lead to wealth reallocation and market crashes, and can be predicted by fund illiquidity.

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 ↗

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 ↗

The emph{securities market} is the fundamental theoretical framework in economics and finance for resource allocation under uncertainty. Securities serve both to reallocate risk and to disseminate probabilistic information. emph{Complete} securities markets - which contain one security for every possible state of natur…

2013-01-16abs ↗pdf ↗

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.

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 ↗

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.

Study finds significant price declines and capital reallocation from centralized to decentralized exchanges after FTX collapse.

problem Quantifying trust dynamics and redistribution between centralized and decentralized exchanges.
method Interdisciplinary approach combining causal inference and computational text analysis.
result Significant price declines and capital reallocation from centralized to decentralized exchanges following the FTX collapse.

Optimal control of reserve assets for stablecoins to maintain peg stability.

problem Balancing immediate liquidity and yield on reserve assets for stablecoin peg maintenance.
method Developed a stochastic model predictive control framework with moment closure for event intensities, incorporating a soft-thresholding structure for rebalancing.
result Optimal policy shifts predictably toward cash as expected outflows intensify or windows lengthen, preserving most bill carry in calm markets and quickly building cash during stress.

The DAO Report led to a significant shift of ICO activity to Europe.

problem The impact of U.S. regulatory changes on global ICO activity.
method Analysis of a global dataset of ICOs from 2014 to 2021, focusing on the DAO Report's effects.
result A substantial and persistent reallocation of ICO activity to Europe following the DAO Report.

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 ↗

Crypto markets show negative spillovers between chains, not positive co-movements.

problem Negative spillovers in crypto asset returns across different blockchains.
method On-chain data from multiple blockchains (Ethereum, Solana, Binance, Arbitrum, Avalanche) analyzed over 2022-2025.
result Surges on one chain often coincide with declines on others, especially during attention shocks.

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.

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 ↗

The prediction of workers' safety behaviour can help identify vulnerable workers who intend to undertake unsafe behaviours and be useful in the design of management practices to minimise the occurrence of accidents. The latest literature has evidenced that there is within-population diversity that leads people's intend…

2019-12-11abs ↗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.

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.