Approximation with Neural Networks in Variable Lebesgue Spaces
This paper concerns the universal approximation property with neural networks in variable Lebesgue spaces. We show that, whenever the exponent function of the space is bounded, every function can be approximated with shallow neural networks with any desired accuracy. This result subsequently leads to determine the universality of the approximation depending on the boundedness of the exponent function. Furthermore, whenever the exponent is unbounded, we obtain some characterization results for the subspace of functions that can be approximated.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Space-Time Approximation with Shallow Neural Networks in Fourier Lebesgue spaces
Approximation capabilities of shallow neural networks (SNNs) form an integral part in understanding the properties of deep neural networks (DNNs). In the study of these approximation capabilities some very popular classe…
Approximation Theory of Tree Tensor Networks: Tensorized Univariate Functions -- Part I
We study the approximation of functions by tensor networks (TNs). We show that Lebesgue $L^p$-spaces in one dimension can be identified with tensor product spaces of arbitrary order through tensorization. We use this ten…
Tensor NetworksA Nearest Neighbor Characterization of Lebesgue Points in Metric Measure Spaces
The property of almost every point being a Lebesgue point has proven to be crucial for the consistency of several classification algorithms based on nearest neighbors. We characterize Lebesgue points in terms of a 1-Near…
ClassificationGeneral ClassificationregressionTime-Frequency Analysis for Neural Networks
We develop a quantitative approximation theory for shallow neural networks using tools from time-frequency analysis. Working in weighted modulation spaces $M^{p,q}_m(\mathbf{R}^{d})$, we prove dimension-independent appro…
Sparse approximation and recovery by greedy algorithms in Banach spaces
We study sparse approximation by greedy algorithms. We prove the Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA), a generalization of the Weak Orthogonal Matching Pursuit to the case of a Banach…