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

179359538717 · Jun 202019922001200920172026
48 results for order processing delay

Paper develops Euler scheme for fractional delay diff. eqs with additive noise.

problem Developing a consistent Euler-Maruyama scheme for fractional stochastic delay diff. eqs.
method Euler-Maruyama scheme for fractional Brownian motion with additive noise.
result Achieved convergence rate of H+1/2 for smooth delays when H>1/2.

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.

Stochastic delay differential equations (SDDE's) have been used for financial modeling. In this article, we study a SDDE obtained by the equation of a CIR process, with an additional fixed delay term in drift; in particular, we prove that there exists a unique strong solution (positive and integrable) which we call fix…

2018-06-04abs ↗pdf ↗

A new Python-C++ framework for agent-based simulation.

problem Understanding market dynamics and effects of delays.
method User-friendly Python API with efficient C++ implementation, message-driven architecture.
result Investigated the role of order processing delay in financial markets.

Study a financial market with singular drift and no arbitrage, considering jumps and delays.

problem Model a financial market with singular drift and no arbitrage, considering jumps and delays.
method Use geometric Itô-Lévy process with singular drift term, incorporate jumps and delays, and apply white noise calculus.
result No arbitrage in the market when delay θ > 0, maximal value finite.

New model for disability insurance reserving handles delays in claim information.

problem Disability insurance claims are affected by long delays and adjudication processes.
method Proposes a new individual reserving model for real-time claim evolution.
result Shows that new reserves can be calculated as modifications of classic reserves.

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.

This paper considers the problem of predicting the number of events that have occurred in the past, but which are not yet observed due to a delay. Such delayed events are relevant in predicting the future cost of warranties, pricing maintenance contracts, determining the number of unreported claims in insurance and in …

2018-01-09abs ↗pdf ↗

Novel algorithm for decentralized optimization in time-varying networks with delays.

problem Decentralized optimization in networks with communication delays.
method DT-GO algorithm, applicable to general directed graphs, converges to same complexity as centralized SGD.
result Algorithm DT-GO achieves convergence rates for convex and non-convex objectives, similar to centralized SGD.

Improved online convex optimization with delayed feedback using curvature.

problem Online convex optimization with curved losses and delayed feedback.
method Variant of follow-the-regularized-leader and Online Newton Step algorithm with adaptive learning rate.
result Regret bounds of order min{σmaxlnT,dtot}\min\{σ_{\max}\ln T, \sqrt{d_{\mathrm{tot}}}\} for exp-concave losses.

Survey of RL methods for control systems with time delays.

problem Time delays in cyber-physical systems degrade RL performance and stability.
method Categorizes and analyzes five major families of RL methods for time delays.
result Identifies key trade-offs and practical guidelines for selecting RL methods.

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.

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.

We analyze the convergence of gradient-based optimization algorithms that base their updates on delayed stochastic gradient information. The main application of our results is to the development of gradient-based distributed optimization algorithms where a master node performs parameter updates while worker nodes compu…

2011-04-28abs ↗pdf ↗

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 ↗

Modeling delayed Granger causality in Hawkes processes.

problem Capturing the time lag between causal events in multivariate Hawkes processes.
method Proposed a Hawkes process model with latent time lags, using Variational Auto-Encoder (VAE) for inference.
result Identified and inferred time lags with posterior distributions, improving event prediction and root cause analysis.

Develops a new bivariate process for energy markets with improved simulation methods.

problem Modelling energy markets with stochastic delays and efficient simulations.
method Introduces a novel bivariate Normal Inverse Gaussian process and a path simulation scheme.
result Improves simulation efficiency for energy market models.

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.

New method estimates traffic congestion delays using statistical causality.

problem Accurate estimation of traffic congestion delays during accidents.
method Proposes a novel time delay estimation method using lag-specific transfer entropy (TE) and Markov bootstrap techniques.
result Validated the method's efficacy using simulated and real data.

This study analyzes and predicts airline delays using machine learning models.

problem Improving the accuracy of predicting airline flight delays.
method The study combines airline and weather datasets, using various machine learning models (Logistic Regression, Naive Bayes, K-NN, Decision Tree, Random Forest) to predict flight delays.
result The Random Forest model achieved an accuracy of 82% in predicting flight delays of 15 minutes or more.

A new algorithm tackles delayed combinatorial semi-bandit with causal relations.

problem Optimizing decisions in a non-stationary environment with delayed and causally related rewards.
method Formalized as a non-stationary delayed combinatorial semi-bandit problem, the approach models causal relations with a directed graph in a stationary structural equation model. The agent learns these relations from delayed feedback to optimize decisions.
result Proved a regret bound for the proposed algorithm's performance.

The paper develops a reinforcement learning model to estimate ad impact considering delayed and cumulative effects.

problem Accurately estimating ad impact considering delayed and long-term effects, cumulative impacts, and customer heterogeneity.
method Modeling ad bidding as a Contextual Markov Decision Process (CMDP) with delayed Poisson rewards, proposing a two-stage maximum likelihood estimator and reinforcement learning algorithm.
result Achieves a near-optimal regret bound of O~(dH2T)\tilde{O}{(dH^2\sqrt{T})}, validating the approach through simulation experiments.

New RL algorithm handles delayed feedback with posterior sampling.

problem Challenges of delayed feedback in reinforcement learning with linear function approximation.
method Posterior sampling with delayed feedback for value-based RL.
result Achieves optimal regret guarantee with improved computational efficiency.

Study utility maximization with delayed information in continuous time Gaussian markets.

problem Maximizing utility with delayed information in continuous time Gaussian markets.
method Purely probabilistic approach based on Radon-Nikodym derivatives of Gaussian measures.
result Solution for optimal control and value in a specific Gaussian framework.

The paper optimizes tax implementation delays for insurance companies with Lévy risk processes.

problem Maximizing tax payments and minimizing costs for insurance companies.
method Optimization of tax implementation levels for spectrally negative Lévy insurance risk processes.
result Optimal implementation levels for tax payments and capital injections are derived.

Study improves risk evaluation timing with right-censored reporting delays.

problem Improving risk evaluation under short observation windows due to administrative censoring.
method Jointly models parametric hazards for event and reporting processes, uses Monte Carlo expectation-maximization algorithm, and proposes transfer-learning procedure.
result Improves accuracy of timely risk evaluation under administrative censoring.

We propose RUDDER, a novel reinforcement learning approach for delayed rewards in finite Markov decision processes (MDPs). In MDPs the Q-values are equal to the expected immediate reward plus the expected future rewards. The latter are related to bias problems in temporal difference (TD) learning and to high variance p…

2018-06-20abs ↗pdf ↗

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.

This paper provides a mathematical framework for time-delay reservoir computing.

problem Lack of rigorous mathematical foundations for reservoir computing properties.
method Control-theoretic framework, formal definitions of separation and fading memory, explicit lower bound derivation.
result Established formal definitions and connections to stability notions for time-delay systems.

Sustaining efficiency and stability by properly controlling the equity to asset ratio is one of the most important and difficult challenges in bank management. Due to unexpected and abrupt decline of asset values, a bank must closely monitor its net worth as well as market conditions, and one of its important concerns …

2010-04-05abs ↗pdf ↗