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

3468102136 · May 202619922001200920172026
48 results for Delay equations

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.

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 ↗

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.

The paper solves optimal control problems for stochastic delay equations.

problem Optimal control of stochastic delay differential equations.
method Rewriting the problem in an infinite-dimensional Hilbert space, using dynamic programming and viscosity solutions.
result Characterizes the value function as the unique viscosity solution of the Hamilton-Jacobi-Bellman equation.

The paper models financial asset prices with jumps and evaluates European option prices using numerical methods.

problem Modeling and pricing European options with jumps in delayed stochastic systems.
method Existence, uniqueness, and positivity of solutions to delayed stochastic differential equations with jumps. Application of Fourier transformation for analytical pricing and Monte-Carlo simulation with a logarithmic Euler-Maruyama scheme for numerical approximation.
result The logarithmic Euler-Maruyama scheme provides a positive and convergent method for approximating the solution to the delayed stochastic differential equations with jumps.

Proposes neural delay differential equations for stable system identification with partially observed states.

problem Learning stable models for systems with partial or delayed observations.
method Augments states with history, uses neural delay differential equations, and ensures stability through time delay analysis.
result The approach ensures stability of learned models for partially observed systems.

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.

This article is a sequel to [A.H.M.P]. In [A.H.M.P], we develop an explicit formula for pricing European options when the underlying stock price follows a non-linear stochastic delay equation with fixed delays in the drift and diffusion terms. In this article, we look at models of the stock price described by stochasti…

2006-04-28abs ↗pdf ↗

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.

In this paper we consider backward stochastic differential equations with time-delayed generators of a moving average type. The classical framework with linear generators depending on (Y(t),Z(t))(Y(t),Z(t)) is extended and we investigate linear generators depending on (1t0tY(s)ds,1t0tZ(s)ds)(\frac{1}{t}\int_0^tY(s)ds, \frac{1}{t}\int_0^tZ(s)ds). We…

2010-08-22abs ↗pdf ↗

Paper presents a novel method to assess boundedness and stability of nonlinear systems with variable delays.

problem Challenges in assessing boundedness and stability of vector nonlinear systems with variable delays and coefficients.
method Develops a novel framework to evaluate the evolution of solution norms in such systems by constructing scalar counterparts.
result Introduces new criteria for boundedness and stability and estimates the radii of containing balls for history functions.

HS-FNO models non-Markovian PDEs by learning history and future states.

problem Non-Markovian dynamics where future states depend on past history.
method History-Space Fourier Neural Operator (HS-FNO) for delay and memory-driven PDEs.
result HS-FNO achieves lowest aggregate errors across various PDE families.

Delay-SDE-net models time series with memory and uncertainty, outperforming other models.

problem Accurately modeling time series with memory and uncertainty.
method Stochastic delay differential equations (SDDEs) neural network model with aleatoric and epistemic uncertainty.
result The Delay-SDE-net consistently outperforms other models in predicting time series values and uncertainties.

We propose a quantum machine learning algorithm for efficiently solving a class of problems encoded in quantum controlled unitary operations. The central physical mechanism of the protocol is the iteration of a quantum time-delayed equation that introduces feedback in the dynamics and eliminates the necessity of interm…

2016-12-16abs ↗pdf ↗

We present a stochastic analysis of a data set consisiting of 10^6 quotes of the US Doller - German Mark exchange rate. Evidence is given that the price changes x(tau) upon different delay times tau can be described as a Markov process evolving in tau. Thus, the tau-dependence of the probability density function (pdf) …

2001-02-27abs ↗pdf ↗

This article is an extension of the work of one of us (Coopersmith, 2011) in deriving the relationship between certain interest rates and the inflation rate of a two component economic system. We use the well-known Fisher relation between the difference of the nominal interest rate and its inflation adjusted value to e…

2016-03-28abs ↗pdf ↗

We propose a model of inter-bank lending and borrowing which takes into account clearing debt obligations. The evolution of log-monetary reserves of NN banks is described by coupled diffusions driven by controls with delay in their drifts. Banks are minimizing their finite-horizon objective functions which take into a…

2016-07-21abs ↗pdf ↗

In this article we develop an explicit formula for pricing European options when the underlying stock price follows a non-linear stochastic differential delay equation (sdde). We believe that the proposed model is sufficiently flexible to fit real market data, and is yet simple enough to allow for a closed-form represe…

2006-04-28abs ↗pdf ↗

We propose an optimal portfolio problem in the incomplete market where the underlying assets depend on economic factors with delayed effects, such models can describe the short term forecasting and the interaction with time lag among different financial markets. The delay phenomenon can be recognized as the integral ty…

2018-05-03abs ↗pdf ↗

In this paper we show that there are applications that transform the movement of a pendulum into movements in R3\mathbb{R}^3. This can be done using Euler top system of differential equations. On the constant level surfaces, Euler top system reduces to the equation of a pendulum. Those properties are also considered in…

2009-05-27abs ↗pdf ↗

New Hessian estimates for heat equations on manifolds.

problem Estimating Hessian matrices for heat-type equations on Riemannian manifolds.
method Using Bismut-Stroock Hessian formula, with explicit coefficients and delay/growth rate functions.
result Novel backward weak Harnack inequality and precise pointwise Hessian estimates for eigenfunctions.

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.

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.

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.

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 ↗

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.