Aveiro Method in Reproducing Kernel Hilbert Spaces Under Complete Dictionary
Weixiong Mai, Tao Qian

TL;DR
The paper introduces the Aveiro Method Under Complete Dictionary (AMUCD), a novel approach that enhances sparse representation in RKHS by utilizing a complete dictionary of derivatives, improving convergence and applicability.
Contribution
It proposes a new Aveiro Method based on a complete dictionary and matching pursuit, addressing challenges in identifying uniqueness sets and improving convergence in RKHS.
Findings
Efficient expansion of elements in Hardy and Paley-Wiener spaces.
Enables better sparse representations using derivatives of kernels.
Reveals new aspects of Aveiro Method and greedy algorithms.
Abstract
Aveiro Method is a sparse representation method in reproducing kernel Hilbert spaces (RKHS) that gives orthogonal projections in linear combinations of reproducing kernels over uniqueness sets. It, however, suffers from determination of uniqueness sets in the underlying RKHS. In fact, in general spaces, uniqueness sets are not easy to be identified, let alone the convergence speed aspect with Aveiro Method. To avoid those difficulties we propose an anew Aveiro Method based on a dictionary and the matching pursuit idea. What we do, in fact, are more: The new Aveiro method will be in relation to the recently proposed, the so called Pre-Orthogonal Greedy Algorithm (P-OGA) involving completion of a given dictionary. The new method is called Aveiro Method Under Complete Dictionary (AMUCD). The complete dictionary consists of all directional derivatives of the underlying reproducing kernels.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
