Pith. sign in

REVIEW 2 cited by

DeepPINK: reproducible feature selection in deep neural networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1809.01185 v2 pith:PGC3EQLZ submitted 2018-09-04 cs.LG stat.ML

classification cs.LGstat.ML
keywords deepfeatureinterpretabilityselectionlearningcontrolleddeeppinkdnns
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Deep learning has become increasingly popular in both supervised and unsupervised machine learning thanks to its outstanding empirical performance. However, because of their intrinsic complexity, most deep learning methods are largely treated as black box tools with little interpretability. Even though recent attempts have been made to facilitate the interpretability of deep neural networks (DNNs), existing methods are susceptible to noise and lack of robustness. Therefore, scientists are justifiably cautious about the reproducibility of the discoveries, which is often related to the interpretability of the underlying statistical models. In this paper, we describe a method to increase the interpretability and reproducibility of DNNs by incorporating the idea of feature selection with controlled error rate. By designing a new DNN architecture and integrating it with the recently proposed knockoffs framework, we perform feature selection with a controlled error rate, while maintaining high power. This new method, DeepPINK (Deep feature selection using Paired-Input Nonlinear Knockoffs), is applied to both simulated and real data sets to demonstrate its empirical utility.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Are machine learning interpretations reliable? A stability study on global interpretations

    stat.ML 2025-05 conditional novelty 6.0 of 10

    Popular machine learning interpretation methods are frequently unstable under small data perturbations, and interpretation stability does not track prediction accuracy.

  2. Model-Agnostic FDR Control via Group Gaussian Mirror and Permutation SHAP

    stat.ML 2026-08 reject novelty 5.0 of 10

    Block-level Gaussian mirror statistics give a mostly sound linear FDR method, but the neural Permutation SHAP variant proves null symmetry only by assuming the fitted model already ignores null groups.

Pith tools