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,341 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Jun 199319922001200920182026
48 results for exponential time differencing

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.

The study proves fractional-order differences and equations are key to modeling long and short memory in economics.

problem Modeling long and short memory in economic processes with discrete fractional differencing and integration.
method Proved discrete fractional differencing and integration are Grunwald-Letnikov fractional differences of non-integer order d. ARIMA and ARFIMA models are fractional-order difference equations. Proved exact fractional-order differences are needed for power law memory.
result Fractional differential equations are necessary for modeling continuous time long and short memory with power law.

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.

This study examines chaos in FIGARCH processes using various metrics.

problem Analyzing chaos in FIGARCH processes for financial time series.
method Computed mutual information, correlation dimensions, FNNs, Lyapunov exponents for FIGARCH (p,d,q) processes and financial time series.
result Maximal Lyapunov exponents are negative, suggesting FIGARCH (p,d,q) is not deterministic chaotic.

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.

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.

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.

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.

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.

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.

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.

Proposes a new model using exponential smoothing cells for robust time series analysis.

problem Challenges of traditional exponential smoothing in noisy data and changing series.
method Flexible model using exponential smoothing cells for overlapping time windows, solving a structured convex optimization problem.
result Can detect and remove outliers, denoise data, fill in missing observations, and provide meaningful forecasts.

New model captures time-varying volatility with stochastic exponential tails.

problem Capturing time-varying volatility and stochastic skewness in financial markets.
method Normal Tempered Stable distribution with time-varying parameter.
result Model better explains market option prices with stochastic exponential tails.

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.

A fast, accurate method for pricing American options with free boundaries.

problem Pricing American options with free boundaries efficiently and accurately.
method A sixth-order compact finite difference scheme with a dynamic staggered boundary scheme and 3(2) R-K Bogacki-Shampine time stepping.
result An efficient sixth-order compact scheme for pricing American options with free boundaries.

Exponentially smoothed RNNs improve industrial forecasting.

problem Complexity and non-stationarity in industrial time series data.
method Exponential smoothed recurrent neural networks (RNNs) for modeling non-linear dynamics.
result Exponentially smoothed RNNs outperform traditional models in multi-step forecasting.

Develops a new exponential map for time-varying vector fields.

problem Lack of global flows for general time-varying vector fields.
method Categorical development of spaces of vector fields and flows, allowing for systematic localisation.
result Derives the homeomorphism of the exponential map for vector fields with measurable time-dependence.

Develops SQR models for multivariate exponential families allowing positive dependencies.

problem Lack of positive dependencies in multivariate graphical models for exponential and Poisson distributions.
method Introduces Square Root Graphical Models (SQR) derived from univariate exponential distributions, with methods for parameter estimation and likelihood approximation.
result Allows for arbitrary positive and negative dependencies in multivariate distributions without constraints on parameter values.

New Thompson sampling algorithm reduces regret for exponential family bandits.

problem Minimizing regret in multi-armed bandit problems with exponential family rewards.
method Proposes ExpTS and ExpTS+^+ algorithms using novel sampling distributions.
result Minimizes both finite-time and asymptotic regret for exponential family rewards.

This paper extends exponential smoothing to distributional time series using Wasserstein distance.

problem Forecasting distributional time series with exponential smoothing.
method Generalized exponential smoothing in Wasserstein space, with consistent parameter estimation.
result Wasserstein exponential smoothing outperforms traditional methods in high-frequency financial and electricity demand data.

Study optimal strategy for maximizing exponential utility in financial market with linear price impact.

problem Maximizing exponential utility in financial market with linear price impact.
method Purely probabilistic approach using duality.
result Computed optimal portfolio strategy and value for Ornstein-Uhlenbeck process.