CoChat

Trading Interpretability for Accuracy: Oblique Treed Sparse Additive Models

Wang, Jialei, Fujimaki, Ryohei, Motohashi, Yosuke · 2015 · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Cited by 42

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

Abstract

Model interpretability has been recognized to play a key role in practical data mining. Interpretable models provide significant insights on data and model behaviors and may convince end-users to employ certain models. In return for these advantages, however, there is generally a sacrifice in accuracy, i.e., flexibility of model representation (e.g., linear, rule-based, etc.) and model complexity needs to be restricted in order for users to be able to understand the results. This paper proposes oblique treed sparse additive models (OT-SpAMs). Our main focus is on developing a model which sacrifices a certain degree of interpretability for accuracy but achieves entirely sufficient accuracy with such fully non-linear models as kernel support vector machines (SVMs). OT-SpAMs are instances of region-specific predictive models. They divide feature spaces into regions with sparse oblique tree splitting and assign local sparse additive experts to individual regions. In order to maintain OT-SpAM interpretability, we have to keep the overall model structure simple, and this produces simultaneous model selection issues for sparse oblique region structures and sparse local experts. We address this problem by extending factorized asymptotic Bayesian inference. We demonstrate, on simulation, benchmark, and real world datasets that, in terms of accuracy, OT-SpAMs outperform state-of-the-art interpretable models and perform competitively with kernel SVMs, while still providing results that are highly understandable.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2783258.2783407

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 5 references

Research works printed but not linked: 42

  1. Amari S., 2000, Methods of Information Geometry
  2. Bache K., 2013, UCI machine learning repository
  3. Breiman L., 1984, Wadsworth and Brooks
  4. 10.1145/1961189.1961199 · DOI · Paper page
  5. 10.1145/2487575.2487583 · DOI
  6. Chipman H. A., 2003, Bayesian treed generalized linear models, Bayesian Statistics, 7
  7. 10.1023/A:1022627411411 · DOI
  8. 10.1214/ss/1038425655 · DOI · Paper page
  9. Eto R., 2014, AISTATS, 238
  10. 10.1145/2594473.2594475 · DOI · Paper page
  11. 10.1214/aos/1013203451 · DOI · Paper page
  12. Fujimaki R., 2012, AISTATS, 400
  13. Gu Q., 2013, AISTATS, 307
  14. 10.1007/978-0-387-21606-5 · DOI · Paper page
  15. Hastie T. J., 1990, Generalized additive models
  16. Hayete B., 2005, Pacific Symposium on Biocomputing, 127
  17. 10.1162/neco.2006.18.7.1527 · DOI · Paper page
  18. 10.1214/09-AOS781 · DOI · Paper page
  19. 10.1162/neco.1994.6.2.181 · DOI · Paper page
  20. Jose C., 2013, ICML, 486
  21. Krizhevsky A., 2012, NIPS, 1106
  22. Ladicky L., 2011, ICML, 985
  23. Letham B., 2014, KDD Workshop on Data Science for Social Good
  24. Liu H., 2009, NIPS, 1141
  25. Lozano A. C., 2009, NIPS, 1150
  26. 10.1109/78.258082 · DOI · Paper page
  27. Maz'ya V. G., 1983, Theory of multipliers in spaces of differentiable functions. Russ. Math. Surv., 38(23)
  28. 10.1007/978-1-4899-3242-6 · DOI · Paper page
  29. 10.1214/09-AOS692 · DOI · Paper page
  30. 10.5555/1622826.1622827 · doi:10.5555/1622826.1622827
  31. Ravikumar P., 2009, Sparse additive models. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 71(5):1009--1030
  32. 10.5555/1756006.1859915 · doi:10.5555/1756006.1859915
  33. 10.1023/B:STCO.0000035301.49549.88 · DOI · Paper page
  34. 10.1111/j.2517-6161.1996.tb02080.x · DOI · Paper page
  35. 10.1109/TIT.2007.909108 · DOI · Paper page
  36. Truong A. K. Y., 2009, Fast growing and interpretable oblique trees via logistic regression models. DPhil Thesis
  37. Ustun B., 2013, AAAI Late Breaking Track
  38. 10.5555/211359 · doi:10.5555/211359
  39. Wang J., 2012, NIPS, 91
  40. Wong R., 1989, Asymptotic approximations of integrals. Computer science and scientific computing
  41. Xu Z. E., 2013, ICML, 133
  42. Zhu J., 2001, NIPS, 1081

Cited by

See all 42

Metadata

Authors
Wang, J., Fujimaki, R., & Motohashi, Y.
Venue
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Publisher
ACM
Published
2015-08-10
Pages
1245-1254
OpenAlex
W2059554529
Cited by
42
References
5
FWCI
2.46
Type
conference paper
Language
en
Open access
closed

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: Trading Interpretability for Accuracy: Oblique Treed Sparse Additive Models. https://app.cochat.ai/papers/10.1145/2783258.2783407
The paper
Wang, J., Fujimaki, R., & Motohashi, Y. (2015). Trading Interpretability for Accuracy: Oblique Treed Sparse Additive Models. Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. https://doi.org/10.1145/2783258.2783407

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.