Lazy Estimation of Variable Importance for Large Neural Networks

Yue Gao, Abby Stevens, Rebecca Willett, Garvesh Raskutti

Introduction

As deep learning models are increasingly deployed in high-stakes domains such as healthcare and climate forecasting, the need for interpretability has become paramount. One of the most intuitive ways to understand a model is through Variable Importance (VI)—quantifying how much a specific input contributes to a prediction. However, existing methods for calculating VI often force a compromise between computational efficiency and statistical reliability.

The Problem: The Cost of Retraining

The most rigorous method for determining VI is "retraining." This involves comparing a "full" model trained on all features to a "reduced" model trained from scratch without the feature of interest. While accurate, this approach is computationally ruinous for large neural networks; testing 100 variables would require training 100 separate models.

To avoid this, many practitioners use "dropout" or permutation methods, which simply zero out a variable in a pre-trained model. While fast, these methods fail significantly when features are correlated. If two sensors provide similar data, dropping one doesn't significantly change the output because the model still relies on the other. Consequently, dropout often fails to capture the true importance of features in complex, interdependent datasets.

Methodology: The LazyVI Framework

This paper introduces LazyVI, a method designed to provide the speed of dropout with the statistical rigor of full retraining. The core innovation lies in approximating the reduced model through linearization.

1. Linearization via Neural Tangent Kernels (NTK)

Instead of training a new non-linear network, LazyVI linearizes the existing full model around its trained parameters. By utilizing the Neural Tangent Kernel (NTK) framework, the network is treated as a linear model within a "gradient feature space"—the space defined by the model's derivatives with respect to its parameters.

2. Initialization Matters

A key insight of this work is that the linearization should occur around the trained parameters of the full model, rather than at random initialization (the standard approach in NTK research). This ensures the "reduced" model remains close enough to the "full" model for the linear approximation to remain valid and accurate.

3. Ridge-Regularized Optimization

To find the parameters for the reduced model, the authors solve a convex ridge regression problem. This adds a penalty term that stabilizes the estimation and allows for a closed-form or easily optimized solution, bypassing the need for iterative backpropagation across multiple new models.

Theoretical Guarantees and Inference

Unlike many "black-box" interpretability tools, LazyVI is grounded in statistical theory. The authors prove that when the ridge penalty is sufficiently large, the estimator achieves an error rate of $O(1/\sqrt{n})$, where $n$ is the number of training samples. Furthermore, the estimator is asymptotically normal. This allows researchers to calculate mathematically sound confidence intervals for their importance scores, providing a measure of certainty that is often missing in deep learning.

Experimental Validation

The authors evaluated LazyVI across synthetic and real-world datasets:

  • Efficiency: In binary classification tasks, LazyVI was over 10 times faster than full retraining (0.6s vs 7.5s) while maintaining nearly identical accuracy and coverage.
  • Handling Collinearity: In climate forecasting (CESM-LENS dataset), LazyVI was tested on sea surface temperature anomalies to predict precipitation. Despite high correlation between different ocean regions (e.g., El Niño indices), LazyVI correctly re-allocated importance, matching the results of expensive retraining where dropout methods failed.
  • Scalability: The method was extended to calculate Shapley values—a game-theoretic measure of importance—achieving a 5x speedup over traditional retraining methods.
  • ROAR Benchmark: On the MNIST dataset, the "Remove and Retrain" (ROAR) benchmark showed that LazyVI accurately identified the most critical pixels, as removing them led to the fastest degradation in model performance.

Limitations and Future Directions

While powerful, LazyVI has specific requirements:

  • Network Architecture: The theoretical guarantees rely on the "NTK regime," which assumes the neural network is sufficiently wide. Its performance on very narrow architectures or those with extreme bottlenecks remains an area for further study.
  • Full Model Quality: The accuracy of the VI estimate is inherently tied to the quality of the initial full model.
  • Early Stopping: A variant called LazyVI-ES (using early stopping instead of ridge regression) showed empirical promise on MNIST but currently lacks the formal theoretical guarantees of the ridge-penalized version.

Conclusion

LazyVI offers a scalable, theoretically grounded solution to the variable importance problem in deep learning. By leveraging linearization and smart initialization, it bridges the gap between the computational efficiency required for large-scale models and the statistical rigor required for high-stakes decision-making.

Summary updated

Abstract

As opaque predictive models increasingly impact many areas of modern life, interest in quantifying the importance of a given input variable for making a specific prediction has grown. Recently, there has been a proliferation of model-agnostic methods to measure variable importance (VI) that analyze the difference in predictive power between a full model trained on all variables and a reduced model that excludes the variable(s) of interest. A bottleneck common to these methods is the estimation of the reduced model for each variable (or subset of variables), which is an expensive process that often does not come with theoretical guarantees. In this work, we propose a fast and flexible method for approximating the reduced model with important inferential guarantees. We replace the need for fully retraining a wide neural network by a linearization initialized at the full model parameters. By adding a ridge-like penalty to make the problem convex, we prove that when the ridge penalty parameter is sufficiently large, our method estimates the variable importance measure with an error rate of $O(\frac{1}{\sqrt{n}})$ where $n$ is the number of training samples. We also show that our estimator is asymptotically normal, enabling us to provide confidence bounds for the VI estimates. We demonstrate through simulations that our method is fast and accurate under several data-generating regimes, and we demonstrate its real-world applicability on a seasonal climate forecasting example.
BibTeX
@inproceedings{gao2022lazy,
  author = {Yue Gao and Abby Stevens and Rebecca Willett and Garvesh Raskutti},
  title = {{Lazy Estimation of Variable Importance for Large Neural Networks}},
  booktitle = {International Conference on Machine Learning},
  year = {2022},
  url = {https://openreview.net/forum?id=x6eUFxLjuy},
}
Figure