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

130260390520 · Jun 202019922001200920172026
48 results for recursive prediction

The paper sets limits for sequential prediction and recursive algorithms using entropy analysis.

problem Fundamental limitations in sequential prediction and recursive algorithms.
method Entropic analysis to investigate underlying relationships of data and noises.
result Derives Lp\mathcal{L}_{p} bounds quantifiable in conditional entropy.

Proposes a recursive MPC scheme with probabilistic safety guarantees for uncertain dynamic systems.

problem Probabilistic safety guarantees for MPC in dynamic environments with unknown stochastic agents.
method Uses conformal prediction to derive high-confidence prediction regions and gradually relax safety constraints online.
result Ensures recursive feasibility of MPC schemes by relaxing safety constraints over time.

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 ↗

We introduce Recurrent Predictive State Policy (RPSP) networks, a recurrent architecture that brings insights from predictive state representations to reinforcement learning in partially observable environments. Predictive state policy networks consist of a recursive filter, which keeps track of a belief about the stat…

2018-03-05abs ↗pdf ↗

Paper uses averaging from many particle filters to approximate posterior predictive distributions.

problem Approximating posterior predictive distributions efficiently and accurately.
method Particle swarm filter algorithm that averages many particle filter approximations.
result Law of large numbers and central limit theorem support the method's effectiveness.

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.

We introduce a recursive adaptive group lasso algorithm for real-time penalized least squares prediction that produces a time sequence of optimal sparse predictor coefficient vectors. At each time index the proposed algorithm computes an exact update of the optimal 1,\ell_{1,\infty}-penalized recursive least squares (R…

2011-01-29abs ↗pdf ↗

Bayesian method for multivariate autoregressive models with exogenous inputs.

problem Estimating uncertainties in autoregressive models with exogenous inputs.
method Recursive Bayesian estimation via message passing in a factor graph.
result Produces full posterior distributions for autoregressive coefficients and noise precision.

While it has become common to perform automated translations on natural language, performing translations between different representations of mathematical formulae has thus far not been possible. We implemented the first translator for mathematical formulae based on recursive neural networks. We chose recursive neural…

2018-11-10abs ↗pdf ↗

RocketStack integrates predictions from multiple base learners using a recursive stacking architecture up to ten levels.

problem Feature redundancy, complexity, and computational burden in deep stacking.
method Level-aware recursive stacking with pruning and compression techniques.
result Increasing accuracy with depth and outperforming standalone ensembles at later levels.

The class of Gaussian Process (GP) methods for Temporal Difference learning has shown promise for data-efficient model-free Reinforcement Learning. In this paper, we consider a recent variant of the GP-SARSA algorithm, called Sparse Pseudo-input Gaussian Process SARSA (SPGP-SARSA), and derive recursive formulas for its…

2018-11-17abs ↗pdf ↗

In this paper we develop a method for learning nonlinear systems with multiple outputs and inputs. We begin by modelling the errors of a nominal predictor of the system using a latent variable framework. Then using the maximum likelihood principle we derive a criterion for learning the model. The resulting optimization…

2016-06-14abs ↗pdf ↗

In this work, we propose a simple but effective method to interpret black-box machine learning models globally. That is, we use a compact binary tree, the interpretation tree, to explicitly represent the most important decision rules that are implicitly contained in the black-box machine learning models. This tree is l…

2018-02-11abs ↗pdf ↗

The paper explores generalizations of Mirzakhani's recursion and computes volumes for physical gravity models.

problem Computing volumes for physical gravity models.
method Topological recursion and physical two-dimensional gravity models.
result Derivation of Virasoro constraints and cut-and-join equations for generalized Mirzakhani's recursions.

Recently, graph neural networks (GNNs) have proved to be suitable in tasks on unstructured data. Particularly in tasks as community detection, node classification, and link prediction. However, most GNN models still operate with static relationships. We propose the Graph Learning Network (GLN), a simple yet effective p…

2019-05-29abs ↗pdf ↗

Paper proposes a recursive GPSSM for efficient online learning.

problem Efficient online learning for dynamical models with limited prior information.
method Recursive Gaussian Process State-Space Model with adaptive capabilities for domains and hyperparameters.
result Superior accuracy, computational efficiency, and adaptability compared to state-of-the-art methods.

In a recurrent setting, conventional approaches to neural architecture search find and fix a general model for all data samples and time steps. We propose a novel algorithm that can dynamically search for the structure of cells in a recurrent neural network model. Based on a combination of recurrent and recursive neura…

2019-05-25abs ↗pdf ↗

Harer and Zagier proved a recursion to enumerate gluings of a 2d2d-gon that result in an orientable genus gg surface, in their work on Euler characteristics of moduli spaces of curves. Analogous results have been discovered for other enumerative problems, so it is natural to pose the following question: how large is t…

2018-12-31abs ↗pdf ↗

QB-Vine extends Quasi-Bayesian methods to high dimensions using vine copulas.

problem Efficiently predicting high-dimensional distributions without sampling.
method Recursive Quasi-Bayesian construction for marginals and vine copulas for dependence modeling.
result QB-Vine is a fully non-parametric density estimator with analytical form and convergence rate independent of dimension.

ORFit trains models on streaming data with one pass, minimizing memory and computational costs.

problem Training large models on a stream of data without retraining on previous data.
method Orthogonal Recursive Fitting (ORFit) using orthogonal gradient descent and recursive least-squares.
result ORFit updates parameters orthogonally to past gradients, leading to efficient memory and computational usage.

This paper studies recursive ensembles driven by Fibonacci updates, improving learning dynamics.

problem Improving learning dynamics in recursive ensemble learning.
method Develops second-order recursive architectures with Fibonacci-type update flows.
result Establishes global convergence conditions and generalization bounds for recursive ensembles.

This work generalizes a formula linking Seiberg-Witten prepotential and topological recursion.

problem Analyzing the relationship between Seiberg-Witten curves and topological recursion.
method Analytical approach using Seiberg-Witten family of curves.
result A generalized formula relating Seiberg-Witten prepotential to the genus zero part of topological recursion on a Seiberg-Witten curve.

LASER compresses recursive model activations by exploiting their low-dimensional structure.

problem Understanding and optimizing the geometric structure of recursive reasoning trajectories.
method Dynamic low-rank basis tracking via matrix-free subspace tracking with a fidelity-triggered reset mechanism.
result Recursive activations occupy a linear, low-dimensional subspace that can be compressed efficiently.