Jump to content

Ridge function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Dorfsnok (talk | contribs) at 13:21, 4 September 2020 (Created page with '{{subst:AFC submission/draftnew}}<!-- Important, do not remove this line before article has been created. --> A ridge function is any function <math>f:\R^d\right...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A ridge function is any function that can be written as the composition of a univariate function with an affiene transformation, that is: for some and . Coinage of the term 'ridge function' is often attributed to B.F. Logan and L.A. Shepp[1].

Relevance

A ridge function is not susceptible to the curse of dimensionality, making it an instrumental tool in various estimation problems. Ridge functions play an essential role in amongst others projection pursuit, generalized linear models, and as activation functions in neural networks. A defining property of ridge functions is that they are constant in directions. Let be independent vectors that are orthogonal to . Then each point Failed to parse (syntax error): {\displaystyle f\left(c_0\boldsymbol{a} + \sum_{k=1}c_k\boldsymbol{a}_k)=f\left(c_0\boldsymbol{a})}



References

  1. ^ Logan, B.F.; Shepp, L.A. (1975). "Optimal reconstruction of a function from its projections". Duke Mathematical Journal. 42 (4): 645–659. doi:10.1215/S0012-7094-75-04256-8.