Complexity of Shallow Networks Representing Finite Mappings

DOI10.1007/978-3-319-19324-3_4zbMath1355.68229OpenAlexW993425874MaRDI QIDQ2814145

Vera Kurková

Publication date: 17 June 2016

Published in: Artificial Intelligence and Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19324-3_4

zbMATH Keywords

Hadamard matricesmodel complexityfinite mappingsshallow feedforward networkssignum perceptrons

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Boolean and Hadamard matrices (15B34)

Related Items (1)

Vulnerability of classifiers to evolutionary generated adversarial examples

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interpolation of scattered data: distance matrices and conditionally positive definite functions
• Complexity of Gaussian-radial-basis networks approximating smooth functions
• On best approximation by ridge functions
• Lower bounds for approximation by MLP neural networks
• Complexity estimates based on integral transforms induced by computational units
• A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves
• Learning Deep Architectures for AI
• Feedforward Neural Network Methodology
• Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization Tasks
• A Fast Learning Algorithm for Deep Belief Nets
• Enumeration of Seven-Argument Threshold Functions

This page was built for publication: Complexity of Shallow Networks Representing Finite Mappings