<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: jbarrow</title><link>https://news.ycombinator.com/user?id=jbarrow</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sat, 07 Nov 2026 18:11:15 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=jbarrow" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by jbarrow in "Why Is Speculative Decoding Fast?"]]></title><description><![CDATA[
<p>This is my post! Happy to answer any follow-up questions people have.<p>I wrote this to try and clear up what I think is a common misconception (speculative decoding is a free lunch), when the picture is more nuanced (and imo, interesting).</p>
]]></description><pubDate>Tue, 20 Oct 2026 16:11:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=50168549</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=50168549</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50168549</guid></item><item><title><![CDATA[DeltaNet Explained (Part 1)]]></title><description><![CDATA[
<p>Article URL: <a href="https://sustcsonglin.github.io/blog/2024/deltanet-1/">https://sustcsonglin.github.io/blog/2024/deltanet-1/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=49483231">https://news.ycombinator.com/item?id=49483231</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 28 Aug 2026 19:34:15 +0000</pubDate><link>https://sustcsonglin.github.io/blog/2024/deltanet-1/</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=49483231</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49483231</guid></item><item><title><![CDATA[Show HN: Locus-v1, a dataset of 2.2M local laws and ordinances]]></title><description><![CDATA[
<p>Wrote a paper (<a href="https://arxiv.org/abs/2606.19334" rel="nofollow">https://arxiv.org/abs/2606.19334</a>) on how we collected and built the dataset. Just covers the United States.<p>Happy to answer any questions!</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48658847">https://news.ycombinator.com/item?id=48658847</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Wed, 24 Jun 2026 12:43:33 +0000</pubDate><link>https://huggingface.co/datasets/LocalLaws/LOCUS-v1</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=48658847</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48658847</guid></item><item><title><![CDATA[New comment by jbarrow in "Unlimited OCR: One-shot long-horizon parsing"]]></title><description><![CDATA[
<p>I'm always glad to see more multi-page work in VLM-based OCR. Especially single-pass. One of the few other multi-page papers from recently, MinerU-Popo, treats fixing up multi-page outputs as a post-processing correction step (<a href="https://arxiv.org/abs/2605.24973" rel="nofollow">https://arxiv.org/abs/2605.24973</a>). Interesting to see the drop-off in quality as you up page count, though.<p>I also think the attention approach (always attend to the image/prefix, with a sliding window for local context) is neat!<p>I do wish they updated their comparison table to include more recent work (that scores marginally better on OmniDocBench), like dots.mocr.</p>
]]></description><pubDate>Wed, 24 Jun 2026 02:33:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=48654438</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=48654438</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48654438</guid></item><item><title><![CDATA[New comment by jbarrow in "Gemma 4 QAT models: Optimizing compression for mobile and laptop efficiency"]]></title><description><![CDATA[
<p>Very impressed with how much the Gemma ecosystem has advanced just this week.<p>Gemma 12B, multitoken prediction, and official quants released. Feels like Google is putting real effort into this string of releases, and I'm very excited to see that!</p>
]]></description><pubDate>Fri, 05 Jun 2026 20:42:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=48417969</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=48417969</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48417969</guid></item><item><title><![CDATA[Building a 1-Outlet, 4-GPU Workstation]]></title><description><![CDATA[
<p>Article URL: <a href="https://jbarrow.ai/2026-05-18-gpu-workstation/">https://jbarrow.ai/2026-05-18-gpu-workstation/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48179263">https://news.ycombinator.com/item?id=48179263</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 18 May 2026 13:06:35 +0000</pubDate><link>https://jbarrow.ai/2026-05-18-gpu-workstation/</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=48179263</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48179263</guid></item><item><title><![CDATA[Agents Have (Information) Needs]]></title><description><![CDATA[
<p>Article URL: <a href="https://jbarrow.ai/2026-05-13-agentic-information-need/">https://jbarrow.ai/2026-05-13-agentic-information-need/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48149368">https://news.ycombinator.com/item?id=48149368</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Fri, 15 May 2026 14:47:05 +0000</pubDate><link>https://jbarrow.ai/2026-05-13-agentic-information-need/</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=48149368</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48149368</guid></item><item><title><![CDATA[New comment by jbarrow in "LFM2.5-350M: No Size Left Behind"]]></title><description><![CDATA[
<p>Very cool to see a company pushing what's possible with (relatively) tiny models! A 350M parameter trained on 28T tokens that, from the benchmarks, is competitive with Qwen3.5-0.8B.<p>Comparing the architecture to Qwen3.5, it seems:<p>- fewer, wider layers<p>- mixing full attention and conv's, instead of the full+linear attention of Qwen3.5<p>- the vocab is about 1/4 the size</p>
]]></description><pubDate>Wed, 01 Apr 2026 02:31:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=47596074</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=47596074</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47596074</guid></item><item><title><![CDATA[LFM2.5-350M: No Size Left Behind]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.liquid.ai/blog/lfm2-5-350m-no-size-left-behind">https://www.liquid.ai/blog/lfm2-5-350m-no-size-left-behind</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47596047">https://news.ycombinator.com/item?id=47596047</a></p>
<p>Points: 3</p>
<p># Comments: 1</p>
]]></description><pubDate>Wed, 01 Apr 2026 02:26:32 +0000</pubDate><link>https://www.liquid.ai/blog/lfm2-5-350m-no-size-left-behind</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=47596047</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47596047</guid></item><item><title><![CDATA[New comment by jbarrow in "What every computer scientist should know about floating-point arithmetic (1991) [pdf]"]]></title><description><![CDATA[
<p>Shared this because I was having fun thinking through floating point numbers the other day.<p>I worked through what fp6 (e3m2) would look like, doing manual additions and multiplications, showing cases where the operations are non-associative, etc. and then I wanted something more rigorous to read.<p>For anyone interested in floating point numbers, I highly recommend working through fp6 as an activity! Felt like I truly came away with a much deeper understanding of floats. Anything less than fp6 felt too simple/constrained, and anything more than fp6 felt like too much to write out by hand. For fp6 you can enumerate all 64 possible values on a small sheet of paper.<p>For anyone not (yet) interested in floating point numbers, I’d still recommend giving it a shot.</p>
]]></description><pubDate>Mon, 16 Mar 2026 14:55:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=47399874</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=47399874</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47399874</guid></item><item><title><![CDATA[What every computer scientist should know about floating-point arithmetic (1991) [pdf]]]></title><description><![CDATA[
<p>Article URL: <a href="https://www.itu.dk/~sestoft/bachelor/IEEE754_article.pdf">https://www.itu.dk/~sestoft/bachelor/IEEE754_article.pdf</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47343902">https://news.ycombinator.com/item?id=47343902</a></p>
<p>Points: 125</p>
<p># Comments: 56</p>
]]></description><pubDate>Wed, 11 Mar 2026 23:24:22 +0000</pubDate><link>https://www.itu.dk/~sestoft/bachelor/IEEE754_article.pdf</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=47343902</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47343902</guid></item><item><title><![CDATA[New comment by jbarrow in "Don't post generated/AI-edited comments. HN is for conversation between humans"]]></title><description><![CDATA[
<p>I've been noticing a _lot_ more AI-generated/edited content of late, both comments and stories. It's gotten to the point that I spend a lot less time on HN than I used to, and if it continues to get worse I expect I'll quit altogether.<p>At the end of the day, I'm here because of all the thoughtful commenters and people sharing interesting stories.</p>
]]></description><pubDate>Wed, 11 Mar 2026 22:34:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=47343218</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=47343218</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47343218</guid></item><item><title><![CDATA[New comment by jbarrow in "Thank HN: You helped save 33k lives"]]></title><description><![CDATA[
<p>Watsi is incredibly inspiring!<p>I’ve been a monthly donor since ~the beginning when I was just an undergraduate, and I still read the stories and emails I receive. I’m glad that you opted for the steady growth path, and that you’ve made it a sustainable thing.</p>
]]></description><pubDate>Tue, 17 Feb 2026 23:05:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=47054721</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=47054721</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47054721</guid></item><item><title><![CDATA[New comment by jbarrow in "Nano-vLLM: How a vLLM-style inference engine works"]]></title><description><![CDATA[
<p>The whole thing feels AI written, generated from the codebase.*<p>*this is incorrect per the author’s response, my apologies.<p>For instance, it goes into (nano)vLLM internals and doesn’t mention PagedAttention once (one of the core ideas that vLLM is based on)[1].<p>Also mentions that Part 2 will cover dense vs MoE’s, which is weird because nanovllm hardcodes a dense Qwen3 into the source.<p>Here are better (imo) explainers about how vLLM works:<p>- <a href="https://hamzaelshafie.bearblog.dev/paged-attention-from-first-principles-a-view-inside-vllm/" rel="nofollow">https://hamzaelshafie.bearblog.dev/paged-attention-from-firs...</a><p>- <a href="https://www.aleksagordic.com/blog/vllm" rel="nofollow">https://www.aleksagordic.com/blog/vllm</a><p>- <a href="https://huggingface.co/blog/continuous_batching" rel="nofollow">https://huggingface.co/blog/continuous_batching</a><p>Aleksa’s blog is a bit in the weeds for my taste but it’s really worth working through.<p>A lot of the magic of vLLM happens in the PagedAttention kernels, which are really succinctly implanted in nanovllm. And the codebase is great and readable by itself!<p>—<p>1. <a href="https://arxiv.org/abs/2309.06180" rel="nofollow">https://arxiv.org/abs/2309.06180</a></p>
]]></description><pubDate>Mon, 02 Feb 2026 14:18:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=46856317</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=46856317</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46856317</guid></item><item><title><![CDATA[New comment by jbarrow in "Show HN: Browser-based PDF form fields detection (YOLO-based)"]]></title><description><![CDATA[
<p>Super interesting. Would you be willing to try the Python package (<a href="https://github.com/jbarrow/commonforms" rel="nofollow">https://github.com/jbarrow/commonforms</a>) or share the PDFs?<p>For the non-ONNX models there are some inference tricks that generally improve performance, and potentially lowering confidence could help.</p>
]]></description><pubDate>Mon, 20 Oct 2025 15:18:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=45644936</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=45644936</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45644936</guid></item><item><title><![CDATA[New comment by jbarrow in "Show HN: Browser-based PDF form fields detection (YOLO-based)"]]></title><description><![CDATA[
<p>Hey, Benjamin, thanks for the attribution! Happy to field any questions HN users have.<p>It's really gratifying to see people building on the work, and I love that it's possible to do browser-side/on-device.</p>
]]></description><pubDate>Sun, 19 Oct 2025 16:39:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=45635580</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=45635580</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45635580</guid></item><item><title><![CDATA[New comment by jbarrow in "Ask HN: What are you working on? (October 2025)"]]></title><description><![CDATA[
<p>Woah, did not realize that, haha. Let me know if it works well!</p>
]]></description><pubDate>Tue, 14 Oct 2025 00:25:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=45574847</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=45574847</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45574847</guid></item><item><title><![CDATA[New comment by jbarrow in "Ask HN: What are you working on? (October 2025)"]]></title><description><![CDATA[
<p>Training ML models for PDF forms. You can try out what I’ve got so far with this service that automatically detects where fields should go and makes PDFs fillable: <a href="https://detect.semanticdocs.org/" rel="nofollow">https://detect.semanticdocs.org/</a>
Code and models are at: <a href="https://github.com/jbarrow/commonforms" rel="nofollow">https://github.com/jbarrow/commonforms</a><p>That’s built on a dataset and paper I wrote called CommonForms, where I scraped CommonCrawl for hundreds of thousands of fillable form pages and used that as a training set:<p><a href="https://arxiv.org/abs/2509.16506" rel="nofollow">https://arxiv.org/abs/2509.16506</a><p>Next step is training and releasing some DETRs, which I think will drive quality even higher. But the ultimate end goal is working on automatic form accessibility.</p>
]]></description><pubDate>Mon, 13 Oct 2025 10:40:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=45566892</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=45566892</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45566892</guid></item><item><title><![CDATA[New comment by jbarrow in "Show HN: CommonForms – open models to auto-detect PDF form fields"]]></title><description><![CDATA[
<p>Existing “auto-fillable” tools are pretty lackluster in my experience. CommonForms is tooling that can automatically detect form fields in PDFs and turn those PDFs into fillable documents. The dataset is ~500k form pages pulled from Common Crawl, which I trained the object detectors on. For being vision only, the results are pretty remarkable!<p>Releasing the dataset, paper, models, and (imo most importantly) simple/convenient tooling to automatically prepare any PDF.<p>Links: Repo: <a href="https://github.com/jbarrow/commonforms" rel="nofollow">https://github.com/jbarrow/commonforms</a> - Paper: <a href="https://arxiv.org/abs/2509.16506" rel="nofollow">https://arxiv.org/abs/2509.16506</a></p>
]]></description><pubDate>Thu, 02 Oct 2025 14:31:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=45450138</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=45450138</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45450138</guid></item><item><title><![CDATA[Show HN: CommonForms – open models to auto-detect PDF form fields]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/jbarrow/commonforms">https://github.com/jbarrow/commonforms</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45450135">https://news.ycombinator.com/item?id=45450135</a></p>
<p>Points: 1</p>
<p># Comments: 1</p>
]]></description><pubDate>Thu, 02 Oct 2025 14:31:49 +0000</pubDate><link>https://github.com/jbarrow/commonforms</link><dc:creator>jbarrow</dc:creator><comments>https://news.ycombinator.com/item?id=45450135</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45450135</guid></item></channel></rss>