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

158315473630 · Jun 202019922001200920172026
48 results for asynchronous time series

Proposes a model for multi-horizon probabilistic forecasting of time series influenced by asynchronous events.

problem Forecasting time series influenced by asynchronous events is challenging.
method Introduces Variational Synergetic Multi-Horizon Network (VSMHN), a deep conditional generative model combining deep point processes and variational recurrent neural networks.
result Produces accurate, sharp, and realistic probabilistic forecasts.

New method speeds up lead-lag detection between asynchronous time series.

problem Slow inference of lead-lag networks between long time series.
method Derive asymptotic distribution of Transfer Entropy and introduce time-shifted time series.
result Statistically validated lead-lag networks between time series.

Despite the eminent successes of deep neural networks, many architectures are often hard to transfer to irregularly-sampled and asynchronous time series that commonly occur in real-world datasets, especially in healthcare applications. This paper proposes a novel approach for classifying irregularly-sampled time series…

2019-09-26abs ↗pdf ↗

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.

Study on network-valued processes with asynchronous updates, proving consistency in community and changepoint estimation.

problem Understanding the behavior of network-valued stochastic processes with asynchronous updates.
method Analysis of concentration properties of aggregated adjacency and Laplacian matrices for lazy network-valued stochastic processes.
result Demonstrates consistency of estimators in community and changepoint estimation problems.

For researching the association between coal enterprise management and return in financial market, this paper applies the method of time difference relevance and PageRank method to seek the leader-index of a stock set containing 21 coal enterprises in A-share market and score those stocks. Based on the return in 2011, …

2012-11-09abs ↗pdf ↗

There are time series that are amenable to recurrent neural network (RNN) solutions when treated as sequences, but some series, e.g. asynchronous time series, provide a richer variation of feature types than current RNN cells take into account. In order to address such situations, we introduce a unified RNN that handle…

2018-09-24abs ↗pdf ↗

Ringleader ASGD optimizes SGD for diverse edge devices with varying data and computation speeds.

problem Scalable distributed optimization with heterogeneous devices and data.
method Ringleader ASGD, an asynchronous SGD algorithm.
result Achieves optimal time complexity under data heterogeneity and arbitrary computation speeds.

Freya PAGE optimizes nonconvex optimization with heterogeneous, asynchronous workers.

problem Optimizing nonconvex finite-sum problems with varying worker processing times.
method Freya PAGE, a parallel method robust to stragglers and adaptive to slow computations.
result Freya PAGE offers improved time complexity guarantees compared to previous methods.

Convolutional neural networks outperform other architectures in streaming time series classification.

problem Efficient deep learning models for real-time data streams.
method Asynchronous dual-pipeline deep learning framework for real-time predictions.
result Convolutional architectures achieve higher accuracy and efficiency in streaming time series classification.

New asynchronous SGD algorithms achieve optimal performance in distributed learning.

problem Asynchronous training introduces staleness, complicating optimization analysis.
method Developed rigorous framework for asynchronous first order stochastic optimization.
result Asynchronous SGD can achieve optimal time complexity, matching synchronous methods.

Standard acquisition functions are sufficient for asynchronous Bayesian optimization.

problem Redundant and repeated queries in asynchronous Bayesian optimization.
method Conceptual analysis and theoretical guarantees of standard acquisitions.
result Standard acquisition functions achieve theoretical guarantees equivalent to Thompson sampling in asynchronous settings.

The paper gives bounds for how long it takes for gossip protocols to spread information in networks.

problem Understanding the diffusion time in asynchronous gossip protocols.
method Provides non-asymptotic bounds for the number of messages needed for consensus in asynchronous gossip protocols.
result Explicit formula and approximation for the number of messages needed for consensus in different types of graphs.

Although distributed computing can significantly reduce the training time of deep neural networks, scaling the training process while maintaining high efficiency and final accuracy is challenging. Distributed asynchronous training enjoys near-linear speedup, but asynchrony causes gradient staleness - the main difficult…

2019-07-26abs ↗pdf ↗

Significant progress has been made in the area of model-based reinforcement learning. State-of-the-art algorithms are now able to match the asymptotic performance of model-free methods while being significantly more data efficient. However, this success has come at a price: state-of-the-art model-based methods require …

2019-10-28abs ↗pdf ↗

