太阳成集团tyc411(中国)有限公司-百度百科

太阳成集团tyc411

Efficiency of the Weak Rescaled Pure Greedy Algorithm

来源:太阳成集团tyc411 发布时间:2023-11-14   10

题目:Efficiency of the Weak Rescaled Pure Greedy Algorithm

报告人:叶培新 教授(南开大学)

时间:20231116日(星期四)下午200-300

地点:腾讯会议

会议ID533-817-358

会议密码:310058


摘要:We study the efficiency of the Weak Rescaled Pure Greedy Algorithm(WRPGA) with respect to a dictionary in a Hilbert space. We obtain the sufficient and necessary conditions for the convergence of WRPGA for any element and any dictionary. This condition is weaker than the sufficient conditions for convergence of the Weak Pure Greedy Algorithm (WPGA).Moreover we derive the error estimate of WRPGA for general element and show the results can be generalized to some Banach paces. Finally, we consider the application of the RPGA to kernel-based regression.




Copyright © 2023 太阳成集团tyc411(中国)有限公司-百度百科    版权所有

    浙ICP备05074421号

技术支持: 创高软件     管理登录

    您是第 1000 位访问者