MEBoost: Variable Selection in the Presence of Measurement Error
Abstract
[Summary]We present a novel method for variable selection in regression models when covariates are measured with error. The iterative algorithm we propose, Measurement Error Boost (MEBoost), follows a path defined by estimating equations that correct for covariate measurement error. Via simulation, we evaluated our method and compare its performance to the recentlyproposed Convex Conditioned Lasso (CoCoLasso) and to the “naive” Lasso which does not correct for measurement error. Increasing the degree of measurement error increased prediction error and decreased the probability of accurate covariate selection, but this loss of accuracy was least pronounced when using MEBoost. We illustrate the use of MEBoost in practice by analyzing data from the Box Lunch Study, a clinical trial in nutrition where several variables are based on selfreport and hence measured with error.
1]Ben Brown
2]Timothy Weaver
3]Julian Wolfson
BROWN et al
Ben Brown, 400 USHwy 169, Minneapolis, MN 55426
400 USHwy 169, Minneapolis, MN 55426
1 Introduction
Variable selection is a wellstudied problem in situations where covariates are measured without error. However, it is common for covariate measurements to be errorprone or subject to random variation around some mean value. Consider, for instance, a study wherein subjects report their daily food intake on the basis of a dietary recall questionnaire. There is variation from day to day in an individual’s calorie consumption, but it is also well established in the nutrition literature that there is error associated with the recall or measurement of the number of calories in a meal ^{1, 2}. In the usual regression setting, ignoring measurement error leads to biased coefficient estimation ^{3}, and hence the presence of measurement error has the potential to affect the performance of variable selection procedures. In this example, we may be able to create a predictive model based on these mismeasured dietery recall data, that we can then apply the model to more expensive data that can be measured with reduced or eliminated measurement error such as with the help of a nutritionist or through prepackaged meals.
There has been relatively little research done about variable selection in the presence of measurement error. Sorensen ^{4} introduced a variation of the Lasso that allows for Normal, i.i.d., additive covariate measurement error. Datta and Zou ^{5} proposed the convex conditioned Lasso (CoCoLasso) which corrects for both additive and multiplicative measurement error in the normal case. Both of these methods are applicable to linear models for continuous outcomes, but do not easily extend to regression models for other outcome types (e.g., binary or count data). Meanwhile, there is a sizable statistical literature on methods for performing estimation and inference for lowdimensional regression parameters in the presence of measurement error ^{3, 6, 7}, but these approaches do not address the variable selection problem and cannot be applied in large , small problems.
We propose a novel method for variable selection in the presence of measurement error, MEBoost, which leverages estimating equations that have been proposed for lowdimensional estimation and inference in this setting. MEBoost is a computationally efficient pathfollowing algorithm that moves iteratively in directions defined by these estimating equations, only requiring the calculation (not the solution) of an estimating equation at each step. As a result, it is much faster than alternative approaches involving, e.g., a matrix projection calculation at each step. MEBoost is also flexible: the version that we describe is based on estimating equations proposed by Nakamura ^{8}, which apply to some generalized linear models, and the underlying MEBoost algorithm can easily incorporate measurement errorcorrected estimating equations for other regression models. We conducted a simulation study to compare MEBoost to the Convex Conditioned Lasso (CoCoLasso) proposed by Daata and Zou ^{5} and the “naive” Lasso which ignores measurement error. We also applied MEBoost to data from the Box Lunch Study, a clinical trial in nutrition where caloric intake across a number of food categories was based on selfreport and hence measured with error.
2 Background
2.1 Regression in the Presence of Covariate Measurement Error
Our discussion of measurement error models draws heavily from Fuller ^{7}. When modeling error the covariates can be treated as random or fixed values. Structural models consider the covariates to be random quantities and functional models consider the covariates to be fixed ^{9}. We consider a structural model. Let , where is a (random) matrix of covariates of dimension , a vector of coefficients of length , is a vector of Normally distributed i.i.d. random errors of length , and is the resultant outcome vector also of length . In an additive measurement error model, we assume that what is observed is not but rather the “contaminated” or “errorprone” matrix where a random matrix.
When a model is fit that ignores measurement error, i.e. it assumes that the true model is , the resulting estimates are said to be naive and satisfy
(1) 
where is the true coefficient vector, is the covariance matrix of the covariates and is the covariance matrix of the measurement error. In the case of linear regression with a single covariate, (1) simplifies to an attenuating factor that biases the coefficient estimates towards zero. However, with multiple covariates the bias may increase, decrease, and even change the sign of the estimated coefficients. Notably, measurement error affecting a single covariate can bias coefficient estimates in all of the covariates, even those that are not measured with error ^{9}.
2.2 Variable selection in the Presence of Measurement Error
Ma ^{10} presented methods to account for measurement error while performing variable selection in parametric and semiparametric settings. Focusing on the parametric setting, they proposed a wide scoping method that can be used in more than just generalized linear models. The method relies on deriving the full likelihood of each observation and it’s corresponding score function, , choosing a penalty function and finding its derivative, , then solving the penalized estimating equations:
(2) 
Solving the penalized equations can be very difficult computationally, especially in the high dimensional setting. Therefore, we will look to compare our method with faster methods that are variants of the Lasso, which can be solved much more quickly.
2.3 Lasso in the Presence of Measurement Error
Sorensen et al. ^{4} analyze the Lasso ^{11} in the presence of measurement error by studying the properties of
(3) 
is asymptotically biased when since . Notice this is the same bias that is introduced when naive linear regression is performed on observed covariates. Sorensen et al. ^{4} derive a lower bound on the magnitude of the nonzero coefficient elements below which the corresponding covariate will not be selected, and an upper bound on the estimation error . They show that with increasing measurement error the lower bound increases, i.e., increasing measurement error adds noninformative noise to the system and so for the signal associated with the relevant covariates to be identified the signal must increase. Increased measurement error also leads to an increase in the upper bound of the estimation error. Sign consistent selection is also impacted by the presence of covariate measurement error. Sorensen et al. ^{4} set a lower bound on the probability of sign consistent selection in this setting. The result requires that the Irrepresentability Condition with Measurement Error (ICME) holds. The ICME requires that the measurements of the relevant and irrelevant covariates have limited correlation, relative to the size of the relevant measured covariate correlation. Note the sample correlation of the irrelevant covariates is not considered. By studying the form of the lower bound, it can be concluded that (at least when using the Lasso) measurement error introduces a greater distortion on the selection of irrelevant covariates than it does in the selection of relevant covariates.
Sorensen et al. ^{4} introduced an iterative method to obtain the Regularized Corrected Lasso with constraint on the radius R:
(4) 
The main results of their simulation study were consistent with their analytical results, namely that the corrected Lasso had a slightly lower selection rate for the true covariates than the naive Lasso, but was also more conservative in including irrelevant covariates. Further, the prediction error, as measured by both and , was lower for the corrected Lasso.
The major drawback of the corrected Lasso method is that it is very computationally intensive, involving an iterative calculation where each step involves a projection of an updated onto the ball for a given radius R. The iterative process must be conducted for each fixed value of the radius R. The selected values of R provide a path of possible solutions for . Hence, the approach seems impractical for largescale problems and for repeated application in a simulation study.
2.4 The Convex Conditioned Lasso (CoCoLasso)
A recent paper by Datta and Zou ^{5} proposes an alternative approach which they refer to as the Convex Conditioned Lasso (CoCoLasso). Consider the following reformulation of the Lasso problem,
(5) 
The CoCoLasso is based on the Loh and Wainwright corrections ^{12} for the predictoroutcome correlation and variance matrix in the presence of measurement error. When errorprone covariates are measured in place of , we can get corrected estimates and :
(6) 
where is the (assumed known) variance in the measured . These estimators are unbiased. A measurement error corrected Lasso estimate could then be derived by substituting and into (5). The problem with this idea is that the corrected matrix may not be a valid covariance matrix, since it is possible to be non positive semidefinite. If has a negative eigenvalue, then this Lasso function would be nonconvex and unbounded. To overcome this obstacle, the key to the CoCoLasso ^{5} is calculating the projection of onto the space of positive definite matrices:
(7) 
The CoCoLasso then solves a standard Lasso problem in which and with the corrected values from (6) and (7), yielding the CoCoLasso estimator:
(8) 
When is not positive definite, the projection from (7) can be challenging to compute. However, the projection only needs to be done once, unlike the Sorensen correction ^{4} which requires a projection at each iteration.
3 MEBoost: Measurement Error Boosting
Our proposed variable selection algorithm, MEBoost (Measurement Error Boosting), is based on an iterative functional gradient descent type algorithm that generates variable selection paths. The key idea is that, instead of following a path defined by the gradient of a loss function (e.g., the likelihood), the “descent” follows the direction defined by an estimating equation . The algorithmic structure of MEBoost is shared with ThrEEBoost (Thresholded Estimating Equation Boost, ^{13}), a generalpurpose technique for variable selection based on estimating equations. While ThrEEBoost described an approach to performing variable selection in the presence of correlated outcomes by leveraging the Generalized Estimating Equations ^{14}, MEBoost achieves improved variable selection performance in the presence of measurement error by following a path defined by a measurement error corrected score function due to Nakamura which is described in Section 3.1. Nakamura’s approach is applicable to linear regression models with normal additive or multiplicative measurement error. Closedform corrected score functions are also derived for Poisson, Gamma, and Wald regression. Nakamura comments that no closed form correction can be created for logistic regression. By using this family of corrected score functions, the MEBoost algorithm is more broadly applicable than the corrected Lasso and CoCoLasso, neither of which is obviously generalizable beyond linear regression.
3.1 Corrected Score Function
Nakamura ^{8} proposed a set of corrected score functions for performing estimation and inference in the generalized linear regression model where covariates are subject to additive measurement error with known variance matrix . In general, the corrected score function S* based on the covariates measured with error (), has the expectation equal to the score function, S, based on the true covariates (). For the normal linear model, Nakamura proposed the following correction to the negative loglikelihood to account for measurement error:
(9) 
Differentiating (9) with respect to , we obtain the corrected score function:
(10) 
In this case the corrected score function is the ’naive’ score function, , with a measurement error correction determined by the sample size, model error, measurement errors, and the coefficient value: . The naive score function is the score function from the true model calculated with the measured covariates:
(11) 
The corrected variance estimate will be calculated as , which in the normal case is:
(12) 
Similarly to the corrected score function, the corrected variance estimate is the naive variance estimate, , with a measurement error correction. The correction reduces the estimated variance, thus subtracting the noise introduced by the measurement error. In the variance case the correction factor is determined only by the true coefficient vector and the measurement error variance.
As another example, the correction for Poisson distributed data is the following:
(13) 
which we apply in our data application (see Section 5). Nakamura ^{8} also provides corrections for multiplicative measurement error in linear regression, as well as measurement error in Gamma and Wald regression. In what follows, we use the normal linear additive measurement error corrected score function as part of an iterative pathfollowing algorithm that performs variable selection in the presence of covariate measurement error.
3.2 The MEBoost Algorithm
Our proposed variable selection algorithm, MEBoost, consists of applying ThrEEBoost with the corrected score function and corrected variance estimate described in the previous section. Algorithm 1 summarizes the MEBoost procedure.
Let be the fixed thresholding parameter. Starting with a estimate of 0 and a , the corrected score function is calculated at these values, and the magnitude of each component of is recorded. The indices of elements to update are identified by a thresholding rule, . The next point in the variable selection path, , is obtained by adding a small value, , to each of these elements in the direction corresponding to the signs of each for . This updated is used to calculate an updated corrected . The algorithm continues for iterations, where is typically chosen to be large (e.g., 1,000).
The parameters , and interact to determine the specific variable selection path that results from the algorithm. The smaller the value of the smaller the distance between estimates on the selection path, while a larger value of leads to larger jumps in the selection path. Ideally, a very small value of (e.g., 0.01). would be used, but if is large, a large number of iterations, , may be required to generate a selection path. This of course is the tradeoff one is required to make when determining the step size. A selection path incremented by only a small value is preferable to a path which takes large steps, but the time required for a large number of iterations may become prohibitive. With each of the iterations those elements of the coefficient vector that are still of size zero have not been selected at this iteration. A conservative selection approach takes a combination of small and , whereas a more aggressive approach takes a combination of larger value and . In the case when , the MEBoost algorithm only updates the element(s) with the maximum absolute value. For any combination of and , this is the most conservative approach that can be taken and will lead to sparser models than when a threshold is considered. It also requires a much larger value of .
The parameter determines how many coefficients are updated at each iteration; it offers a compromise between updating each coefficient at every iteration (, similar to standard gradient descent) and updating only the coefficient corresponding to the element of the estimating equation with largest magnitude (). In the context of Generalized Linear Models without measurement error, Wolfson ^{15} showed that setting yields an update rule that is asymptotically equivalent (as , , and ) to following the path of minimizers of an penalized projected artificial loglikelihood ratio whose tangent is the GLM score function. In the case when , the MEBoost algorithm only updates the element(s) with the maximum absolute value. For any combination of and , this is the most conservative approach that can be taken and will lead to sparser models than when a threshold is considered. It also requires a much larger value of . By allowing multiple directions to be updated at each iteration, MEBoost can explore a much wider range of variable selection paths; as we discuss later, crossvalidation can be used to select the parameter which leads to the optimal level of thresholding. In ThrEEBoost ^{13}, it was shown that a threshold in the range of 0.40.8 may perform better than thresholds closer to 0 or 1.
3.2.1 Connection to the MELasso
Nakamura’s measurement corrected score functions are derivatives of corrected negative log likelihoods. In the normal case, the correction is exactly that described in Sorensen et al. (see Equation (3)). Hence, the arguments of Rosset ^{16} can be applied to show that 1) MEBoost applied with and threshold value , and 2) the solutions to (3), have the same local behavior. Specifically, under some regularity conditions ^{15}, as and with , MEBoost’s iterative steps match the sequence of solutions to (3).
3.2.2 Selecting a final model
For a fixed , identifying a final model involves choosing a point on the variable selection path generated by Algorithm 1; this is akin to choosing the penalty parameter in the Lasso. Crossvalidation using a loss function relevant to the problem at hand (e.g., mean squared error) can be used to select a on the path. Crossvalidation can similarly be used to select the best value of . The full procedure is described in Algorithm 2.
4 Simulation Study
To examine the impact of measurement error in the covariates on variable selection we performed a simulation study. We evaluated MEBoost by comparing it to two variable selection methods: the Convex Conditioned Lasso (CoCoLasso), and the “naive” Lasso which does not correct for measurement error.
4.1 Simulation Setup
Data were generated from a linear regression model with iid normal errors, ; where and . The sample size for all studies is 80. The true covariates are drawn from a multivariate normal distribution, . is a block diagonal matrix with diagonal entries equal to 1, and 10 by 10 blocks corresponding to a group of 10 covariates with an exchangeable correlation structure with common pairwise correlation . In all simulations the true model has 10 nonzero coefficients and 90 zero coefficients, i.e., , so that the relevant covariates in the first block were correlated.
The measured covariates were generated as for a matrix whose columns were generated as described below. To explore the impact of different types of measurement error, we considered 10 different scenarios for generating the columns of and varying the assumptions made about it. In the first five scenarios, is assumed to be normally distributed with mean zero and covariance matrix , and the scenarios explore different structures for . In each of Scenarios 15, we correctly specify the distribution of when applying MEBoost and the CoCoLasso. Scenarios 610 explore cases where the distribution of is incorrectly specified.

