Optimal Convergence Rates for the Orthogonal Greedy Algorithm

DOI10.1109/TIT.2022.3147984zbMath1497.94027arXiv2106.15000OpenAlexW4206883325MaRDI QIDQ5088475

Jin-Chao Xu, Jonathan W. Siegel

Publication date: 13 July 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.15000

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Approximation algorithms (68W25)

Related Items (3)

Uniform approximation rates and metric entropy of shallow neural networks ⋮ Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping ⋮ Greedy training algorithms for neural networks and applications to PDEs

This page was built for publication: Optimal Convergence Rates for the Orthogonal Greedy Algorithm