arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.26064math.NAcs.NAmath.FA
收藏

关于弱贪心算法

On weak greedy algorithms

A. S. Spivak, V. N. Temlyakov

AI总结:

本文研究弱贪心算法的收敛性,提出基于广义八面体的子集收敛分析,并扩展了弱贪心算法的弱序列应用。

摘要:

本文的主要目标是双重的。首先,我们将已知的弱贪心算法中标量参数结果扩展到弱贪心算法的弱序列情况。其次,我们提出了贪心算法收敛性问题的新设定。通常,我们关注算法对空间所有元素的收敛性。我们建议研究算法对一个子集的收敛性,该子集与给定字典相关联的广义八面体。

英文摘要:

The main goal of this paper is twofold. First, we extend some results known in the case of weak greedy algorithms with a scalar parameter to the case of weak greedy algorithms with a weakness sequence. Second, we formulate a new setting of the problem of convergence of greedy algorithms. Usually, we are interested in convergence of an algorithm for all elements of the space. We suggest to study convergence of an algorithm for a subset, which is a generalized octahedron associated with a given dictionary.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