DeepROCK: Error-controlled interaction detection in deep neural networks
Winston Chen, William Stafford Noble, Yang Young Lu

TL;DR
DeepROCK is a novel method that uses knockoffs and a specialized DNN architecture to reliably identify feature interactions with controlled false discovery rate, aiding interpretability in complex neural networks.
Contribution
DeepROCK introduces a systematic approach for interaction detection in DNNs that controls FDR and enhances interpretability, addressing limitations of existing methods.
Findings
Effectively controls false discovery rate in interaction detection
Demonstrates superior performance on simulated datasets
Validates approach on real-world data
Abstract
The complexity of deep neural networks (DNNs) makes them powerful but also makes them challenging to interpret, hindering their applicability in error-intolerant domains. Existing methods attempt to reason about the internal mechanism of DNNs by identifying feature interactions that influence prediction outcomes. However, such methods typically lack a systematic strategy to prioritize interactions while controlling confidence levels, making them difficult to apply in practice for scientific discovery and hypothesis validation. In this paper, we introduce a method, called DeepROCK, to address this limitation by using knockoffs, which are dummy variables that are designed to mimic the dependence structure of a given set of features while being conditionally independent of the response. Together with a novel DNN architecture involving a pairwise-coupling layer, DeepROCK jointly controls…
Peer Reviews
Decision·Submitted to ICLR 2024
+ Interesting integration of knockoffs for FDR control in DNNs. + Addresses a critical need for interpretable and reliable DNN predictions. + Provides empirical evidence demonstrating the potential of the approach.
+ The generality of the method across different DNN architectures in not developed. In fact, the method only seems to work with MLPs. + The method seems somewhat heuristic. As pointed out by reviewer 1, the sentence 'Intuitively, the interaction between two marginally important features naturally has a higher importance score than random interactions' is used to motivate the calibration in section 3.2, but is not very well formalized. + The method seems very specialized to pairwise interactions,
1. The problem of detecting interactions is important for science. 2. The paper's experiments show clear advantage over existing methods in terms of power and FDR. 3. The need for calibrated interaction scores is surprising.
As the main goal is variable selection and the stated goal is FDR control, it seems necessary that there should be a proof of FDR control. To start here, one example of a definition of an important feature is $Y \perp X_j \mid X_{-j}$. Is there a version of this in terms of interaction ? Possibly, the following $$Y \perp (X_j, X_i) \mid X_{-ji}, (E[Y \mid X_j], E[Y\mid X_i]) $$ Without connecting such a definition to the how you are using the knockoffs framework, I cannot trust a claim about F
- The authors address a very relevant topic, namely the detection of feature interaction in DNNs, along with a procedure to control the error rate. - They propose an interesting idea to approach the problem, which is the connection of knockoff framework and interaction detection algorithms to control FDR. Ultimately, this makes interaction detection algorithms useful in high-stake applications. - Sound presentation of their approach and required mathematical background knowledge. - Meaningful ex
- For the real-world experiments in Fig. 3 and 4, there is no comparison with existing methods. It would be interesting to study found interactions without calibration/coupling layer. - (nitpick) typos in section 2.2: “withcovariance”
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Machine Learning and Data Classification · Explainable Artificial Intelligence (XAI)
