Generalized Automatic Least Squares: Efficiency Gains from Misspecified Heteroscedasticity Models
It is well known that in the presence of heteroscedasticity ordinary least squares estimator is not efficient. I propose a generalized automatic least squares estimator (GALS) that makes partial correction of heteroscedasticity based on a (potentially) misspecified model without a pretest. Such an estimator is guaranteed to be at least as efficient as either OLS or WLS but can provide some asymptotic efficiency gains over OLS if the misspecified model is approximately correct. If the heteroscedasticity model is correct, the proposed estimator achieves full asymptotic efficiency. The idea is to frame moment conditions corresponding to OLS and WLS squares based on miss-specified heteroscedasticity as a joint generalized method of moments estimation problem. The resulting optimal GMM estimator is equivalent to a feasible GLS with estimated weight matrix. I also propose an optimal GMM variance-covariance estimator for GALS to account for any remaining heteroscedasticity in the residuals.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Generalized Tensor-Aided Channel Estimation for Hardware Impaired Device Identification
In this paper, we investigate the joint generalized channel estimation and device identification problem in Internet of Things (IoT) networks {under multipath propagation}. To fully utilize the received signal, we decomp…
Sparse Linear Regression via Generalized Orthogonal Least-Squares
Sparse linear regression, which entails finding a sparse solution to an underdetermined system of linear equations, can formally be expressed as an $l_0$-constrained least-squares problem. The Orthogonal Least-Squares (O…
regressionLeast squares Monte Carlo methods in stochastic Volterra rough volatility models
In stochastic Volterra rough volatility models, the volatility follows a truncated Brownian semi-stationary process with stochastic vol-of-vol. Recently, efficient VIX pricing Monte Carlo methods have been proposed for t…
validRobust Partially-Compressed Least-Squares
Randomized matrix compression techniques, such as the Johnson-Lindenstrauss transform, have emerged as an effective and practical way for solving large-scale problems efficiently. With a focus on computational efficiency…
Computational EfficiencyGeneralized Forgetting Recursive Least Squares: Stability and Robustness Guarantees
This work presents generalized forgetting recursive least squares (GF-RLS), a generalization of recursive least squares (RLS) that encompasses many extensions of RLS as special cases. First, sufficient conditions are pre…
parameter estimation