Metraipolis › archive › dc_275ec07068ea

Pointwise minimax lower bounds under a multi-index constraint: the price of an unknown orientation — arXiv:2610.19208

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.19208
License (as archived)
CC0-1.0
Archived
2026-10-15T14:25:52.652Z
SHA-256 of the archived text
a797fe0adaa8666402322b84d793e28bedf0dfc7c9fe0d18bcb658bb5d73e14f
Stable URL of this page
https://metraipolis.com/documento/dc_275ec07068ea

How to cite

Pointwise minimax lower bounds under a multi-index constraint: the price of an unknown orientation — arXiv:2610.19208 — arXiv (en), https://arxiv.org/abs/2610.19208 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_275ec07068ea (Metraipolis archive dc_275ec07068ea, sha256 a797fe0adaa8666402322b84d793e28bedf0dfc7c9fe0d18bcb658bb5d73e14f)
BibTeX
@misc{dc275ec07068ea,
  title = {Pointwise minimax lower bounds under a multi-index constraint: the price of an unknown orientation — arXiv:2610.19208},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.19208},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_275ec07068ea; sha256 a797fe0adaa8666402322b84d793e28bedf0dfc7c9fe0d18bcb658bb5d73e14f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.19208. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We consider nonparametric regression with random design and non-Gaussian noise, where the regression function has the multi-index form $F(x)=f(\Theta x)$ with an unknown link $f:\RR^m\to\RR$ in an anisotropic Hölder class and an unknown matrix $\Theta$ with $m\le d$ orthonormal rows. For estimation of $F$ at a fixed point we prove that the minimax risk is bounded from below by a multiple of $L^{1/(2\gamma+1)}(n^{-1}\ln n)^{\gamma/(2\gamma+1)}$, where $\gamma$ is the harmonic mean of the smoothness indices of the link divided by $m$. For $m<d$ this extends a Gaussian white noise result to regression. The main new case is $m=d$, where no dimension reduction takes place: the logarithmic factor still appears as soon as the link is anisotropic and the orientation of its axes is unknown. In contrast, when the link is isotropic with smoothness index at most one, the class is rotation invariant up to a constant and the classical rate without logarithm is attained. The logarithmic loss is therefore caused by the unknown orientation of the directions in which the function is least smooth

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.ST, nuovi lavori del giorno).
Categorie arXiv: Statistics Theory (math.ST).
Pagina del lavoro: https://arxiv.org/abs/2610.19208 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T13:55:35.305Z dalla pagina https://arxiv.org/list/math.ST/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).