<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hamiltonian Graph Networks with ODE Integrators · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1909.12790/</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/1909.12790/feed.xml" rel="self" type="application/rss+xml" /><item><title>Hamiltonian Graph Networks with ODE Integrators — mentioned by shoyer</title><link>https://news.ycombinator.com/item?id=21365587</link><guid isPermaLink="false">urn:hackerpapers:mention:1909.12790:21365587</guid><pubDate>Sat, 26 Oct 2019 19:14:20 GMT</pubDate><description>&lt;p&gt;Agreed, this paper did not show any meaningful generalization and is sorely short on baselines. If you wanted to train a neural network model that would generalize, you would need build in physical constraints into the model architecture. For example, dynamics are governed by a Hamiltonian based on pairwise interactions, which should be integrated as an ODE. A nice recent example of this from folks at DeepMind is this paper “Hamiltonian Graph Networks with ODE Integrators”: https://arxiv.org/abs/1909.12790. That said, if you go down this road too far you may find that you are just learning an…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1909.12790/"&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>
