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

Trend · papers per month

2.2%4.4%6.6%8.8% · Apr 202619922001200920172026
48 results for sequential forecasting

A new framework detects forecast model inadequacies using online monitoring of forecast errors.

problem Inaccurate forecasts lead to poor decision-making in complex models.
method Sequential changepoint techniques on forecast errors for real-time identification of process changes.
result The framework identifies shifts in forecast errors faster than in the original models, indicating process changes.

Paper analyzes Nyström regularization for time series forecasting with sequential sub-sampling.

problem Learning rate analysis of Nyström regularization for ττ-mixing time series.
method Banach-valued Bernstein inequality and integral operator approach for ττ-mixing sequences.
result Almost optimal learning rates for Nyström regularization with sequential sub-sampling.

Introduces recency bias to improve time-series forecasting.

problem Lack of recency bias in standard Transformer attention for time-series data.
method Reweights attention scores with a smooth heavy-tailed decay to emphasize nearby observations.
result Recency-biased attention consistently improves sequential modeling and achieves competitive performance on time-series forecasting benchmarks.

New method recalibrates VaR for option books, reducing forecast errors.

problem Inaccurate VaR forecasts due to missing operational choices.
method Marking-aware sequential VaR recalibration targeting normalized book-level loss.
result Sequential VaR recalibration improves VaR performance across different markets and options.

SOR-Mamba improves Mamba for robust time series forecasting by minimizing channel order bias.

problem Robust time series forecasting with Mamba's sequential order bias.
method SOR-Mamba incorporates regularization to minimize channel order discrepancy and introduces CCM for channel correlation preservation.
result SOR-Mamba enhances robustness to channel order and improves forecasting accuracy.

RNN-HAR model improves VaR forecasting with long-memory and non-linear dynamics.

problem Efficiently forecasting Value at Risk (VaR) with long-memory and non-linear realized volatility.
method Loss-based generalized Bayesian inference with Sequential Monte Carlo for model estimation and prediction.
result RNN-HAR model consistently outperforms other VaR forecasting models.

Time series forecasting is difficult. It is difficult even for recurrent neural networks with their inherent ability to learn sequentiality. This article presents a recurrent neural network based time series forecasting framework covering feature engineering, feature importances, point and interval predictions, and for…

2019-01-01abs ↗pdf ↗

Unified deep sequential and state-space models for robust option pricing with uncertainty.

problem Combining robustness to noise and uncertainty measurement in option pricing models.
method Unscattered reservoir smoother (URS) integrating deep sequential and state-space models.
result URS achieves competitive forecasting accuracy and uncertainty measurement in noisy datasets.

The purpose of this paper is to propose a time-varying vector autoregressive model (TV-VAR) for forecasting multivariate time series. The model is casted into a state-space form that allows flexible description and analysis. The volatility covariance matrix of the time series is modelled via inverted Wishart and singul…

2008-02-01abs ↗pdf ↗

Prequential posteriors tackle data assimilation for deep generative forecasting models.

problem Challenges in assimilating data into deep generative forecasting models due to intractable likelihood functions.
method Introduces prequential posteriors based on a predictive-sequential loss function, proving consistency under mild conditions, and using parallelizable SMC samplers for scalable inference.
result Prequential posteriors concentrate around parameters with optimal predictive performance, validating method on synthetic and real-world datasets.

Structured subsampling improves privacy in deep time series forecasting.

problem Incompatible privacy guarantees with time series forecasting.
method Structured subsampling of sequential data for privacy amplification.
result Structured subsampling enables training with strong privacy guarantees.

Generative networks minimize predictive scoring rules for probabilistic forecasting.

problem Evaluating and improving probabilistic forecasts using generative models.
method Training generative networks to minimize predictive-sequential scoring rules on temporal sequences.
result Our method outperforms adversarial approaches in probabilistic calibration.

New framework optimizes forecasting and decision-making in dynamic systems.

problem Optimizing forecasting and decision-making processes in dynamic systems.
method Closed-loop framework using bilevel optimization.
result The proposed methodology yields consistently better performance than the standard open-loop approach.

We develop a new DTSM with nonlinearities using Gaussian Processes for better interest rate forecasting.

problem Linear DTSMs fail to capture nonlinear relationships between macroeconomic variables and interest rates.
method We propose a Gaussian Process-based sequential Monte Carlo estimation and forecasting scheme.
result Nonlinear models outperform linear ones in forecasting core inflation, leading to significant economic value gains.

In this paper we develop a Bayesian procedure for estimating multivariate stochastic volatility (MSV) using state space models. A multiplicative model based on inverted Wishart and multivariate singular beta distributions is proposed for the evolution of the volatility, and a flexible sequential volatility updating is …

2007-08-31abs ↗pdf ↗

Production forecasting is a key step to design the future development of a reservoir. A classical way to generate such forecasts consists in simulating future production for numerical models representative of the reservoir. However, identifying such models can be very challenging as they need to be constrained to all a…

2018-11-30abs ↗pdf ↗

Dynamic probabilistic forecasts guide optimal decisions in uncertain processes.

problem Optimal decision making in processes influenced by uncertain random factors.
method Stochastic models for probabilistic forecast evolution, calibrated from ensemble forecasts.
result Optimal decision strategies determined using dynamic probabilistic forecasts.

