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

Trend · papers per month

5101419 · Jun 202019922001200920172026
48 results for multi-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.

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.

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.

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.

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.

Study non-parametric value function estimation from a single path.

problem Estimating value function from a single trajectory in Markov reward processes.
method Kernel-based multi-step temporal difference (TD) estimates, including KK-step look-ahead TD and TD(λ)(λ).
result Non-asymptotic guarantees for TD estimates, capturing interactions between mixing time and model mis-specification.

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.

Adaptive optimal control of nonlinear dynamic systems with deterministic and known dynamics under a known undiscounted infinite-horizon cost function is investigated. Policy iteration scheme initiated using a stabilizing initial control is analyzed in solving the problem. The convergence of the iterations and the optim…

2015-05-20abs ↗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.

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.

The paper calculates prices for multi-step barrier options under the Black-Scholes model.

problem Calculating prices for multi-step barrier options with varying barriers and time steps.
method Derives a general, explicit expression for option prices using the Black-Scholes model and a multi-step reflection principle.
result Derives a multi-step reflection principle that generalizes the reflection principle of Brownian motion.

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 ↗

Efficiently optimizes expensive functions with multi-step lookahead using one-shot optimization.

problem Optimizing expensive functions with long-term impacts using myopic approaches.
method Formulated as nested optimization problems within a multi-step scenario tree, optimized in one-shot fashion.
result Multi-step expected improvement is computationally tractable and outperforms existing methods.

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.

Stanza models complex time series with balance between traditional and deep learning approaches.

problem Capturing long-term structure in non-stationary time series.
method Nonlinear, non-stationary state space model.
result Achieves forecasting accuracy competitive with deep LSTMs, especially for multi-step ahead forecasting.

Paper presents a copula-based method to efficiently generate correlated sample paths from multi-step time series models.

problem Generating realistic correlation structures in multi-step forecast sample paths is expensive and time-consuming.
method Copula-based approach to generate correlated sample paths in one forward pass.
result Improved sample path quality and significant speedup over autoregressive sampling.

Framework predicts and prepares for rain-induced microwave link attenuation.

problem Severe signal attenuation due to weather conditions degrades network performance.
method Predictive Network Reconfiguration (PNR) framework using LSTM for attenuation prediction and MSNR for dynamic routing.
result Framework improves network utilization by more than 200% compared to reactive algorithms.

Planning has been very successful for control tasks with known environment dynamics. To leverage planning in unknown environments, the agent needs to learn the dynamics from interactions with the world. However, learning dynamics models that are accurate enough for planning has been a long-standing challenge, especiall…

2018-11-12abs ↗pdf ↗

Reinforcement learning has attracted great attention recently, especially policy gradient algorithms, which have been demonstrated on challenging decision making and control tasks. In this paper, we propose an active multi-step TD algorithm with adaptive stepsizes to learn actor and critic. Specifically, our model cons…

2019-11-11abs ↗pdf ↗

Study shows optimal RL with transition look-ahead is NP-hard for 2\ell \geq 2.

problem Optimal reinforcement learning with transition look-ahead is computationally hard.
method Proved NP-hardness for 2\ell \geq 2 using linear programming.
result There is a precise boundary between tractable and intractable cases for RL with look-ahead.

The paper introduces a multi-step loss function to improve model-based reinforcement learning.

problem Compounding of one-step prediction errors in long trajectories.
method A multi-step objective function combining MSE losses at various future horizons.
result Models trained with the multi-step loss achieve significant improvement in future prediction.

Looped Transformers learn to implement multi-step gradient descent for in-context learning.

problem Understanding the learnability of multi-step algorithms in multi-layer Transformers.
method Training weight-sharing looped Transformers for in-context linear regression, proving gradient dominance condition for convergence.
result Looped Transformers implement multi-step preconditioned gradient descent, converging to global minimizer.

Paper proposes a dual-level approach for multi-step forecasting of dynamical systems.

problem Accurate multi-step forecasting of time series systems for automatic control and optimization.
method Hybrid input forecasting using LSTM-STMs and physics-informed neural networks (PINNs).
result Hybrid models achieve higher log-likelihood and lower MSE compared to conventional methods.

Model-based reinforcement learning is an appealing framework for creating agents that learn, plan, and act in sequential environments. Model-based algorithms typically involve learning a transition model that takes a state and an action and outputs the next state---a one-step model. This model can be composed with itse…

2019-05-30abs ↗pdf ↗

New acquisition functions improve Bernoulli LSE.

problem Efficiently estimating regions where a Bernoulli function is above or below a threshold.
method Developed new look-ahead acquisition functions for Gaussian process classification models.
result Demonstrated clear benefits of new acquisition functions on benchmark and real-world tasks.

In its simplest form, the traffic flow prediction problem is restricted to predicting a single time-step into the future. Multi-step traffic flow prediction extends this set-up to the case where predicting multiple time-steps into the future based on some finite history is of interest. This problem is significantly mor…

2018-03-04abs ↗pdf ↗

Diffusion-VAE tackles multi-step stock price prediction with stochastic noise.

problem Challenges in multi-step stock price prediction due to stochasticity and target price sequence.
method Combines hierarchical VAE and diffusion probabilistic techniques for seq2seq stock prediction.
result D-Va model outperforms state-of-the-art solutions in prediction accuracy and variance.

Transformers learn multi-step reasoning through gradient descent.

problem Understanding how transformers solve symbolic multi-step reasoning tasks.
method Theoretical analysis of gradient descent dynamics and multi-phase training.
result Trained one-layer transformers can solve both backward and forward reasoning tasks with generalization guarantees.

The task of multi-step ahead prediction in language models is challenging considering the discrepancy between training and testing. At test time, a language model is required to make predictions given past predictions as input, instead of the past targets that are provided during training. This difference, known as exp…

2018-09-16abs ↗pdf ↗

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.