Probabilistic lower bounds for approximation by shallow perceptron networks

DOI10.1016/j.neunet.2017.04.003zbMath1437.68063WikidataQ47855272 ScholiaQ47855272MaRDI QIDQ2181058

Marcello Sanguineti, Vera Kurková

Publication date: 18 May 2020

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2017.04.003

zbMATH Keywords

model complexity; Chernoff-Hoeffding bounds; perceptrons; shallow networks; lower bounds on approximation rates

Mathematics Subject Classification ID

68T07: Artificial neural networks and deep learning

68W25: Approximation algorithms

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)

68Q07: Biologically inspired models of computation (DNA computing, membrane computing, etc.)