Approximate maximum a posteriori with Gaussian process priors (Q2642920): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Markus Hegland / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Hans Benker / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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
