Optimality of the Approximation and Learning by the Rescaled Pure Super Greedy Algorithms
We propose the Weak Rescaled Pure Super Greedy Algorithm (WRPSGA) for approximation with respect to a dictionary <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi mathvariant="script">D</mi><...
Main Authors: | Wenhui Zhang, Peixin Ye, Shuo Xing, Xu Xu |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-08-01
|
Series: | Axioms |
Subjects: | |
Online Access: | https://www.mdpi.com/2075-1680/11/9/437 |
Similar Items
-
Approximation Properties of the Vector Weak Rescaled Pure Greedy Algorithm
by: Xu Xu, et al.
Published: (2023-04-01) -
On the Rate of Convergence of Greedy Algorithms
by: Vladimir Temlyakov
Published: (2023-06-01) -
The learning performance of the weak rescaled pure greedy algorithms
by: Qin Guo, et al.
Published: (2024-03-01) -
Almost Optimality of the Orthogonal Super Greedy Algorithm for <i>μ</i>-Coherent Dictionaries
by: Chunfang Shao, et al.
Published: (2022-04-01) -
Learning capability of the rescaled pure greedy algorithm with non-iid sampling
by: Qin Guo, et al.
Published: (2023-01-01)