<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Faster Policy Learning with Continuous-Time Gradients · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2012.06684/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2012.06684/feed.xml" rel="self" type="application/rss+xml" /><item><title>Faster Policy Learning with Continuous-Time Gradients — mentioned by ChrisRackauckas</title><link>https://news.ycombinator.com/item?id=32771842</link><guid isPermaLink="false">urn:hackerpapers:mention:2012.06684:32771842</guid><pubDate>Thu, 08 Sep 2022 20:45:57 GMT</pubDate><description>&lt;p&gt;The only ones that I know of are in https://arxiv.org/abs/2012.06684 (with Julia DifferentialEquations.jl and DiffTaichi), but those are more algorithmic. There, Julia does extremely well, but the conclusion that I would draw from it is more: use a programming language with robust and differentiable differential equation solvers rather than writing simple Euler loops by hand (as this article does).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2012.06684/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Faster Policy Learning with Continuous-Time Gradients — mentioned by klowrey</title><link>https://news.ycombinator.com/item?id=29406235</link><guid isPermaLink="false">urn:hackerpapers:mention:2012.06684:29406235</guid><pubDate>Wed, 01 Dec 2021 17:10:49 GMT</pubDate><description>&lt;p&gt;I manage the MuJoCo.jl wrapper, and having the source code wont (naively) help with AD. Internally, there&amp;#x27;s a number of iterative algorithms that you wouldn&amp;#x27;t want to automatically differentiate, and if analytical derivatives were apparent they would be in there (the MuJoCo creator was my advisor). As it stands, finite differencing is the best way to extract derivative/gradient information from the underlying physics model of MuJoCo, and is the suggested method. We had a paper that included MuJoCo (with custom defined adjoints) within Julia&amp;#x27;s DiffEq framework to learn continuous control…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2012.06684/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Faster Policy Learning with Continuous-Time Gradients — mentioned by ChrisRackauckas</title><link>https://news.ycombinator.com/item?id=29402658</link><guid isPermaLink="false">urn:hackerpapers:mention:2012.06684:29402658</guid><pubDate>Wed, 01 Dec 2021 11:08:21 GMT</pubDate><description>&lt;p&gt;&amp;gt;One of the domains where I hope Julia will excel is precisely as you comment on physics + ml (I check frequently if MuJoCo source code is available at last). Somebody already did a comparison of DifferentialEquations.jl&amp;#x27;s standard usage against MuJoCo and DiffTaichi and showed that it outperformed them by about 5x-10x. https://arxiv.org/abs/2012.06684 https://homes.cs.washington.edu/~thickstn/ctpg-project-page/... That&amp;#x27;s all showing the raw iteration count to show that it algorithmically is faster, but the time per iteration is also fast for many reasons showcased in the SciMLBenchmarks…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2012.06684/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