New method calibrates asynchronous, error-prone covariates for longitudinal data.

problem Estimation biases and slow convergence in analyzing time-varying covariates with measurement error.
method Functional calibration approach based on functional principal component analysis.
result Asymptotically unbiased and consistent estimators for time-invariant coefficients; optimal convergence rate for time-varying coefficients.

This work tackles resource allocation in asynchronous and stochastic systems.

problem Distributed resource allocation in asynchronous and stochastic settings.
method Approximate stochastic primal-dual approach with asynchronous updates.
result The Asynchronous stochastic Primal-Dual (Asyn-PD) algorithm converges to the saddle point solution at a rate of O(1/t)O(1/t).

New algorithm for multi-player bandits in decentralized, asynchronous systems.

problem Challenges in decentralized, asynchronous multi-player bandits, including coordination and player detection.
method Adaptive exploration-exploitation algorithm that reduces collisions and detects player presence.
result Achieves regret of O(TlogT+logT/Δ2)\mathcal{O}(\sqrt{T \log T} + {\log T}/{Δ^2}).

New asynchronous algorithms improve speed in decentralized optimization networks.

problem Hard convergence analysis for asynchronous decentralized optimization.
method Continuized framework to analyze heterogeneous delays in event-driven updates.
result Achieves asynchronous speedup with convergence rate controlled by eigengap weighted by local delays.

Ringmaster LMO accelerates training in distributed systems by asynchronously updating neural networks.

problem Asynchronous training in distributed systems where workers compute gradients at different speeds.
method Introduces an asynchronous LMO-based momentum method for unconstrained stochastic nonconvex optimization.
result Establishes convergence guarantees and time complexity bounds for asynchronous LMO-based updates.

New model stabilizes asynchronous LTI systems, independent of synchronous stability.

problem Stability of asynchronous LTI systems under randomization and asynchrony.
method Introduced a new model for random asynchronous LTI systems and developed a method for system identification.
result Stability of random asynchronous LTI systems is independent of synchronous stability.

We design and analyse variations of the classical Thompson sampling (TS) procedure for Bayesian optimisation (BO) in settings where function evaluations are expensive, but can be performed in parallel. Our theoretical analysis shows that a direct application of the sequential Thompson sampling algorithm in either synch…

2017-05-25abs ↗pdf ↗

Combines multi-fidelity and asynchronous batch methods for faster experimental design.

problem Designing optimal experimental setups for battery performance.
method Algorithm combining multi-fidelity and asynchronous batch Bayesian Optimization.
result Algorithm outperforms single-fidelity batch and multi-fidelity sequential methods.

CARRNN tackles deep learning for sporadic data, improving prediction errors in healthcare.

problem Challenges in learning temporal patterns from sporadic multivariate longitudinal data.
method Developed a novel deep learning architecture combining RNN and CAR models, using a generalized discrete-time autoregressive model.
result CARRNN achieves the lowest prediction errors in multivariate time-series regression tasks.

Enhances SGLD for log-concave posteriors with asynchronous computation.

problem Sampling log-concave posterior distributions efficiently.
method Integrates asynchronous computation into SGLD with delayed gradients.
result Convergence in measure is not significantly affected by delayed gradient information.

The Epps effect, the decrease of correlations between stock returns for short time windows, was traced back to the trading asynchronicity and to the occasional lead-lag relation between the prices. We study pairs of stocks where the latter is negligible and confirm the importance of asynchronicity but point out that al…

2007-01-09abs ↗pdf ↗

Asynchronous federated modeling improves spatial data sharing without centralizing raw data.

problem Privacy and bandwidth constraints in distributed spatial data.
method Asynchronous federated modeling using low-rank Gaussian process approximations with block-wise optimization and adaptive strategies.
result Asynchronous federated modeling achieves synchronous performance and outperforms it in heterogeneous settings.

New algorithm reduces federated learning rounds and improves privacy.

problem Inefficient synchronous federated learning causing scalability issues.
method Asynchronous federated learning with reduced communication and differential privacy via Gaussian noise.
result The algorithm reduces waiting times and network communication, making federated learning more scalable and private.

Enhances Fourier estimator performance for asynchronous event-data.

problem Improving correlation and covariance estimation on event-data.
method Implement and test NUFFT methods with different averaging kernels.
result Demonstrates improved performance and relationship between averaging scales.