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

72145217289 · Jun 202019922001200920172026
48 results for Multi-step Error Expansion

FedSARSA converges with heterogeneous agents, achieving linear speed-up.

problem Convergence analysis of Federated SARSA with heterogeneous agents.
method Linear function approximation, local training, multi-step error expansion.
result FedSARSA achieves linear speed-up with respect to the number of agents.

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.

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 ↗

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.

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.

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.

The paper addresses Dyna-style RL's value hallucination issue by proposing a new algorithm.

problem Value hallucination in Dyna-style RL due to bootstrapping simulated states.
method Introduces a new Dyna algorithm using predecessor models with multi-step updates.
result Evidence supports the Hallucinated Value Hypothesis (HVH), suggesting predecessor models with multi-step updates are promising.

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.

Neural CDEs correct errors in learned time-series models for better forecasting.

problem Error accumulation in multi-step forecasts of learned time-series models.
method Predictor-Corrector framework with a neural controlled differential equation.
result The proposed framework consistently improves forecasting performance across various models.

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.

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 ↗

This note provides an error bound for the Hartman-Watson integral's leading term.

problem Bounding the error of the leading term of the Hartman-Watson integral.
method Asymptotic expansion analysis focusing on the regime rt=ρrt=ρ constant.
result The error term is bounded uniformly as ϑ(t,ρ)170t|\vartheta(t,ρ)|\leq \frac{1}{70}t.

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 ↗

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.

Develops AMITE for analyzing neural network nonlinearities.

problem Addressing difficulties in verification, explainability, and security in neural network analysis.
method Analytically modified integral transform expansion (AMITE) for neural network nonlinearities.
result First to provide six mutually exclusive desired expansion properties.

Proposes QDF to improve multi-step time-series forecasting.

problem Ignoring label autocorrelation and unequal task weights in training objectives.
method Quadratic-form weighted training objective and QDF learning algorithm.
result Improves performance of various forecast models, achieving state-of-the-art results.

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.

In this report, we derive a non-negative series expansion for the Jensen-Shannon divergence (JSD) between two probability distributions. This series expansion is shown to be useful for numerical calculations of the JSD, when the probability distributions are nearly equal, and for which, consequently, small numerical er…

2008-10-28abs ↗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 ↗

Energy price forecasting is a relevant yet hard task in the field of multi-step time series forecasting. In this paper we compare a well-known and established method, ARMA with exogenous variables with a relatively new technique Gradient Boosting Regression. The method was tested on data from Global Energy Forecasting …

2015-06-23abs ↗pdf ↗

The paper uses polyhedral expansions to capture the shape of compact metric spaces.

problem Capturing the shape of compact metric spaces using finite approximations.
method Inverse sequences of polyhedra based on finite approximations of a compact metric space.
result Proves the General Principle and computes inverse persistent homology groups.

Model-based reinforcement learning (MBRL) aims to learn a dynamic model to reduce the number of interactions with real-world environments. However, due to estimation error, rollouts in the learned model, especially those of long horizons, fail to match the ones in real-world environments. This mismatching has seriously…

2019-09-25abs ↗pdf ↗

The main goal of the paper is to address the issue of the existence of Kempf's distortion function and the Tian-Yau-Zelditch (TYZ) asymptotic expansion for the Kepler manifold - an important example of non compact manfold. Motivated by the recent results for compact manifolds we construct Kempf's distortion function an…

2007-05-15abs ↗pdf ↗

Achieving artificial visual reasoning - the ability to answer image-related questions which require a multi-step, high-level process - is an important step towards artificial general intelligence. This multi-modal task requires learning a question-dependent, structured reasoning process over images from language. Stand…

2017-07-10abs ↗pdf ↗

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.

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.

We provide faster algorithms for the problem of Gaussian summation, which occurs in many machine learning methods. We develop two new extensions - an O(Dp) Taylor expansion for the Gaussian kernel with rigorous error bounds and a new error control scheme integrating any arbitrary approximation method - within the best …

2012-06-27abs ↗pdf ↗

New Hermite approximations accelerate convergence with adaptive coordinate transformations.

problem Accelerating convergence of spectral approximations for Hermite expansions.
method Using normalizing flows for adaptive coordinate transformations and deriving error estimates.
result Error estimates for Hermite expansions under adaptive coordinate transformations.

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 ↗

Paper provides Edgeworth expansions for network moments, improving accuracy of sampling distributions.

problem Accurate descriptions of sampling distributions of network moment statistics.
method Edgeworth expansion applied to studentized network moment statistics.
result Higher-order accurate approximation to sampling CDF of network moment statistics.

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.