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

4385128170 · Jun 202019922001200920172026
48 results for matrix autoregression

Proposes a Structural Matrix Autoregressive model for joint analysis of asset returns, realized volatility, and trading volume.

problem Joint analysis of asset returns, realized volatility, and trading volume
method Structural Matrix Autoregressive model
result Volatility is primary driver of trading activity, with informational shocks incorporated through price variability.

We show Vector Autoregressive Moving Average models with scalar Moving Average components could be estimated by generalized least square (GLS) for each fixed moving average polynomial. The conditional variance of the GLS model is the concentrated covariant matrix of the moving average process. Under GLS the likelihood …

2019-09-01abs ↗pdf ↗

Study on estimating sparse transition matrix of partially-observed VAR with noisy and sparse data.

problem Estimating sparse transition matrix of partially-observed VAR with noisy and sparse data.
method Yule-Walker equation, Dantzig selector, minimax lower bound.
result Near-optimality of the proposed estimator with convergence rate analysis.

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.

FLANDERS detects and blocks extreme model poisoning in federated learning.

problem Resilience against large-scale model poisoning attacks in federated learning.
method FLANDERS treats client updates as matrix-valued time series and identifies outliers using autoregressive forecasting.
result FLANDERS significantly improves robustness in federated learning across various attacks.

Sparse Tucker decomposition with graph regularization improves time series forecasting accuracy.

problem High-dimensional time series forecasting with over-parameterization issue.
method Sparse Tucker decomposition and graph regularization for tensor-based model.
result Non-asymptotic error bound and superior performance in numerical experiments.

New method for identifying graph shift operators using vertex-time autoregressive models.

problem Identifying graph shift operators from graph signals.
method Online optimization using vertex-time autoregressive model and stochastic gradient projection.
result Successful recovery of graph shift operators from graph signals.

Paper proposes LATC for multivariate time series prediction and missing data imputation.

problem Large-scale, incomplete, and corrupted multivariate time series data.
method Transforms multivariate time series into a tensor structure, models global and local trends, and uses autoregressive norm.
result Integration of global and local trends improves missing data imputation and rolling prediction.

Survey of graph learning methods for combinatorial optimization problems.

problem Efficient and effective analysis of graphs for combinatorial optimization problems.
method Two-stage framework: Graph representation learning followed by machine learning.
result Recent studies have shown promise in using machine learning to solve graph-based combinatorial optimization problems.

We show how to solve a number of problems in numerical linear algebra, such as least squares regression, p\ell_p-regression for any p1p \geq 1, low rank approximation, and kernel regression, in time $T(A) \poly(\log(nd))$, where for a given input matrix ARn×dA \in \mathbb{R}^{n \times d}, T(A)T(A) is the time needed to com…

2019-12-12abs ↗pdf ↗

Improved covariance matrix forecasting for S&P 500 using factor models and shrinkage.

problem Forecasting large covariance matrices of returns in finance.
method Decompose covariance matrix into firm-level factors and sectoral restrictions. Estimate using VHAR models with LASSO.
result Significantly improved forecasting precision compared to benchmarks.

FOCUS method forecasts counterfactuals in panel data with time series dynamics.

problem Forecasting unobserved potential outcomes in causal inference with missing entries and latent factors.
method FOCUS extends matrix completion methods by leveraging time series dynamics of latent factors.
result FOCUS method outperforms existing benchmarks in predicting future counterfactuals.

We study the problem of learning the support of transition matrix between random processes in a Vector Autoregressive (VAR) model from samples when a subset of the processes are latent. It is well known that ignoring the effect of the latent processes may lead to very different estimates of the influences among observe…

2017-02-27abs ↗pdf ↗

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 ↗

New method for estimating and testing impulse responses in high-dimensional VAR systems.

problem Statistical inference for impulse responses in sparse, high-dimensional vector autoregressions.
method Local projection equations and de-sparsified estimators combined with a non-regularized contemporaneous impact matrix.
result Valid inference procedures for structural impulse responses in high-dimensional systems.

We propose in this work a new family of kernels for variable-length time series. Our work builds upon the vector autoregressive (VAR) model for multivariate stochastic processes: given a multivariate time series x, we consider the likelihood function p_θ(x) of different parameters θin the VAR model as features to descr…

2011-01-04abs ↗pdf ↗

Estimates spatio-temporal data with satellite NO2 concentrations using Yule-Walker equations.

problem Estimating large spatio-temporal autoregressions with unknown spatial interactions.
method Sparse generalized Yule-Walker estimation, penalized regression, spatial and temporal dependence.
result Strong forecast improvements and evidence of spatial interactions in NO2 satellite data.

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 ↗

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.

In this paper, we study non-asymptotic deviation bounds of the least squares estimator in Gaussian AR(nn) processes. By relying on martingale concentration inequalities and a tail-bound for χ2χ^2 distributed variables, we provide a concentration bound for the sample covariance matrix of the process output. With this, …

2019-12-17abs ↗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 ↗

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.

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 ↗

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 ↗

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.

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.

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.

Paper proposes a self-supervised method to denoise autoregressive signals with heavy-tailed noise.

problem Denoising autoregressive signals corrupted by heavy-tailed noise.
method Self-supervised learning approach without requiring full noise distribution knowledge.
result Strong denoising performance compared to baseline methods, especially for impulsive noise.

We develop methods to estimate lag and parameters for multiple stable autoregressive processes.

problem Estimating lag and parameters for multiple stable autoregressive processes with unknown lag.
method Use convex programming to simultaneously select lag and estimate parameters across multiple processes.
result The estimated process is stable, and forecasting errors can outperform known rates.

Efficiently combines autoregressive and set-based models for joint distributions.

problem Joint distributions over multiple predictions from set-based models.
method Causal autoregressive buffer that caches context and captures dependencies.
result Up to 20x faster joint sampling and density evaluation, up to 7x lower memory usage.