Estimation and Inference for Multiplicative Error Models via Analytical Derivatives

summary

The gist

Estimation and Inference for Multiplicative Error Models via Analytical Derivatives provides analytical expressions and an iterative algorithm to compute Maximum Likelihood Estimates (MLEs) for…

In short

This paper develops analytical derivatives and an iterative algorithm to find Maximum Likelihood Estimates (MLEs) for parameters in a Multiplicative Error Model, which is important because closed-form solutions are not available and numerical derivatives can be unstable. The method provides stable estimators for the asymptotic covariance matrix, showing that robust estimators perform better under various misspecification scenarios.

Key concepts

Multiplicative Error Model (MEM)
The MEM describes a non-negative time series process where the dynamics of the series are governed by a conditional mean equation and a conditional variance equation. The error term follows an i.i.d. distribution defined on a positive support, leading to a volatility-of-volatility structure where the ratio between conditional variance and squared conditional mean is constant under specific assumptions.
Analytical Derivatives
The authors derive exact mathematical expressions for the score vector and the Hessian matrix of the MEM log-likelihood by assuming a Gamma distribution for estimation purposes. These derivatives are crucial because they allow for a stable iterative algorithm to compute MLEs, avoiding the instability associated with numerical approximations of these derivatives.
Quasi-Maximum Likelihood Estimator (QMLE)
The QMLE is an estimator for the conditional mean equation parameters that remains consistent if the conditional mean equation is correctly specified, even when using a misspecified log-likelihood function. Furthermore, the fully robust (FR) estimator is shown to be consistent under general forms of heteroskedasticity of the errors.
Asymptotic Covariance Matrix
This matrix describes the variance and covariance structure of the Maximum Likelihood Estimates as the sample size grows large. The paper provides explicit formulas for several estimators, comparing their finite sample behavior under correct specification versus distributional misspecification, demonstrating that certain estimators are consistent even when assumptions do not hold.

Terminology used across episodes

This episode discusses

The paper

Estimation and Inference for Multiplicative Error Models via Analytical Derivatives · Read on arXiv

Luca Scaffidi Domianello

Dipartimento di Economia e Impresa, Università di Catania

Maximum Likelihood Estimates (MLEs) of the parameters of a Multiplicative Error Model are typically computed through a standard gradient method, an iterative procedure usually based on numerical approximations to derivatives of the log-likelihood function, owing to the complexity of the analytical derivatives, which involve recursive terms. Building on previous work developed mainly in the GARCH framework, we derive analytical expressions for the score vector and the Hessian matrix of the Multiplicative Error Model log-likelihood by adopting the Gamma distribution for estimation purposes. Then, we illustrate how the iterative algorithm based on the analytical derivatives should be computationally implemented. After maximizing the log-likelihood, we also provide explicit formulas for several estimators of the asymptotic covariance matrix of the MLE. Additionally, we provide analytic formulas for robust covariance estimators that remain valid under distributional misspecification, which are also referred to as the asymptotic variance of the Quasi-Maximum Likelihood Estimator. We also propose a covariance estimator that is consistent under general forms of heteroskedasticity of the error term, while the usually adopted estimators rely on a specific variance assumption. The finite-sample performance of the covariance estimators is assessed through a Monte Carlo investigation. An application on real data completes the analysis.

Transcript

Introduction to the show: ident: Statistics. The day in statistics: methods, theory and the inference under them.

Tom: I'm Tom.

Jane: And I'm Jane, here with Lu, Meng and our in-house large language model, Lalam.

Tom: We're looking at the paper: "Estimation and Inference for Multiplicative Error Models via Analytical Derivatives".

Jane: Here's the gist of the paper. Estimation and Inference for Multiplicative Error Models via Analytical Derivatives provides analytical expressions and an iterative algorithm to compute Maximum Likelihood Estimates (MLEs) for parameters in a Multiplicative Error Model, which is important because closed-form solutions are not available and numerical derivatives can be unstable.

Tom: Model Description The Multiplicative Error Model (MEM) describes a non-negative time series process where the dynamics are governed by a conditional mean equation and a conditional variance equation, with the error term following an i.i.d.

Jane: distribution defined on a positive support.

Tom: The conditional mean evolves deterministically according to Equation (2) in terms of lagged values of the series and past values of the conditional mean itself.

Paper summary: Tom: Thinking about the title "Estimation and Inference for Multiplicative Error Models via Analytical Derivatives," it sounds like they're offering a direct path around the typical difficulty of these models <ref:2611.16577#pg1>.

