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

16324763 · May 202619922001200920172026
48 results for multistep forecasting

Proposes a graph neural network for traffic forecasting in WANs.

problem Traffic forecasting challenges in WANs due to dynamic and large data volumes.
method Dynamic diffusion convolutional recurrent neural networks for multistep traffic forecasting.
result Significant improvements in forecasting accuracy compared to classical methods.

The project aims to research on combining deep learning specifically Long-Short Memory (LSTM) and basic statistics in multiple multistep time series prediction. LSTM can dive into all the pages and learn the general trends of variation in a large scope, while the well selected medians for each page can keep the special…

2017-10-12abs ↗pdf ↗

Investor finds a fair outcome in complex financial markets.

problem Finding a fair outcome in complex financial markets.
method Recalled and proved the existence of personal equilibrium in a multistep, generically incomplete financial market model.
result Personal equilibrium exists in a multistep, generically incomplete financial market model under appropriate assumptions.

Deep learning framework predicts streamflow and flood probabilities in Australian catchments.

problem Large-scale flooding prediction challenges due to model calibration and missing data.
method Ensemble quantile-based deep learning framework using quantile regression and CAMELS dataset.
result Notable efficacy and uncertainties in streamflow forecasts with varied catchment properties.

We present a derivation and theoretical investigation of the Adams-Bashforth and Adams-Moulton family of linear multistep methods for solving ordinary differential equations, starting from a Gaussian process (GP) framework. In the limit, this formulation coincides with the classical deterministic methods, which have be…

2016-10-26abs ↗pdf ↗

Continuous semi-implicit models enable faster training and better performance in generative modeling.

problem Slow convergence in hierarchical semi-implicit models during training.
method CoSIM, a continuous semi-implicit model that incorporates a continuous transition kernel for efficient training.
result CoSIM achieves superior performance on image generation tasks compared to existing methods.

New methods improve deep reinforcement learning by accelerating credit assignment.

problem Challenges in achieving fast and stable off-policy learning in deep reinforcement learning.
method Extends the generalized PBE objective to support multistep credit assignment and derives three gradient-based methods.
result Proposed methods outperform PPO and StreamQ in MuJoCo and MinAtar environments.

Framework improves clinical timeline reconstruction from text and tables.

problem Temporal precision and event timing in clinical narratives and EHRs.
method Retrieval-augmented multimodal alignment framework.
result Consistently improves absolute timestamp accuracy and temporal concordance.

Proposes exact inference for continuous-time Gaussian process dynamics.

problem Inexact inference methods for continuous-time Gaussian process dynamics are impractical for irregularly-sampled data.
method Uses higher-order numerical integrators to discretize dynamics with arbitrary accuracy and proposes multistep and Taylor integrators for exact inference.
result Demonstrates accurate representation of continuous-time systems through exact GP inference.

While physics conveys knowledge of nature built from an interplay between observations and theory, it has been considered less importantly in deep neural networks. Especially, there are few works leveraging physics behaviors when the knowledge is given less explicitly. In this work, we propose a novel architecture call…

2019-02-08abs ↗pdf ↗

Regularized nonlinear acceleration (RNA) estimates the minimum of a function by post-processing iterates from an algorithm such as the gradient method. It can be seen as a regularized version of Anderson acceleration, a classical acceleration scheme from numerical analysis. The new scheme provably improves the rate of …

2018-05-24abs ↗pdf ↗

COLoKe adapts Koopman embeddings online, reducing overfitting and improving long-term predictions.

problem Online adaptation of Koopman embeddings to avoid overfitting and maintain long-term predictive accuracy.
method Combines deep feature learning with multistep prediction consistency in a lifted space, using a conformal-style mechanism for selective updates.
result Empirically effective in reducing overfitting and maintaining long-term predictive accuracy.

In this paper, we present a differential privacy version of convex and nonconvex sparse classification approach. Based on alternating direction method of multiplier (ADMM) algorithm, we transform the solving of sparse problem into the multistep iteration process. Then we add exponential noise to stable steps to achieve…