Novel time series forecasting method using sliding window signatures.

problem Challenges in forecasting nonlinear and delayed time series data.
method Ridge regression with signature features calculated on sliding windows.
result Signature features effectively encode temporal and nonlinear dependencies, leading to accurate forecasts.

This work addresses identifiability in sequential data with switching dynamics, introducing a new estimator.

problem Identifiability of sequential data with regime-switching dynamics under flexible assumptions.
method Introduces ΩΩSDS, a flow-based estimator for exact likelihood optimization.
result Demonstrates improved disentanglement and more accurate forecasting compared to VAE-based estimators.

STOIC improves energy demand forecasting with reliable uncertainty estimates.

problem Accurate point forecasts alone are insufficient for energy systems; reliable uncertainty estimates are needed.
method Integrates graph-based forecasting with tabular foundation models for zero-shot calibration of spatial-temporal residuals.
result STOIC delivers more reliable and robust uncertainty estimates for complex graph-structured energy time series.

New RNN model forecasts unseen time series with little training data.

problem Lack of data for RNNs to generalize well in time series forecasting.
method Proposes a novel RNN-based model that learns shared feature embeddings over quantised time series.
result Accurately forecasts unseen time series with minimal training data.

This work combines recurrent models with diffusion for probabilistic time series forecasting.

problem Scalability and capturing high-dimensional distributions and cross-feature dependencies in time series forecasting.
method Combines recurrent neural networks' efficiency with diffusion models' probabilistic modeling, using stochastic interpolants and conditional generation.
result Offers scalable probabilistic time series forecasting methods.

Generative adversarial network for probabilistic forecasting of random systems.

problem Forecasting random dynamical systems without distributional assumptions.
method Recurrent neural network and generative adversarial network (GAN) with regularization based on maximum mean discrepancy (MMD).
result The proposed model successfully forecasts complex stochastic processes with multiple-step predictions.

Combines machine learning and data assimilation for improved forecasting.

problem Improving forecast accuracy with noisy observations.
method Sequentially learns a machine-learning model using an ensemble Kalman filter.
result The combined model achieves good forecast skill and computational efficiency.

We propose a framework for general probabilistic multi-step time series regression. Specifically, we exploit the expressiveness and temporal nature of Sequence-to-Sequence Neural Networks (e.g. recurrent and convolutional structures), the nonparametric nature of Quantile Regression and the efficiency of Direct Multi-Ho…

2017-11-29abs ↗pdf ↗

ResCP uses reservoir computing to create efficient, scalable time series prediction intervals.

problem Building distribution-free prediction intervals for time series data with small sample sizes and changing distributions.
method Reservoir Conformal Prediction (ResCP) leverages reservoir computing to dynamically reweight conformity scores based on similarity among reservoir states.
result ResCP achieves asymptotic conditional coverage and is effective across diverse forecasting tasks.

The paper studies the distance from calibration in sequential prediction, proving upper and lower bounds.

problem The challenge is to measure and minimize the deviation from perfect calibration in sequential binary prediction.
method The approach involves proving an O(T)O(\sqrt{T}) upper bound and an Ω(T1/3)Ω(T^{1/3}) lower bound, using structural results and minimax arguments.
result An O(T)O(\sqrt{T}) upper bound on the calibration distance is achieved, with an Ω(T1/3)Ω(T^{1/3}) lower bound showing the inherent difficulty.

We establish optimal rates for online regression for arbitrary classes of regression functions in terms of the sequential entropy introduced in (Rakhlin, Sridharan, Tewari, 2010). The optimal rates are shown to exhibit a phase transition analogous to the i.i.d./statistical learning case, studied in (Rakhlin, Sridharan,…

2014-02-11abs ↗pdf ↗

Multivariate boosted trees improve forecasting and control by capturing correlated predictions.

problem Capturing multivariate target cross-correlations and applying structured penalties to predictions.
method A computationally efficient algorithm for fitting multivariate boosted trees.
result Multivariate trees outperform univariate counterparts in correlated prediction scenarios.

This paper combines and improves probabilistic forecasts of wind speeds using advanced statistical methods.

problem Improving accuracy and reliability of probabilistic forecasts in wind speed prediction.
method Adapting prediction with expert advice theory to probabilistic forecasts, combining raw or post-processed ensembles, and using CRPS and Jolliffe-Primo tests.
result Combining probabilistic forecasts can lead to more reliable and skillful predictions, as shown by the Jolliffe-Primo test.

Paper presents a method for probabilistic load forecasting using adaptive online learning.

problem Inability to assess intrinsic uncertainties and capture dynamic changes in consumption patterns.
method Adaptive online learning of hidden Markov models for recursive parameter updates and sequential prediction.
result Significant improvement in performance compared to existing techniques across various scenarios.

This paper establishes minimax rates for online regression with arbitrary classes of functions and general losses. We show that below a certain threshold for the complexity of the function class, the minimax rates depend on both the curvature of the loss function and the sequential complexities of the class. Above this…

2015-01-26abs ↗pdf ↗

We consider the setting of sequential prediction of arbitrary sequences based on specialized experts. We first provide a review of the relevant literature and present two theoretical contributions: a general analysis of the specialist aggregation rule of Freund et al. (1997) and an adaptation of fixed-share rules of He…

2012-07-09abs ↗pdf ↗