<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fused Gromov-Wasserstein distance for structured objects: theoretical foundations and mathematical properties · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1811.02834/</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/1811.02834/feed.xml" rel="self" type="application/rss+xml" /><item><title>Fused Gromov-Wasserstein distance for structured objects: theoretical foundations and mathematical properties — mentioned by bionhoward</title><link>https://news.ycombinator.com/item?id=22395703</link><guid isPermaLink="false">urn:hackerpapers:mention:1811.02834:22395703</guid><pubDate>Sun, 23 Feb 2020 08:03:39 GMT</pubDate><description>&lt;p&gt;is the loss you&amp;#x27;re talking about like fused gromov-wasserstein distance? we hit permutation invariance issues like what you&amp;#x27;re talking about in some atomistic simulations because the atoms need to be permutable if you want to use the same model for chemistry as protein folding/docking, and the FGW algo from e.g. https://arxiv.org/pdf/1811.02834.pdf https://tvayer.github.io/materials/Titouan_Marseille_2019.pd... relaxes the invariance issue by adding a feature distance to the euclidean distance. higher order distance matrices are a neat trick, but blow up VRAM past 10-50k atoms, but if you did…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1811.02834/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>stat.ML</category></item></channel></rss>
