<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>neural networks on Tom Roth</title><link>https://tomroth.dev/tags/neural-networks/</link><description>Recent content in neural networks on Tom Roth</description><generator>Hugo -- gohugo.io</generator><language>en</language><lastBuildDate>Sun, 01 Dec 2019 00:00:00 +0000</lastBuildDate><atom:link href="https://tomroth.dev/tags/neural-networks/index.xml" rel="self" type="application/rss+xml"/><item><title>Backprop and topological sorting</title><link>https://tomroth.dev/backprop-toposort/</link><pubDate>Sun, 01 Dec 2019 00:00:00 +0000</pubDate><guid>https://tomroth.dev/backprop-toposort/</guid><description>Neural networks need to update their weights with respect to a loss function. Rather than compute these weight updates manually, today we usually use automatic differentiation packages and tools. We call these autodiff systems.
To do their job, autodiff systems construct computational graphs of the function they’re trying to find the gradient of. These computational graphs are key to backpropagation. I won’t go into how these graphs are constructed here.</description></item></channel></rss>