Difference between revisions of "Differentiable Programming"
(Created page with "{{#seo: |title=PRIMO.ai |titlemode=append |keywords=artificial, intelligence, machine, learning, models, algorithms, data, singularity, moonshot, Tensorflow, Google, Nvidia, M...") |
|||
| Line 15: | Line 15: | ||
TensorFlow 1 uses the static graph approach, whereas TensorFlow 2 uses the dynamic graph approach by default. [http://en.wikipedia.org/wiki/Differentiable_programming Differentiable programming | Wikipedia] | TensorFlow 1 uses the static graph approach, whereas TensorFlow 2 uses the dynamic graph approach by default. [http://en.wikipedia.org/wiki/Differentiable_programming Differentiable programming | Wikipedia] | ||
| − | http://pathmind.com/images/wiki/differentiable_probabilistic.jpg | + | <img src="http://pathmind.com/images/wiki/differentiable_probabilistic.jpg" width="800" height="700"> |
Revision as of 17:19, 26 April 2020
YouTube search... ...Google search
Differentiable programs are programs that rewrite themselves at least one component by optimizing along a gradient, like neural networks do using optimization algorithms such as gradient descent. Here’s a graphic illustrating the difference between differential and probabilistic programming approaches. A Beginner's Guide to Differentiable Programming | Chris Nicholson - A.I. Wiki pathmind
TensorFlow 1 uses the static graph approach, whereas TensorFlow 2 uses the dynamic graph approach by default. Differentiable programming | Wikipedia
