Complexity of shallow networks representing finite mappings
type: Item
instance of: scholarly article
title: Complexity of Shallow Networks Representing Finite Mappings
zbMATH Open document ID: 1355.68229
DOI: 10.1007/978-3-319-19324-3_4
author: Věra Kůrková
published in: Artificial Intelligence and Soft Computing
publication date: 2016-06-17T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 15B34
zbMATH DE Number: 6595215
zbMATH Keywords: shallow feedforward networks
zbMATH Keywords: signum perceptrons
zbMATH Keywords: finite mappings
zbMATH Keywords: model complexity
zbMATH Keywords: Hadamard matrices
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-319-19324-3 4
OpenAlex ID: W993425874
cites work: Feedforward Neural Network Methodology
cites work: A Fast Learning Algorithm for Deep Belief Nets
cites work: Learning deep architectures for AI
cites work: Q4024392
cites work: Interpolation of scattered data: distance matrices and conditionally positive definite functions
cites work: A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves
cites work: Complexity of Gaussian-radial-basis networks approximating smooth functions
cites work: Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization Tasks
cites work: Complexity estimates based on integral transforms induced by computational units
cites work: On best approximation by ridge functions
cites work: Lower bounds for approximation by MLP neural networks
cites work: Q4938227
cites work: Q4839051
cites work: Enumeration of Seven-Argument Threshold Functions
cites work: Q4065548
Recommended article: Probabilistic lower bounds for approximation by shallow perceptron networks
Recommended article: On the capabilities of multilayer perceptrons
Recommended article: Q4024392
Recommended article: Limitations of shallow nets approximation
Recommended article: Q4885199
description: scientific article; zbMATH DE number 6595215