Computational aspects of Kolmogorov's superposition theorem

DOI10.1016/0893-6080(94)90079-5zbMath0823.26011OpenAlexW2077695810MaRDI QIDQ1338265

David A. Sprecher, Hidefumi Katsuura

Publication date: 27 November 1994

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

Full work available at URL: https://doi.org/10.1016/0893-6080(94)90079-5

zbMATH Keywords

iterated contraction mappingsKolmogorov superposition

Mathematics Subject Classification ID

Representation and superposition of functions (26B40)

Related Items (2)

A NEURO-FUZZY MODEL FOR DIMENSIONALITY REDUCTION AND ITS APPLICATION ⋮ A three layer neural network can represent any multivariate function

Cites Work

• Unnamed Item
• Unnamed Item
• A universal mapping for Kolmogorov's superposition theorem
• Approximative versions of Kolmogorov's superposition theorem, proved constructively
• Continuous Nowhere-Differentiable Functions--an Application of Contraction Mappings
• On the representation of continuous functions of many variables by superposition of continuous functions of one variable and addition
• On the Structure of Continuous Functions of Several Variables
• On the Structure of Representations of Continuous Functions of Several Variables as Finite Sums of Continuous Functions of One Variable

This page was built for publication: Computational aspects of Kolmogorov's superposition theorem