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.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · May 199319922001200920172026
48 results for Conditional Autoregressive

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.

HCNAF models complex conditional distributions for probabilistic occupancy forecasting.

problem Modeling complex conditional probability density functions for occupancy forecasting.
method Hyper-Conditioned Neural Autoregressive Flow (HCNAF) combining AF and hyper-network.
result HCNAF achieves state-of-the-art performance in self-driving datasets.

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.

Unified approach to risk measurement using Skew Exponential Power distribution.

problem Direct measurement of market risk with improved asymmetry and non-linearity.
method Unified Bayesian Conditional Autoregressive Risk Measures using Skew Exponential Power distribution with semiparametric P-spline approximation.
result Demonstrated effectiveness on real data of five stock market indices.

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.

Efficiently improves non-autoregressive sequence models for better translation performance.

problem Heavy inference latency and inconsistent output sentences in non-autoregressive models.
method Incorporates a structured inference module with an efficient CRF approximation and dynamic transition technique.
result Significantly better translation performance (BLEU score 26.80) compared to previous non-autoregressive models.

Study LASSO for high-dimensional VAR models with weakly dependent innovations.

problem Understanding sparse regularization in high-dimensional VAR models with weakly dependent innovations.
method LASSO estimation for weakly sparse VAR models with heavy tailed innovations, under L1L^1 mixingale condition.
result Oracle properties of LASSO estimation in high-dimensional VAR models with weakly dependent innovations.

GAMs combine autoregressive and log-linear components for data-efficient sequence learning.

problem Poor performance of standard autoregressive models under small-data conditions.
method Introduce Global Autoregressive Models (GAMs) combining autoregressive and log-linear components, trained in two steps.
result GAMs show a strong perplexity reduction over standard models in language modelling.

Hierarchical autoregressive models improve image quality by learning abstract representations.

problem Local structure bias in autoregressive models leads to lack of large-scale coherence in generated images.
method Propose two methods to learn discrete representations of images that abstract away local detail, and train autoregressive priors on these representations.
result Hierarchical autoregressive models produce high-fidelity reconstructions and realistic images with large-scale coherence.

Improved autoregressive models generate higher quality images and are more robust to noise.

problem Generating high-quality images from autoregressive models.
method Noise conditional maximum likelihood estimation (MLE) with score-based sampling.
result Models trained with noise conditional MLE achieve better test likelihoods and generate higher quality images.

AR-CSM models use derivatives of univariate log-conditionals to estimate joint distributions efficiently.

problem Scalability and stability issues in training autoregressive models.
method Parameterize joint distribution using derivatives of univariate log-conditionals and introduce Composite Score Matching (CSM) for efficient training.
result AR-CSM models are more scalable and stable compared to previous score matching algorithms.

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.

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.

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.

The paper develops a learning theory for neural network-based CHARME models.

problem Developing a learning theory for CHARME models using neural networks.
method Proves the stationarity and ergodicity of CHARME models under weak conditions, then applies neural networks to derive strong consistency and asymptotic normality of estimators.
result Strong consistency and asymptotic normality of NN-based estimators of CHARME model weights and biases under weak conditions.

New model predicts financial transaction durations using quantiles.

problem Modeling financial transaction durations using traditional mean duration.
method Proposes a new autoregressive conditional duration model based on log-symmetric distributions reparametrized by quantiles.
result Proposed model allows for modeling different percentiles of financial transaction durations.

We demonstrate a conditional autoregressive pipeline for efficient music recomposition, based on methods presented in van den Oord et al.(2017). Recomposition (Casal & Casey, 2010) focuses on reworking existing musical pieces, adhering to structure at a high level while also re-imagining other aspects of the work. This…

2018-11-18abs ↗pdf ↗

A new model estimates complex densities without explicit normalizing constants.

problem Accurately estimating the normalizing constant of high-dimensional energy functions.
method Autoregressive Energy Machine (AEM) learns an unnormalized density and an importance-sampling estimate of the normalizing constant.
result Achieves state-of-the-art performance on density-estimation tasks.

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.

Latent Block-Diffusion Temporal Point Processes (LBDTPP) is a semi-autoregressive framework for generating asynchronous event sequences.

problem Generating asynchronous event sequences
method Latent Block-Diffusion Temporal Point Processes
result Outperforms state-of-the-art TPP baselines in both unconditional and conditional generation tasks

Multivariate binary distributions can be decomposed into products of univariate conditional distributions. Recently popular approaches have modeled these conditionals through neural networks with sophisticated weight-sharing structures. It is shown that state-of-the-art performance on several standard benchmark dataset…

2017-03-22abs ↗pdf ↗

Diffusion models generate music sequences without autoregressive loops.

problem Generating music sequences from symbolic data using diffusion models.
method Parameterize discrete symbolic data in continuous latent space, train diffusion model, generate sequences through reverse process.
result Strong unconditional generation and post-hoc conditional infilling compared to autoregressive models.

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.

Improved flow-based models capture dependencies better with multi-scale autoregressive priors.

problem Limited expressiveness of flow-based models for long-range data dependencies.
method Introducing channel-wise dependencies through multi-scale autoregressive priors (mAR) in split coupling flow layers (mAR-SCF).
result Achieves state-of-the-art density estimation results on MNIST, CIFAR-10, and ImageNet.

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 ↗

The paper develops bootstrap methods for ACD models with random durations.

problem Bootstrap inference for autoregressive duration models with random durations.
method Recursive schemes for fixed calendar span or realized event count.
result The bootstrap method reproduces the conditional Gaussian component for ACD models with 0<κ<10<κ<1.