Review Articles

Interpreting uninterpretable predictors: kernel methods, Shtarkov solutions, and random forests

T. M. Le ,

Department of Mathematics, Science, and Informatics, Mercer University, Atlanta, GA, USA

Bertrand Clarke

Department of Statistics, University of Nebraska-Lincoln, Lincoln, NE, USA

Pages 10-28 | Received 18 Mar. 2020, Accepted 08 Aug. 2021, Published online: 08 Sep. 2021,
  • Abstract
  • Full Article
  • References
  • Citations

Many of the best predictors for complex problems are typically regarded as hard to interpret physically. These include kernel methods, Shtarkov solutions, and random forests. We show that, despite the inability to interpret these three predictors to infinite precision, they can be asymptotically approximated and admit conceptual interpretations in terms of their mathematical/statistical properties. The resulting expressions can be in terms of polynomials, basis elements, or other functions that an analyst may regard as interpretable.

References

To cite this article: T. M. Le & Bertrand Clarke (2021): Interpreting uninterpretable predictors:
kernel methods, Shtarkov solutions, and random forests, Statistical Theory and Related Fields,
DOI: 10.1080/24754269.2021.1974157
To link to this article: https://doi.org/10.1080/24754269.2021.1974157