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

Trend · papers per month

0.5%1.0%1.6%2.1% · Jul 201919922001200920172026
48 results for delay compensation

Proposes DC-S3GD for efficient large-scale decentralized neural network training.

problem Training large-scale decentralized neural networks efficiently.
method Decentralized stale-synchronous version of DC-ASGD with gradient correction.
result Achieves state-of-the-art results in training Convolutional Neural Networks.

Proposes a compensation mechanism for improving individual forecast confidence.

problem Difficult to assess the quality of individual probabilistic forecasts and their utilities.
method Compensation mechanism based on fair bets and online learning.
result The proposed mechanism cannot be exploited and ensures forecasted utility matches actual utility.

Improved SGD rates with delayed and compressed gradients.

problem Convergence rates of SGD with delayed and compressed gradients.
method Analyzed SGD with delayed updates on smooth quasi-convex and non-convex functions, derived non-asymptotic rates.
result Convergence rates are affected by noise but not by delay, leading to optimal rates.

The Canonical Regression Quantile method predicts CEO compensation and future performance.

problem Determining fair CEO compensation and its impact on company performance.
method Canonical Regression Quantile method to assess CEO pay and performance.
result The method can predict future CEO performance and distinguish over/underpaid CEOs.

The paper simplifies calculus for semimartingales using multiplicative compensation.

problem Developing a formula for complex-valued semimartingales to simplify stochastic calculus.
method Multiplicative compensation for complex-valued semimartingales.
result The stochastic exponential of complex-valued semimartingales becomes a true martingale after compensation.

We propose and study the known-compensation multi-arm bandit (KCMAB) problem, where a system controller offers a set of arms to many short-term players for TT steps. In each step, one short-term player arrives to the system. Upon arrival, the player aims to select an arm with the current best average reward and receiv…

2018-11-05abs ↗pdf ↗

Paper tackles action delays in reinforcement learning, proposing a delay-aware framework.

problem Action delays degrade reinforcement learning performance in real-world systems.
method Formal definition of delay-aware MDP, transformation into standard MDP with augmented states, delay-aware model-based reinforcement learning framework.
result Proposed framework is more efficient in training and transferable between systems with various delay durations.

Proposes a new algorithm to reduce communication costs in decentralized training.

problem How to apply error-compensated compression to decentralized training.
method Error-compensated stochastic gradient descent for decentralized training.
result Proposed algorithm outperforms existing methods in communication cost reduction.

New algorithms ensure fair selection in combinatorial semi-bandit with unrestricted delays.

problem Fair selection in stochastic combinatorial semi-bandit with delayed feedback.
method Introduced merit-based fairness constraints and new bandit algorithms for reward and fairness.
result Achieved sublinear expected reward and fairness regrets with dependence on delay distribution quantiles.

New algorithm handles delayed feedback robustly, reducing regret without knowing delay bounds.

problem Bandits with variably delayed feedback, especially excessive delays.
method Implicit exploration scheme, adaptive skipping, drifted regret control.
result Can tolerate arbitrary excessive delays up to order T, reducing regret.

A machine learning model for PMD compensation in dual-polarization systems.

problem Compensating for polarization-mode dispersion (PMD) in dual-polarization systems.
method Model-based machine learning approach using the split-step Fourier method for the Manakov-PMD equation.
result The model converges to within 1% of peak dB performance after 428 iterations, achieving a 0.30 dB reduction in effective signal-to-noise ratio compared to PMD-free case.

Extends compactness theory to variable-coefficient pseudo-differential operators on manifolds.

problem Compensated compactness for pseudodifferential operators on vector bundles.
method Establishes a theorem for weakly convergent sequences of sections under a pseudo-differential operator.
result Quadratic form converges in distributional sense under certain conditions.

Paper tackles delays in multi-agent reinforcement learning, improving performance.

problem Challenges in reinforcement learning due to delays in real-world systems.
method Proposes a novel framework for multi-agent reinforcement learning with delays, using Delay-Aware Markov Games and centralized-decentralized training.
result Demonstrates significant improvement in performance with delay-aware multi-agent reinforcement learning.

Study on synchronization in financial markets with time delays.

