Concentration estimates for the moving least-square method in learning theory (Q719353)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5955948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Concentration estimates for the moving least-square method in learning theory |
scientific article; zbMATH DE number 5955948 |
Statements
Concentration estimates for the moving least-square method in learning theory (English)
0 references
10 October 2011
0 references
Moving least-square method is a classical tool in statistics, numerical analysis and approximation theory. It was studied by the author, \textit{D.-H. Xiang} and \textit{D.-X. Zhou} [ J. Approx. Theory 162, No. 3, 599--614 (2010; Zbl 1202.68325)] in a learning theory framework. In this paper the author improves the estimate for the sampling error by means of a concentration inequality, which leads to better convergence rates.
0 references
Learning theory
0 references
moving least-square method
0 references
sample error
0 references
norming condition
0 references
concentration inequality
0 references
0.8609598278999329
0 references
0.837904155254364
0 references
0.8277527689933777
0 references
0.8121789693832397
0 references
0.8045954704284668
0 references
