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

Trend · papers per month

177353530706 · Jun 202019922001200920182026
48 results for time series averaging

This paper improves forecasts for diverse time series by averaging similar ones.

problem Forecasting challenges in heterogeneous time series.
method Dynamic Time Warping to find similar time series, k-Nearest Neighbor averaging.
result Averaging improves forecasts of simple models.

We analyze the question whether sliding window time averages applied to stationary increment processes converge to a limit in probability. The question centers on averages, correlations, and densities constructed via time averages of the increment x(t,T)=x(t+T)-x(t)and the assumption is that the increment is distribute…

2008-04-06abs ↗pdf ↗

Automatically extracts features from time series data for improved forecasting.

problem Manual feature selection for time series forecasting is inefficient and prone to errors.
method Extracts features from time series using recurrence plots and computer vision algorithms.
result Automatically extracted features lead to highly comparable and sometimes superior forecasting performance.

The study revisits inaccuracies in time series averaging under dynamic time warping.

problem Inaccuracies in time series averaging under dynamic time warping.
method Analysis of existing correctness-criterion and introduction of drift-outs, showing their insufficiency and inconclusiveness.
result Sample means as global minimizers of a Fréchet function never drift out, and the adjusted drift-out is a test for coherence.

Neural moving average model speeds up state space model inference for time series data.

problem Efficiently scaling approximate Bayesian inference for time series data.
method Proposes a novel generative model (neural moving average model) for latent temporal states in state space models.
result Achieves accurate parameter estimation in a short time for various models.

TTW aligns time-series faster and more accurately than existing methods.

problem Efficiently aligning multiple time-series signals with varying lengths.
method TTW uses a sinc convolutional kernel and gradient-based optimization for linear time and sequence complexity.
result TTW outperforms existing methods in time-series averaging and classification tasks.

AverageTime uses simple averaging to enhance long-term time series forecasting.

problem Long-term time series forecasting with improved intra-sequence and cross-channel dependencies.
method Proposes AverageTime, a simple, efficient, and scalable forecasting model that reframes channel extraction as a stackable architecture.
result AverageTime surpasses state-of-the-art models in forecasting performance with near-linear complexity.

SummerTime summarizes variable-length time series for machine learning applications.

problem Classical machine learning methods struggle with variable-length time series data.
method Summarizes time series into a fixed-length feature vector using Gaussian Mixture Models (GMM).
result Improves classification and regression performance in physical activity analysis.

Forecasting time series data is an important subject in economics, business, and finance. Traditionally, there are several techniques to effectively forecast the next lag of time series data such as univariate Autoregressive (AR), univariate Moving Average (MA), Simple Exponential Smoothing (SES), and more notably Auto…

2018-03-16abs ↗pdf ↗

The level crossing and inverse statistics analysis of DAX and oil price time series are given. We determine the average frequency of positive-slope crossings, να+ν_α^+, where Tα=1/να+T_α =1/ν_α^+ is the average waiting time for observing the level αα again. We estimate the probability P(K,α)P(K, α), which provides us the probab…

2010-01-25abs ↗pdf ↗

Automatically learns summary features from time series data for likelihood-free inference.

problem Necessity of hand-tailored summary features for time series data in likelihood-free inference.
method Data-driven approach to automatically learn summary features.
result Learning summary features from data can outperform hand-crafted values in likelihood-free inference.

Two possible definitions of fixed points in the self-similar analysis of time series are considered. One definition is based on the minimal-difference condition and another, on a simple averaging. From studying stock market time series, one may conclude that these two definitions are practically equivalent. A forecast …

1998-03-05abs ↗pdf ↗

Automated smoothing does not significantly improve time series classification performance.

problem Improving time series classification algorithms using automated smoothing methods.
method Assessed six smoothing algorithms (moving average, exponential, etc.) on three benchmark classifiers.
result No significant improvement in performance over unsmoothed data.

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.

Adaptive estimation for nonstationary time series reduces computational cost.

problem Estimating parameters of nonstationary time series with varying parameters over time.
method Moving exponential moving ML estimator for scale parameter estimation.
result Significantly improved log-likelihoods compared to standard estimation.

Proposes GDTW for aligning time series on different, incomparable spaces.

