Approximative Compactness of Linear Combinations of Characteristic Functions

Abstract

Best approximation by the set of all n-fold linear combinations of a family of characteristic functions of measurable subsets is investigated. Such combinations generalize Heaviside-type neural networks. Existence of best approximation is studied in terms of approximative compactness, which requires convergence of distance-minimizing sequences.

Categories and tags

  • Článek v odborném periodiku