Jane: It really is about using analytical derivatives derived from a Gamma distribution to create an iterative algorithm that avoids the instability you get when using numerical approximations <ref:2611.16577#pg3>.

Lu: And they give us those explicit formulas for covariance estimators, showing how they perform across different specification scenarios in their simulation study <ref:2611.16577#pg3>.

Meng: So, for deployment at scale, the implication is that you can use this iterative method to get a more robust estimate of the error structure even when you're not sure about the exact distribution <ref:2611.16577#pg3>.

Tom: And they even show that this method can be extended to handle time-varying dispersion parameters, which is a big plus for real-world data where volatility changes over time <ref:2611.16577#pg3>.

Jane: It’s about taking something that usually requires specific assumptions and making it work under general forms of heteroskedasticity in the errors <ref:2611.16577#pg3>.

Lu: The paper really highlights how the Quasi Maximum Likelihood Estimator for the conditional mean equation parameters is consistent if that conditional mean equation is correctly specified, without needing a particular distributional assumption or even the GLM assumption <ref:2611.16577#pg3>.

Meng: That consistency under general forms of heteroskedasticity is what matters when you're shipping models to production and you don't have perfect knowledge of the error dynamics <ref:2611.16577#pg3>.

Tom: The authors report that generative AI was not used in their research or preparation of this manuscript <ref:2611.16577#pg3>.

Jane: So, overall, the work is providing a more reliable computational path for estimation and inference in these multiplicative error models <ref:2611.16577#pg3>.

Conclusion: Tom: So, we’re looking at this paper, "Estimation and Inference for Multiplicative Error Models via Analytical Derivatives," and the authors are tackling a problem where you can't just use a simple formula to find your best guesses for the model parameters <ref:2611.16577#pg3>.

Jane: Right, they’re using these analytical derivatives derived from assuming a Gamma distribution to build an iterative algorithm that avoids the instability you get when you try to estimate those parameters using numerical approximations <ref:2611.16577#pg3>.

Lu: The main thing here is they provide explicit formulas for several estimators of the asymptotic covariance matrix, and they compare how these estimators behave under different conditions like correct specification versus misspecification in the distribution <ref:2611.16577#pg3>.

Meng: That means they're not just giving you a number; they’re showing you how reliable that number is, even when your assumptions about the error term are slightly off, which is crucial when we’re shipping models to production <ref:2611.16577#pg3>.

Tom: And what I find interesting is that they show the usual estimator based on a specific conditional variance assumption isn't even consistent if that assumption doesn't hold <ref:2611.16577#pg3>.

Jane: So, the proposed method is consistent under general forms of heteroskedasticity of the errors, which is a big deal because real-world data is messy and rarely perfectly fits one neat distribution <ref:2611.16577#pg3>.

Lu: They also show that the Quasi Maximum Likelihood Estimator for the conditional mean equation parameters works fine if that equation itself is correctly specified, without needing a particular distributional assumption or even that GLM assumption <ref:2611.16577#pg3>.

Meng: If we can get consistency just by correctly specifying the mean part of the model, regardless of the error distribution, then we have a much more robust tool for our systems <ref:2611.16577#pg3>.

Tom: It’s about taking something that usually requires specific assumptions and making it work under general forms of heteroskedasticity in the errors <ref:2611.16577#pg3>.

Jane: The paper also shows how this method can be extended to handle time-varying dispersion parameters, which is a big plus for real-world data where volatility changes over time <ref:2611.16577#pg3>.

Lu: So, overall, the work is providing a more reliable computational path for estimation and inference in these multiplicative error models <ref:2611.16577#pg3>.

Meng: It’s about taking something that usually requires specific assumptions and making it work under general forms of heteroskedasticity in the errors <ref:2611.16577#pg3>.

Tom: The paper also shows how this method can be extended to handle time-varying dispersion parameters, which is a big plus for real-world data where volatility changes over time <ref:2611.16577#pg3>.

Jane: So, what does this mean for someone just listening to the show? It means we have a way to get more reliable estimates for complex time series models without getting stuck on fragile numerical methods or being overly dependent on perfect assumptions about the data distribution <ref:2611.16577#pg3>.

Lu: Exactly, it gives us a framework that’s more robust when we can’t guarantee everything is perfectly specified <ref:2611.16577#pg3>.

More episodes

← Home