2019-08-02abs ↗pdf ↗

Short-term load forecasting is a critical element of power systems energy management systems. In recent years, probabilistic load forecasting (PLF) has gained increased attention for its ability to provide uncertainty information that helps to improve the reliability and economics of system operation performances. This…

2019-03-26abs ↗pdf ↗

Combining forecasts of 16 ED causes improves accuracy and stability.

problem Forecasting accuracy and stability for ED admissions is poor due to model uncertainty and limited data.
method High-dimensional forecast combinations of 16 cause-specific ED forecasts using extensive covariates.
result Forecast combinations yield forecast accuracies of 3.81%-23.54% across causes, outperforming individual models in 50% of scenarios.

Conditional forecasts improve performative prediction accuracy.

problem Performative predictions undermine standard forecasting methods.
method Condition forecasts on covariates to make them forecast-invariant.
result Proper scoring rules fail under conditioning, but two solutions are identified.

Study improves seasonal forecasts using deep learning.

problem Challenges in generating large forecast ensembles and limited observations for verification.
method Developed a probabilistic deep neural network model.
result Demonstrated favorable skill compared to state-of-the-art dynamical forecast systems.

Two new methods improve forecasting of functional time series data.

problem Forecasting of functional time-dependent data.
method Functional Singular Spectrum Analysis (FSFA) based forecasting methods.
result Our methods outperform existing algorithms for periodic stochastic processes.

A new machine learning method for Bayesian inverse problems in function spaces.

problem Bayesian inverse problems in function spaces with incompatibility of white noise sources.
method One-step generative transport with amortized neural operator and prior-aligned Gaussian random field.
result Generative operator trained on prior samples and noisy observations generates posterior samples efficiently.

MPANF improves naive forecast by incorporating directional information.

problem Challenging to surpass naive forecast in financial time series.
method Combines naive forecast with movement prediction and accuracy.
result MPANF generally outperforms common benchmarks.

Simplifies forecast combination by using diversity of out-of-sample forecasts.

problem Estimating optimal weights for forecast combinations is challenging.
method Use out-of-sample forecasts to extract features and calculate weights for forecast combination.
result Achieves superior forecasting performance in point forecasts and prediction intervals.

Microdata improves inflation forecasts after major shocks, study finds.

problem Forecasting inflation in a non-stationary environment with microeconomic data.
method Developed a scan test to detect periods of micro forecast outperformance, combined with adaptive machine learning.
result Micro forecasts improve inflation predictions after major shocks, especially after 2020.

Given a nonlinear model, a probabilistic forecast may be obtained by Monte Carlo simulations. At a given forecast horizon, Monte Carlo simulations yield sets of discrete forecasts, which can be converted to density forecasts. The resulting density forecasts will inevitably be downgraded by model mis-specification. In o…

2011-12-29abs ↗pdf ↗

Paper proposes a new method for selecting the best hierarchical forecasting approach.

problem Selecting the best method for reconciling base forecasts in hierarchical time series.
method Conditional hierarchical forecasting using machine learning and time series features.
result Conditional hierarchical forecasting leads to significantly more accurate forecasts, especially at lower levels.

Proposes a neural network for accurate and reconciled hierarchical time series forecasting.

problem Forecasting and reconciling hierarchical time series data.
method Uses a deep neural network to directly produce accurate and reconciled forecasts, minimizing a customized loss function at training time.
result Our approach outperforms state-of-the-art competitors in hierarchical forecasting on real-world datasets.

This paper reviews forecast combinations over 50 years, highlighting their evolution and utility.

problem Improving forecast accuracy through combining multiple forecasts.
method Evolution of forecast combination methods, from simple to sophisticated.
result Forecast combinations have become a mainstream approach in forecasting.

This paper improves forecast stability without sacrificing accuracy using dynamic loss weighting.

problem Rolling origin forecast instability in time series forecasting.
method Dynamic loss weighting algorithms applied to the N-BEATS model.
result Dynamic loss weighting can further improve forecast stability without compromising accuracy.