Unregularized online algorithms with varying Gaussians

DOI10.1007/S00365-021-09536-3MaRDI QIDQ2035494zbMATH OpenOpenAlexFDO

Authors Baobin Wang, Ting Hu

Publication date 24 June 2021

Published in Constructive Approximation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00365-021-09536-3

zbMATH Keywords

geometric noise conditionlearning rateonline learningreproducing kernel Hilbert spacesvarying Gaussian kernels

Mathematics Subject Classification ID

Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Recommendations

• Online classification with varying Gaussians
• Online regression with varying Gaussians and non-identical distributions
• scientific article; zbMATH DE number 5811685
• Learnability of Gaussians with flexible variances
• Unregularized online learning algorithms with general loss functions

Cites work

• An Explicit Description of the Reproducing Kernel Hilbert Spaces of Gaussian RBF Kernels
• Choosing multiple parameters for support vector machines
• Classification with Gaussians and convex loss
• Convergence of unregularized online learning algorithms
• ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
• Fast rates for support vector machines using Gaussian kernels
• Fully online classification by regularization
• scientific article; zbMATH DE number 854998 (Why is no real title available?)
• Learnability of Gaussians with flexible variances
• Learning the kernel matrix with semidefinite programming
• Minimax nonparametric classification .I. Rates of convergence
• Multi-kernel regularized classifiers
• Nonparametric stochastic approximation with large step-sizes
• On the Generalization Ability of On-Line Learning Algorithms
• Online gradient descent learning algorithms
• Online learning algorithms
• Online Regularized Classification Algorithms
• Optimal aggregation of classifiers in statistical learning.
• Risk bounds for mixture density estimation
• Support vector machine soft margin classifiers: error analysis
• Theory of Reproducing Kernels

Cited in

(7)

• Distributed regularized least squares with flexible Gaussian kernels
• Online regression with varying Gaussians and non-identical distributions
• Learnability of Gaussians with flexible variances
• Online variance minimization
• Online classification with varying Gaussians
• Sparse online regression algorithm with insensitive loss functions
• Online outcome weighted learning with varying Gaussians and non-identical distributions

This page was built for publication: Unregularized online algorithms with varying Gaussians

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2035494)