Polyanalytic reproducing kernels in $$\mathbb {C}^n$$

2021 ◽  
Vol 7 (3-4) ◽  
Author(s):  
E. H. Youssfi
Keyword(s):  
Reproducing Kernels

scholarly journals Universalities of reproducing kernels revisited

2015 ◽  
Vol 95 (8) ◽  
pp. 1776-1791 ◽  
Author(s):  
Wenjian Chen ◽  
Benxun Wang ◽  
Haizhang Zhang
Keyword(s):  
Reproducing Kernels

Convergence analysis of online learning algorithm with two-stage step size

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Weilin Nie ◽  
Cheng Wang
Keyword(s):  
Online Learning ◽  
Optimization Problems ◽  
Learning Algorithm ◽  
Computational Cost ◽  
Reproducing Kernels ◽  
Step Size ◽  
Two Stage ◽  
Logarithmic Term ◽  
Convergence Performance ◽  
Online Learning Algorithm

Abstract Online learning is a classical algorithm for optimization problems. Due to its low computational cost, it has been widely used in many aspects of machine learning and statistical learning. Its convergence performance depends heavily on the step size. In this paper, a two-stage step size is proposed for the unregularized online learning algorithm, based on reproducing Kernels. Theoretically, we prove that, such an algorithm can achieve a nearly min–max convergence rate, up to some logarithmic term, without any capacity condition.

scholarly journals Reproducing kernels of Sobolev spaces on ℝd and applications to embedding constants and tractability

2018 ◽  
Vol 16 (05) ◽  
pp. 693-715 ◽  
Author(s):  
Erich Novak ◽  
Mario Ullrich ◽  
Henryk Woźniakowski ◽  
Shun Zhang
Keyword(s):  
Sobolev Space ◽  
Sobolev Spaces ◽  
Reproducing Kernel ◽  
Absolute Error ◽  
Reproducing Kernels ◽  
Worst Case ◽  
Reproducing Kernel Formula ◽  
Positive Integers ◽  
Integration Errors ◽  
Exponentially Small

The standard Sobolev space [Formula: see text], with arbitrary positive integers [Formula: see text] and [Formula: see text] for which [Formula: see text], has the reproducing kernel [Formula: see text] for all [Formula: see text], where [Formula: see text] are components of [Formula: see text]-variate [Formula: see text], and [Formula: see text] with non-negative integers [Formula: see text]. We obtain a more explicit form for the reproducing kernel [Formula: see text] and find a closed form for the kernel [Formula: see text]. Knowing the form of [Formula: see text], we present applications on the best embedding constants between the Sobolev space [Formula: see text] and [Formula: see text], and on strong polynomial tractability of integration with an arbitrary probability density. We prove that the best embedding constants are exponentially small in [Formula: see text], whereas worst case integration errors of algorithms using [Formula: see text] function values are also exponentially small in [Formula: see text] and decay at least like [Formula: see text]. This yields strong polynomial tractability in the worst case setting for the absolute error criterion.

Sign in / Sign up

Export Citation Format

Share Document