Orthogonal greedy algorithm for linear operator learning with shallow neural network

Ye Lin, Jiwei Jia, Young Ju Lee, Ran Zhang
1/6/2025
math.NAcs.LG

No confident code implementation found for this paper.

Abstract

Greedy algorithms, particularly the orthogonal greedy algorithm (OGA), have proven effective in training shallow neural networks for fitting functions and solving partial differential equations (PDEs). In this paper, we extend the application of OGA to the tasks of linear operator learning, which is equivalent to learning the kernel function through integral transforms. Firstly, a novel greedy algorithm is developed for kernel estimation rate in a new semi-inner product, which can be utilized to approximate the Green's function of linear PDEs from data. Secondly, we introduce the OGA for point-wise kernel estimation to further improve the approximation rate, achieving orders of accuracy improvement across various tasks and baseline models. In addition, we provide a theoretical analysis on the kernel estimation problem and the optimal approximation rates for both algorithms, establishing their efficacy and potential for future applications in PDEs and operator learning tasks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lin2025orthogonal,
  title  = {Orthogonal greedy algorithm for linear operator learning with shallow neural network},
  author = {Ye Lin and Jiwei Jia and Young Ju Lee and Ran Zhang},
  year   = {2025},
  eprint = {2501.02791},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.02791v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.02791.svg)](https://codeofpaper.com/paper/2501.02791)

Discussion