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

86172258344 · Jun 202019922001200920172026
48 results for autoregressive order

A new autoregressive model learns the order of graph generation tasks.

problem Generating graphs in a meaningful order when the canonical order is not obvious.
method Introduces a variant of autoregressive models that dynamically decides the autoregressive order based on data.
result Achieves state-of-the-art results on molecular graph generation benchmarks.

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.

New model handles missing data effectively in autoregressive models.

problem Handling missing data in autoregressive models.
method Reinterpret existing models through missing data lens, introduce principled framework for incomplete datasets, active information acquisition.
result MO-ARM consistently outperforms imputation baselines across real-world benchmarks.

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 new online learning setting for autoregressive processes with sublinear regret.

problem Sequential decision-making with temporal dependence in autoregressive processes.
method Autoregressive Bandits (ARBs) and AutoRegressive Upper Confidence Bound (AR-UCB) algorithm.
result Sublinear regret of order $\widetilde{\mathcal{O}} \left( \frac{(k+1)^{3/2}\sqrt{nT}}{(1-Γ)^2} ight)$ for optimal policy.

Causal autoregressive flows enable accurate causal inference and prediction.

problem Causal discovery and interventional predictions in machine learning.
method Autoregressive normalizing flows with fixed variable orderings.
result Causal models derived from autoregressive flows are identifiable and allow for accurate interventional and counterfactual predictions.

Improved simulation of phase transitions using hierarchical autoregressive networks.

problem Simulating phase transitions in complex systems.
method Hierarchical Autoregressive Neural (HAN) network sampling algorithm.
result Significant improvement in statistical uncertainty compared to the Wolff cluster algorithm.

LMConv improves autoregressive models for image generation and completion.

problem Limited generation order in autoregressive models restricts their applicability.
method Introduces LMConv, a modified 2D convolution that allows arbitrary masks to be applied to weights.
result LMConv achieves improved performance on image density estimation and coherent completions.

Due to the unparallelizable nature of the autoregressive factorization, AutoRegressive Translation (ART) models have to generate tokens sequentially during decoding and thus suffer from high inference latency. Non-AutoRegressive Translation (NART) models were proposed to reduce the inference time, but could only achiev…

2019-09-15abs ↗pdf ↗

A new clustering method for vector time series using autoregressive dynamics.

problem Clustering of vector time series based on their dynamics is challenging.
method System identification approach using mixture autoregressive models.
result Developed a computationally manageable algorithm k-LMVAR for clustering vector time series.

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.

Improved lattice field theory simulations with local-Autoregressive Conditional Normalizing Flow.

problem Efficiently sampling lattice field theories with computational challenges.
method Integrates locality into autoregressive conditional normalizing flows.
result Autocorrelation times improved by orders of magnitude for φ4φ^{4} theory on a 2D lattice.

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.

We introduce a new criterion to determine the order of an autoregressive model fitted to time series data. It has the benefits of the two well-known model selection techniques, the Akaike information criterion and the Bayesian information criterion. When the data is generated from a finite order autoregression, the Bay…

2015-08-11abs ↗pdf ↗

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 ↗

New model generates graphs with tighter likelihood bounds and better quality.

problem Intractable likelihood of autoregressive graph models.
method Derive exact joint probability, approximate node orderings, variational inference.
result Lower bound on log-likelihood is significantly tighter than previous methods.

The paper introduces reservoir computing models for complex systems.

problem Modeling complex engineering systems using nonlinear autoregression.
method Introduces reservoir computing with output feedback as stationary and ergodic infinite-order nonlinear autoregressive models.
result Demonstrates versatility of classical and quantum reservoir computers in modeling synthetic and real data.

Normalising flows (NFS) map two density functions via a differentiable bijection whose Jacobian determinant can be computed efficiently. Recently, as an alternative to hand-crafted bijections, Huang et al. (2018) proposed neural autoregressive flow (NAF) which is a universal approximator for density functions. Their fl…

2019-04-09abs ↗pdf ↗

Generative model predicts financial market order flow with high accuracy.

problem Creating realistic order flow models for financial markets.
method Token-level autoregressive generative model using deep state space layers.
result Model generates high-quality order flow data with low perplexity.

Paper proposes a new sparse VAR model for high-dimensional time series.

problem Non-identifiability, computational intractability, and difficulty of interpretation for high-dimensional time series.
method Sparse infinite-order VAR model with 1\ell_1-regularized estimation methods.
result Greater statistical efficiency and interpretability achieved with little loss of temporal information.

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.

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.

ARDMs are a new model class for autoregressive diffusion that generalize existing models and can compress data efficiently.

problem Efficient data compression and generation.
method Autoregressive Diffusion Models (ARDMs) that generalize existing autoregressive models and discrete diffusion models.
result ARDMs require significantly fewer steps for compression compared to discrete diffusion models.

Study local sensitivity of HDD and CDD temperature derivatives prices.

problem Understanding how temperature derivatives prices change with small temperature changes.
method Analyzes sensitivity of HDD and CDD futures and options prices to temperature perturbations using a CAR process.
result Identifies the order of the CAR process and its impact on temperature derivatives prices.

Efficient method classifies locally stationary time series based on second-order characteristics.

problem Classifying locally stationary time series for various applications.
method Autoregressive approximation, ensemble aggregation, distance-based threshold.
result Zero misclassification error rate asymptotically for mildly differing second-order characteristics.

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 ↗

Thermalizer stabilizes autoregressive models for long-term predictions in chaotic systems.

problem Long-term predictions in chaotic spatiotemporal systems are unreliable due to trajectory divergence.
method Diffusion models are used to implicitly estimate the score of an invariant measure, which stabilizes autoregressive emulators by applying denoising during inference.
result Thermalization extends the time horizon of stable predictions by an order of magnitude in chaotic systems.

LOB-Bench benchmarks generative AI for financial data, outperforming traditional models.

problem Lack of consensus on evaluating generative AI models for financial data.
method Python-based benchmark with LOB statistics and market impact metrics.
result Generative autoregressive models outperform traditional models in LOB data.

Vector autoregression (VAR) is a fundamental tool for modeling multivariate time series. However, as the number of component series is increased, the VAR model becomes overparameterized. Several authors have addressed this issue by incorporating regularized approaches, such as the lasso in VAR estimation. Traditional a…

2014-12-17abs ↗pdf ↗

Bayesian causal inference method improves accuracy over traditional approaches.

problem Bayesian marginalisation over causal models is computationally infeasible.
method Decomposes structure marginalisation into causal orders and DAGs, using Gaussian processes for mechanisms and ARCO for orders.
result Method outperforms state-of-the-art in structure learning and inference.