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

Trend · papers per month

127255382509 · Jun 202019922001200920172026
48 results for multi-step prediction

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.

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.

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.

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.

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.

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.

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 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.

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 ↗

Proposes a method to apply conformal prediction to probabilistic time series forecasting models.

problem Obtaining accurate prediction regions for multi-step time series forecasting with probabilistic models.
method Conformalises conditional normalising flows to generate potentially disjoint prediction regions.
result Improves predictive efficiency in time series forecasting with multimodal distributions.

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.

Model predicts stock price changes and forecasts using tokenized data.

problem Challenges in stock price forecasting and prediction due to dynamic data and statistical differences.
method Introduces PCIE model with tokenization to handle both forecasting and prediction.
result PCIE model outperforms state-of-the-art models in forecast and prediction tasks.

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.

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.

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 ↗

New algorithm learns optimal policy with multi-step lookahead information.

problem Learning optimal policy in reinforcement learning with multi-step lookahead information is NP-hard.
method Adaptive batching policies that process lookahead in state-dependent chunks.
result Order-optimal regret bounds up to a constant factor of lookahead horizon.

Paper explains DRL strategies for portfolio management using linear models.

problem Difficulty in understanding DRL-based trading strategies.
method Empirical approach using linear models and integrated gradients.
result DRL agents show stronger multi-step prediction power than machine learning methods.

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.

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.

ForecastNet uses a time-variant deep feed-forward neural network for better multi-step-ahead time series forecasting.

problem Time-invariant architectures limit multi-step-ahead forecasting.
method ForecastNet employs a deep feed-forward architecture with time-variant parameters and interleaved outputs.
result ForecastNet outperforms other models on multi-step-ahead time series forecasting tasks.

A multi-step framework tackles online unsupervised domain adaptation with novel mean-target subspace computation.

problem Online unsupervised domain adaptation with unlabelled target data arriving sequentially.
method Multi-step framework with a novel mean-target subspace computation and temporal coherency consideration.
result Improved performance over previous approaches on four datasets.

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.

Proposes a framework to quantify uncertainty in multi-step decision-making by LLMs.

problem Uncertainty quantification in multi-step decision-making scenarios of LLMs.
method A principled, information-theoretic framework decomposing uncertainty into internal and extrinsic components, and proposing UProp for efficient extrinsic uncertainty estimation.
result UProp significantly outperforms existing single-turn UQ baselines in multi-step decision-making benchmarks.

Multi-step greedy policies have been extensively used in model-based reinforcement learning (RL), both when a model of the environment is available (e.g.,~in the game of Go) and when it is learned. In this paper, we explore their benefits in model-free RL, when employed using multi-step dynamic programming algorithms: …

2019-10-07abs ↗pdf ↗

We examine the impact of learning Lipschitz continuous models in the context of model-based reinforcement learning. We provide a novel bound on multi-step prediction error of Lipschitz models where we quantify the error using the Wasserstein metric. We go on to prove an error bound for the value-function estimate arisi…

2018-04-19abs ↗pdf ↗

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.

This work analyzes CoT prompting methods from a statistical estimation perspective.

problem Improving the effectiveness of LLMs in solving multi-step reasoning problems.
method Introducing a multi-step latent variable model to characterize CoT prompting from a statistical estimation viewpoint.
result The CoT estimator is equivalent to a Bayesian estimator when the pretraining dataset is large.