Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.

Exact and Consistent Interpretation for Piecewise Linear Neural Networks: A Closed Form Solution

Chu, Lingyang, Hu, Xia, Hu, Juhua, Wang, Lanjun, Pei, Jian · 2018 · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining

Abstract

Strong intelligent machines powered by deep neural networks are increasingly deployed as black boxes to make decisions in risk-sensitive domains, such as finance and medical. To reduce potential risk and build trust with users, it is critical to interpret how such machines make their decisions. Existing works interpret a pre-trained neural network by analyzing hidden neurons, mimicking pre-trained models or approximating local predictions. However, these methods do not provide a guarantee on the exactness and consistency of their interpretations. In this paper, we propose an elegant closed form solution named $OpenBox$ to compute exact and consistent interpretations for the family of Piecewise Linear Neural Networks (PLNN). The major idea is to first transform a PLNN into a mathematically equivalent set of linear classifiers, then interpret each linear classifier by the features that dominate its prediction. We further apply $OpenBox$ to demonstrate the effectiveness of non-negative and sparse constraints on improving the interpretability of PLNNs. The extensive experiments on both synthetic and real world data sets clearly demonstrate the exactness and consistency of our interpretation.

Overview

Integrity signals

Registry

Crossref · 10.1145/3219819.3220063

Cites

51 of 51 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 48 references

Research works printed but not linked: 4

  1. Erhan D., 2009, Visualizing higher-layer features of a deep network, University of Montreal, 1341, 3
  2. Fong Ruth, 2017, Interpretable Explanations of Black Boxes by Meaningful Perturbation. arXiv:1704.03296 · arXiv
  3. Goodfellow Ian, Deep Learning
  4. Goodfellow Ian J, 2013, Maxout networks. arXiv:1302.4389 · arXiv

Cited by

See all 104

Metadata

Authors
Chu, L., Hu, X., Hu, J., Wang, L., & Pei, J.
Affiliations
  • Simon Fraser University (CA)
  • Simon Fraser University, Burnaby, BC, Canada
  • Huawei Technologies (China) (CN)
Venue
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
Publisher
ACM
Published
2018-07-19
Pages
1244-1253
OpenAlex
W2962824341
Cited by
87
References
48
Citations by year
2026: 5 · 2025: 8 · 2024: 8 · 2023: 13 · 2022: 6 · 2021: 19 · 2020: 16 · 2019: 9 · 2018: 3
FWCI
4.78
Type
conference paper
Language
en
Open access
closed
Locations
  • ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
  • University of Washington Tacoma Digital Commons (University of Washington Tacoma) (submittedVersion)
Funders
  • the NSERC Strategic Grant program
  • the NSERC Discovery Grant program
  • the Canada Research Chair program
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
Keywords
piecewise linear neural networks, neural network interpretability, nonnegativity constraints, sparsity constraints, explainable AI, black-box decision-making

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Exact and Consistent Interpretation for Piecewise Linear Neural Networks: A Closed Form Solution. https://app.cochat.ai/papers/10.1145/3219819.3220063
The paper
Chu, L., Hu, X., Hu, J., Wang, L., & Pei, J. (2018). Exact and Consistent Interpretation for Piecewise Linear Neural Networks: A Closed Form Solution. Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. https://doi.org/10.1145/3219819.3220063

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.