This paper models how features influence event triggers in high-dimensional networks.
problem Estimating context-dependent networks in high-dimensional marked point processes.
method Leveraging compositional time series and regularization methods, the paper considers autoregressive multinomial and logistic-normal models for network estimation.
result The logistic-normal model leads to a convex negative log-likelihood objective and captures dependence across categories.
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 L1 mixingale condition. result Oracle properties of LASSO estimation in high-dimensional VAR models with weakly dependent innovations.
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.
EventFlow forecasts event sequences without autoregression, improving accuracy.
problem Forecasting errors in autoregressive models for event sequences.
method EventFlow uses flow matching to learn joint distributions over event times directly.
result EventFlow reduces forecast error by 20%-53% compared to baselines.
High-dimensional time series data exist in numerous areas such as finance, genomics, healthcare, and neuroscience. An unavoidable aspect of all such datasets is missing data, and dealing with this issue has been an important focus in statistics, control, and machine learning. In this work, we consider a high-dimensiona…
New GLS estimator handles high-dimensional data with autocorrelated errors.
problem High-dimensional regressions with autocorrelated errors.
method LASSO regression, autoregressive model fitting, and whitening.
result The method outperforms unadjusted LASSO in estimating errors driven by autoregressive processes.
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
Identification of a groundwater contaminant source simultaneously with the hydraulic conductivity in highly-heterogeneous media often results in a high-dimensional inverse problem. In this study, a deep autoregressive neural network-based surrogate method is developed for the forward model to allow us to solve efficien…
Paper explores variable skipping to speed up range density estimation.
problem Efficiently estimating range densities over high-dimensional data.
method Variable skipping technique to accelerate range density estimation.
result 10-100x efficiency improvements in challenging high-quantile error metrics.
Model nonstationary spatial processes using normalizing flows.
problem Difficult selection of spatial warping functions.
method Neural autoregressive flows (NAFs) for complex, high-dimensional warpings.
result NAFs model has greater representational capacity than other spatial process models.
Paper proposes a new sparsity scheme for high-dimensional VAR models.
problem Estimation of high-dimensional VAR models with sparsity assumptions.
method Regularized estimation procedures for sparse VAR models.
result Threholding extends consistency properties of regularized estimators.
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…
In recent years, deep reinforcement learning has been shown to be adept at solving sequential decision processes with high-dimensional state spaces such as in the Atari games. Many reinforcement learning problems, however, involve high-dimensional discrete action spaces as well as high-dimensional state spaces. This pa…
ARCNPs improve CNPs by autoregressively modeling dependencies.
problem CNPs struggle with modeling dependencies in predictions.
method Autoregressive deployment of factorized Gaussian CNPs.
result ARCNPs significantly outperform non-AR CNPs in various tasks.
New method for estimating high-dimensional binary time series coefficients.
problem Statistical inference for high-dimensional binary time series.
method Post-selection estimator and second-order wild bootstrap algorithm.
result Good finite-sample performance of the proposed method.
We present a distributionally robust formulation of a stochastic optimization problem for non-i.i.d vector autoregressive data. We use the Wasserstein distance to define robustness in the space of distributions and we show, using duality theory, that the problem is equivalent to a finite convex-concave saddle point pro…
Efficient methods for answering complex probabilistic queries in sequential data.
problem Complex probabilistic queries in sequential data.
method Broad class of novel approximation techniques for marginalization in sequential models.
result Efficient techniques for answering long-range probabilistic queries.
Novel estimation methods improve MAR model accuracy for high-dimensional time series.
problem Limited estimation techniques for Matrix Autoregressive (MAR) models.
method Adapted Yule-Walker equations and Burg's method.
result Proposed methods achieve comparable model fit to VAR models.
In order to disentangle the internal dynamics from exogenous factors within the Autoregressive Conditional Duration (ACD) model, we present an effective measure of endogeneity. Inspired from the Hawkes model, this measure is defined as the average fraction of events that are triggered due to internal feedback mechanism…
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.
Study improves dividend discount model using VAR process.
problem Improving dividend discount models for better predictions.
method Introduced a Gordon growth model based on Vector Autoregressive Process (VAR).
result Two Propositions related to the new model.
Calculates local Granger causality for Gaussian and nonlinear systems.
problem Understanding causal influence in complex systems.
method Vector autoregression and information-theoretic approach.
result Local Granger causality offers a robust and fast method for time-directed information transfer.
We propose a method for inferring the conditional indepen- dence graph (CIG) of a high-dimensional discrete-time Gaus- sian vector random process from finite-length observations. Our approach does not rely on a parametric model (such as, e.g., an autoregressive model) for the vector random process; rather, it only assu…
Linear autoregressive models serve as basic representations of discrete time stochastic processes. Different attempts have been made to provide non-linear versions of the basic autoregressive process, including different versions based on kernel methods. Motivated by the powerful framework of Hilbert space embeddings o…
New method for identifying autoregressive systems on manifolds.
problem Identifying autoregressive systems on Stiefel and Grassmann manifolds.
method Defining parameters as orthogonal group elements, averaging over observations, conjugate gradient descent on manifolds.
result System parameters can be estimated efficiently using the proposed algorithm.
Optimizes Gaussian process hyperparameters using Bayesian autoregression.
problem Optimizing hyperparameters for Matérn kernel temporal Gaussian processes.
method Recursive Bayesian estimation for autoregressive parameters.
result Outperforms traditional optimization methods in runtime and accuracy.
Proposes PredVAR model for reduced-dimensional dynamics from noisy data.
problem Extracting low-dimensional dynamics from high-dimensional noisy data.
method Probabilistic reduced-dimensional vector autoregressive model with oblique projection.
result Iterative algorithm yields dynamic latent variables with rank-ordered predictability.
We consider the problem of estimating the parameters of a multivariate Bernoulli process with auto-regressive feedback in the high-dimensional setting where the number of samples available is much less than the number of parameters. This problem arises in learning interconnections of networks of dynamical systems with …
We consider stationary autoregressive processes with coefficients restricted to an ellipsoid, which includes autoregressive processes with absolutely summable coefficients. We provide consistency results under different norms for the estimation of such processes using constrained and penalized estimators. As an applica…
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.
Bayesian method estimates Kronecker graphical models from autoregressive processes.
problem Estimating Kronecker graphical models from autoregressive Gaussian processes.
method Bayesian approach to estimate Kronecker graphical models.
result Effectiveness demonstrated through numerical experiments and real-world data application.
The framework of normalizing flows provides a general strategy for flexible variational inference of posteriors over latent variables. We propose a new type of normalizing flow, inverse autoregressive flow (IAF), that, in contrast to earlier published flows, scales well to high-dimensional latent spaces. The proposed f…
A new model for point processes without intensity function trade-offs.
problem Inefficiency and trade-offs in existing point process models.
method Point Set Diffusion, a diffusion-based latent variable model.
result Achieves state-of-the-art performance in point process generation.
Bayesian method detects change points in time series data.
problem Detecting significant regime shifts in time series data.
method Bayesian autoregressive model with time-varying parameters.
result Enhanced estimate accuracy and forecasting power.
Novel F2NARX model improves surrogate modeling for stochastic dynamical systems.
problem Challenges in constructing accurate and efficient surrogate models for stochastic dynamical systems.
method Function-on-Function Nonlinear AutoRegressive model with eXogenous inputs (F2NARX) combining PCA and Gaussian process regression.
result F2NARX outperforms state-of-the-art NARX models in efficiency and accuracy.
A new framework generates high-dimensional event sequences efficiently.
problem Challenges in modeling high-dimensional marked temporal point processes.
method Conditional generator that learns from event history.
result Superior performance compared to existing methods.
New method uncovers hidden causal connections in multivariate point process networks.
problem Unobserved hidden variables confound causal discovery in high-dimensional point process networks.
method Proposes a deconfounding procedure to estimate causal interactions among observed nodes with unknown unobserved processes.
result The method accurately identifies causal interactions among observed processes, even with hidden variables.
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-regularized estimation methods. result Greater statistical efficiency and interpretability achieved with little loss of temporal information.
While normalizing flows have led to significant advances in modeling high-dimensional continuous distributions, their applicability to discrete distributions remains unknown. In this paper, we show that flows can in fact be extended to discrete events---and under a simple change-of-variables formula not requiring log-d…
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.
The paper provides a finite-sample deviation bound for stable autoregressive processes.
problem Deviation bounds for least squares estimators in Gaussian AR(n) processes.
method Utilizes martingale concentration inequalities and tail-bound for χ² distributed variables.
result Problem-dependent finite-time bound on the deviation probability of AR(n) process parameters.
New method makes machine learning approximations unbiased and efficient.
problem Efficient sampling of complex probability distributions.
method Uses autoregressive neural networks with cluster updates and physical symmetries.
result Shows unbiased and low-variance approximations for phase transitions.
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…
We propose a generic spatiotemporal event forecasting method, which we developed for the National Institute of Justice's (NIJ) Real-Time Crime Forecasting Challenge. Our method is a spatiotemporal forecasting model combining scalable randomized Reproducing Kernel Hilbert Space (RKHS) methods for approximating Gaussian …
The purpose of this paper is to provide a sharp analysis on the asymptotic behavior of the Durbin-Watson statistic. We focus our attention on the first-order autoregressive process where the driven noise is also given by a first-order autoregressive process. We establish the almost sure convergence and the asymptotic n…
Develops a new model for network estimation from multi-variate data.
problem Network estimation from multi-variate point process or time series data.
method Semi-parametric approach based on the monotone single-index multi-variate autoregressive model (SIMAM).
result Achieves optimal rates of convergence and superior performance in prediction and network estimation.
Neural density estimators are flexible families of parametric models which have seen widespread use in unsupervised machine learning in recent years. Maximum-likelihood training typically dictates that these models be constrained to specify an explicit density. However, this limitation can be overcome by instead using …
New statistical inference method for high-dimensional Hawkes processes.
problem Uncertainty evaluation of network estimates in high-dimensional point process data.
method Develops a new statistical inference procedure using concentration inequalities and martingale central limit theory.
result Characterizes the convergence rate of test statistics for high-dimensional Hawkes processes.