The recovery of ridge functions on the hypercube suffers from the curse of dimensionality

Research output: Contribution to journalArticlepeer-review

Abstract

A multivariate ridge function is a function of the form f(x)=g(aTx), where g is univariate and a∈Rd. We show that the recovery of an unknown ridge function defined on the hypercube [−1,1]d with Lipschitz-regular profile g suffers from the curse of dimensionality when the recovery error is measured in the L-norm, even if we allow randomized algorithms. If a limited number of components of a is substantially larger than the others, then the curse of dimensionality is not present and the problem is weakly tractable, provided the profile g is sufficiently regular.

Original languageEnglish
Article number101521
JournalJournal of Complexity
Volume63
DOIs
Publication statusPublished - 1 Apr 2021

Keywords

  • High-dimensional function approximation
  • Information-based complexity
  • Lower bounds
  • Randomized algorithms
  • Ridge functions

Fingerprint

Dive into the research topics of 'The recovery of ridge functions on the hypercube suffers from the curse of dimensionality'. Together they form a unique fingerprint.

Cite this