A note on computing with Kolmogorov superpositions without iterations

DOI10.1016/j.neunet.2021.07.006OpenAlexW3193453340MaRDI QIDQ6055149

Robert Demb, David A. Sprecher

Publication date: 28 September 2023

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

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

zbMATH Keywords

error boundapproximationscomputational algorithmsparallel computationsiterationsfunction representationsinterpolantsKolmogorov superpositionsKöppen's recursive formula

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Algorithms for approximation of functions (65D15) Approximation by other special function classes (41A30)

Cites Work

• A universal mapping for Kolmogorov's superposition theorem
• Error bounds for deep ReLU networks using the Kolmogorov-Arnold superposition theorem
• Variants of Learning Algorithm Based on Kolmogorov Theorem
• Representation of continuous functions of three variables by the superposition of continuous functions of two variables
• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on computing with Kolmogorov superpositions without iterations