{"href":"https://api.simplecast.com/oembed?url=https%3A%2F%2Fpytorch-dev-podcast.simplecast.com%2Fepisodes%2Fmin-cut-partitioner-MvcSsUpR","width":444,"version":"1.0","type":"rich","title":"Min-cut partitioner","thumbnail_width":300,"thumbnail_url":"https://image.simplecastcdn.com/images/8cefde76-fb46-406a-8d87-ab0df67f3423/92f11400-2dad-49b4-8b14-cce35f5ab765/pytorch-symbol-02-orangeondark.jpg","thumbnail_height":300,"provider_url":"https://simplecast.com","provider_name":"Simplecast","html":"<iframe src=\"https://player.simplecast.com/d2733990-9661-4f01-b618-73278e4757fc\" height=\"200\" width=\"100%\" title=\"Min-cut partitioner\" frameborder=\"0\" scrolling=\"no\"></iframe>","height":200,"description":"The min-cut partitioner makes decisions about what to save for backwards when splitting the forward and backwards graph from the joint graph traced by AOTAutograd. Crucially, it doesn't actually do a \"split\"; instead, it is deciding how much of the joint graph should be used for backwards. I also talk about the backward retracing problem."}