Strong universal consistency of neural network classifiers

DOI10.1109/18.243433zbMath0811.68109OpenAlexW2161086430MaRDI QIDQ4307316

Andras Farago, Gábor Lugosi

Publication date: 4 October 1994

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.243433

zbMATH Keywords

statistical pattern recognitionuniversally consistent classifiers

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items (7)

Learning and Convergence of the Normalized Radial Basis Functions Networks ⋮ A counterexample concerning uniform ergodic theorems for a class of functions ⋮ A deep learning semiparametric regression for adjusting complex confounding structures ⋮ Classifier performance as a function of distributional complexity ⋮ Functional classification of ornamental stone using machine learning techniques ⋮ A nonparametric ensemble binary classifier and its statistical properties ⋮ Hardness results for neural network approximation problems

This page was built for publication: Strong universal consistency of neural network classifiers