Abstract
We consider a fully online regression algorithm associated with a general convex loss function and Gaussian kernels with changing variances. Error analysis is conducted in a setting with samples drawn from a non-identical sequence of probability measures. When a fixed Gaussian is used, it was known that the learning ability of induced algorithms is weak. By allowing varying Gaussians, we show that the achieved learning rates can be of polynomial decays.
| Original language | English |
|---|---|
| Pages (from-to) | 395-408 |
| Number of pages | 14 |
| Journal | Analysis and Applications |
| Volume | 9 |
| Issue number | 4 |
| DOIs | |
| State | Published - Oct 2011 |
| Externally published | Yes |
Keywords
- Gaussian kernel
- convex loss function
- online learning
- regression algorithm
- reproducing kernel Hilbert space
- variance of Gaussian
Fingerprint
Dive into the research topics of 'Online regression with varying Gaussians and non-identical distributions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver