3 ms·
a pure functional language is trivially differentiated, no? View a program as a data flow graph and then append the differentiation data flow graph. How this
by brrrrrm 5y ago
a pure functional language is trivially differentiated, no? View a program as a data flow graph and then append the differentiation data flow graph. How this is executed (reverse-mode vs forward-mode vs some exotic mix) is just a leaked abstraction. Ideally, it wouldn't need to be exposed to the user.
- taeric 5y agoMy understanding is that all trivial versions of anything are wonderful for the pedagogy, but far short of what is needed in implementation. Just consider garbage collection. Trivial reference counting is easy to explain and implement. Not going to win too many points in use, though.