Concentration estimates for the moving least-square method in learning theory (Q719353): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jat.2011.03.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095375944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neural Network Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical performance of support vector machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization networks and support vector machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: ONLINE REGRESSION WITH VARYING GAUSSIANS AND NON-IDENTICAL DISTRIBUTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: ONLINE LEARNING WITH MARKOV SAMPLING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Support Vector Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak convergence and empirical processes. With applications to statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moving least-square method in learning theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-kernel regularized classifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: SVM LEARNING AND L<sup>p</sup> APPROXIMATION BY GAUSSIANS ON RIEMANNIAN MANIFOLDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering number in learning theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity of reproducing kernel spaces in learning theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: High order Parzen windows and randomized sampling / rank
 
Normal rank

Latest revision as of 11:49, 4 July 2024

scientific article
Language Label Description Also known as
English
Concentration estimates for the moving least-square method in learning theory
scientific article

    Statements

    Concentration estimates for the moving least-square method in learning theory (English)
    0 references
    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

    Identifiers