<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: at2005</title><link>https://news.ycombinator.com/user?id=at2005</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Wed, 08 Jul 2026 03:49:37 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=at2005" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[Matrix Orthogonalization Improves Memory in Recurrent Models]]></title><description><![CDATA[
<p>Article URL: <a href="https://ayushtambde.com/blog/matrix-orthogonalization-improves-memory-in-recurrent-models/">https://ayushtambde.com/blog/matrix-orthogonalization-improves-memory-in-recurrent-models/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48742514">https://news.ycombinator.com/item?id=48742514</a></p>
<p>Points: 85</p>
<p># Comments: 32</p>
]]></description><pubDate>Wed, 01 Jul 2026 05:13:22 +0000</pubDate><link>https://ayushtambde.com/blog/matrix-orthogonalization-improves-memory-in-recurrent-models/</link><dc:creator>at2005</dc:creator><comments>https://news.ycombinator.com/item?id=48742514</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48742514</guid></item><item><title><![CDATA[New comment by at2005 in "Tree Search Distillation for Language Models Using PPO"]]></title><description><![CDATA[
<p>I didn't compare with the harness (focused on distillation) but the original ToT paper has a section on it: <a href="https://arxiv.org/abs/2305.10601" rel="nofollow">https://arxiv.org/abs/2305.10601</a></p>
]]></description><pubDate>Mon, 16 Mar 2026 21:47:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=47405396</link><dc:creator>at2005</dc:creator><comments>https://news.ycombinator.com/item?id=47405396</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47405396</guid></item><item><title><![CDATA[New comment by at2005 in "Tree Search Distillation for Language Models Using PPO"]]></title><description><![CDATA[
<p>Ah, I meant that MCTS uses more inference-time compute (over GRPO) to <i>produce</i> a training sample</p>
]]></description><pubDate>Sun, 15 Mar 2026 06:50:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=47384918</link><dc:creator>at2005</dc:creator><comments>https://news.ycombinator.com/item?id=47384918</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47384918</guid></item><item><title><![CDATA[Tree Search Distillation for Language Models Using PPO]]></title><description><![CDATA[
<p>Article URL: <a href="https://ayushtambde.com/blog/tree-search-distillation-for-language-models-using-ppo/">https://ayushtambde.com/blog/tree-search-distillation-for-language-models-using-ppo/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=47383059">https://news.ycombinator.com/item?id=47383059</a></p>
<p>Points: 87</p>
<p># Comments: 10</p>
]]></description><pubDate>Sun, 15 Mar 2026 00:51:55 +0000</pubDate><link>https://ayushtambde.com/blog/tree-search-distillation-for-language-models-using-ppo/</link><dc:creator>at2005</dc:creator><comments>https://news.ycombinator.com/item?id=47383059</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47383059</guid></item><item><title><![CDATA[New comment by at2005 in "A HL Programming Language for Quantum Computers"]]></title><description><![CDATA[
<p>Btw the whole motivation for this were algorithms like Grover's, which need "oracles" to be specified. You can only imagine trying to code adders and greater-than circuits with QASM...</p>
]]></description><pubDate>Tue, 23 Feb 2021 19:34:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=26241776</link><dc:creator>at2005</dc:creator><comments>https://news.ycombinator.com/item?id=26241776</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=26241776</guid></item><item><title><![CDATA[A HL Programming Language for Quantum Computers]]></title><description><![CDATA[
<p>Hi,
I've designed and implemented a higher-level programming language for quantum computers. It essentially makes creating classical oracles for use in quantum circuits much easier, by defining C-style arithmetic/logical operations on qregs and having a compiler pass to estimate qubit counts prior to compilation, which, btw compiles to QASM for use on IBM systems. Does this seem interesting to people? Would anyone like to learn more about it?</p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=26241699">https://news.ycombinator.com/item?id=26241699</a></p>
<p>Points: 1</p>
<p># Comments: 1</p>
]]></description><pubDate>Tue, 23 Feb 2021 19:29:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=26241699</link><dc:creator>at2005</dc:creator><comments>https://news.ycombinator.com/item?id=26241699</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=26241699</guid></item></channel></rss>