problem Dynamic time warping requires comparable spaces, but time series can live on different, incomparable spaces.
method Gromov dynamic time warping (GDTW) considers intra-relational geometry to avoid comparability requirements.
result Demonstrates effectiveness of GDTW in aligning, combining, and comparing time series on incomparable spaces.

Bayesian stacking improves model performance with varying model weights.

problem Improving model predictions with heterogeneous input performance.
method Bayesian hierarchical stacking with varying model weights inferred via Bayesian inference.
result Hierarchical stacking yields better predictions than linear averaging.

Long short-term memory network outperforms seasonal model in JSE Top 40 forecasting.

problem Comparing neural network performance to traditional models in financial forecasting.
method Used long short-term memory network for JSE Top 40 return data forecasting.
result Long short-term memory network outperforms seasonal model in forecasting.

Model selection for time series forecasting can be biased by the distribution of scores.

problem Model selection for probabilistic forecasting on time series data.
method Using proper scoring rules to aggregate scores across multiple time series.
result The mean score is immune to the skewness of the score distribution.

Paper develops a method for estimating spectral density matrices in high-dimensional time series.

problem Estimating spectral density matrices in high-dimensional time series.
method Thresholded versions of averaged periodograms for regularized estimation.
result Consistent estimation of spectral density matrices possible under high-dimensional regime.

Enhances financial time series forecasting with a multi-period learning framework.

problem Accurate financial time series forecasting requires considering both short-term and long-term trends.
method Proposes a Multi-period Learning Framework (MLF) with three modules: Inter-period Redundancy Filtering, Learnable Weighted-average Integration, and Multi-period self-Adaptive Patching.
result Improves financial time series forecasting accuracy and efficiency.

Paper develops methods for inference on time series data using neural networks and sieves.

problem Inference on time series data with nonparametric conditional moment restrictions.
method GN-QLR based inference using general nonlinear sieves and multilayer neural networks.
result Optimally weighted GN-QLR statistic is asymptotically Chi-square distributed.

Paper analyzes electricity price and demand data to detect cyber-attacks using time series methods.

problem Detecting cyber-attacks in electricity price and demand data.
method Time series analysis, including moving average, moving standard deviation, and augmented Dickey-Fuller test.
result Identified anomalies in the data using time-series stationary criteria.

A new framework evaluates deep learning vs classical forecasting methods for time series predictions.

problem Current forecasting model evaluation metrics fail to capture model performance differences.
method Proposes a novel framework for evaluating univariate time series forecasting models from multiple perspectives.
result Deep learning models like NHITS outperform classical methods in multi-step ahead forecasting but not in anomaly handling.

The existence of forbidden patterns, i.e., certain missing sequences in a given time series, is a recently proposed instrument of potential application in the study of time series. Forbidden patterns are related to the permutation entropy, which has the basic properties of classic chaos indicators, thus allowing to sep…

2007-11-05abs ↗pdf ↗

Hopformer combines common trends with series-specific details for better time series forecasting.

problem Forecasting multiple time-series with high-dimensional covariates while retaining series-specific information.
method Hopformer uses a two-stage framework: SPA for common trends and LoRA-fine-tuned Transformer for residual dependencies.
result Improves MASE by an average of 6.56% across synthetic and real-world benchmarks.

Bayesian QFSTS model tackles feature selection in quantile time series analysis.

problem Quantile feature selection in correlated multivariate time series data.
method Bayesian dimension reduction methodology using QFSTS model with multivariate asymmetric Laplace distribution, spike-and-slab prior, Metropolis-Hastings algorithm, and Bayesian model averaging.
result QFSTS model outperforms in feature selection, parameter estimation, and forecasting.

Bayesian neural network predicts cyclical time series with SVGD and reduced error.

problem Predicting cyclical time series data with calibrated uncertainties.
method Bayesian framework using SVGD to train a feed-forward DetNN.
result The BNN reduces average estimation error by 10% compared to MLP.

New RDPC dissimilarity measure improves time series clustering.

problem Improving time series clustering methods for diverse data.
method Combining weighted Pearson correlation with largest element-wise differences.
result RDPC outperforms existing methods in complex datasets.

We propose in this paper a differentiable learning loss between time series, building upon the celebrated dynamic time warping (DTW) discrepancy. Unlike the Euclidean distance, DTW can compare time series of variable size and is robust to shifts or dilatations across the time dimension. To compute DTW, one typically so…

2017-03-05abs ↗pdf ↗