Minimax Additive Regression under Unknown Dependent Designs

Baptiste Ferrere, Fabrice Gamboa, Jean-Michel Loubes
9/30/2026
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

We study additive regression under a potentially non-product random design on $[0,1]^d$, allowing the dimension $d$ to grow with the sample size $n$. We introduce coupled smoothness classes that separately control the regularity of the marginal densities and the density-weighted additive components. To handle dependence, we adapt a Riesz-basis construction for functional ANOVA models and establish compatibility bounds with constants independent of the dimension under uniform bounds on the joint density. We construct thresholded least-squares estimators and establish matching minimax upper and lower bounds for prediction with known or unknown marginal densities, under suitable dimension-growth conditions. When the marginal densities are at least as smooth as the weighted components, the unknown-density problem attains the known-density minimax rate. When the densities are less smooth, their regularity determines the minimax rate over the coupled class. Finally, we show that the centered additive components can be recovered at the same aggregate upper rate, without an additional order of error.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{ferrere2026minimax,
  title  = {Minimax Additive Regression under Unknown Dependent Designs},
  author = {Baptiste Ferrere and Fabrice Gamboa and Jean-Michel Loubes},
  year   = {2026},
  eprint = {2609.39212},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2609.39212v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2609.39212.svg)](https://codeofpaper.com/paper/2609.39212)

Discussion