Base case: , where the identity matrix, and .

Varying : for j in 110. This pattern repeats across the blocks of 10 covariates. The relevant covariates have similar spreads of measurement error to the irrelevant covariates.

Correlated Measurement Error: Measurement error was assumed normally distributed with an exchangeable correlation structure Within each block, where , , , and is vector of ones.

Varying with correlation: is distributed normally and is centered at 0 with for j in 110. This pattern repeats across the blocks of 10 covariates. The relevant covariates have similar spreads of measurement error to the irrelevant covariates. In blocks of ten, there is correlation in of 0.3

Some ’s not measured with error: , where , and for .

Overestimated : generated as in Scenario 1, but we specify .

Underestimated : generated as in Scenario 1, but we specify .

Misspecified correlation: generated as in Scenario 3, but we ignore the correlation and specify in running MEBoost and CoCoLasso.

Measurement error is distributed uniformly: Each entry of is generated independently from a Uniform distribution, . MEBoost and CoCoLasso are run assuming with .

Measurement error is distributed asymmetrically: Each entry of is generated independently from a shifted exponential distribution, . MEBoost and CoCoLasso are run assuming with .
MEBoost was performed for each threshold value in the set , and crossvalidation (using the errorprone covariates) was used to select the optimal value of and number of MEBoost iterations, as well as the value of in the CoCoLasso and naive Lasso. We compared MEBoost, CoCoLasso, and naive Lasso on two metrics of prediction error: mean squared error based on the true covariates (MSE = ), mean squared error prediction based on the measured covariates (MSEM = ). These metrics were estimated using independent test sets generated during each individual simulation. We also computed distance from the true , and variable selection sensitivity and specificity. For each scenario the metrics presented are the average over 1,000 simulations, and are calculated at intervals of 0.05 along ; the true value, . Because the MEBoost algorithm may change multiple indices at each iteration it may not have values along each interval in the path. To account for this, a linear approximation of the relevant statistic was made at each point in the path.
We note that in this simulation study we chose to investigate model performance based on both the true and errorprone covariates. The motivation for techniques like ours which account for measurement error is to uncover the underlying relationship between the errorfree covariates and the outcome . Hence, in an ideal world, values of would be available on some subset (or an independent set) of observations so that prediction error could be assessed and the “best” model chosen. However, in practice we will often only have access to the errorprone covariates for model fitting. So, if errorfree measurements are not (and may never be) available, is it worthwhile to correct for measurement error? Buonaccorsi ^{17} argued against correction, using the logic that the future predictions will be based on (errorprone) , not on (errorfree) . Indeed, it can be shown in simple linear regression, that without the correction in a large sample the expected value of MSEM is less than or equal to that of an estimate ignoring measurement error. However, as seen in the results section that follows, we found that correcting for measurement error decreased prediction error regardless of whether predictions were computed using errorfree or errorprone covariates. Since we often only have mismeasured data available, it is reassuring to see that we are able to use the measured covariates to perform crossvalidation to select a model that will provide us with an accurate relationship between the outcome and true covariate. This finding is discussed in greater detail below.
4.2 Simulation Results
Table 1 presents the minimum MSE, MSEM, distance from the true , sensitivity, and specificity at the minimum MSE for the three variable selection methods across the 10 scenarios. In all ten scenarios, MEBoost had the lowest MSE, MSEM, and distance from the true . The CoCoLasso has 16.6%71.7% higher prediction error from the true covariates than MEBoost and in the case where measurement error is overestimated, the prediction error from the CoCoLasso is 5.26 times that of MEBoost. This is likely due to the fact that the Loh and Wainwright correction in (6) is more negative, and hence requires a “longer” (and hence potentially more distorting) projection onto the space of positive definite matrices.
In terms of variable selection, MEBoost had a greater sensitivity and lower specificity than CoCoLasso in each case while Lasso had the lowest specificity. The Lasso struggles most when correlation is present in the measurement error. The MSE is about 2.5 times that of MEBoost, when we allow MEBoost to account for the correlation. All methods perform poorly when we misspecify by ignoring the correlation. The sensitivity and specificity are at high levels for most simulations with the exception of the misspecified that ignored correlation. Overestimating lead to a more conservative selection process with a high specificity, while underestimating had a higher sensitivity. The distance from the true can also tell us about performance. Again, the scenario where we misspecify by ignoring correlation performs worst.
5 Data Application
We applied our method to baseline data collected in the Box Lunch Study, a randomized trial of the effects of portion size availability on weight change. In the study, a total of 219 subjects were randomized to one of four groups: in three groups, subjects were provided a free daily lunch with a fixed number of calories (400, 800, and 1600). The control group was not provided a free lunch.
We considered the problem of predicting the number of times subjects reported binging on food in the last month, using Poisson regression with 99 explanatory variables. All variables were measured at baseline. 16 of the 99 explanatory variables were selfreported measures; of these 16, 8 were measures of food consumption and therefore possibly subject to substantial measurement error we will notate . Another 8 may have also been measured with error, notated . Kipnis ^{18} examined a nutritional study with a 24 hour recall, and found that the correlation between the true and reported consumption of protein and energy was only 0.336. We assume this relationship exists in each of our variables measured with error. Assuming the measurement error variance is independent of the variance of the true covariate , we can obtain:
(14) 
and hence This is the value we will need to provide MEBoost for our assumption of the measurement error. We assume this level of measurement error for each 24 hour dietary recall variable. After scaling our predictors to have zero mean and unit variance, we applied our method with the Nakamura correction. Since our measured data has its variance () scaled to equal 1, we assumed that the 8 dietary recall covariates measured with error had . Since dietary variables may be more prone to measurement error than other variables, we scaled the assumed error of the other 8 variables to be half that of the nutritional variables: . The remaining variables were assumed to be measured without error. We conducted a sensitivity analysis to assess the performance of our method by setting and 0.25.
To select tuning parameters, we employed 8fold cross validation based on the deviance on a training set consisting of 70% of the data. The performance of our model was evaluated on the remaining test set. We present the models derived from MEBoost performed with three different thresholds : 0.2, 0.6 (the approximate value estimated using crossvalidation), and 0.9.
Table 2 shows the selected variables and estimated prediction error (MSEM, bottom row) for various MEBoost models along with results from the naive Lasso. We did not compare to the Measurement Error Lasso or the CoCoLasso because implementing these techniques in a problem of this size was computationally infeasible. The deviance and MSEM were lowest for the model selected by MEBoost assuming the highest measurement error (= 0.887) and a threshold value of 0.6. This model ( and ) selected just 4 variables, which were a subset of the 7 chosen with the naive Lasso. The other two MEBoost models included up to two additional variables to the MEBoost model that minimized MSEM (selected with and ). Regardless of the assumption about the level of measurement error, using a threshold value of leads to the inclusion of several variables with small coefficients, and a much higher deviance and prediction error. Of particular note is that the naive Lasso (and MEBoost with the lower threshold) included the variable corresponding to the number of daily calories consumed at breakfast, while the bestperforming MEBoost models (with and 0.9) did not. Since it is based on a 24hour dietary recall, this variable may be particularly susceptible to measurement error induced by recall bias.
6 Discussion
We examined the variable selection problem in regression when the number of potential covariates is large compared to the sample size and when these potential covariates are measured with measurement error. We proposed MEBoost, a computationally simple descentbased approach which follows a path determined by measurement errorcorrected estimating equations. We compared MEBoost, via simulation and in a real data example, with the recentlyproposed Convex Conditioned Lasso (CoCoLasso) as well as the naive Lasso which assumes that covariates are measured without error. In almost all simulation scenarios, MEBoost performed best in terms of prediction error and coefficient bias. The CoCoLasso is more conservative with the highest specificity in each case, but sensitivity and prediction are better with MEBoost. In the comparison of selection paths, we saw that MEBoost was more aggressive in identifying variables to be included in the model more quickly than the CoCoLasso. These differences were most apparent when the measurement error had a larger variance and a more complex correlation structure. Specifically, when faced with a data set of 1000 observations and 1000 covariates, MEBoost obtained a solution in 1.3 seconds, while the CoCoLasso needed 6:17.
As shown in the simulation study, MEBoost has lower prediction error than the Lasso on independent test data when predictions are based on the true (i.e., nonerrorprone) covariates. It is interesting to note that MEBoost retains some advantage, albeit a more modest one, over the Lasso when predictions are based on errorprone covariates. This finding appears to contradict the intuition that accounting for covariate measurement error provides no benefit when the goal is prediction and errorfree covariates will never be available. However, the observed benefit in our simulation is likely due to the fact that MEBoost is somewhat more flexible than the Lasso as it uses an additional parameter, the threshold , which allows it to explore the model space more comprehensively. Nevertheless, it is reassuring that by using the errorprone covariates to perform crossvalidation and select a model, MEBoost still allows us to select a model that offers an improvement in prediction in the setting where we will have correctly measured covariates.
MEBoost, while a promising approach, has some limitations. One limitation–which is shared with many methods that correct for measurement error–is that we assume that the covariance matrix of the measurement error process is known, an assumption which in many settings may be unrealistic. In some cases, it may be possible to estimate these structures using external data sources, but absent such data one could perform a sensitivity analysis with different measurement error variances and correlation structures, as we demonstrate in the real data application. Another challenging aspect of model selection with errorprone covariates is that, even if the set of candidate models is generated via a technique which accounts for measurement error, the process of selecting a final model (e.g., via crossvalidation) still uses covariates that are measured with error. However, we showed in our simulation study that MEBoost performs well in selecting a model which recovers the relationship between the true (errorfree) covariates and the outcome, even when using errorprone covariates to select the final model. This finding suggests that the procedure for generating a “path” of candidate models has a greater influence on prediction error and variable selection accuracy than the procedure picking a final model from among those candidates.
To conclude, we note that while we only considered linear and Poisson regression in this paper, MEBoost can easily be applied to other regression models by, e.g., using the estimating equations presented by Nakamura ^{8} or others which correct for measurement error. In contrast, the approaches of Sorensen ^{4} and Datta ^{5} exploit the structure of the linear regression model and it is not obvious how they could be extended to the broader family of generalized linear models. The robustness and simplicity of MEBoost, along with its strong performance against other methods in the linear model case suggests that this novel method is a reliable way to deal with variable selection in the presence of measurement error.
References
 1 Spiegelman D, McDermott A, Rosner B. Regression calibration method for correcting measurementerror bias in nutritional epidemiology.. The American journal of clinical nutrition. 1997;65(4 Suppl):1179S–1186S.
 2 Fraser Gary E, Stram Daniel O. Regression calibration when foods (measured with error) are the variables of interest: markedly nonGaussian data with many zeroes.. American journal of epidemiology. 2012;175(4):325–31.
 3 Rosner B, Spiegelman D, Willett W C. Correction of logistic regression relative risk estimates and confidence intervals for random withinperson measurement error.. American journal of epidemiology. 1992;136(11):1400–13.
 4 Sørensen Øystein, Frigessi Arnoldo, Thoresen Magne. Measurement Error in Lasso: Impact and Correction. arXiv.org. 2012;.
 5 Datta A., Zou H.. CoCoLasso for Highdimensional Errorinvariables Regression. Annals of Statistics. 2017;(Accepted).
 6 Stefanski Leonard A., Carroll Raymond J.. Covariate Measurement Error in Logistic Regression. The Annals of Statistics. 1985;13(4):1335–1351.
 7 Fuller Wayne A., ed.Measurement Error Models. Wiley Series in Probability and StatisticsHoboken, NJ, USA: John Wiley & Sons, Inc.; 1987.
 8 Nakamura T.. Corrected score function for errorsinvariables models: Methodology and application to generalized linear models. Biometrika. 1990;77(1):127–137.
 9 Buonaccorsi John. Measurement Error: Models, Methods and Applications. Boca Raton: CRC Press; 2010.
 10 Ma Yanyuan, Li Runze. Variable selection in measurement error models. Bernoulli. 2010;16(1):274–300.
 11 Tibshirani Robert. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society Series B. 1996;58:267–288.
 12 Loh PoLing, Wainwright Martin J.. Highdimensional regression with noisy and missing data: Provable guarantees with nonconvexity. The Annals of Statistics. 2012;40(3):1637–1664.
 13 Brown Ben, Miller Christopher J., Wolfson Julian. ThrEEBoost: Thresholded Boosting for Variable Selection and Prediction via Estimating Equations. Journal of Computational and Graphical Statistics. 2017;:1–10.
 14 Liang KungYee, Zeger Scott L.. Longitudinal data analysis using generalized linear models. Biometrika. 1986;73(1):13–22.
 15 Wolfson Julian. EEBoost: A General Method for Prediction and Variable Selection Based on Estimating Equations. Journal of the American Statistical Association. 2011;106(493):296–305.
 16 Rosset Saharon, Zhu Ji, Hastie Trevor. Boosting as a Regularized Path to a Maximum Margin Classifier. Journal of Machine Learning Research. 2004;5:941–973.
 17 Buonaccorsi John P. Prediction in the Presence of Measurement Error: General Discussion and an Example Prediction in the Presence of Measurement Error: General Discussion and an Example Predicting Defoliation. Source: Biometrics. 1995;51(4):1562–1569.
 18 Kipnis Victor, Subar Amy F, Midthune Douglas, et al. Structure of dietary measurement error: results of the OPEN biomarker study.. American journal of epidemiology. 2003;158(1):14–21; discussion 22–6.
