3 ms·
Could one say, in a sense, that recurrence is essentially differential equations and convolution essentially more complicated operations than those of arithmeti
by posterboy 7y ago
Could one say, in a sense, that recurrence is essentially differential equations and convolution essentially more complicated operations than those of arithmetic polynomials?
This might sound like nonsense. On the one hand, most trivial convolutions use trivial operators; "polynomials" might include higher operations anyhow, or approximate some of the more important ones, none of which is appealing if simplicity equals efficiency. On the other hand, I never really understood diff-eqs; ODEs seem like polynomials over self similar polynomials, to me, hence "recurrent"; All the other diff-eqs I can't begin to fathom.
- apl 7y agoThere's many perspectives on everything. Deep ConvNets, for instance, can be expressed as a continuously evolving ODE. Here's a fantastic paper on this view: https://papers.nips.cc/paper/7892-neural-ordinary-differential-equations https://papers.nips.cc/paper/7892-neural-ordinary-differenti...
- ummonk 7y agoYeah, that's a reasonable way of looking at it. Convolution would be a partial differential equation in this view.