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

3887761,1631,551 · Jun 202019922001200920172026
48 results for linear autoregressive models

Linear attention in Transformers can be interpreted as dynamic VAR models.

problem Misalignment between Transformers and autoregressive forecasting objectives.
method Interpreting linear attention as VAR, rearranging MLP, attention, and flow.
result SAMoVAR improves performance, interpretability, and efficiency.

Vector autoregressive models characterize a variety of time series in which linear combinations of current and past observations can be used to accurately predict future observations. For instance, each element of an observation vector could correspond to a different node in a network, and the parameters of an autoregr…

2016-05-09abs ↗pdf ↗

This work proposes an efficient autoregressive model for text generation.

problem The challenge of generating high-quality text with autoregressive models.
method Introduces a cascaded decoding approach using Markov transformers to achieve sub-linear parallel time generation.
result Shows competitive accuracy/speed tradeoff compared to existing methods on five machine translation datasets.

Flow-based generative models are a family of exact log-likelihood models with tractable sampling and latent-variable inference, hence conceptually attractive for modeling complex distributions. However, flow-based models are limited by density estimation performance issues as compared to state-of-the-art autoregressive…

2019-05-08abs ↗pdf ↗

Standard autoregressive seq2seq models are easily trained by max-likelihood, but tend to show poor results under small-data conditions. We introduce a class of seq2seq models, GAMs (Global Autoregressive Models), which combine an autoregressive component with a log-linear component, allowing the use of global \textit{a…

2019-09-16abs ↗pdf ↗

Transformers become faster by linearizing self-attention.

problem Quadratic complexity of transformers makes them slow for long sequences.
method Expressed self-attention as a linear dot-product and used matrix product associativity to reduce complexity.
result Linear transformers are up to 4000x faster on long sequences.

Modified asymmetric hidden Markov models for time series with autoregressive components.

problem Dynamic relationships between variables in time series data.
method Introducing an asymmetric autoregressive component to recent asymmetric hidden Markov models.
result The model can choose the optimal autoregressive order for better likelihood.

This paper explores how Transformers predict next tokens in autoregressive tasks.

problem Understanding the success of Transformers in autoregressive learning.
method Trained a Transformer on a next-token prediction task, focusing on commuting orthogonal matrices.
result Trained Transformers can be seen as implementing gradient descent for a specific objective function.

The optimal predictor for a linear dynamical system (with hidden state and Gaussian noise) takes the form of an autoregressive linear filter, namely the Kalman filter. However, a fundamental problem in reinforcement learning and control theory is to make optimal predictions in an unknown dynamical system. To this end, …

2019-05-23abs ↗pdf ↗

Paper uses non-linear dimension reduction for better economic forecasting.

problem Analyzing economic effects of shocks in large datasets.
method Non-linear dimension reduction in factor-augmented vector autoregressions.
result Non-linear dimension reduction techniques improve forecasting, especially in volatile data.

LGB+ improves macroeconomic forecasting by combining linear and tree models.

problem Efficiency in small samples for forecasting with mixed linear and nonlinear dynamics.
method LGB+ is a boosting procedure that evaluates both tree and linear candidates at each step, advancing only the winner. It decomposes forecasts into linear and nonlinear contributions.
result LGB+ delivers strong gains for targets with pronounced autoregressive dynamics or mixed signals.

Autoregressive networks can achieve promising performance in many sequence modeling tasks with short-range dependence. However, when handling high-dimensional inputs and outputs, the huge amount of parameters in the network lead to expensive computational cost and low learning efficiency. The problem can be alleviated …

2019-09-06abs ↗pdf ↗

Autoregressive flow models can perform causal discovery and inference tasks.

problem Causal inference tasks such as causal discovery and interventional predictions.
method Using autoregressive flow models to estimate causal directions and make predictions.
result Autoregressive flows can accurately perform causal inference tasks without restrictive assumptions.

A normalizing flow models a complex probability density as an invertible transformation of a simple density. The invertibility means that we can evaluate densities and generate samples from a flow. In practice, autoregressive flow-based models are slow to invert, making either density estimation or sample generation sl…

2019-06-05abs ↗pdf ↗

SALT models combine ARHMM and SLDS for efficient, interpretable time-series analysis.

problem Efficient modeling of systems with time-varying dynamics and long-range dependencies.
method Switching autoregressive low-rank tensor models parameterized with a low-rank factorization.
result SALT models provide a balance of interpretability and efficiency, outperforming ARHMMs and SLDSs.

Paper uses GMM and MAF for probabilistic classification, outperforming simpler models.

problem Classifying data with complex distributions.
method Density estimation using Gaussian Mixture Model and Masked Autoregressive Flow.
result Proposed classifiers outperform simpler models like linear discriminant analysis.

The paper tackles long-context linear system identification with improved sample complexity bounds.

problem Identifying dynamical systems with long dependencies over fixed context windows.
method Established sample complexity bounds for systems with linear dependencies over a context window of length p.
result The learning process is not hindered by slow mixing properties in extended context windows.

Many complex dynamical phenomena can be effectively modeled by a system that switches among a set of conditionally linear dynamical modes. We consider two such models: the switching linear dynamical system (SLDS) and the switching vector autoregressive (VAR) process. Our Bayesian nonparametric approach utilizes a hiera…

2010-03-19abs ↗pdf ↗

AR model forecasts partially observed dynamical time series by estimating evolution function and imputing missing variables.

problem Forecasting dynamical time series with missing variables.
method Autoregressive with slack time series (ARS) model.
result ARS model forecasts future time series with time-invariant and linear assumptions.

The ability to track and monitor relevant and important news in real-time is of crucial interest in multiple industrial sectors. In this work, we focus on the set of cryptocurrency news, which recently became of emerging interest to the general and financial audience. In order to track relevant news in real-time, we (i…

2019-03-27abs ↗pdf ↗

We present a windowed technique to learn parsimonious time-varying autoregressive models from multivariate timeseries. This unsupervised method uncovers interpretable spatiotemporal structure in data via non-smooth and non-convex optimization. In each time window, we assume the data follow a linear model parameterized …

2019-05-21abs ↗pdf ↗

The fundamental task of general density estimation p(x)p(x) has been of keen interest to machine learning. In this work, we attempt to systematically characterize methods for density estimation. Broadly speaking, most of the existing methods can be categorized into either using: \textit{a}) autoregressive models to estim…

2018-01-30abs ↗pdf ↗

Autoregressive models are among the best performing neural density estimators. We describe an approach for increasing the flexibility of an autoregressive model, based on modelling the random numbers that the model uses internally when generating data. By constructing a stack of autoregressive models, each modelling th…

2017-05-19abs ↗pdf ↗

Autoregressive sequence models achieve state-of-the-art performance in domains like machine translation. However, due to the autoregressive factorization nature, these models suffer from heavy latency during inference. Recently, non-autoregressive sequence models were proposed to reduce the inference time. However, the…

2019-10-25abs ↗pdf ↗

Alternative sampling method for autoregressive models using Langevin dynamics.

problem Efficiently sampling from autoregressive models.
method Initialize sequences with white noise and follow Langevin dynamics on global log-likelihood.
result Parallelizes and generalizes sampling process for autoregressive models.

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.

Autoregressive state transitions, where predictions are conditioned on past predictions, are the predominant choice for both deterministic and stochastic sequential models. However, autoregressive feedback exposes the evolution of the hidden state trajectory to potential biases from well-known train-test discrepancies.…

2019-08-30abs ↗pdf ↗

Paper proposes AXE loss for non-autoregressive machine translation, improving performance.

problem Challenges in training non-autoregressive models due to lack of autoregressive factors and cross entropy loss penalties.
method Proposes aligned cross entropy (AXE) loss function using a differentiable dynamic program for better word order alignment.
result AXE-based training improves performance on major WMT benchmarks and sets a new state of the art for non-autoregressive models.

Study optimal and instance-dependent guarantees for solving linear equations with Markovian data.

problem Approximately solving linear fixed point equations with Markovian data.
method Non-asymptotic bounds and instance-dependent characterizations for stochastic approximation.
result Instance-optimality of the averaged SA estimator and matching upper and lower bounds.

Transformers learn a mesa-optimizer to implement in-context learning.

problem Understanding the convergence of autoregressive training to a mesa-optimizer.
method Investigated a one-layer linear causal self-attention model autoregressively trained by gradient flow.
result Proved that autoregressive training converges to a gradient descent step for an OLS problem, validating the mesa-optimizer hypothesis.