<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Classical Planning in Deep Latent Space: Bridging the Subsymbolic-Symbolic Boundary · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1705.00154/</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/1705.00154/feed.xml" rel="self" type="application/rss+xml" /><item><title>Classical Planning in Deep Latent Space: Bridging the Subsymbolic-Symbolic Boundary — mentioned by guicho271828</title><link>https://news.ycombinator.com/item?id=19906900</link><guid isPermaLink="false">urn:hackerpapers:mention:1705.00154:19906900</guid><pubDate>Tue, 14 May 2019 05:02:10 GMT</pubDate><description>&lt;p&gt;Author here. IBM is currently focusing on the combination of machine learning and reasoning, also called neural-symbolic AI [1], to combine the best of both worlds (noise robustness and explainability, etc.). I am from Tokyo and will join MIT-IBM lab soon to perform this line of research. I have been working on Latplan [AAAI-2018, 2,3,4,5,6], a neural-symbolic classical planning system that learns symbolic representations of noisy images and perform efficient symbolic planning in the latent space. Later, several other groups have started working in this field, like [7]. The problem with…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1705.00154/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Classical Planning in Deep Latent Space: Bridging the Subsymbolic-Symbolic Boundary — mentioned by ilovewhiskey</title><link>https://news.ycombinator.com/item?id=17660268</link><guid isPermaLink="false">urn:hackerpapers:mention:1705.00154:17660268</guid><pubDate>Wed, 01 Aug 2018 07:06:50 GMT</pubDate><description>&lt;p&gt;This approach is very similar to a AAAI18 paper [1] that also finds a binary representation (&amp;quot;plannable representation&amp;quot;) using VAEs and performs planning algorithms, but the difference is that they included some experiments for continuous abstract states. I personally prefer VAEs because GANs are hard to train. [1] arxiv.org/abs/1705.00154&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1705.00154/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
