Approximate maximum a posteriori with Gaussian process priors (Q2642920)

From MaRDI portal
Revision as of 20:02, 6 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximate maximum a posteriori with Gaussian process priors
scientific article

    Statements

    Approximate maximum a posteriori with Gaussian process priors (English)
    0 references
    0 references
    6 September 2007
    0 references
    A framework and some foundations are provided which are required for the application of numerical approximation to an important class of machine learning problems. The results suggest that computational learning problems can be efficiently solved using numerical techniques like the finite element method and sparse grid approximations.
    0 references
    0 references
    machine learning
    0 references
    computational learning
    0 references
    finite element method
    0 references
    sparse grid approximations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references