Approximate maximum a posteriori with Gaussian process priors (Q2642920): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00365-006-0661-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093281571 / rank
 
Normal rank

Latest revision as of 02:13, 20 March 2024

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
    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
    machine learning
    0 references
    computational learning
    0 references
    finite element method
    0 references
    sparse grid approximations
    0 references
    0 references
    0 references

    Identifiers

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