节点文献
l~P-系数正则化Shannon采样学习算法收敛速度(英文)
The Learning Rate of l~p-coefficient Regularized Shannon Sampling Algorithm
【摘要】 研究l~P-系数正则化意义下Shannon采样学习算法的收敛速度估计问题.借助l~P-空间的凸性不等式给出了样本误差和正则化误差的上界估计,并给出了用K-泛函表示的逼近误差估计.将K-泛函的收敛速度估计转化为平移网络逼近问题,在此基础上给出了用概率表示的学习速度.
【Abstract】 In the present paper,we provide an investigation on the learning rate of the Shannon sampling algorithms with l~p-coefficient regularization.We give the upper bounds for the sample error and the regularization error with the convex inequality in l~p-spaces and show the approximation error by a K-functional whose convergence rate can be sum up to the translation network approximation.Basing on these estimates we show an explicit learning rate in possibility.
【关键词】 Shannon采样算法;
学习理论;
系数正则化;
学习速度;
【Key words】 Shannon sampling algorithm; learning theory; coefficient regularization; learning rate;
【Key words】 Shannon sampling algorithm; learning theory; coefficient regularization; learning rate;
【基金】 Supported by NSFC(No.10871226,No.61179041)
- 【文献出处】 数学进展 ,Advances in Mathematics , 编辑部邮箱 ,2014年06期
- 【分类号】O211.4
- 【被引频次】1
- 【下载频次】26