<p>There is an advanced result, key to machine learning, known as Kolmogorov's theorem [1]; I have never seen an intuitive sketch of why it works.  This may have to do with the different cultures that approach it.  The applied learning crowd regards Kolmogorov's theorem as an existence theorem that merely indicates that NNs may exist, so at least the structure is not overly limiting, but the theorem does not guarantee these NNs can be found.  Mathematicians are not so concerned with low-level applications of the theorem.</p>

<p>The theorem was also historically used to invoke/defend the inherent sophistication of multilayer NNs to counter a criticism from <a href="http://en.wikipedia.org/wiki/Perceptrons_%28book%29" rel="nofollow">Perceptrons</a> (Minsky/Papert) that there were basic functions [ie nonlinear] that they couldnt learn.</p>

<p>Theoretical computer scientists prefer not to regard NNs as <a href="http://en.wikipedia.org/wiki/Approximation_algorithm" rel="nofollow">"approximations"</a>, as that term has a special/different meaning.  There is probably some rough analogy with <a href="http://en.wikipedia.org/wiki/Linear_interpolation" rel="nofollow">piecewise linear interpolation</a> but again, I havent seen it laid out.</p>

<p>[1] Kolmogorov, A. N. (1957). On the representation of continuous 
functions of many variables by superposition of continuous 
functions of one variable and addition. Doklady Akademii 
Nauk SSSR, 144, 679-681; American Mathematical Society 
Translation, 28, 55-59 [1963]</p>

<p>[2] <a href="http://neuron.eng.wayne.edu/tarek/MITbook/chap2/2_3.html" rel="nofollow">2.3 Approximation Capabilities of Feedforward Neural Networks for Continuous Functions</a></p>

<p>[3] <a href="http://www.sciencedirect.com/science/article/pii/0893608092900128" rel="nofollow">Kolmogorov's theorem and multilayer neural networks</a> Kurkova</p>