problem Understanding market dynamics and synchronization in financial systems with time delays.
method Examined a system of coupled non-linear delay-differential equations, linearized for small delays, and analyzed collective dynamics using bifurcation diagrams and numerical solutions.
result Demonstrated that limit cycles can be maintained in coupled N-asset models with appropriate parameterization, leading to market synchronization.

BayTiDe discovers time-delayed differential equations from noisy data.

problem Discovering time-delayed differential equations from data with large delays and noise.
method Bayesian inference with a sparsity-promoting prior.
result BayTiDe accurately identifies time-delayed differential equations with accuracy proportional to data resolution.

New algorithm tackles stochastic bandits with varying arm-dependent delays.

problem Applying existing algorithms to stochastic delayed bandit settings is restricted by strong assumptions on delay distributions.
method Proposes a simple UCB-based algorithm called PatientBandits that weakens assumptions on delay distributions.
result Provides bounds on regret and performance lower bounds for the PatientBandits algorithm.

We investigate multiarmed bandits with delayed feedback, where the delays need neither be identical nor bounded. We first prove that "delayed" Exp3 achieves the O((KT+D)lnK)O(\sqrt{(KT + D)\ln K} ) regret bound conjectured by Cesa-Bianchi et al. [2019] in the case of variable, but bounded delays. Here, KK is the number of actio…

2019-06-03abs ↗pdf ↗

Delayed-RNN approximates stacked and bidirectional RNNs.

problem Improving RNN expressiveness and representational capacity.
method Weight-constrained delayed-RNN, equivalent to stacked-RNNs, with partial acausality.
result Delayed-RNN can approximate stacked and bidirectional RNNs, outperforming them in some tasks.

Coded Federated Learning speeds up model convergence by preemptively computing on parity data.

problem Federated learning's convergence is slow on heterogeneous platforms due to stragglers.
method Develops CFL scheme where clients generate parity data and share it once, allowing the server to compute redundantly.
result CFL allows global model to converge nearly four times faster than uncoded federated learning.

New algorithm tackles non-stationary delayed feedback in recommender systems.

problem Challenges in learning from delayed feedback in non-stationary environments.
method Developed a UCRL-based algorithm for non-stationary, delayed bandits with intermediate observations.
result Sublinear regret guarantees for the proposed algorithm in non-stationary delayed environments.

PCTS optimizes noisy, delayed, multi-fidelity feedbacks in black-box optimization.

problem Optimizing unknown functions with noisy, delayed, and multi-fidelity feedbacks.
method ProCrastinated Tree Search (PCTS) with DUCB1 and DUCBV algorithms.
result PCTS achieves better regret bounds for delayed, noisy, and multi-fidelity feedbacks.

Predicting conversion rates (CVRs) in display advertising (e.g., predicting the proportion of users who purchase an item (i.e., a conversion) after its corresponding ad is clicked) is important when measuring the effects of ads shown to users and to understanding the interests of the users. There is generally a time de…

2018-02-01abs ↗pdf ↗

We study a variant of the stochastic KK-armed bandit problem, which we call "bandits with delayed, aggregated anonymous feedback". In this problem, when the player pulls an arm, a reward is generated, however it is not immediately observed. Instead, at the end of each round the player observes only the sum of a number…

2017-09-20abs ↗pdf ↗

Study online learning with delays and capacity constraints, achieving optimal regret bounds.

problem Online learning with delays and capacity constraints.
method Novel scheduling and preemptive techniques, matching upper and lower bounds.
result Achieves optimal regret bounds across all capacity levels.

Online learning with delayed feedback has received increasing attention recently due to its several applications in distributed, web-based learning problems. In this paper we provide a systematic study of the topic, and analyze the effect of delay on the regret of online learning algorithms. Somewhat surprisingly, it t…

2013-06-04abs ↗pdf ↗

Federated learning technique improves convergence speed with communication delays.

problem Communication delays between edge nodes and aggregator in federated learning.
method Developed FedDelAvg, a technique that generalizes federated averaging to incorporate a weighting between current local model and delayed global model.
result FedDelAvg achieves a significant improvement in convergence speed, especially when optimizing the weighting scheme to account for delays.