Search arXiv⌕ Search

arXiv · 2610.05405

Impulse Response Inference for Matrix Autoregressions

Abstract

Matrix autoregressive (MAR) models offer a parsimonious framework for modeling matrix-valued time series, yet tools for estimation and inference for their impulse response functions are lacking. We develop asymptotic and bootstrap-based inference for impulse responses of stable MAR($p$) models. We derive the joint asymptotic distribution of the coefficient and covariance estimators, which permits closed-form delta-method standard errors. To address finite-sample bias, we propose ProBAB-MAR, a bias-corrected bootstrap that projects the corrected coefficients back onto the Kronecker parameter space, and prove that it attains asymptotically correct coverage. Monte Carlo simulations show that delta-method intervals undercover in small samples, while ProBAB-MAR achieves near-nominal coverage with intervals considerably narrower than those from an unrestricted VAR. An application to euro area inflation illustrates how shocks transmit across countries and inflation categories.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alain Hecq, Ivan Ricardo, Ines Wilms. 2026-10-04. Impulse Response Inference for Matrix Autoregressions. https://arxiv.org/abs/2610.05405

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Get me out of this hole: Identifying and avoiding inferior local optima in choice models

Choice modellers routinely acknowledge the risk of convergence to inferior local optima when using structures other than a simple linear-in-parameters logit model, but there is no consensus on how to address it. Most analysts seem to ignore the problem, while others try a set of different starting values or put their faith in what they believe to be more robust estimation approaches. This paper puts the question on a firmer empirical footing for latent class models, contrasting eight estimation strategies on a stated choice and a revealed preference dataset. These include multistart, global optimisation heuristics, the EM algorithm, and a proposed new profile likelihood algorithm that systematically analyses the parameter space around an initial estimate in search of better optima. Multiple well identified local optima are present in both case studies, with eight distinct solutions in the first and $23$ in the second, and no single approach recovers all of them. The solution that is easiest to find is not the one that fits best, and conventional starting values lead to a solution ranking thirteenth of $23$ in the second case study. We further show why these optima exist, tracing the barriers in log-likelihood between solutions to an interchange of substantive roles between classes. The consequences are material: willingness-to-pay measures differ by up to $60\%$ across solutions and elasticities by a factor of two, with the ordering of solutions by fit bearing little relation to their ordering by any such measure.

econ.EM↗

On the Rank Condition of Tail Index Regressions and a Comparative Study with Extremal Quantile Regression

We revisit tail index regressions. For linear specifications, we find that the usual full rank condition can fail because conditioning on extreme outcomes causes regressors to degenerate to constants. Taking this into account, we provide additional regularity conditions and establish the corresponding asymptotic theory. For more general specifications, the conditional distribution of the covariates in the tails concentrates on the values that minimize the tail index. This issue does not arise in the extremal quantile regression framework, where the tail index is assumed constant. Simulations support these findings. Using daily S\&P 500 returns, we give an empirical illustration. The patterns we find are more consistent with a constant tail index and a time-varying scale than with the strong degeneracy implied by a varying tail index.

econ.EM↗

SLIM: Stochastic Learning and Inference in Overidentified Models

We propose SLIM (Stochastic Learning and Inference in overidentified Models), a scalable stochastic approximation framework for nonlinear GMM. Independent mini-batches of moments and derivatives yield unbiased update directions with martingale difference noise. Under suitable regularity conditions, SLIM yields consistent and asymptotically normal estimators without a consistent initial estimator or a globally convex GMM criterion. Our theory covers fixed-sample and random-sampling asymptotics. An optional second-order refinement achieves full-sample GMM efficiency. Random-scaling and plug-in inference account for sampling and computational uncertainty, while debiased $J$-tests permit specification testing with SLIM. We extend the framework to clustered data with unequal cluster sizes, preserving the form of the inference procedures. Monte Carlo experiments for a nonlinear demand system with 576 moments and 380 parameters demonstrate computational gains and scalability to one million observations. A large-scale LinkedIn application with 4.8 million college graduates illustrates clustered estimation and inference for first employment destinations.

econ.EM↗