Abstract
An information matrix of a parametric model being singular at a certain true value of a parameter vector is irregular. The maximum likelihood estimator in the irregular case usually has a rate of convergence slower than the -rate in a regular case. We propose to estimate such models by the adaptive lasso maximum likelihood and propose an information criterion to select the involved tuning parameter. We show that the penalized maximum likelihood estimator has the oracle properties. The method can implement model selection and estimation simultaneously and the estimator always has the usual -rate of convergence.
JEL Classification:
C13; C18; C51; C52
1. Introduction
It has long been noted that some parametric models may have singular information matrices but still be identifiable. For example, Silvey (1959) finds that the score statistic in a single-parameter identifiable model can be zero for all data and Cox and Hinkley (1974) notice that a zero score can arise in the estimation of variance component parameters. Zero or linearly dependent scores imply that information matrices are singular. Other examples include, among others, parametric mixture models that include one homogeneous distribution (Kiefer 1982), simultaneous equations models (Sargan 1983), the sample selection model (Lee and Chesher 1986), the stochastic frontier function model (Lee 1993), and a finite mixture model (Chen 1995).
Some authors have considered the asymptotic distribution of the maximum likelihood estimator (MLE) in some irregular cases with singular information matrices. Cox and Hinkley (1974) show that the asymptotic distribution of the MLE of variance components can be found after a power reparameterization. Lee (1993) derives the asymptotic distribution of the MLE for parameters in a stochastic frontier function model with a singular information matrix by several reparameterizations so that the transformed model has a nonsingular information matrix. Rotnitzky et al. (2000) consider a general parametric model where the information matrix has a rank being one less than the number of parameters, and derive the asymptotic distribution of the MLE by reparameterizations and investigating high order Taylor expansions of the first order conditions. Typically, the MLEs of some components of the parameter vector in the irregular case may have slower than the -rate of convergence and have non-normal asymptotic distributions, while the MLE in the regular case has the -rate of convergence and is asymptotically normally distributed. As a result, for inference purposes, one may need to first test whether the parameter vector takes a certain value at which the information matrix is singular.
We consider the case that the irregularity of a singular information matrix occurs when a subvector of the parameter vector takes a specific true value, while the information matrix at any other value is nonsingular. For example, zero true value of a variance parameter in the stochastic frontier function model, and zero true values of a correlation coefficient and coefficients for variables in the selection equation of a sample selection model can lead to singular information matrices (Lee and Chesher 1986). For such a model, if the true value of the subvector is known and imposed in the model, the restricted model will usually have a nonsingular information matrix for the remaining parameters and the MLE has the usual -rate of convergence. This reminds us of the oracle properties of the lasso in linear regressions, i.e., it may select the correct model with probability approaching one (w.p.a.1.) and the resulting estimator satisfies the properties as if we knew the true model (Fan and Li 2001). In this paper, we propose to estimate an irregular parametric model by a penalized maximum likelihood (PML) which appends a lasso penalty term to the likelihood function. Without loss of generality, we consider the situation when the information matrix is singular at a zero true value of a subvector of the parameter vector .1 We expect that a PML with oracle properties for parametric models can avoid the slow rate of convergence and nonstandard asymptotic distribution for the irregular case. We penalize using the Euclidean norm as for the group lasso (Yuan and Lin 2006), since the interest is in whether the whole vector rather than its individual components are zero. The penalty term is constructed to be adaptive by using an initial consistent estimator as for the adaptive lasso (Zou 2006) and adaptive group lasso (Wang and Leng 2008), so that the PML can have the oracle properties. In the irregular case, the initial estimate used to construct the adaptive penalty term has a slower rate of convergence than that in the literature, but the lasso approach can still be applied if the tuning parameter is properly selected. We prove the oracle properties under regularity conditions. Consequently, the PML can implement model selection and estimation simultaneously. Because the model with and the restricted one with imposed have nonsingular information matrices, the PML estimator (PMLE) always has the -rate of convergence and standard asymptotic distributions.
The PML criterion function has a tuning parameter in the penalty term. In asymptotic analysis, the tuning parameter is assumed to have certain order so that the PML can have the oracle properties. In finite samples, the tuning parameter needs to be chosen. For least square shrinkage methods, the generalized cross validation (GCV) and information criteria such as the Akaike information criterion (AIC) and Bayesian information criterion (BIC) are often used. While the GCV and AIC cannot identify the true model consistently (Wang et al. 2007), the BIC can (Wang and Leng 2007; Wang et al. 2007; Wang et al. 2009). Zhang et al. (2010) propose a general information criterion (GIC) that can nest the AIC and BIC and show its consistency in model selection. Following Zhang et al. (2010), we propose to choose the tuning parameter by minimizing an information criterion. We show that the procedure is consistent in model selection under regularity conditions. Because of the irregularity in the model, the proposed information criterion can be different from the traditional AIC, BIC and GIC.
Jin and Lee (2017) show that, in a matrix exponential spatial specification model, the covariance matrix of the gradient vector for the nonlinear two stage least squares (N2SLS) criterion function can be singular when a subvector of the parameter vector has the true value zero. They consider the penalized lasso N2SLS estimation of the model. This paper generalizes the lasso method to the ML estimation of the several cited models with singular information matrices. For the model in Jin and Lee (2017), the true parameter vector is in the interior of the parameter space. However, for some irregular models cited above, the true parameter vector is on the boundary of the parameter space. We thus consider also the boundary case in this paper.
The PML approach proposed in this paper can be applied to all of the parametric models with singular information matrices mentioned above, e.g., the sample selection model and the stochastic frontier function model. Since the PMLE has the -rate of convergence for the components which are not super-consistently estimated, we expect the PMLE to outperform the unrestricted MLE in finite samples for such models in the irregular case, e.g., in terms of smaller root mean squared errors and shorter confidence intervals.
The rest of the paper is organized as follows. Section 2 presents the PML estimation procedure for general parametric models with singular information matrices. Section 3 discusses specifically the PMLEs for the sample selection model and stochastic frontier function model. Section 4 reports some Monte Carlo results. Section 5 concludes. In Appendix A, we derive the asymptotic distribution of the MLE of the sample selection model in the irregular case. Proofs are in Appendix B.
2. PMLE for Parametric Models
Let the data be i.i.d. with the probability density function (pdf) , a member of the family of pdf’s , , if y’s are continuous random variables. If y’s are discrete, will be a probability mass function. Furthermore, if y’s are mixed continuous and discrete random variables, will be a mixed probability mass and density function. Assumption 1 is a standard condition for the consistency of the MLE (Newey and McFadden 1994).
Assumption 1.
Suppose that , , are i.i.d. with pdf (or mixed probability mass and density function) and (i) if then with probability one; (ii) , which is compact; (iii) is continuous at each θ with probability one; (iv) .
Rothenberg (1971) shows that, if the information matrix of a parametric model has constant rank in an open neighborhood of the true parameter vector, then local identification of parameters is equivalent to nonsingularity of the information matrix at the true parameter vector. Local identification is necessary but not sufficient for global identification. For the examples in the introduction, the information matrix of a parametric model is singular when the true parameter vector takes certain value, but it is nonsingular at other values. Thus, the result in Rothenberg (1971) does not apply but the parameters may still be identifiable in all cases.
We consider the case that the information matrix of the likelihood function is singular at , with a subvector of being zero. We propose to estimate by maximizing the following penalized likelihood function
where is the log likelihood function divided by n with , is a tuning parameter, is a constant, is an initial consistent estimator of , which can be the MLE or any other consistent estimator, denotes the Euclidean norm and is the set indicator. The PMLE maximizes (1).
Assumption 2.
.
The initial estimator can be zero in value, especially when is on the boundary of the parameter space, e.g., a zero variance parameter for the stochastic frontier function model in Section 3.2. With a zero value for , the PMLE of in (1) is set to zero and the value of the PMLE equals that of the restricted MLE with the restriction imposed. The tuning parameter needs to be positive which tends to zero as the sample size increases.
Assumption 3.
and .
We have the consistency of as long as goes to zero as n goes to infinity in Assumption 3.
Proposition 1.
Under Assumptions 1–3, .
The convergence rate of can be derived under regularity conditions. Let , where and are, respectively, the parameter spaces for and . We investigate the case where is on the boundary as well as the case where is in the interior of . The rest of parameters are always in the interior of . The following regularity condition is required.
Assumption 4.
(i) which are compact convex subsets in some finite dimensional Euclidean space ; (ii) ; (iii) for some if , and if with ; (iv) is twice continuously differentiable and on , where with being an open neighborhood at of ; (v) , ; (vi) exists and is nonsingular when , and exists and is nonsingular when ; (vii) .
In the literature, several irregular models have parameters on the boundary: the model on simplified components of variances in Cox and Hinkley (1974, p. 117), the mixture model in Kiefer (1982) and the stochastic frontier function model in Aigner et al. (1977).2 For these models, a scalar parameter is always nonnegative but irregularity occurs when on the boundary. True parameters other than are in the interior of their parameter spaces. We thus assume that is a scalar when it can be on the boundary of its parameter space.3 (iv)–(vii) in Assumption 4 are standard. Note that for the partial derivative with respect to at on the boundary, only perturbations on are considered, as for the (left/right) partial derivatives in Andrews (1999). The convexity of and makes such derivatives well-defined and convexity is relevant when the mean value theorem is applied to the log likelihood function.
For our main focus in this paper, at , the information matrix is singular. However, our lasso estimation method is also applicable to regular models where the information matrix might be nonsingular even at . The following proposition provides such a generality.
Proposition 2.
Under Assumptions 1–4, if exists and is nonsingular, then .
Proposition 2 derives the rate of convergence of the PMLE in the case of a nonsingular information matrix. When , we have assumed in Assumption 4 that the information matrix is nonsingular. When , Proposition 2 is relevant in the event that the PML is formulated with a reparameterized model that has a nonsingular information matrix and the reparameterized unknown parameters are represented by .
We now consider whether the PMLE has the sparsity property, i.e., whether is equal to zero w.p.a.1. when . For the lasso penalty function, and the initial consistent estimate are required to have certain orders of convergence for the sparsity property.
Assumption 5.
Suppose that , where . The tuning parameter sequence is selected to satisfy either
- (i)
- converges to zero such that as ; or
- (ii)
- if exists and is nonsingular, is selected to have at most the order such that as .
According to Rotnitzky et al. (2000), in the case that the information matrix is singular with rank being one less than the number of parameters k, there exists a reparameterization such that the MLE of one of the transformed parameter component converges at a rate slower than , but the remaining transformed components converge at the -rate. As a result, some components of the MLE in terms of the original parameter vector have a slower than the -rate of convergence, while the remaining components may have the -rate. In this case, for as a whole, in Assumption 5 if is the MLE. Assumption 5 (i) can be satisfied if is selected to have a relatively slow rate of convergence to 0. The condition differs from that in the literature due to the irregularity issue we are considering. In the case that the PML is formulated with a reparameterized model that has a nonsingular information matrix and represents the reparameterized unknown parameter vector, Assumption 5 (ii) is relevant with if is the MLE.
The oracle properties of the PMLE, including the sparsity property, are presented in Proposition 3.4 When , the PMLE of can equal zero w.p.a.1., and has the same asymptotic distribution as that of the MLE as if we knew .
Proposition 3.
Under Assumptions 1–5, if , then , and .
We next turn to the case with . The consistency of to in Proposition 1 will guarantee that goes to 1 if . By Proposition 2, in order that can converge to with -consistency and without an asymptotic impact of the first order by when , we need to select to converge to zero with the order .
Assumption 6.
.
Assumptions 5 and 6 need to coordinate with each other as they are opposite requirements. By taking for some , Assumption 6 holds. Assumption 5 (i) can be satisfied if we take to be large enough such that . For such a to exist, it is necessary to take for a given s. For the regular case in Assumption 5 (ii) , it is relatively more flexible on the value of .
Proposition 4.
Under Assumptions 1–4 and 6, if , . Furthermore, as , .
We next consider the selection of the tuning parameter . To make explicit the dependence of the PMLE on a tuning parameter , denote the PMLE for a given .5 Let be an interval from which the tuning parameter is selected, where is a finite positive number. We propose to select the tuning parameter that maximizes the following information criterion:
where is a positive sequence of constants, and is the PMLE of for a given . That is, given , the selected tuning parameter is . The term is an extra bonus for setting to zero. Some conditions on are also invoked.
Assumption 7.
, and as .
To balance the order requirements of and , can be taken to be . As this order changes with s, the information criterion in (2) can be different from the traditional ones such as the AIC, BIC and Hannan-Quinn information criterion.
Let be an arbitrary sequence of tuning parameters which satisfy Assumptions 3, 5 and 6, e.g., , where is chosen such that . Define , . In Proposition 5, we let the initial estimator be the MLE.
Proposition 5.
Under Assumptions 1–7, as .
Proposition 5 states that the model selection by the tuning parameter selection procedure is consistent. It implies that any in that fails to identify the true model would not be selected asymptotically by the information criterion in (2) as an optimal tuning parameter in , because such a is less favorable than any , which can identify the true model asymptotically.
3. Examples
In this section, we illustrate the PMLEs of the sample selection model as well as the stochastic frontier function model. In the irregular case, the true parameter vector is in the interior of its parameter space for the sample selection model, but it is on the boundary for the stochastic frontier function model.
3.1. The Sample Selection Model
We consider the sample selection model in Lee and Chesher (1986), which can have a singular information matrix. The model is as follows:
where n is the sample size, is the ith observation of exogenous variables, and the vectors , for are independently distributed as the bivariate normal . The variable is not observed, but a binary indicator is observed to be 1 if and only if and is 0 otherwise. The variable is only observed when . Let , and , where and are, respectively, the coefficients for the intercept terms in the outcome and selection equations. According to Lee and Chesher (1986), when contains an intercept term, but the true values of and the correlation coefficient are zero, elements of the score vector are linearly dependent and the information matrix is singular.6 For this model, the true parameter vector which causes irregularity is in the interior of the parameter space.
We derive the asymptotic distribution of the MLE in this irregular case in Appendix A.7 Let be the MLE of . It is shown that, for , all components of have the usual -rate of convergence and are asymptotically normal. However, at , has the same asymptotic distribution as that of , where is a transformed parameter and is asymptotically normal, has the same asymptotic distribution as that of , where , and has the same asymptotic distribution as that of , while is asymptotically normal. Thus, , and have slower than the -rate of convergence, but and have the usual -rate of convergence.
Let and . The PML criterion function for model (3) with the MLE is
Since and , Assumptions 5 (i) and 6 hold when is greater than 3. By Assumption 7, in the information criterion function (2), should satisfy and as .
According to the discussions in deriving the asymptotic distribution of the MLE via reparameterizations, alternatively, the criterion function for the PMLE can be formulated with the function of the transformed parameters as
where , , and . While enters the penalty terms of (4) and (5) in the same way, it is not the case for : it is in (4) but in (5). Since has a nonsingular information matrix, by Proposition 2, the PMLE has the order , which is under the assumption . Then as in Assumption 5 (ii) will be relevant. Thus, for the PML criterion function (5), as long as , no further condition on is needed. Furthermore, Assumption 7 for in the information criterion function (2) with and as is relevant, and we can take .
3.2. The Stochastic Frontier Function Model
Consider the following stochastic frontier function model:
where is a k-dimensional vector of exogenous variables which contains a constant term, the disturbance represents technical inefficiency, represents uncontrollable disturbance, and and are independent. Following the literature, is assumed to be half normal with the pdf
and . As in Aigner et al. (1977), let and . For a random sample of size n, the log likelihood function divided by n is
where . In this model, is nonnegative and, for the irregular case, the true parameter lies on the boundary, which represents the absence of technical inefficiency. According to Lee (1993), when , the information matrix is singular and the MLE of has the convergence rate ; when , the information matrix has full rank and the MLE has the -rate of convergence. The asymptotic distribution of the MLE when is derived by transforming the model into one with a nonsingular information matrix via several reparameterizations. Thus, the PML estimation can be formulated similarly to the sample selection model, using the original model or the transformed model. Note that in finite samples, the MLE of , regardless of whether or not, can be zero with a positive probability. A necessary and sufficient condition for the MLE of to be zero is , where ’s are the least squares residuals (Lee 1993).
4. Monte Carlo
In this section, we report results from some Monte Carlo experiments for both the sample selection model and the stochastic frontier function model. The code files are written and run in MATLAB.
4.1. The Sample Selection Model
For the sample selection model, in the experiments, there are two exogenous variables in : one is an intercept term and the other is drawn randomly from the standard normal distribution. The true vector of coefficients for is . There are also two exogenous variables in : an intercept term with true coefficient 1 and a variable randomly drawn from the standard normal distribution, for which the true coefficient is 2, 0.5 or 0. Two values of , 2 and 0.5, are considered. The is either 0.7, −0.7, 0.3, −0.3 or 0. In the information criterion function (2) for the tuning parameter selection, is set to 4 and .8 An estimate is regarded as zero if it is smaller than 10−5. The number of Monte Carlo repetitions is 1000. The sample sizes considered are or 600.
Table 1 reports the probabilities that the PMLEs select the right model, i.e., the probabilities of the PMLEs of being zero when , and being nonzero when . We use PMLE-o and PMLE-t to denote the PMLEs obtained from the criterion functions formulated using, respectively, the original and transformed likelihood functions. When or 0.5, with the sample size , the probabilities are 1 or very closed to 1; with the sample size , all probabilities are 1. When and , the PMLEs estimate as zero with high probabilities, higher than 95% for the PMLE-o and higher than 69% for the PMLE-t. The PMLE-o has higher probabilities of estimating as zero than the PMLE-t. As the sample size increases from 200 to 600, the correct model selection probabilities of the PMLE-o increase while those of the PMLE-t decrease. When but , the PMLEs estimate as nonzero with very low probabilities. With , we see that . Thus, the scores are approximately linearly dependent as . In finite samples, even though , the identification can be weak and the MLE behaves similarly to that in the case with , which has large bias and variance, as seen from Tables 4 and 5 below. As a result, the PMLEs which use the MLEs to construct the penalty terms have low probabilities of estimating to be non-zero.
Table 1.
Probabilities that the PMLEs of the sample selection model select the right model.
Table 2 presents the biases, standard errors (SE) and root mean squared errors (RMSE) of the estimates when . For a nonzero true parameter value, the biases, SEs and RMSEs are divided by the absolute value of the true parameter value. The upper panel is for the sample with size . The restricted MLE, denoted as MLE-r, usually has the largest bias, because it imposes the wrong restriction . The MLE, PMLE-o and PMLE-t almost have identical summary statistics. Their biases and SEs are relatively low, e.g., the biases of are all below or equal to 0.012, or 2.5% for a nonzero true , and the SEs are all below or equal to 0.246. As the SEs dominate the biases, the RMSEs have similar magnitudes as those of the SEs. As the value of changes, the biases, SEs and RMSEs do not change much. When decreases from 2 to 0.5, all estimates of , and tend to have smaller biases and SEs, but those for , and show little changes. As the sample size increases to 600, all estimates have smaller biases, SEs and RMSEs.
Table 2.
The biases, standard errors (SE) and root mean squared errors (RMSE) of the estimators when in the sample selection model.
Table 3 illustrates the biases, SEs and RMSEs of the estimates when = 0.5. The patterns are similar to those for Table 2. With a smaller , the biases and SEs of , and tend to be smaller, but those of , and are larger.
Table 3.
The biases, SEs and RMSEs of the estimators when = 0.5 in the sample selection model.
Table 4 reports the biases, SEs and RMSEs when but . We observe that the MLE has relatively large biases and SEs. For , the biases of can be as high as 0.46 in absolute value, or higher than 100%, and the SEs can be as high as 0.72. While the biases of the MLE are usually smaller than those of the MLE-r, the SEs are usually much larger, especially for , and . In terms of the RMSEs, the MLE does not show an advantage over the MLE-r. The biases of the PMLE-o are usually smaller than those of the MLE-r and larger than those of the MLE, but the SEs of the PMLE-o are generally smaller than those of the MLE. The PMLE-t has smaller biases than those of PMLE-o but larger SEs in most cases, more similar to the MLE. That is consistent with Table 1, since the PMLE-t estimates as nonzero with higher probabilities. The RMSEs of the PMLEs are usually smaller than those of the MLE but larger than those of the MLE-r. In this case, even though the PML methods do not provide good probabilities of selecting the non-zero models, the shrinkage feature of the lasso does provide smaller RMSEs than those of the unconstrained MLEs.
Table 4.
The biases, SEs and RMSEs of the estimators when and in the sample selection model.
The results for and are reported in Table 5. As expected, the MLE-r usually has the smallest biases, SEs and RMSEs, since it has imposed the correct restriction . The biases, SEs and RMSEs of the PMLEs are between those of the MLE-r and MLE. The PMLE-o of , , and have significantly smaller biases, SEs and RMSEs than those of the MLE. The biases, SEs and RMSEs of the PMLE-t are smaller than those of the MLE, but larger than those of the PMLE-o, since it estimates as nonzero with higher probabilities. Note that the MLEs of , and have relatively very large SEs, and the MLEs of have very large biases, which can be larger than 50%. With a smaller , the estimates generally have smaller biases, SEs and RMSEs. As n increases to 600, the summary statistics of the PMLE-o become very similar to those of the MLE-r, and all estimates have smaller biases, SEs and RMSEs in general.
Table 5.
The biases, SEs and RMSEs of the estimators when and in the sample selection model.
4.2. The Stochastic Frontier Function Model
In the Monte Carlo experiments for the stochastic frontier function model, there are three explanatory variables in x: the first one is the intercept term, the second one is randomly drawn from the standard normal distribution, and the third one is randomly drawn from the centered chi-squared distribution . The true coefficient vector for the explanatory variables is . We fix , thus , where is either 2, 1, 0.5, 0.25, 0.1 or 0. For the PML criterion function (1) using the original likelihood function, is set to 4, and in the information criterion (2) is taken to be , which is chosen in a way similar to that for the sample selection model. For the PML criterion function using the transformed likelihood function as in (5), and .
Table 6 reports the probabilities that the PMLEs select the right model. For sample size , when , both the PMLE-o and PMLE-t estimate to be nonzero with probabilities higher than 80%. However, when , 0.5, 0.25 or 0.1, the PMLEs estimate to be nonzero with very low probabilities. With , the PMLEs estimate as zero with probabilities higher than 85%. There is a weak identification issue for the stochastic frontier function model similar to that for the sample selection model: , where and . Thus, when is nonzero but small, the MLE and thus the PMLEs can perform poorly, which can be seen from Table 7. When the sample size increases from 200 to 600, the probabilities for and increase, but others decrease except that of the PMLE-o with .
Table 6.
Probabilities that the PMLEs of the stochastic frontier function model select the right model.
Table 7.
The biases, SEs and RMSEs of the estimators when in the stochastic frontier function model.
Table 7 presents biases, SEs and RMSEs of the MLE, PMLE-o, PMLE-t and MLE-r with the restriction imposed, even though . Since the MLE-r imposes the wrong restriction, it has very large biases for , and but it generally has the smallest SEs. The MLE, PMLE-o and PMLE-t of and have similar features. For , 1 and 0.5, the biases of the PMLEs of , and are generally larger than those of the MLE, but are smaller than those of the MLE-r. The SEs of the PMLEs are larger than those of the MLE for and 1 but are smaller for smaller values of . For = 0.25 and 0.1, even though the PMLEs estimate as zero with high probabilities, they have smaller biases, SEs and RMSEs than those of the MLE in almost all cases. As the sample size n increases, all estimates have smaller SEs, the MLEs have smaller biases, but the MLE-r and PMLEs may have smaller or larger biases.
The biases, SEs and RMSEs of the estimators when are presented in Table 8. All estimators of various estimation methods have similar summary statistics for and . For other parameters, the MLE-r has the smallest biases, SEs and RMSEs, since it imposes the correct restriction . The PMLEs have much smaller biases, SEs and RMSEs than those of the MLE. The biases, SEs and RMSEs of the PMLE-o are smaller than those of the PMLE-t. As the sample size increases to 600, the summary statistics of the PMLE-o become very close to those of the MLE-r. For all estimates, we observe smaller biases, SEs and RMSEs for a larger sample size.
Table 8.
The biases, SEs and RMSEs of the estimators when in the stochastic frontier function model.
5. Conclusions
In this paper, we investigate the estimation of parametric models with singular information matrices using the PML based on the adaptive lasso (group lasso). An irregular model has a singular information matrix occurring at a subvector of the true parameter vector being zero, but its information matrices at other parameter values are nonsingular. In addition, if we knew that is zero, the restricted model always has a nonsingular information matrix. We show that the PMLEs have oracle properties. Consequently, the PMLEs always have the -rate of convergence, no matter whether or not, while the MLEs usually have slower than the -rate of convergence and their asymptotic distributions might not be normal when . The PML can conduct model selection and estimation simultaneously. As examples, we consider the PMLEs for the sample selection model and the stochastic frontier function model, which can be formulated with both original structural parameters of interest and transformed parameters. Our Monte Carlo results show that the PMLE formulated with the original parameters generally performs well and outperforms the reparameterized one in terms of smaller RMSEs.
Acknowledgments
Fei Jin gratefully acknowledges the financial support from the National Natural Science Foundation of China (No. 71501119).
Author Contributions
The authors have contributed equally to this work.
Conflicts of Interest
The authors declare no conflict of interest.
Appendix A. MLE of the Sample Selection Model
In this section, we derive the asymptotic distribution of the MLE of the sample selection model (3). The irregularity of the information matrix occurs at , which is in the interior of the range for the correlation coefficient. So for this model, the true parameter vector of interest is in the interior of the compact parameter space . In addition, we assume that the exogenous variables and are uniformly bounded, the empirical distribution of converges in distribution to a limiting distribution and the matrices and exist and are positive definite. These assumptions are strong enough to establish the asymptotic properties in this section.
The log likelihood function of model (3) divided by n is
where and is the standard normal distribution. The first order derivatives of are
where , , and with being the standard normal pdf. It is known that the variance-covariance matrix of a vector of random variables is positive definite if and only if there is no linear relation among the components of the random vector (Rao 1973, p. 107). Under the assumed regularity conditions, one can easily show that when , the gradients (A2)–(A5) at are linearly independent w.p.a.1., and hence the limiting matrix of , where is the information matrix with the sample size n, is positive definite. Thus, there are no irregularities in the model when , and the MLE is -consistent and asymptotically normal.
However, when and together with , there are some irregularities in the model. With , the first order derivatives are
These derivatives are linearly independent as long as x and are linearly independent, which will usually be the case if z contains some relevant continuous exogenous variables with nonzero coefficients. However, when the non-intercept variables in z have coefficients equal to zero, is a constant for all i, and the first component of and are linearly dependent as x contains an intercept term. It follows that the information matrix must be singular. We consider this irregularity below. Let , with being a scalar, with being the coefficient for the intercept term of the selection equation, , , , and . Then,
where . Furthermore, the submatrix of the information matrix corresponding to with the sample size n is
The limit of has full rank under the assumed regularity conditions. Thus, the rank of the information matrix is one less than the total number of parameters. This sample selection model (3) has irregularities similar to the stochastic frontier function model in Lee (1993), with the exception that the true parameter vector is not on the boundary of a parameter space. The asymptotic distribution of its MLE can be similarly derived. The method in Rotnitzky et al. (2000) can also be used, but the method in Lee (1993) is simpler for this particular model.
Consider the transformation of to defined by , where with being the number of variables in x.9 At , . Define by
which is the log likelihood divided by n in terms of and . Then
and by (A10),
Thus, the derivative of with respect to at is zero. The derivative can be interpreted as the residual vector of the minimum mean square regression of on . The linear dependence relation (A10) implies that the residual vector must be zero and . Furthermore, we see that
Then by (A12) and (A7),
where denotes the th component of . This is a second irregularity of the model. Following Lee (1993) and Rotnitzky et al. (2000), consider the transformation of to defined by , where and with being the number of parameters in z, and the function defined by
Then
At , . By (A13) and the linear dependence relation in (A14),
and
Since the first and second order derivatives of with respect to at are zero, it is necessary to investigate the third order derivative of with respect to at . By (A18) and (A10),
Note that . Since , , , and , it is straightforward to show that
and
Then
Thus, is not linearly dependent on . Under this circumstance, as in Rotnitzky et al. (2000), the asymptotic distribution of the MLE can be derived by investigating high order Taylor expansions of the first order condition of . For the stochastic frontier function model, Lee (1993) shows that the asymptotic distribution of the MLE can be derived by considering one more reparameterization. We employ the approach in Lee (1993).10 Note that a Taylor expansion of around up to the second order yields
where the second equality follows by (A20) and (A21). Consider the transformation of to defined by
and the function defined by
It follows that
Hence,
From (A27) and (A23), and are linearly independent. Then the information matrix for is nonsingular and the MLE has the asymptotic distribution
where
The complete transformation for the model is
The inverse transformation is
With the asymptotic distribution of in (A28), the asymptotic distribution of the MLE for the original parameters can then be derived from the inverse transformations (A30)–(A34) by Slutsky’s theorem and the continuous mapping theorem. From (A34), . By the matrix inverse formula in a block form, is asymptotically normal . Then it follows that is asymptotically distributed as a cubic root of a normal variable, and converges in distribution at a much lower rate of convergence.11 Since
the MLE has the same rate of convergence as , and the asymptotic distribution of is the same as that of . Similarly, as
has the same asymptotic distribution as . Both and converge in distribution at some lower rates of convergence and are not asymptotically normally distributed. is asymptotically distributed as a cubic root of a normal variable and is asymptotically proportional to . is asymptotically distributed as a power of a normal variable. The remaining estimates and , however, have the usual order and is asymptotically normally distributed. From the information matrix in (A29), the joint asymptotic distribution of , , , and can also be derived.
Appendix B. Proofs
Proof of Proposition 1.
When , by Assumption 2, and . Then, w.p.a.1.,
When , if ,
if , . Thus, w.p.a.1., for any ,
By Lemma 2.4 in Newey and McFadden (1994), under Assumption 1. Hence, w.p.a.1.,
Let be any relative open subset of containing . As is compact and is uniquely maximized at , for some , . Therefore, choosing , it follows that w.p.a.1. . Thus, the consistency of follows. ☐
Proof of Proposition 2.
Let . As in Fan and Li (2001), we show that for any given , there exists a large enough constant C such that
We consider the two cases and separately.
(i) . Note that Taylor’s theorem still holds when some parameters are on the boundary (Andrews 1999, Theorem 6) as the parameter space is convex. Then by a first order Taylor expansion of u at 0, w.p.a.1.,
where is the subvector of u that consists of the last p elements of u, and lies between u and 0. The first term on the r.h.s. excluding u has the order . As , the second term on the r.h.s. excluding and u has the order . The third term on the r.h.s. excluding has the order , since and . By the Cauchy-Schwarz inequality, the fourth term on the r.h.s. is bounded by . Since is negative definite, for a sufficiently large C, the second term dominates other terms. Thus, (A35) holds.
(ii) . If , then and the PMLE becomes the restricted MLE with imposed. Thus, . If , then and
Expanding by Taylor’s theorem as in (i), we see that (A35) holds.
Equation (A35) implies that there exists a local maximum in the ball with probability at least . Furthermore, for given , because is a consistent estimator of by Proposition 1, there exists a small ball with radius , such that . So one may choose C such that the small ball is a subset of and (A35) holds. Because , this implies that . Then the result in the proposition holds. ☐
Proof of Proposition 3.
From the construction of in (1), if the initial , is set to zero. So it is sufficient to consider . If , we have the first order condition
By a first order Taylor expansion, , where lies between and . Let be a relative compact neighborhood of contained in . Under Assumption 4, by Lemma 2.4 in Newey and McFadden (1994), , , and and are continuous for . For on , Lemma 3.6 in Newey and McFadden (1994) holds and . Then as its variance has the order . As is compact, . Thus, . Furthermore, if the information matrix is nonsingular, by Proposition 2, and . Since , there must be some component of , where p is the length of , such that . Then . Under Assumption 5 (i), the first term on the l.h.s. of (A36) has the order , but the maximum of the components in absolute value of the second term goes to infinity w.p.a.1., then (A36) cannot hold with a positive probability. Under Assumption 5 (ii), the first term on the l.h.s. of (A36) multiplied by has the order , but the maximum of the components in absolute value of the second term multiplied by goes to infinity w.p.a.1., then (A36) cannot hold with a positive probability either. Hence, as .
Since , w.p.a.1., we have the first order condition By the mean value theorem,
where lies between and . Thus,
Under Assumption 4, and the information matrix equality holds, thus the result in the proposition follows. ☐
Proof of Proposition 4.
When , by Proposition 2, under Assumption 6, and also w.p.a.1. As , we have the first order condition
Applying the mean value theorem to the first term on the l.h.s. yields
where lies between and . As in the proof of Proposition 3, and . The second term on the l.h.s. has the order . By Assumption 6, the third term on the l.h.s. has the order . Thus,
Since and the information matrix equality holds, has the asymptotic distribution in the proposition. ☐
Proof of Proposition 5.
We consider the following two cases separately: (1) , but ; (2) , but .
Case 1: , but . Let be the restricted MLE with the restriction imposed, where . As , . Then . By the setting of Case 1 and the definition of , since as , . Furthermore, by Proposition 2, . Then w.p.a.1., . Hence, as .
Case 2: , but . As , . By the definition of the MLE , . By Proposition 3, as , and . Then w.p.a.1., . By a first order Taylor expansion (Andrews 1999, Theorem 6), w.p.a.1.,
where lies between and , and lies between and . As in the proof of Proposition 3, , and . Then the first term on the r.h.s. has the order , the second term has the order since , the third term has the order , the fourth term has the order , and the last term goes to minus infinity as . Hence, as .
Combining the results in the above two cases, we have the result in the proposition. ☐
References
- Aigner, Dennis, C. A. Knox Lovell, and Peter Schmidt. 1977. Formulation and estimation of stochastic frontier production function models. Journal of Econometrics 6: 21–37. [Google Scholar] [CrossRef] [Scilit]
- Andrews, Donald W. K. 1999. Estimation when a parameter is on a boundary. Econometrica 67: 1341–83. [Google Scholar] [CrossRef] [Scilit]
- Chen, Jiahua. 1995. Optimal rate of convergence for finite mixture models. Annals of Statistics 23: 221–33. [Google Scholar] [CrossRef] [Scilit]
- Cox, David R., and David V. Hinkley. 1974. Theoretical Statistics. London: Chapman and Hall. [Google Scholar]
- Fan, Jianqing, and Runze Li. 2001. Variable selection via Nonconcave penalized likelihood and its oracle properties. Journal of the American Statistical Association 96: 1348–60. [Google Scholar] [CrossRef] [Scilit]
- Goldfeld, Stephen M., and Richard E. Quandt. 1975. Estimation in a disequilibrium model and the value of information. Journal of Econometrics 3: 325–48. [Google Scholar] [CrossRef] [Scilit]
- Jin, Fei, and Lung-Fei Lee. 2017. Irregular N2SLS and LASSO estimation of the matrix exponential spatial specification model. Journal of Econometrics. forthcoming. [Google Scholar]
- Kiefer, Nicholas M. 1982. A Remark on the Parameterization of a Model for Heterogeneity. Working Paper No 278. Ithaca, NY, USA: Department of Economics, Cornell University. [Google Scholar]
- Lee, Lung-Fei. 1993. Asymptotic distribution of the maximum likelihood estimator for a stochastic frontier function model with a singular information matrix. Econometric Theory 9: 413–30. [Google Scholar] [CrossRef] [Scilit]
- Lee, Lung-Fei, and Andrew Chesher. 1986. Specification testing when score test statistics are identically zero. Journal of Econometrics 31: 121–49. [Google Scholar] [CrossRef] [Scilit]
- Newey, Whitney K., and Daniel McFadden. 1994. Large sample estimation and hypothesis testing. In Handbook of Econometrics. Edited by James J. Heckman and Edward E. Leamer. Amsterdam: Elsevier, chapter 36. vol. 4, pp. 2111–245. [Google Scholar]
- Quandt, Richard E. 1978. Tests of the Equilibrium vs. Disequilibrium Hypotheses. International Economic Review 19: 435–52. [Google Scholar] [CrossRef] [Scilit]
- Rao, Calyampudi Radhakrishna. 1973. Linear Statistical Inferene and Its Applications. New York: John Wiley and Sons. [Google Scholar]
- Rothenberg, Thomas J. 1971. Identification in parametric models. Eonometrica 39: 577–91. [Google Scholar] [CrossRef] [Scilit]
- Rotnitzky, Andrea, David R.Cox, Matteo Bottai, and James Robins. 2000. Likelihood-based inference with singular information matrix. Bernoulli 6: 243–84. [Google Scholar] [CrossRef] [Scilit]
- Sargan, John D. 1983. Identification and lack of identification. Econometrica 51: 1605–33. [Google Scholar] [CrossRef] [Scilit]
- Silvey, Samuel D. 1959. The Lagrangean multiplier test. Annals of Mathematical Statistics 30: 389–407. [Google Scholar] [CrossRef] [Scilit]
- Wang, Hansheng, and Chelei Leng. 2007. Unified LASSO Estimation by Least Squares Approximation. Journal of the American Statistical Association 102: 1039–48. [Google Scholar] [CrossRef] [Scilit]
- Wang, Hansheng, and Chelei Leng. 2008. A note on adaptive group lasso. Computational Statistics and Data Analysis 52: 5277–86. [Google Scholar] [CrossRef] [Scilit]
- Wang, Hansheng, Bo Li, and Chelei Leng. 2009. Shrinkage Tuning Parameter Selection with a Diverging Number of Parameters. Journal of the Royal Statistical Society. Series B (Statistical Methodology) 71: 671–83. [Google Scholar] [CrossRef] [Scilit]
- Wang, Hansheng, Runze Li, and Chih-Ling Tsai. 2007. Tuning Parameter Selectors for the Smoothly Clipped Absolute Deviation Method. Biometrika 94: 553–68. [Google Scholar] [CrossRef] [Scilit] [PubMed]
- Yuan, Ming, and Yi Lin. 2006. Model selection and estimation in regression with group variables. Journal of the Royal Statistical Society, Series B 68: 49–67. [Google Scholar] [CrossRef] [Scilit]
- Zhang, Yiyun, Runze Li, and Chih-Ling Tsai. 2010. Regularization Parameter Selections via Generalized Information Criterion. Journal of the American Statistical Association 105: 312–23. [Google Scholar] [CrossRef] [Scilit] [PubMed]
- Zou, Hui. 2006. The adaptive lasso and its oracle properties. Journal of the American Statistical Association 101: 1418–29. [Google Scholar] [CrossRef] [Scilit]
| 1 | A model with the new parameter can be considered in the case of a nonzero . |
| 2 | As pointed out by an anonymous referee, our PML approach can also be applied to interesting economic models such as disequilibrium models and structural change models. For a market possibly in disequilibrium, an equilibrium is characterized by a parameter value on the boundary (Goldfeld and Quandt 1975; Quandt 1978). Structural changes can also be characterized by parameters on the boundary. Thus, our PML approach can be applied in those models with singular information matrices. |
| 3 | This implies that when , which simplifies later presentation for the asymptotic distribution of the PMLE. In the case that with and is allowed to be on the boundary of , when , some components of can still be on the boundaries of their parameter spaces, then the asymptotic distributions of their PMLEs will be nonstandard. |
| 4 | Proposition 2 is proved in the case of a nonsingular information matrix, similar to that in Fan and Li (2001). The method cannot be used in the case of a singular information matrix. However, the sparsity property can still be established by using only the consistency of under Assumption 5 (i). |
| 5 | As before, when , the PMLE of is . |
| 6 | Another irregular case is that consists of only a constant term and dichotomous explanatory variables, and contains the same set of dichotomous explanatory variables and their interaction terms. For this case, the reparameterization process discussed in Appendix A to derive the asymptotic distribution of the MLE also applies. |
| 7 | The method is similar to that in Lee (1993) for the stochastic frontier function model. |
| 8 | In theory, the information criterion (2) can achieve model selection consistency as long as satisfies the order requirement in Assumption 7. However, the finite sample performance depends on the choice of . From the proof of Proposition 5, when , for large enough n, should be smaller than the difference between the function values of the expected log density at the true parameter vector and at the probability limit of the restricted MLE with the restriction imposed. When , should be larger than the difference of the function values of the likelihood divided by n at the MLE and at the restricted MLE. For , and , we compute the second difference 1000 times, and set to be the sample mean plus 2 times the standard error, which yields = 0.26. We then set in all cases and for all sample sizes. We also tried setting to be the sample mean plus zero to four times the standard error. The results are relatively sensitive to the choice of k. We leave the theoretical study on the choice of the constant in to future research. |
| 9 | For the reparameterization in Lee (1993), the parameters and in are not taken to be the true values. Both methods work. The method here might be simpler in computation. |
| 10 | In Rotnitzky et al. (2000), for a general model, it is possible that the order of the first non-zero derivative with respect to the first component (last component in this paper) is either odd or even after proper reparameterizations. If the order is even, there is a need to analyze the sign of the MLE. In our case, the order is odd and the asymptotic distribution of the MLE can be derived by considering one more reparameterization. |
| 11 | Note that we cannot use the delta method because is not differentiable at . |
© 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).