Interpretable Approximation of High-Dimensional Data
Not on the map. Why?
Abstract (arXiv)
In this paper we apply the previously introduced approximation method based on the ANOVA (analysis of variance) decomposition and Grouped Transformations to synthetic and real data. The advantage of this method is the interpretability of the approximation, i.e., the ability to rank the importance of the attribute interactions or the variable couplings. Moreover, we are able to generate an attribute ranking to identify unimportant variables and reduce the dimensionality of the problem. We compare the method to other approaches on publicly available benchmark datasets.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 2 of its 45 references that are in the map. First posted on arXiv 25 Mar 2021.
Builds on
2 of 45 references.
References · 2
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 5; 2025: 2.
10 papers.
- 2022HARFE: Hard-Ridge Random Feature Expansioncited by 12
- 2021SHRIMP: Sparser Random Feature Models via Iterative Magnitude Pruningcited by 9
- 2024ANOVA-boosting for Random Fourier Featurescited by 2
- 2024Generative Feature Training of Thin 2-Layer Networkscited by 2
- 2021Interpretable transformed ANOVA approximation on the example of the prevention of forest firescited by 1
- 2024Neural-ANOVA: Analytical Model Decomposition using Automatic Integrationcited by 1
- 2025Learning where to learn: Training data distribution optimization for scientific machine learningcited by 1
- 2024Fast and interpretable Support Vector Classification based on the truncated ANOVA decompositioncited by 0
- 2024Data Compression using Rank-1 Lattices for Parameter Estimation in Machine Learningcited by 0
- 2025PartnerMAS: An LLM Hierarchical Multi-Agent Framework for Business Partner Selection on High-Dimensional Featurescited by 0
- 2025PartnerMAS: An LLM Hierarchical Multi-Agent Framework for Business Partner Selection on High-Dimensional Features28 Sep 2025
- 2025Learning where to learn: Training data distribution optimization for scientific machine learning27 May 2025
- 2024Generative Feature Training of Thin 2-Layer Networks11 Nov 2024
- 2024Data Compression using Rank-1 Lattices for Parameter Estimation in Machine Learning20 Sep 2024
- 2024Neural-ANOVA: Analytical Model Decomposition using Automatic Integration22 Aug 2024
- 2024ANOVA-boosting for Random Fourier Features3 Apr 2024
- 2024Fast and interpretable Support Vector Classification based on the truncated ANOVA decomposition4 Feb 2024
- 2022HARFE: Hard-Ridge Random Feature Expansion6 Feb 2022
- 2021SHRIMP: Sparser Random Feature Models via Iterative Magnitude Pruning7 Dec 2021
- 2021Interpretable transformed ANOVA approximation on the example of the prevention of forest fires14 Oct 2021