<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Visualizing and Understanding Recurrent Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1506.02078/</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/1506.02078/feed.xml" rel="self" type="application/rss+xml" /><item><title>Visualizing and Understanding Recurrent Networks — mentioned by magoghm</title><link>https://news.ycombinator.com/item?id=39370091</link><guid isPermaLink="false">urn:hackerpapers:mention:1506.02078:39370091</guid><pubDate>Wed, 14 Feb 2024 14:24:52 GMT</pubDate><description>&lt;p&gt;I tried to find the where I heard that Radford was inspired by that blog post, but the closest thing I found is that in the &amp;quot;Sentiment Neuron&amp;quot; paper (Learning to Generate Reviews and Discovering Sentiment: https://arxiv.org/pdf/1704.01444.pdf), in the &amp;quot;Discussion and Future Work&amp;quot; section they mention this Karpathy paper from 2015: Visualizing and Understanding Recurrent Networks https://arxiv.org/abs/1506.02078&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1506.02078/"&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>Visualizing and Understanding Recurrent Networks — mentioned by ninjin</title><link>https://news.ycombinator.com/item?id=25685307</link><guid isPermaLink="false">urn:hackerpapers:mention:1506.02078:25685307</guid><pubDate>Fri, 08 Jan 2021 14:58:31 GMT</pubDate><description>&lt;p&gt;Yikes, you are right… I just linked a private repo. &amp;#x27;^^ I have poked the rest of the group and it seems that at least a tweet was made [1] – but not much else remains. Describing it from memory, we ran ELMo and BERT on Wikipedia and then allowed similarity search between a query and showed heat maps to a matched context. Nothing particularly deep compared to yours that go into the transformer “machinery”, but I think it captures very well how most Question Answering models still operate: Embed query and contexts in a high-dimensional space, compare, find semantically plausible span, and done!…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1506.02078/"&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>Visualizing and Understanding Recurrent Networks — mentioned by veselin</title><link>https://news.ycombinator.com/item?id=20375084</link><guid isPermaLink="false">urn:hackerpapers:mention:1506.02078:20375084</guid><pubDate>Sun, 07 Jul 2019 13:56:43 GMT</pubDate><description>&lt;p&gt;This one is a character level language model. The Microsoft one is per token. This one should be the closest to the Microsoft model: https://miltos.allamanis.com/publicationfiles/allamanis2018l... Btw, simple neural networks are far from doing the best for code. The kind of accuracy LSTM gives is already achieved with good n-gram models. E.g. see this one on a Linux code prediction: https://arxiv.org/pdf/1506.02078.pdf Also, there are other techniques that improve on top of the n-gram models: https://files.sri.inf.ethz.ch/website/papers/charmodel-iclr2...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1506.02078/"&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>Visualizing and Understanding Recurrent Networks — mentioned by fnbr</title><link>https://news.ycombinator.com/item?id=14805364</link><guid isPermaLink="false">urn:hackerpapers:mention:1506.02078:14805364</guid><pubDate>Wed, 19 Jul 2017 16:11:24 GMT</pubDate><description>&lt;p&gt;So, this is definitely good work, and I don&amp;#x27;t have any suggestions on how to do it better, but I&amp;#x27;m ultimately not sure how useful I find it. I have no intuition for what the histograms for `t` should look like, and so seeing the different histograms for ծ vs `not ծ` doesn&amp;#x27;t tell me much except that they&amp;#x27;re different (which is trivially true!). Does anyone else find this sort of visualization useful? Maybe I&amp;#x27;m just misunderstanding this. I would love to develop more of an intuition for neuron activations in deep nets- I want to better understand how they work, as right now, the only thing that…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1506.02078/"&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>Visualizing and Understanding Recurrent Networks — HN submission</title><link>https://news.ycombinator.com/item?id=10857538</link><guid isPermaLink="false">urn:hackerpapers:submission:1506.02078:10857538</guid><pubDate>Thu, 07 Jan 2016 12:31:16 GMT</pubDate><description>&lt;p&gt;Visualizing and understanding recurrent networks&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1506.02078/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Visualizing and Understanding Recurrent Networks — HN submission</title><link>https://news.ycombinator.com/item?id=9689511</link><guid isPermaLink="false">urn:hackerpapers:submission:1506.02078:9689511</guid><pubDate>Wed, 10 Jun 2015 01:12:39 GMT</pubDate><description>&lt;p&gt;Visualizing and Understanding Recurrent Networks&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1506.02078/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
