<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Dynamic Chunking for End-to-End Hierarchical Sequence Modeling · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2507.07955/</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/2507.07955/feed.xml" rel="self" type="application/rss+xml" /><item><title>Dynamic Chunking for End-to-End Hierarchical Sequence Modeling — mentioned by psb217</title><link>https://news.ycombinator.com/item?id=45666709</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.07955:45666709</guid><pubDate>Wed, 22 Oct 2025 09:34:28 GMT</pubDate><description>&lt;p&gt;Yes, you can get good compression of a long sequence of &amp;quot;base&amp;quot; text tokens into a shorter sequence of &amp;quot;meta&amp;quot; text tokens, where each meta token represents the information from multiple base tokens. But, grouping a fixed number of base tokens into each meta token isn&amp;#x27;t ideal, since that won&amp;#x27;t align neatly with sensible semantic boundaries, like words, phrases, sentences, etc. So, the trick is how decide which base tokens should be grouped into each meta token.... This sort of &amp;quot;dynamic chunking&amp;quot; of low-level information, perhaps down to the level of raw bytes, into shorter sequences of meta…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.07955/"&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>Dynamic Chunking for End-to-End Hierarchical Sequence Modeling — mentioned by cubefox</title><link>https://news.ycombinator.com/item?id=45543052</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.07955:45543052</guid><pubDate>Fri, 10 Oct 2025 19:53:31 GMT</pubDate><description>&lt;p&gt;This sounds a bit like H-Net [1] or Byte Latent Transformer [2]. 1: https://arxiv.org/abs/2507.07955 2: https://arxiv.org/abs/2412.09871&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.07955/"&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>Dynamic Chunking for End-to-End Hierarchical Sequence Modeling — mentioned by spmurrayzzz</title><link>https://news.ycombinator.com/item?id=44723770</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.07955:44723770</guid><pubDate>Tue, 29 Jul 2025 14:24:02 GMT</pubDate><description>&lt;p&gt;Do you have a citation for the paper on that? IME, that&amp;#x27;s not really something you see used in practice, at least not after 2022 or so. Without some form positional adjustment, transformer-based LLMs have no way to differentiate from &amp;quot;The dog bit the man.&amp;quot; and &amp;quot;The man bit the dog.&amp;quot; given the token ids are nearly identical. You just end up back in the bag-of-words problem space. The self-attention mechanism is permutation-invariant, so as long as it remains true that the attention scores are computed as an unordered set, you need some way to model the sequence. Long context is almost always…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.07955/"&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>Dynamic Chunking for End-to-End Hierarchical Sequence Modeling — HN submission</title><link>https://news.ycombinator.com/item?id=44704854</link><guid isPermaLink="false">urn:hackerpapers:submission:2507.07955:44704854</guid><pubDate>Sun, 27 Jul 2025 21:27:53 GMT</pubDate><description>&lt;p&gt;Dynamic Chunking for End-to-End Hierarchical Sequence Modeling&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/2507.07955/"&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>Dynamic Chunking for End-to-End Hierarchical Sequence Modeling — HN submission</title><link>https://news.ycombinator.com/item?id=44665740</link><guid isPermaLink="false">urn:hackerpapers:submission:2507.07955:44665740</guid><pubDate>Thu, 24 Jul 2025 01:01:21 GMT</pubDate><description>&lt;p&gt;Dynamic Chunking for End-to-End Hierarchical Sequence Modeling&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/2507.07955/"&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>Dynamic Chunking for End-to-End Hierarchical Sequence Modeling — mentioned by lukebechtel</title><link>https://news.ycombinator.com/item?id=44575574</link><guid isPermaLink="false">urn:hackerpapers:mention:2507.07955:44575574</guid><pubDate>Tue, 15 Jul 2025 20:38:56 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/pdf/2507.07955 paper&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2507.07955/"&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>Dynamic Chunking for End-to-End Hierarchical Sequence Modeling — HN submission</title><link>https://news.ycombinator.com/item?id=44548021</link><guid isPermaLink="false">urn:hackerpapers:submission:2507.07955:44548021</guid><pubDate>Sun, 13 Jul 2025 06:37:48 GMT</pubDate><description>&lt;p&gt;Dynamic Chunking for End-to-End Hierarchical Sequence Modeling&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;10 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2507.07955/"&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>Dynamic Chunking for End-to-End Hierarchical Sequence Modeling — HN submission</title><link>https://news.ycombinator.com/item?id=44541423</link><guid isPermaLink="false">urn:hackerpapers:submission:2507.07955:44541423</guid><pubDate>Sat, 12 Jul 2025 11:54:21 GMT</pubDate><description>&lt;p&gt;Dynamic Chunking for End-to-End Hierarchical Sequence Modeling&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2507.07955/"&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>Dynamic Chunking for End-to-End Hierarchical Sequence Modeling — HN submission</title><link>https://news.ycombinator.com/item?id=44535552</link><guid isPermaLink="false">urn:hackerpapers:submission:2507.07955:44535552</guid><pubDate>Fri, 11 Jul 2025 18:36:28 GMT</pubDate><description>&lt;p&gt;Dynamic Chunking for End-to-End Hierarchical Sequence Modeling&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;5 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2507.07955/"&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>
