Identifiability of Polynomial Models from First Principles and via a Gr\"obner Basis Approach
Abstract
The relationship between a set of design points and the class of hierarchical polynomial models identifiable from the design is investigated. Saturated models are of particular interest. Necessary and sufficient conditions are derived on the set of design points for specific terms to be included in leaves of the statistical fan. A practitioner led approach to building hierarchical saturated models that are identifiable is developed. This approach is compared to the method of model building based on Gr\"obner bases. The main results are illustrated by examples.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.