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.

169,096 papers · 148 categories

Trend · papers per month

1.2%2.5%3.7%4.9% · Jun 202619922001200920182026
48 results for temporal differencing

This paper re-evaluates TD in deep RL, finding MC can be a viable alternative.

problem Understanding the role of temporal differencing (TD) in deep reinforcement learning.
method Designed environments to control for factors affecting performance in deep RL, comparing TD with infinite-horizon Monte Carlo (MC).
result Finite-horizon Monte Carlo is not inferior to TD, even with sparse or delayed rewards.

NoTMF forecasts sparse urban road movement speeds with nonstationary temporal matrix factorization.

problem Sparse and nonstationary movement speed data from urban roads.
method Nonstationary Temporal Matrix Factorization (NoTMF) model.
result NoTMF outperforms baseline models in forecasting urban road movement speeds.

The study compares differencing methods for financial data and finds fractional differencing improves model performance.

problem Improving financial time series forecasting models using appropriate data transformation techniques.
method Comparative analysis of traditional logarithmic returns and fractional differencing methods, including tempered extensions.
result Fractional differencing methods improve model forecasting performance and trading strategy effectiveness.

New method combines long-memory reservoirs for accurate dengue forecasting from short data.

problem Accurate dengue forecasting from short, noisy, non-stationary, and nonlinear data.
method Fractional ESN and Wavelet ESN frameworks integrating long-term memory.
result fESN and wESN outperform baselines in multiple dengue datasets and forecasting horizons.

A new method solves American put options with high accuracy and speed.

problem Solving American put options with high accuracy and speed.
method Adaptive fourth-order Runge-Kutta-Fehlberg method coupled with a fourth-order compact scheme.
result The method provides a more accurate solution and better performance in terms of computational speed.

New method for active subspace analysis reduces gradient evaluations needed.

problem Efficiently perform subspace sensitivity analysis on expensive or noisy functions.
method Develops acquisition functions for sequential learning of active subspaces using Gaussian process surrogate models.
result ASM estimator can be computed in closed form for Gaussian process surrogates, reducing need for finite differencing.

This study uses moving average cluster entropy to analyze financial market dynamics.

problem Understanding long-range dependence in financial markets.
method Moving average cluster entropy approach applied to ARFIMA and FBM processes.
result Long-range positive correlation in financial markets is linked to the cluster entropy behavior.

MIM networks predict non-stationary spatiotemporal dynamics using differential signals.

problem Predicting non-stationary spatiotemporal processes with high-order variations.
method Memory In Memory (MIM) networks with cascaded memory modules.
result Achieved state-of-the-art results on four spatiotemporal prediction tasks.

We develop methods to approximate derivatives for causal inference problems using data.

problem Estimating causal effects from data when distributions are not known.
method Constructive algorithm approximating Gateaux derivatives via finite differencing.
result Derives conditions for finite-difference approximations to preserve statistical benefits.

Study forecasts U.S. bond index using deep learning, finding persistence is key.

problem Forecasting U.S. aggregate bond index with deep learning methods.
method Constructed a stationary but maximally persistent representation of the bond index, evaluated using MLPs and CNNs.
result Deep learning models outperform traditional methods in short-horizon forecasting of bond indices.

The Whittle likelihood is a widely used and computationally efficient pseudo-likelihood. However, it is known to produce biased parameter estimates for large classes of models. We propose a method for de-biasing Whittle estimates for second-order stationary stochastic processes. The de-biased Whittle likelihood can be …

2016-05-22abs ↗pdf ↗

Method improves treatment effect prediction robust to unknown covariate shifts.

problem Estimating heterogeneous treatment effects for different populations.
method Post-processing CATE T-learners with multi-accurate predictors to handle unknown covariate shifts.
result Improves bias and mean squared error in simulations with covariate shifts.

Enhances SNNs for spatio-temporal feature extraction.

problem Insufficient temporal dependencies in existing SNN synaptic structures.
method Integrates temporal convolution and attention mechanisms into synaptic connections.
result Improves SNN performance on classification tasks.

MTRGL learns temporal correlations from multi-modal data for improved pair trading.

problem Discerning temporal correlations among financial entities.
method Combines time series data and discrete features into a temporal graph, using a memory-based temporal graph neural network.
result MTRGL outperforms traditional methods in temporal graph link prediction and pair trading.

Proposes a new model for complex multivariate event data.

problem Modeling complex multivariate event data with spatio-temporal dynamics.
method Integrates spatial information into latent state evolution through learned temporal and spatial decay dynamics.
result Successfully recovers sensible temporal and spatial intensity structure in multivariate spatio-temporal point patterns.

TG-GAN models dynamic graph evolution for continuous-time temporal graphs.

problem Challenges in modeling dynamic temporal graphs, especially in continuous time.
method Temporal Graph Generative Adversarial Network (TG-GAN) that models truncated edge sequences, time budgets, and node attributes.
result TG-GAN significantly outperforms existing methods in efficiency and effectiveness.

ATiSE embeds temporal information into KGs using time series decomposition.

problem Improving KG embedding models by incorporating temporal information.
method ATiSE uses Additive Time Series decomposition to map temporal KGs into multi-dimensional Gaussian distributions.
result ATiSE achieves state-of-the-art performance on link prediction over four temporal KGs.

New framework for unbiased sampling of temporal networks.

problem Challenges in analyzing and modeling large, continuous temporal networks.
method General framework for unbiased temporal network sampling with online, single-pass algorithms and unbiased estimators.
result Effective algorithms for fast, accurate, and memory-efficient statistical estimation of temporal network patterns and properties.

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.

TGAT learns node embeddings for evolving graphs, capturing both static and temporal features.

problem Learning node embeddings for dynamic graphs with evolving topological structures and temporal patterns.
method Temporal Graph Attention (TGAT) layer using self-attention and functional time encoding.
result TGAT model can inductively infer node embeddings for new and observed nodes as the graph evolves.

A framework uses deep learning for spatio-temporal data prediction.

problem Interpolation of continuous spatio-temporal fields on irregular points.
method Decomposes spatio-temporal processes into products of basis functions and spatial coefficients.
result Effectiveness in reconstructing coherent spatio-temporal fields.

Gradient descent forces neural network eigenvalues to a specific threshold.

problem Understanding why gradient descent drives eigenvalues to a specific threshold.
method Introduced edge coupling, a functional on consecutive iterate pairs, to explain the trajectory towards the eigenvalue threshold.
result Gradient descent forces the Hessian eigenvalue to the threshold 2/η2/η from arbitrary initialization.

TOQ-Nets learn to recognize complex temporal events with varying objects and sequences.

problem Recognizing complex relational-temporal events with varying numbers of objects and sequence lengths.
method Neuro-symbolic networks with reasoning layers for finite-domain quantification over objects and time.
result TOQ-Nets can generalize to scenarios with more objects than training data and temporal warpings.

STACI uses neural nets to estimate spatio-temporal fields with valid uncertainty quantification.

problem Scalable spatio-temporal deep learning models fail to capture underlying correlation structure.
method Variational Bayesian neural network approximation of non-stationary spatio-temporal Gaussian Process (GP) with conformal inference.
result STACI provides accurate prediction intervals for spatio-temporal processes, outperforming competing methods.