Efficiency of the Weak Rescaled Pure Greedy Algorithm

题目：Efficiency of the Weak Rescaled Pure Greedy Algorithm

报告人：叶培新 教授（南开大学）

时间：2023年11月16日（星期四）下午2：00-3：00

地点：腾讯会议

会议ID：533-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.