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

58117175233 · Jun 202019922001200920172026
48 results for Time-delayed relations

New method disentangles latent variables in nonstationary data.

problem Disentangling latent variables in nonstationary sequential data.
method NCTRL framework exploiting Markov assumption and temporal structure.
result Independent latent components can be recovered from nonlinear mixture without auxiliary variables.

Granger causality is a fundamental technique for causal inference in time series data, commonly used in the social and biological sciences. Typical operationalizations of Granger causality make a strong assumption that every time point of the effect time series is influenced by a combination of other time series with a…

2019-12-18abs ↗pdf ↗

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.

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.

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 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.

In this paper we show that several dynamical systems with time delay can be described as vector fields associated to smooth functions via a bracket of Leibniz structure. Some examples illustrate the theoretical considerations.

2005-08-12abs ↗pdf ↗

Time-delayed embeddings avoid self-intersections for high enough delay.

problem Analyzing self-intersections in time-delayed embeddings.
method Study of time-delayed coordinate maps for diffeomorphisms on compact manifolds.
result For high enough delay, time-delayed embeddings avoid self-intersections almost everywhere.

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 ↗

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 ↗

Improved modeling of chaotic systems using time-delay embeddings and Frenet-Serret frame.

problem Identifying effective coordinate systems for nonlinear dynamical systems.
method Developed a new algorithm to identify more stable and accurate models from less data, leveraging the connection between HAVOK and Frenet-Serret frame.
result The sub- and super-diagonal entries of the linear model correspond to intrinsic curvatures in Frenet-Serret frame.

Framework LiLY recovers latent causal variables from time-series data under distribution shifts.

problem Learning and correcting models under unknown distribution shifts in time-series data.
method LiLY framework that recovers latent causal variables and identifies their relations from temporal data under different distribution shifts.
result The framework reliably identifies time-delayed latent causal influences from observed variables under different distribution changes.

New framework TDRL identifies latent causal variables from sequential data.

problem Identify latent causal variables from sequential data.
method Proposes TDRL framework to recover time-delayed latent causal variables and identify their relations from measured sequential data.
result Identifies latent causal variables reliably from sequential data.

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.

ERDMD discovers sparse, nonuniformly timed DMD models from chaotic attractors.

problem Discovering high-fidelity, nonuniformly timed DMD models from chaotic data.
method Entropic regression for nonlinear information flow detection, combined with multi-step DMD.
result ERDMD produces highly efficient and robust models with minimal complexity.

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 ↗

Neural Laplace Control tackles offline RL for continuous-time delayed systems with irregular observations.

problem Offline reinforcement learning problems involving continuous-time environments with delays and irregular observations.
method Combines a Neural Laplace dynamics model with a model predictive control (MPC) planner.
result Achieves near expert policy performance on continuous-time delayed environments.

We consider the static and dynamic models of Cournot duopoly with tax evasion. In the dynamic model we introduce the time delay and we analyze the local stability of the stationary state. There is a critical value of the delay when the Hopf bifurcation occurs.

2007-06-05abs ↗pdf ↗

Study extends Lévy models to capture market propagation delays.

problem Capturing sudden events in related markets with stochastic delays.
method Extend multivariate Lévy models using self-decomposability and multivariate subordination.
result Derived closed-form expressions for characteristic function and implemented Monte Carlo scheme.

LEAP identifies latent causal variables from temporal data.

problem Recovering time-delayed latent causal variables from general temporal data.
method Proposes LEAP, a framework that extends VAEs with constraints for temporally causal latent processes.
result Successfully identifies temporally causal latent processes from observed variables under various dependency structures.

New framework IDOL identifies latent causal processes with instantaneous relations from time series data.

problem Identifying latent causal processes with instantaneous relations from time series data.
method Sparse influence constraint and variational inference architecture with sparsity regularization.
result Our method can identify latent causal processes with instantaneous relations.

Parsimonious Dynamic Mode Decomposition selects sparse modes robustly.

problem Manual tuning of sparsity parameters in traditional DMD.
method Time-delay embedding and Orthogonal Matching Pursuit.
result Autonomously determines optimally sparse subset of modes.

Novel method discovers causal relations in time series data, even with autocorrelation.

problem Discovering causal relations in time series data with strong autocorrelation.
method Conditional independence (CI) based PCMCI+^+ method, optimized for contemporaneous and lagged links.
result PCMCI+^+ outperforms other methods in detecting causal links and controlling false positives.

New method constructs multilayer networks from financial data, capturing dependencies across different risk factors.

problem Difficult construction of multilayer networks, neglecting time delays and interdependencies.
method Tucker tensor autoregression for direct multilayer network construction.
result Captures within and between connections, identifies strong interconnections between volumes and prices layers.

This study uses persistent homology to analyze complex transitional networks from time series data.

problem Lack of effective tools to summarize complex topology in transitional networks.
method Persistent homology from topological data analysis applied to coarse-grained state-space networks (CGSSN).
result CGSSN improves dynamic state detection and noise robustness compared to other methods.

Aggregation distorts causal discovery results but recovery is possible with partial linearity or prior.

problem Understanding how temporal aggregation affects causal discovery in aggregated data.
method Functional consistency and conditional independence consistency methods.
result Causal discovery results may be distorted by aggregation, but recovery is possible with certain conditions.

New method recovers radar and communication signals from overlaid data.

problem Recover radar and communication signals from overlaid data with unknown parameters.
method Propose minimizing the sum of multivariate atomic norms (SoMAN) for multi-antenna receiver.
result Minimum number of samples and antennas required for perfect recovery is logarithmically dependent on the maximum of radar targets and communications paths.