Construct · 1 fields · 1 citations

representer theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Learning theory

the result that the minimizer of a regularized loss over a reproducing kernel Hilbert space is a weighted sum of kernels centered on the training points.

In learning theory, representer theorem refers to the result that the minimizer of a regularized loss over a reproducing kernel Hilbert space is a weighted sum of kernels centered on the training points. This meaning comes from Schölkopf (2001) in Lecture Notes in Computer Science.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how representer theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

kernel4 fields · 5 citationsjingle · one word, four constructs learning6 fields · 14 citationsjingle · one name, six constructs loss2 fields · 3 citationsjingle · one word, two constructs

References

Schölkopf, B., Herbrich, R., & Smola, A. J. (2001). A Generalized Representer Theorem. In Lecture Notes in Computer Science (pp. 416-426). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-44581-1_27

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct