Verified70% confidenceFactExact time
The Universal Approximation Theorem was proved by George Cybenko in 1989, stating that given sufficient layers and neurons, a neural network can approximate any continuous function to arbitrary precision.
4
Sources
70%
Confidence
Long-term
Relevance
7/21/2026
First Seen
Sources
Related Claims
VerifiedThe universal approximation theorem was rigorously proven by mathematician Cybenko in 1989 for the Sigmoid activation function.77% similarUnverifiedCybenko的原始证明利用了Hahn-Banach定理来证明神经网络所张成的函数子空间在连续函数空间C(K)中稠密73% similarUnverifiedElhage et al. in their 2022 paper on the Superposition hypothesis explained the phenomenon of polysemanticity: networks encode far more features than their number of dimensions in a limited dimensional space, causing individual neurons to respond to multiple concepts.67% similarUnverified预测性编码理论由神经科学家卡尔·弗里斯顿在赫尔姆霍兹早期感知理论基础上系统化发展62% similarVerifiedTerence Tao collaborated with Ben Green to prove the Green-Tao theorem, which states that the prime numbers contain arbitrarily long arithmetic progressions.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/582544API
curl https://kongchang.com/api/v1/knowledge/claims/582544MCP
get_claim(id=582544)