\relax 
\providecommand\hyper@newdestlabel[2]{}
\providecommand\HyField@AuxAddToFields[1]{}
\providecommand\HyField@AuxAddToCoFields[2]{}
\@writefile{toc}{\contentsline {section}{\numberline {1}The Big Picture: Two Networks Playing a Game}{1}{section.1}\protected@file@percent }
\newlabel{sec:overview}{{1}{1}{The Big Picture: Two Networks Playing a Game}{section.1}{}}
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces The parts of a GAN. Nine are reused from earlier in the course; three are new.}}{2}{table.1}\protected@file@percent }
\newlabel{tab:parts}{{1}{2}{The parts of a GAN. Nine are reused from earlier in the course; three are new}{table.1}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.1}Why a Third Approach?}{2}{subsection.1.1}\protected@file@percent }
\newlabel{sec:why}{{1.1}{2}{Why a Third Approach?}{subsection.1.1}{}}
\@writefile{toc}{\contentsline {section}{\numberline {2}The Generator: the VAE's Decoder, Without the Encoder}{3}{section.2}\protected@file@percent }
\newlabel{sec:generator}{{2}{3}{The Generator: the VAE's Decoder, Without the Encoder}{section.2}{}}
\@writefile{toc}{\contentsline {section}{\numberline {3}The Discriminator: a Classifier You Have Already Built}{3}{section.3}\protected@file@percent }
\newlabel{sec:disc}{{3}{3}{The Discriminator: a Classifier You Have Already Built}{section.3}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces The two networks (HW5 sizes; five of each 64-unit layer drawn). Both are Week~9 MLPs, with three details worth noticing: $G$'s output layer has no activation, because it outputs a data point; $D$'s last layer followed by a sigmoid is exactly a logistic regression, applied to features the earlier layers learned; and both use LeakyReLU, which keeps gradients flowing for negative inputs.}}{4}{figure.1}\protected@file@percent }
\newlabel{fig:gan-arch}{{1}{4}{The two networks (HW5 sizes; five of each 64-unit layer drawn). Both are Week~9 MLPs, with three details worth noticing: $G$'s output layer has no activation, because it outputs a data point; $D$'s last layer followed by a sigmoid is exactly a logistic regression, applied to features the earlier layers learned; and both use LeakyReLU, which keeps gradients flowing for negative inputs}{figure.1}{}}
\newlabel{eq:dloss}{{1}{4}{The Discriminator: a Classifier You Have Already Built}{equation.1}{}}
\newlabel{eq:minimax}{{2}{4}{The Discriminator: a Classifier You Have Already Built}{equation.2}{}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}The best possible detective}{4}{subsection.3.1}\protected@file@percent }
\newlabel{sec:dstar}{{3.1}{4}{The best possible detective}{subsection.3.1}{}}
\newlabel{eq:optimalD}{{3}{4}{The best possible detective}{equation.3}{}}
\@writefile{toc}{\contentsline {section}{\numberline {4}What the Generator Is Really Minimizing}{5}{section.4}\protected@file@percent }
\newlabel{sec:jsd}{{4}{5}{What the Generator Is Really Minimizing}{section.4}{}}
\newlabel{eq:jsd}{{4}{5}{What the Generator Is Really Minimizing}{equation.4}{}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Training: Two Networks, Alternating Steps}{6}{section.5}\protected@file@percent }
\newlabel{sec:training}{{5}{6}{Training: Two Networks, Alternating Steps}{section.5}{}}
\@writefile{toc}{\contentsline {section}{\numberline {6}The Non-Saturating Generator Loss}{6}{section.6}\protected@file@percent }
\newlabel{sec:nonsat}{{6}{6}{The Non-Saturating Generator Loss}{section.6}{}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces The GAN at a glance. In each step one network learns and the other is \emph  {frozen} (dashed gray). \textbf  {(a)} $D$ learns to label real points 1 and fakes 0; the fakes are detached, so nothing flows back into $G$. \textbf  {(b)} $G$ learns to make $D$ output ``real'' for its fakes; the gradient passes through $D$'s layers (without changing them) into $G$. \textbf  {(c)} After training, $D$ is discarded and $G$ alone generates.}}{7}{figure.2}\protected@file@percent }
\newlabel{fig:gan-pipeline}{{2}{7}{The GAN at a glance. In each step one network learns and the other is \emph {frozen} (dashed gray). \textbf {(a)} $D$ learns to label real points 1 and fakes 0; the fakes are detached, so nothing flows back into $G$. \textbf {(b)} $G$ learns to make $D$ output ``real'' for its fakes; the gradient passes through $D$'s layers (without changing them) into $G$. \textbf {(c)} After training, $D$ is discarded and $G$ alone generates}{figure.2}{}}
\@writefile{toc}{\contentsline {section}{\numberline {7}Common Failure Modes}{8}{section.7}\protected@file@percent }
\newlabel{sec:failure}{{7}{8}{Common Failure Modes}{section.7}{}}
\@writefile{toc}{\contentsline {section}{\numberline {8}Demo: A Full 1-D GAN}{9}{section.8}\protected@file@percent }
\newlabel{sec:demo}{{8}{9}{Demo: A Full 1-D GAN}{section.8}{}}
\@writefile{toc}{\contentsline {section}{\numberline {9}Three Ways to Build a Generative Model}{9}{section.9}\protected@file@percent }
\newlabel{sec:three-ways}{{9}{9}{Three Ways to Build a Generative Model}{section.9}{}}
\@writefile{toc}{\contentsline {section}{\numberline {10}HW5 Problem 4: Map and Implementation Notes}{9}{section.10}\protected@file@percent }
\newlabel{sec:hw5}{{10}{9}{HW5 Problem 4: Map and Implementation Notes}{section.10}{}}
\gdef \@abspage@last{10}