Appendix A Tables
Scenario  Method  MSE  MSEM  D  SENS  SPEC 

Measurement error  MEBoost  4.86  10.65  5.17  0.95  0.86 
iid  Lasso  7.13  11.63  6.75  0.98  0.75 
CoCoLasso  6.30  12.53  6.04  0.92  0.91  
Varying  MEBoost  4.88  10.52  5.21  0.96  0.85 
Lasso  7.08  11.42  6.76  0.98  0.76  
CoCoLasso  7.18  14.84  6.50  0.85  0.95  
Some  MEBoost  3.65  6.70  3.57  0.99  0.87 
Lasso  4.88  6.23  5.42  0.99  0.83  
CoCoLasso  6.23  11.15  5.60  0.92  0.95  
Varying  MEBoost  6.19  19.12  6.27  0.95  0.87 
& correlation  Lasso  15.18  21.42  9.63  0.80  0.79 
CoCoLasso  8.94  22.47  7.77  0.78  0.94  
Correlation in  MEBoost  6.16  19.27  6.29  0.95  0.87 
measurement error  Lasso  15.78  22.24  9.75  0.80  0.79 
CoCoLasso  8.67  22.29  7.81  0.78  0.94  
Overestimated  MEBoost  4.00  10.21  3.46  0.94  0.94 
Lasso  7.18  11.71  6.75  0.98  0.76  
CoCoLasso  21.05  28.22  9.11  0.37  1.00  
Underestimated  MEBoost  5.54  10.81  6.28  0.98  0.76 
Lasso  7.18  11.71  6.75  0.98  0.76  
CoCoLasso  6.46  12.02  6.20  0.95  0.87  
Misspecified ,  MEBoost  12.79  21.03  9.41  0.86  0.80 
ignores correlation  Lasso  15.78  22.24  9.75  0.80  0.79 
CoCoLasso  15.67  24.17  9.51  0.55  0.93  
Measurement error  MEBoost  4.89  10.68  5.16  0.95  0.85 
from asymmetric  Lasso  7.21  11.85  6.81  0.98  0.75 
distribution  CoCoLasso  7.32  15.20  6.71  0.85  0.95 
Measurement error  MEBoost  4.81  10.52  5.17  0.96  0.84 
from uniform  Lasso  7.19  11.75  6.80  0.99  0.75 
distribution  CoCoLasso  6.61  13.91  6.26  0.87  0.94 
Naive  
Variable  Lasso  
Ate lg amt past 28 days  0.09  0.23  0.39  0.08  0.23  0.33  0.09  0.22  0.29  0.21 
Lost control past 28 days  0.09  0.23  0.21  0.08  0.23  0.22  0.09  0.22  0.23  0.24 
TFEQ Disinhibition  0.09  0.23  0.09  0.08  0.23  0.18  0.09  0.22  0.21  0.17 
BCT: Max clicks for pizza slice  0.09  0.21  0.1  0.08  0.23  0.19  0.09  0.22  0.2  0.16 
Long fast (0=no days 6=every day)  0.09      0.08      0.09       
Judge your shape (0=not at all 6=markedly)  0.07      0.07  0.06    0.07  0.06     
Judge your weight (0=not at all 6=markedly)  0.07      0.07    0.06  0.07  0.06  0.06  0.06 
Dissatisfied with shape (0=not at all 6=markedly)  0.07      0.07      0.07       
BCT: Rounds of clicking for pizza  0.06      0.06      0.07       
BCT: Pmaxpizza/(Pmaxpizza+Pmaxread)  0.06      0.06      0.06       
TFEQ Hunger  0.06      0.06      0.06       
Dissatisfied with weight (0=not at all 6=markedly)  0.06      0.06      0.06       
NDSR breakfast kcals at BL  0.06      0.05            0.08 
CDRS body image (1=thinnest 9=fattest)  0.05      0.05      0.05       
Dem9 Household income                    0.05 
Eat lunch in cafeteria              0.05       
Eat items from home, days/wk  0.06      0.06      0.06       
Cohort first lunch date  0.07      0.07      0.08       
Deviance  210.43  89.06  100.49  222.07  90.22  93.23  208.07  90.63  90.38  97.12 
MSEM  22.35  5.61  8.10  23.28  5.69  7.29  22.04  5.97  6.21  7.89 