TL;DR
This paper introduces new significance tests for feature relevance in deep neural networks, addressing the black-box challenge with methods that are less assumption-dependent and computationally intensive, validated through simulations and real data.
Contribution
It develops one-split and two-split tests that relax assumptions and reduce computational complexity for assessing feature significance in complex models.
Findings
Effective in simulated examples
Validated on multiple real datasets
Available as an open-source Python library
Abstract
An exciting recent development is the uptake of deep neural networks in many scientific fields, where the main objective is outcome prediction with the black-box nature. Significance testing is promising to address the black-box issue and explore novel scientific insights and interpretation of the decision-making process based on a deep learning model. However, testing for a neural network poses a challenge because of its black-box nature and unknown limiting distributions of parameter estimates while existing methods require strong assumptions or excessive computation. In this article, we derive one-split and two-split tests relaxing the assumptions and computational complexity of existing black-box tests and extending to examine the significance of a collection of features of interest in a dataset of possibly a complex type such as an image. The one-split test estimates and evaluates…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
