Abstract
We consider the kernel-based coefficient least squares learning algorithm for regression with lq-regularizer, 1<q≤2. Our error analysis is carried out under more general conditions. The kernel function may be non-positive definite and the output sample values satisfy the moment hypothesis rather than the uniform boundedness. We derive the capacity dependent error bounds of the algorithm by constructing the stepping stone function for the indefinite kernels. When the output values are bounded, we obtain a learning rate that can be arbitrarily close to the best rate O(m−1) under some mild conditions of the regression function and the hypothesis space.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
