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

Trend · papers per month

1234 · Feb 202419922001200920172026
48 results for step-ahead

Paper adapts ACI for online multi-step time-series forecasting with coverage guarantees.

problem Achieving reliable error bounds in online multi-step time-series forecasting.
method Adaptive conformal inference (ACI) adapted for multi-step forecasting with dynamic significance levels.
result Proposes a multi-step ACI algorithm with finite-sample coverage guarantees for non-exchangeable data.

AEnbMIMOCQR generates robust multi-step ahead prediction intervals for time series data.

problem Generating reliable multi-step ahead prediction intervals for time series data.
method Adaptive ensemble batch multi-input multi-output conformalized quantile regression (AEnbMIMOCQR) based on conformal prediction principles.
result AEnbMIMOCQR provides close to exact coverage and robustness to distribution shifts.

The paper develops a method to forecast financial risk multiple steps ahead using quantile time series and historical simulation.

problem Forecasting financial risk multiple steps ahead with accurate estimation of Value-at-Risk (VaR) and Expected Shortfall (ES).
method Quantile-based, semi-parametric historical simulation estimation of VaR and ES models, using quantile loss function and resampling.
result The proposed method accurately forecasts VaR and ES one and multiple steps ahead, superior to existing methods.

This study proposes methods for multi-step-ahead stock price prediction using decomposition and neural networks.

problem Inaccurate one-step-ahead forecasting limits stock market decision-making.
method Two novel methods: DCT-MFRFNN and VMD-MFRFNN.
result VMD-MFRFNN outperforms other methods in multi-step-ahead stock price prediction.

Deep learning model predicts traffic flows across entire network for multiple steps ahead.

problem Accurately forecasting future traffic flows across all network links.
method Spatial-Temporal Sequence to Sequence (STSeq2Seq) model combining seq2seq and graph convolution.
result STSeq2Seq achieves state-of-the-art performance in traffic forecasting.

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.

BCI provides calibrated prediction intervals for time series forecasts.

problem Calibration of prediction intervals for time series forecasts.
method BCI wraps around any time series forecasting models and optimizes interval lengths using dynamic programming.
result BCI achieves long-term coverage under arbitrary distribution shifts and temporal dependence.

Quantile deep learning improves time series prediction accuracy and uncertainty quantification.

problem Uncertainty in multi-step time series prediction.
method Developed a novel quantile regression deep learning framework for multi-step time series prediction.
result Integrating quantile loss function with deep learning provides additional predictions for selected quantiles without loss in accuracy.

In this article the Lorenz dynamical system is revived and revisited and the current state of the art results for one step ahead forecasting for the Lorenz trajectories are published. Multitask learning is shown to help learning the hard to learn z trajectory. The article is a reflection upon the evolution of neural ne…

2019-03-18abs ↗pdf ↗

MAGMA uses a common mean process to improve multi-step-ahead time series forecasting.

problem Improving multiple-step-ahead predictions for time series data.
method Proposes a novel multi-task Gaussian process framework with a common mean process for sharing information across tasks.
result Significantly improves predictive performances, even far from observations, and reduces computational complexity.

Under a Bayesian framework, we formulate the fully sequential sampling and selection decision in statistical ranking and selection as a stochastic control problem, and derive the associated Bellman equation. Using value function approximation, we derive an approximately optimal allocation policy. We show that this poli…

2017-10-07abs ↗pdf ↗

Paper compares GCNs and MPNNs, finding GCNs are one step ahead of WL algorithm.

problem Comparing graph convolutional networks (GCNs) and message-passing neural networks (MPNNs).
method Casts GCNs and MPNNs as MPNNs, studies distinguishing power of different architectures.
result GCNs are one step ahead of the Weisfeiler-Lehman (WL) algorithm in distinguishing power.

Model-based reinforcement learning (MBRL) has been shown to be a powerful framework for data-efficiently learning control of continuous tasks. Recent work in MBRL has mostly focused on using more advanced function approximators and planning schemes, with little development of the general framework. In this paper, we id…

2020-02-11abs ↗pdf ↗

The stock market prediction has always been crucial for stakeholders, traders and investors. We developed an ensemble Long Short Term Memory (LSTM) model that includes two-time frequencies (annual and daily parameters) in order to predict the next-day Closing price (one step ahead). Based on a four-step approach, this …

2020-01-10abs ↗pdf ↗

New budget quantifies drift in closed-loop learning, improving reproducibility.

problem Characterizing statistical learning under distributional drift in closed-loop settings.
method Introduces an intrinsic drift budget CTC_T quantifying cumulative information-geometric motion of the data distribution.
result Proves a drift-feedback bound of order T1/2+CT/TT^{-1/2}+C_T/T for prequential reproducibility, up to controlled second-order remainder terms.

An algorithm based on Renormalization Group (RG) to analyze time series forecasting was proposed in cond-mat/0110285. In this paper we explicitly code and test it. We choose in particular some financial time series (stocks, indexes and commodities) with daily data and compute one step ahead forecasts. We then construct…

2008-05-21abs ↗pdf ↗

JANET improves time series prediction with adaptive uncertainty regions.

problem Time series data's lack of exchangeability and multi-step prediction challenges.
method Proposes JANET, a framework for joint adaptive prediction regions with controlled error rates.
result Demonstrates superior performance in multi-step prediction tasks across diverse datasets.

New models analyze how ECB's unconventional policies affect stock market volatility.

problem Analyzing the impact of ECB's unconventional policies on stock market volatility.
method Developed MEM with Asymmetry and Policy effects (MAP) models to separate base volatility from policy effects.
result Significant improvement in forecasting power after Expanded Asset Purchase Programme implementation.

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.

The Teacher Forcing algorithm trains recurrent networks by supplying observed sequence values as inputs during training and using the network's own one-step-ahead predictions to do multi-step sampling. We introduce the Professor Forcing algorithm, which uses adversarial domain adaptation to encourage the dynamics of th…

2016-10-27abs ↗pdf ↗

Recently, a novel class of Approximate Policy Iteration (API) algorithms have demonstrated impressive practical performance (e.g., ExIt from [2], AlphaGo-Zero from [27]). This new family of algorithms maintains, and alternately optimizes, two policies: a fast, reactive policy (e.g., a deep neural network) deployed at t…

2018-05-28abs ↗pdf ↗

Deep state space model forecasts time series with uncertainty.

problem Probabilistic forecasting for risk management.
method Parameterized deep networks for non-linear models, recurrent neural nets for dependency, ARD network for exogenous variables.
result Accurate and sharp probabilistic forecasts with realistic uncertainty growth.

Paper analyzes time series prediction using empirical risk minimization.

problem Optimizing 1-step-ahead prediction for time series.
method Empirical risk minimization applied to recursive algorithms for time series forecasting.
result Empirical risk minimization achieves optimal predictive performance.