Minimax Additive Regression under Unknown Dependent Designs
Not on the map. Why?
Abstract (arXiv)
We study additive regression under an unknown and potentially non product design distribution, allowing the number of covariates to grow with the sample size. We consider a coupled class that separately controls the smoothness of the marginal densities and of each additive component multiplied by the corresponding marginal density. Under joint-density bounds that hold uniformly in the dimension and suitable dimension-growth conditions, we establish matching minimax bounds for prediction. With known marginal densities, the classical additive rate is attainable. When the marginals are unknown, this rate is preserved if the densities are at least as smooth as the weighted components. Otherwise, marginal-density smoothness determines the minimax rate over the coupled class. Finally, we recover all additive components with total squared error of the same order as the prediction error.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 30 references that are in the map. First posted on arXiv 30 Sep 2026.
Builds on
11 of 30 references.
References · 11
- 2015An Introduction to Matrix Concentration Inequalitiescited by 397
- 2020Neural Additive Models: Interpretable Machine Learning with Neural Netscited by 319
- 2019InterpretML: A Unified Framework for Machine Learning Interpretabilitycited by 246
- 2021NODE-GAM: Neural Generalized Additive Model for Interpretable Deep Learningcited by 88
- 2022Neural Basis Models for Interpretabilitycited by 56
- 2019Purifying Interaction Effects with the Functional ANOVA: An Efficient Algorithm for Recovering Identifiable Additive Modelscited by 42
- 2023Deep Neural Networks for Nonparametric Interaction Models with Diverging Dimensioncited by 15
- 2015Minimax Optimal Rates of Estimation in High Dimensional Additive Models: Universal Phase Transitioncited by 13
- 2019Generalized Sparse Additive Modelscited by 11
- 2025Tree Ensemble Explainability through the Hoeffding Functional Decomposition and TreeHFD Algorithmcited by 6
- 2026Generalized Functional ANOVA: A Complete Theoretical Frameworkcited by 1
Built on by
Not cited yet.