Approximative compactness of linear combinations of characteristic functions
DOI10.1016/j.jat.2020.105435zbMath1445.41020OpenAlexW3023494653MaRDI QIDQ783713
Andrew Vogt, Paul C. Kainen, Vera Kurková
Publication date: 4 August 2020
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jat.2020.105435
neural networksHausdorff metricHaar measuresymmetric difference metricapproximative compactnesscompact sets of characteristic (indicator) functions
Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20) Measurable and nonmeasurable functions, sequences of measurable functions, modes of convergence (28A20) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Other problems of combinatorial convexity (52A37) Approximation by arbitrary linear expressions (41A45)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Replacing points by compacta in neural network approximation
- Operations on approximatively compact sets
- Existence of best approximations
- A strong law of large numbers for random compact sets
- Approximation and learning of convex superpositions
- Best approximation by linear combinations of characteristic functions of half-spaces.
- A better approximation for balls
- Geometry and topology of continuous best and near best approximations
- Limitations of the approximation capabilities of neural networks with one hidden layer
- On the symmetric difference metric for convex bodies
- Neural Networks for Localized Approximation
- Bounds on rates of variable-basis and neural-network approximation
- Theory of Random Sets
- Metrics for sets of convex bodies
This page was built for publication: Approximative compactness of linear combinations of characteristic functions