A short tour of operator learning theory: Convergence rates, statistical limits, and open questions
This paper surveys recent developments at the intersection of operator learning, statistical learning theory, and approximation theory. First, it reviews error bounds for empirical risk minimization with a focus on holomorphic operators and neural network approximations. Next, it illustrates fundamental performance limits in terms of sample size by adopting a minimax perspective and considering various notions of regularity beyond holomorphy. The paper ends with a discussion on the interplay between these two perspectives and related open questions.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Using the Split Bregman Algorithm to Solve the Self-repelling Snake Model
Preserving contour topology during image segmentation is useful in many practical scenarios. By keeping the contours isomorphic, it is possible to prevent over-segmentation and under-segmentation, as well as to adhere to…
Image SegmentationSegmentationSemantic SegmentationTheory-to-Practice Gap for Neural Networks and Neural Operators
This work studies the sampling complexity of learning with ReLU neural networks and neural operators. For mappings belonging to relevant approximation spaces, we derive upper bounds on the best-possible convergence rate …
Operator learningConvergence Rates for Learning Linear Operators from Noisy Data
This paper studies the learning of linear operators between infinite-dimensional Hilbert spaces. The training data comprises pairs of random input vectors in a Hilbert space and their noisy images under an unknown self-a…
Learning TheoryLearn to Tour: Operator Design For Solution Feasibility Mapping in Pickup-and-delivery Traveling Salesman Problem
This paper aims to develop a learning method for a special class of traveling salesman problems (TSP), namely, the pickup-and-delivery TSP (PDTSP), which finds the shortest tour along a sequence of one-to-one pickup-and-…
Reinforcement Learning (RL)Traveling Salesman ProblemTrilevel and Multilevel Optimization using Monotone Operator Theory
We consider rather a general class of multi-level optimization problems, where a convex objective function is to be minimized subject to constraints of optimality of nested convex optimization problems. As a special case…