Conley Standard Errors in R30 Aug 2015
Correcting for Spatial and Temporal Auto-Correlation in Panel Data:
R to Estimate Spatial HAC Errors per Conley (1999, 2008)
tl;dr: Fast computation of standard errors that allows for serial and spatial auto-correlation.
Economists and political scientists often employ panel data that track units (e.g., firms or villages) over time. When estimating regression models using such data, we often need to be concerned about two forms of auto-correlation: serial (within units over time) and spatial (across nearby units). As Cameron and Miller (2013) note in their excellent guide to cluster-robust inference, failure to account for such dependence can lead to incorrect conclusions: “[f]ailure to control for within-cluster error correlation can lead to very misleadingly small standard errors…” (p. 4).
Conley (1999, 2008) develops one commonly employed solution. His approach allows for serial correlation over all (or a specified number of) time periods, as well as spatial correlation among units that fall within a certain distance of each other. For example, we can account for correlated disturbances within a particular village over time, as well as between that village and every other village within one hundred kilometers.
We provide a new function that allows
R users to more easily estimate these corrected standard errors. (Solomon Hsiang (2010) provides code for STATA, which we used to test our estimates and benchmark speed.) Moreover using the excellent
RcppArmadillo packages (and Tony Fischetti’s Haversine distance function), our function is roughly 20 times faster than the STATA equivalent and can scale to handle panels with more units. (We have used it on panel data with over 100,000 units observed over 6 years.)
We first use Hsiang’s STATA code to compute the corrected standard errors (spatHAC in the output below).
cd "~/Dropbox/ConleySEs/Data" clear use "new_testspatial.dta" tab year, gen(yy_) tab FIPS, gen(FIPS_) timer clear 1 timer on 1 ols_spatial_HAC EmpClean00 HDD CDD yy_* FIPS_2-FIPS_362, lat(lat ) lon(lon ) t(year) p(FIPS) dist(500) lag(5) bartlett disp # ----------------------------------------------- # Variable | OLS spatial spatHAC # -------------+--------------------------------- # HDD | -0.283 -0.283 -0.283 # | 0.650 0.886 0.894 # CDD | 2.497 2.497 2.497 # | 1.493 4.068 4.388 timer off 1 timer list 1 # 1: 25.42 / 1 = 25.4170
Using the same data and options as the STATA code, we then estimate the adjusted standard errors using our new R function. This requires us to first estimate our regression model using the
felm function from the
We use the
felm() from the
lfe package to estimate model with year and county fixed effects.
Two important points:
- We specify our latitude and longitude coordinates as the cluster variables, so that they are included in the output (
- We specify
keepCx = TRUE, so that the centered data is included in the output (
We then feed this model to our function, as well as the cross-sectional unit (county
FIPS codes), time unit (
year), geo-coordinates (
lon), the cutoff for serial correlation (5 years), the cutoff for spatial correlation (500 km), and the number of cores to use.
Estimating the model and computing the standard errors requires under two seconds, making it many times faster than the comparable STATA routine.
R Using Multiple Cores:
Even with a single core, we realize significant speed improvements. However, the gains are even more dramatic when we employ multiple cores. Using 4 cores, we can cut the estimation of the standard errors down to around 0.4 seconds. (These replications employ the Haversine distance formula, which is more time-consuming to compute.)
Given the prevalence of panel data that exhibits both serial and spatial dependence, we hope this function will be a useful tool for applied econometricians working in
Feedback Appreciated: Memory vs. Speed Tradeoff
This was Darin’s first foray into C++, so we welcome feedback on how to improve the code. In particular, we would appreciate thoughts on how to overcome a memory vs. speed tradeoff we encountered. (You can email Darin at darinc[at]luskin.ucla.edu)
The most computationally intensive chunk of our code computes the distance from each unit to every other unit. To cut down on the number of distance calculations, we can fill the upper triangle of the distance matrix and then copy it to the lower triangle. With $N$ units, this requires only $N (N-1) /2$ distance calculations.
However, as the number of units grows, this distance matrix becomes too large to store in memory, especially when executing the code in parallel. (We tried to use a sparse matrix, but this was extremely slow to fill.) To overcome this memory issue, we can avoid constructing a distance matrix altogether. Instead, for each unit, we compute the vector of distances from that unit to every other unit. We then only need to store that vector in memory. While that cuts down on memory use, it requires us to make twice as many ($N(N-1)$) distance calculations.
As the number of units grows, we are forced to perform more duplicate distance calculations to avoid memory constraints – an unfortunate tradeoff. (See the functions
XeeXhC_Lg in ConleySE.cpp.)