CC BY-SA 3.0
2013-05-08T01:18:42.553Z
see also [are machine learning techniques approximation algorithms?](http://stats.stackexchange.com/questions/23463/are-machine-learning-techniques-approximation-algorithms), stats.se
vzn
CC BY-SA 3.0
2013-05-08T18:49:12.183Z
"this advanced result [...] have not seen an intuitive sketch of why it works." Would such a sketch be a considerable undertaking for someone in the advanced math crowd? Do the advanced math people even understand intuitively why it works? It seems that an intuitive understanding of this theorem is something that the applied learning crowd should strongly desire, if they are to devise superior topologies and learning algorithms for ANNs.
Matt Munson
CC BY-SA 3.0
2013-05-13T15:21:28.887Z
Edited for grammar, spelling, punctuation, and capitalization.
Jeffε
CC BY-SA 3.0
2013-05-08T01:10:04.987Z
2013-05-13T15:20:17.070Z
2013-05-13T15:20:17.070Z
vzn
<p>Cybenko's result is fairly intuitive, as I hope to convey below; what makes things more tricky is he was aiming both for generality, as well as a minimal number of hidden layers.  Kolmogorov's result (mentioned by vzn) in fact achieves a stronger guarantee, but is somewhat less relevant to machine learning (in particular, it does not build a standard neural net, since the nodes are heterogeneous); this result in turn is daunting since on the surface it is just 3 pages  recording some limits and continuous functions, but in reality it is constructing a set of fractals.  While Cybenko's result is unusual and very interesting due to the exact techniques he uses, results of that flavor are very widely used in machine learning (and I can point you to others).</p>

<p>Here is a high-level summary of why Cybenko's result should hold.</p>

<ul>
<li>A continuous function on a compact set can be approximated by a piecewise constant function.</li>
<li>A piecewise constant function can be represented as a neural net as follows.  For each region where the function is constant, use a neural net as an indicator function for that region.  Then build a final layer with a single node, whose input linear combination is the sum of all the indicators, with a weight equal to the constant value of the corresponding region in the original piecewise constant function.</li>
</ul>

<p>Regarding the first point above, this can be taken as the statement "a continuous function over a compact set is uniformly continuous".  What this means to us is you can take your continuous function over $[0,1]^d$, and some target error $\epsilon&gt;0$, then you can grid $[0,1]^d$ at scale $\tau&gt;0$ (ending up with roughly $(1/\tau)^d$ subcubes) so that a function which is constant over each subcube is within $\epsilon$ of the target function.</p>

<p>Now, a neural net can not precisely represent an indicator, but you can get very close.  Suppose the "transfer function" is a sigmoid.  (Transfer function is the continuous function you apply to a linear combination of inputs in order to get the value of the neural net node.)  Then by making the weights huge, you output something close to 0 or close to 1 for more inputs.  This is consistent with Cybenko's development: notice he needs the functions involved to equal 0 or 1 in the limit: by definition of limit, you get exactly what I'm saying, meaning you push things arbitrarily close to 0 or 1.</p>

<p>(I ignored the transfer function in the final layer; if it's there, and it's continuous, then we can fit anything mapping to $[0,1]$ by replacing the constant weights with the something in the inverse image of that constant according to the transfer function.)</p>

<p>Notice that the above may seem to take a couple layers: say, 2 to build the indicators on cubes, and then a final output layer.  Cybenko was trying for two points of generality: minimal number of hidden layers, and flexibility in the choice of transfer function.  I've already described how he works out flexibility in transfer function.</p>

<p>To get the minimum number of layers, he avoids the construction above, and instead uses functional analysis to develop a contradiction.
Here's a sketch of the argument.</p>

<ul>
<li><p>The final node computes a linear combination of the elements of the layer below it, and applies a transfer function to it.  This linear combination  is a linear combination of functions, and as such, is itself a function, a function within some subspace of functions, spanned by the possible nodes in the hidden layer.</p></li>
<li><p>A subspace of functions is just like an ordinary finite-dimensional subspace, with the main difference that it is potentially not a closed set; that's why cybenko's arguments all take the closure of that subspace.  We are trying to prove that this closure contains all continuous functions; that will mean we are arbitrarily close to all continuous functions.</p></li>
<li><p>If the function space were simple (a Hilbert space), we could argue as follows.  Pick some target continuous function which is contradictorily supposed to not lie in the subspace, and project it onto the orthogonal complement of the subspace.  This residual must be nonzero.  But since our subspace can represent things like those little cubes above, we can find some region of this residual, fit a little cube to it (as above), and thereby move closer to our target function.  This is a contradiction since projections choose minimal elements.  (Note, I am leaving something out here: Cybenko's argument doesn't build any little cubes, he handles this in generality too; this is where he uses a form of the Riesz representation theorem, and properties of the transfer functions (if I remember correctly, there is a separate lemma for this step, and it is longer than the main theorem).) </p></li>
<li><p>We aren't in a Hilbert space, but we can use the Hahn-Banach theorem to replace the projection step above (note, proving Hahn-Banach uses the axiom of choice).</p></li>
</ul>

<p>Now I'd like to say a few things about Kolmogorov's result.  While this result does not apparently need the sort of background of Cybenko's, I personally think it is much more intimidating.</p>

<p>Here is why.  Cybenko's result is an <strong>approximation guarantee</strong>: it does not say we can exactly represent anything.  On the other hand, Kolmogorov's result is provides an <strong>equality</strong>.  More ridiculously, it says the size of the net: you need just $\mathcal O(d^2)$ nodes.  To achieve this strengthening, there is a catch of course, the one I mentioned above: the network is heteregeneous, by which I mean all the transfer functions are not the same.</p>

<p>Okay, so with all that, how can this thing possible work?!</p>

<p>Let's go back to our cubes above.  Notice that we had to bake in a level of precision: for every $\epsilon&gt;0$, we have to go back and pick a more refined $\tau &gt;0$.  Since we are working with (finite) linear combinations of indicators, we are never exactly representing anything.  (things only get worse if you include the approximating effects of sigmoids.)</p>

<p>So what's the solution?  Well, how about we handle all scales simultaneously?  I'm not making this up: Kolmogorov's proof is effectively constructing the hidden layer as a set of fractals.  Said another way, they are basically space filling curves which map $[0,1]$ to $[0,1]^d$; this way, even though we have a combination of univariate functions, we can fit any multivariate function.  In fact, you can heuristically reason that $\mathcal O(d^2)$ is "correct" via a ridiculous counting argument: we are writing a continuous function from $\mathbb{R}^d$ to $\mathbb R$ via univariate continuous functions, and therefore, to capture all inter-coordinate interactions, we need $\mathcal O(d^2)$ functions...</p>

<p>Note that Cybenko's result, due to using only one type of transfer function, is more relevant to machine learning.  Theorems of this type are very common in machine learning (vzn suggested this in his answer, however he referred to Kolmogorov's result, which is less applicable due to the custom transfer functions; this is weakened in some more fancy versions of Kolmogorov's result (produced by other authors), but those still involve fractals, and at least two transfer functions).</p>

<p>I have some slides on these topics, which I could post if you are interested (hopefully less rambly than the above, and have some pictures; I wrote them before I was adept with Hahn-Banach, however).  I think both proofs are very, very nice.  (Also, I have another answer here on these topics, but I wrote it before I had grokked Kolmogorov's result.)</p>

CC BY-SA 3.0
2013-05-15T03:59:53.140Z
Usually when I think of Hahn-Banach I think of the geometric variant: two convex sets $A$, $B$ are disjoint if and only if a hyperplane separates them, i.e. there exists a linear functional $\phi$ such that $\forall f \in A: \phi(f) \leq 1$ and $\forall g \in B: \phi(g) > 1$. so is Cybenko simply constructing a linear functional that separates a function from the subspace of interest and deriving a contradiction, maybe by approximating the functional ?
Sasho Nikolov
CC BY-SA 3.0
2013-05-15T04:13:41.930Z
@SashoNikolov , yes, basically that.  Given our closed subspace $S$ (a closed convex set) and target function $f\not\in S$, a slightly more powerful version of Hahn-Banach gives us linear function $L$ with $L(g) = 0$ for $g \in S$, and $L(f) = \|f\|$.  Next, Riesz representation theorem lets us write $L(f)$ as an integral with respect to some signed measure.  But this finishes the proof due to Cybenko's conditions on the transfer functions (continued in next comment).
matus
CC BY-SA 3.0
2013-05-15T04:16:32.537Z
@SashoNikolov , Cybenko's condition is that given any signed measure not exactly zero, there exists some affine function so that integration of the transfer function composed with that affine function, over that measure, is not equal to zero.  He then has to prove the lemma that generalized sigmoids (as I gave above: limits to 0 and 1 on the left and right) fit the bill.  (continued in next comment.)
matus
CC BY-SA 3.0
2013-05-15T04:18:58.013Z
@SashoNikolov .  Above I said "plopping a cube along the residual".  This would make our job slightly easier, since the signed measure is not exactly zero, we would just pick out some little piece and plop an indicator there.  In his case, he has to work a little, but similarly this boils down to moving around the sigmoid with the affine function so that it finds some easy region, thus getting nonzero integral, contradicting Hahn-Banach (which is zero over our subspace); in the Hilbert sense, we shrank our residual, a contradiction.
matus
CC BY-SA 3.0
2013-05-16T20:18:08.117Z
Wow, this is an extremely nice answer. Naturally, I have a few questions if you don't mind answering them. Cybenko's result (as you say) seems most useful for applications, but I get a bit lost dealing with the subspace of functions. How do we project an arbitrary continuous function onto the orthogonal complement of the subspace of linear combinations of possible nodes. For that matter, how do we conceptualize the orthogonal compliment of that subspace? Do functions closer in space more closely approximate one another? (Continued).
Matt Munson
CC BY-SA 3.0
2013-05-16T20:35:02.063Z
What is a region of the residual, and how do we fit a cube to it? I also have some general followup questions. The Cybenko result shows that we can make an approximation by approximating a step function, but how much more effective can an ANN be by being somewhat non-constant. Finally, does the Kolmogorov result suggest to you that there could be some practical utility in providing an ANN with a variety of transfer functions, and, if so, how could we reason about which variety? (Continued).
Matt Munson
CC BY-SA 3.0
2013-05-16T20:40:05.467Z
Thank you very much for the extremely comprehensive and insightful answer. If you have time to post the slides and pictures, and the link to your other post, I'm sure that I and others would get great value out of that. Cheers, and thanks again.
Matt Munson
CC BY-SA 3.0
2014-01-22T21:05:55.907Z
@matus this is an awesome answer. You should consider adding links to the other answer and slides that you mention at the end. I think they would be helpful for interested readers.
Artem Kaznatcheev
CC BY-SA 3.0
2015-04-20T19:25:28.353Z
Does Cybenko's result hold for zero weights? Lemma 2 in his paper seems to falter for these cases, I don't understand, maybe I'm looking at it wrongly?
mesllo
CC BY-SA 3.0
2015-04-20T21:09:30.013Z
I mean Lemma 1*
mesllo
CC BY-SA 3.0
2013-05-15T00:08:17.173Z
2013-05-15T00:08:17.173Z
matus
<p>I posted this <a href="https://math.stackexchange.com/q/382479/6555">earlier</a> on MSE, but it was suggested that here may be a better place to ask.</p>

<p><a href="http://en.wikipedia.org/wiki/Universal_approximation_theorem" rel="noreferrer">Universal approximation theorem</a> states that "the standard multilayer feed-forward network with a single hidden layer, which contains finite number of hidden neurons, is a universal approximator among continuous functions on compact subsets of Rn, under mild assumptions on the activation function."</p>

<p>I understand what this means, but the relevant papers are too far over my level of math understanding to grasp why it is true or how a hidden layer approximates non-linear functions.</p>

<p>So, in terms little more advanced than basic calculus and linear algebra, how does a feed-forward network with one hidden layer approximate non-linear functions? The answer need not necessarily be totally concrete.</p>

CC BY-SA 3.0
2013-05-08T01:30:11.807Z
see also global optimization in [are there gradient descent techniques to find global extrema](http://cstheory.stackexchange.com/questions/10634/is-there-any-gradient-descent-based-technique-for-searching-absolute-minimum-ma)
vzn
CC BY-SA 3.0
2017-04-17T19:12:05.923Z
I found the [visual proof](http://neuralnetworksanddeeplearning.com/chap4.html) by michael nielsen pretty useful
Mr Tsjolder from codidact
<approximation-algorithms><ne.neural-evol><na.numerical-analysis>
Universal Approximation Theorem — Neural Networks
Matt Munson
# Universal Approximation Theorem — Neural Networks

(Asked by: username_0 on 2013-05-07)

I posted this [earlier](https://math.stackexchange.com/q/382479/6555) on MSE, but it was suggested that here may be a better place to ask.

[Universal approximation theorem](http://en.wikipedia.org/wiki/Universal_approximation_theorem) states that "the standard multilayer feed-forward network with a single hidden layer, which contains finite number of hidden neurons, is a universal approximator among continuous functions on compact subsets of Rn, under mild assumptions on the activation function."

I understand what this means, but the relevant papers are too far over my level of math understanding to grasp why it is true or how a hidden layer approximates non-linear functions.

So, in terms little more advanced than basic calculus and linear algebra, how does a feed-forward network with one hidden layer approximate non-linear functions? The answer need not necessarily be totally concrete.

**Tags:** approximation-algorithms, ne.neural-evol, na.numerical-analysis

> **Comments:**
> **username_1**: see also global optimization in [are there gradient descent techniques to find global extrema](http://cstheory.stackexchange.com/questions/10634/is-there-any-gradient-descent-based-technique-for-searching-absolute-minimum-ma)  
> **username_2**: I found the [visual proof](http://neuralnetworksanddeeplearning.com/chap4.html) by michael nielsen pretty useful  

---

## 2 answers

### Answer by username_4 on 2013-05-15. Score: 29 | Accepted answer

Cybenko's result is fairly intuitive, as I hope to convey below; what makes things more tricky is he was aiming both for generality, as well as a minimal number of hidden layers. Kolmogorov's result (mentioned by username_1) in fact achieves a stronger guarantee, but is somewhat less relevant to machine learning (in particular, it does not build a standard neural net, since the nodes are heterogeneous); this result in turn is daunting since on the surface it is just 3 pages recording some limits and continuous functions, but in reality it is constructing a set of fractals. While Cybenko's result is unusual and very interesting due to the exact techniques he uses, results of that flavor are very widely used in machine learning (and I can point you to others).

Here is a high-level summary of why Cybenko's result should hold.

* A continuous function on a compact set can be approximated by a piecewise constant function.
* A piecewise constant function can be represented as a neural net as follows. For each region where the function is constant, use a neural net as an indicator function for that region. Then build a final layer with a single node, whose input linear combination is the sum of all the indicators, with a weight equal to the constant value of the corresponding region in the original piecewise constant function.

Regarding the first point above, this can be taken as the statement "a continuous function over a compact set is uniformly continuous". What this means to us is you can take your continuous function over $[0,1]^d$, and some target error $\epsilon>0$, then you can grid $[0,1]^d$ at scale $\tau>0$ (ending up with roughly $(1/\tau)^d$ subcubes) so that a function which is constant over each subcube is within $\epsilon$ of the target function.

Now, a neural net can not precisely represent an indicator, but you can get very close. Suppose the "transfer function" is a sigmoid. (Transfer function is the continuous function you apply to a linear combination of inputs in order to get the value of the neural net node.) Then by making the weights huge, you output something close to 0 or close to 1 for more inputs. This is consistent with Cybenko's development: notice he needs the functions involved to equal 0 or 1 in the limit: by definition of limit, you get exactly what I'm saying, meaning you push things arbitrarily close to 0 or 1.

(I ignored the transfer function in the final layer; if it's there, and it's continuous, then we can fit anything mapping to $[0,1]$ by replacing the constant weights with the something in the inverse image of that constant according to the transfer function.)

Notice that the above may seem to take a couple layers: say, 2 to build the indicators on cubes, and then a final output layer. Cybenko was trying for two points of generality: minimal number of hidden layers, and flexibility in the choice of transfer function. I've already described how he works out flexibility in transfer function.

To get the minimum number of layers, he avoids the construction above, and instead uses functional analysis to develop a contradiction.
Here's a sketch of the argument.

* The final node computes a linear combination of the elements of the layer below it, and applies a transfer function to it. This linear combination is a linear combination of functions, and as such, is itself a function, a function within some subspace of functions, spanned by the possible nodes in the hidden layer.
* A subspace of functions is just like an ordinary finite-dimensional subspace, with the main difference that it is potentially not a closed set; that's why cybenko's arguments all take the closure of that subspace. We are trying to prove that this closure contains all continuous functions; that will mean we are arbitrarily close to all continuous functions.
* If the function space were simple (a Hilbert space), we could argue as follows. Pick some target continuous function which is contradictorily supposed to not lie in the subspace, and project it onto the orthogonal complement of the subspace. This residual must be nonzero. But since our subspace can represent things like those little cubes above, we can find some region of this residual, fit a little cube to it (as above), and thereby move closer to our target function. This is a contradiction since projections choose minimal elements. (Note, I am leaving something out here: Cybenko's argument doesn't build any little cubes, he handles this in generality too; this is where he uses a form of the Riesz representation theorem, and properties of the transfer functions (if I remember correctly, there is a separate lemma for this step, and it is longer than the main theorem).)
* We aren't in a Hilbert space, but we can use the Hahn-Banach theorem to replace the projection step above (note, proving Hahn-Banach uses the axiom of choice).

Now I'd like to say a few things about Kolmogorov's result. While this result does not apparently need the sort of background of Cybenko's, I personally think it is much more intimidating.

Here is why. Cybenko's result is an **approximation guarantee**: it does not say we can exactly represent anything. On the other hand, Kolmogorov's result is provides an **equality**. More ridiculously, it says the size of the net: you need just $\mathcal O(d^2)$ nodes. To achieve this strengthening, there is a catch of course, the one I mentioned above: the network is heteregeneous, by which I mean all the transfer functions are not the same.

Okay, so with all that, how can this thing possible work?!

Let's go back to our cubes above. Notice that we had to bake in a level of precision: for every $\epsilon>0$, we have to go back and pick a more refined $\tau >0$. Since we are working with (finite) linear combinations of indicators, we are never exactly representing anything. (things only get worse if you include the approximating effects of sigmoids.)

So what's the solution? Well, how about we handle all scales simultaneously? I'm not making this up: Kolmogorov's proof is effectively constructing the hidden layer as a set of fractals. Said another way, they are basically space filling curves which map $[0,1]$ to $[0,1]^d$; this way, even though we have a combination of univariate functions, we can fit any multivariate function. In fact, you can heuristically reason that $\mathcal O(d^2)$ is "correct" via a ridiculous counting argument: we are writing a continuous function from $\mathbb{R}^d$ to $\mathbb R$ via univariate continuous functions, and therefore, to capture all inter-coordinate interactions, we need $\mathcal O(d^2)$ functions...

Note that Cybenko's result, due to using only one type of transfer function, is more relevant to machine learning. Theorems of this type are very common in machine learning (username_1 suggested this in his answer, however he referred to Kolmogorov's result, which is less applicable due to the custom transfer functions; this is weakened in some more fancy versions of Kolmogorov's result (produced by other authors), but those still involve fractals, and at least two transfer functions).

I have some slides on these topics, which I could post if you are interested (hopefully less rambly than the above, and have some pictures; I wrote them before I was adept with Hahn-Banach, however). I think both proofs are very, very nice. (Also, I have another answer here on these topics, but I wrote it before I had grokked Kolmogorov's result.)

> **Comments:**
> **username_5**: Usually when I think of Hahn-Banach I think of the geometric variant: two convex sets $A$, $B$ are disjoint if and only if a hyperplane separates them, i.e. there exists a linear functional $\phi$ such that $\forall f \in A: \phi(f) \leq 1$ and $\forall g \in B: \phi(g) > 1$. so is Cybenko simply constructing a linear functional that separates a function from the subspace of interest and deriving a contradiction, maybe by approximating the functional ?  
> **username_4**: @SashoNikolov , yes, basically that.  Given our closed subspace $S$ (a closed convex set) and target function $f\not\in S$, a slightly more powerful version of Hahn-Banach gives us linear function $L$ with $L(g) = 0$ for $g \in S$, and $L(f) = \|f\|$.  Next, Riesz representation theorem lets us write $L(f)$ as an integral with respect to some signed measure.  But this finishes the proof due to Cybenko's conditions on the transfer functions (continued in next comment).  
> **username_4**: @SashoNikolov , Cybenko's condition is that given any signed measure not exactly zero, there exists some affine function so that integration of the transfer function composed with that affine function, over that measure, is not equal to zero.  He then has to prove the lemma that generalized sigmoids (as I gave above: limits to 0 and 1 on the left and right) fit the bill.  (continued in next comment.)  
> **username_4**: @SashoNikolov .  Above I said "plopping a cube along the residual".  This would make our job slightly easier, since the signed measure is not exactly zero, we would just pick out some little piece and plop an indicator there.  In his case, he has to work a little, but similarly this boils down to moving around the sigmoid with the affine function so that it finds some easy region, thus getting nonzero integral, contradicting Hahn-Banach (which is zero over our subspace); in the Hilbert sense, we shrank our residual, a contradiction.  
> **username_0**: Wow, this is an extremely nice answer. Naturally, I have a few questions if you don't mind answering them. Cybenko's result (as you say) seems most useful for applications, but I get a bit lost dealing with the subspace of functions. How do we project an arbitrary continuous function onto the orthogonal complement of the subspace of linear combinations of possible nodes. For that matter, how do we conceptualize the orthogonal compliment of that subspace? Do functions closer in space more closely approximate one another? (Continued).  
> **username_0**: What is a region of the residual, and how do we fit a cube to it? I also have some general followup questions. The Cybenko result shows that we can make an approximation by approximating a step function, but how much more effective can an ANN be by being somewhat non-constant. Finally, does the Kolmogorov result suggest to you that there could be some practical utility in providing an ANN with a variety of transfer functions, and, if so, how could we reason about which variety? (Continued).  
> **username_0**: Thank you very much for the extremely comprehensive and insightful answer. If you have time to post the slides and pictures, and the link to your other post, I'm sure that I and others would get great value out of that. Cheers, and thanks again.  
> **username_6**: @username_4 this is an awesome answer. You should consider adding links to the other answer and slides that you mention at the end. I think they would be helpful for interested readers.  
> **username_7**: Does Cybenko's result hold for zero weights? Lemma 2 in his paper seems to falter for these cases, I don't understand, maybe I'm looking at it wrongly?  
> **username_7**: I mean Lemma 1*  

---

### Answer by username_1 on 2013-05-08. Score: 3

There is an advanced result, key to machine learning, known as Kolmogorov's theorem [1]; I have never seen an intuitive sketch of why it works. This may have to do with the different cultures that approach it. The applied learning crowd regards Kolmogorov's theorem as an existence theorem that merely indicates that NNs may exist, so at least the structure is not overly limiting, but the theorem does not guarantee these NNs can be found. Mathematicians are not so concerned with low-level applications of the theorem.

The theorem was also historically used to invoke/defend the inherent sophistication of multilayer NNs to counter a criticism from [Perceptrons](http://en.wikipedia.org/wiki/Perceptrons_%28book%29) (Minsky/Papert) that there were basic functions [ie nonlinear] that they couldnt learn.

Theoretical computer scientists prefer not to regard NNs as ["approximations"](http://en.wikipedia.org/wiki/Approximation_algorithm), as that term has a special/different meaning. There is probably some rough analogy with [piecewise linear interpolation](http://en.wikipedia.org/wiki/Linear_interpolation) but again, I havent seen it laid out.

[1] Kolmogorov, A. N. (1957). On the representation of continuous
functions of many variables by superposition of continuous
functions of one variable and addition. Doklady Akademii
Nauk SSSR, 144, 679-681; American Mathematical Society
Translation, 28, 55-59 [1963]

[2] [2.3 Approximation Capabilities of Feedforward Neural Networks for Continuous Functions](http://neuron.eng.wayne.edu/tarek/MITbook/chap2/2_3.html)

[3] [Kolmogorov's theorem and multilayer neural networks](http://www.sciencedirect.com/science/article/pii/0893608092900128) Kurkova

> **Comments:**
> **username_1**: see also [are machine learning techniques approximation algorithms?](http://stats.stackexchange.com/questions/23463/are-machine-learning-techniques-approximation-algorithms), stats.se  
> **username_0**: "this advanced result [...] have not seen an intuitive sketch of why it works." Would such a sketch be a considerable undertaking for someone in the advanced math crowd? Do the advanced math people even understand intuitively why it works? It seems that an intuitive understanding of this theorem is something that the applied learning crowd should strongly desire, if they are to devise superior topologies and learning algorithms for ANNs.  
> **username_3**: Edited for grammar, spelling, punctuation, and capitalization.  

---

