<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: ansk</title><link>https://news.ycombinator.com/user?id=ansk</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Fri, 30 Oct 2026 10:14:45 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=ansk" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by ansk in "Qwenputer: A functioning, deterministic RISC-V CPU inside Qwen3.5"]]></title><description><![CDATA[
<p>This perspective -- that the burden of proof is on the experts to disprove the slop -- is exactly what I think is unsustainable.</p>
]]></description><pubDate>Thu, 29 Oct 2026 03:39:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=50284295</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=50284295</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50284295</guid></item><item><title><![CDATA[New comment by ansk in "Compute-efficient pretraining and scaling to trillion-parameter models"]]></title><description><![CDATA[
<p>I don't know enough about the specific models they're comparing against to say this definitively, but it looks to me like they're comparing their pre-trained models with others' post-trained models.<p>The metric upon which their 10x claim is based (bits-per-byte) is exactly the metric which is optimized during pre-training.  Post-trained models are fine-tuned to optimize other metrics, which is known to be detrimental to performance on bits-per-byte evaluations.  So bits-per-byte evaluations will always make a pre-trained model look favorable in comparison to a comparable model which has also undergone post-training.<p>Can someone confirm whether the models they are comparing against (DeepSeek V4, Kimi K2, and Nemotron 3 Ultra) have been post-trained?</p>
]]></description><pubDate>Thu, 10 Sep 2026 16:38:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=49646570</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=49646570</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49646570</guid></item><item><title><![CDATA[New comment by ansk in "PyTorch: A Reference Language"]]></title><description><![CDATA[
<p>I can see how LLMs may make compiler development seem futile when it comes to optimizing the local graph structure (ie kernel-sized chunks of the computation).<p>But optimizing the global structure -- things like defining the boundaries between kernels, the lifetimes of allocations (or when/how to reuse buffers), and scheduling/parallelizing operations -- seems inextricably tied to the type of traditional program analysis used by compilers.<p>Even tiling/layout decisions, which you mentioned can be optimized by hand or by an LLM in the context of a single kernel, must be optimized in the broader context of the computation to minimize copies/relayouts between kernels.<p>I think part of the problem is that massive models make the compiler problem much less interesting, since global program optimization reduces to local kernel-level optimization.</p>
]]></description><pubDate>Tue, 28 Jul 2026 17:05:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=49086881</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=49086881</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49086881</guid></item><item><title><![CDATA[New comment by ansk in "PyTorch: A Reference Language"]]></title><description><![CDATA[
<p>This kind of sounds like just giving up on making the compiler better.</p>
]]></description><pubDate>Tue, 28 Jul 2026 06:48:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=49080246</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=49080246</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49080246</guid></item><item><title><![CDATA[New comment by ansk in "DeepSeek pause fundraise after comments on compute gap to US leaked (transcript) [pdf]"]]></title><description><![CDATA[
<p>I skimmed the doc and my impression is that your second listed interpretation -- DeepSeek is pausing investment because of a leak -- is the more correct one.<p>There's quite a bit of confidential information in the doc about the company and how it's positioning itself going forward to compete with US labs.  I'd imagine they're not happy at all with this being leaked and are withholding investment as a punitive measure.<p>Not to mention the other interpretation seems illogical -- why would you pause fundraising if your perception was that you lacked resources compared to your competitors?</p>
]]></description><pubDate>Sun, 26 Jul 2026 02:07:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=49053925</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=49053925</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49053925</guid></item><item><title><![CDATA[New comment by ansk in "Slow breathing modulates brain function and risk behavior"]]></title><description><![CDATA[
<p>I've found breathing exercises to be effective for the duration of the exercise, but I'm more interested in the possibility of training myself to adjust my respiration patterns over sustained durations.  Would it be beneficial -- or even possible at all -- to adjust my body's default/subconscious breathing patterns to match those mentioned in the article?<p>Tangentially related, are there any wearable devices that allow for high resolution respiration monitoring?  I'm imagining some measurement of lung expansion over time (probably at least 10 Hz) so that I can quantify the deepness/shallowness of my breaths as well as the phase of inhalation/exhalation cycles.</p>
]]></description><pubDate>Sun, 21 Jun 2026 00:56:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=48614627</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=48614627</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48614627</guid></item><item><title><![CDATA[New comment by ansk in "Sakana AI's Recursive Self-Improvement (RSI) Lab"]]></title><description><![CDATA[
<p>Kind of a backwards take, both in your interpretation of this announcement and the company in general.<p>The point of this announcement is to draw attention to the fact that the currently hyped topic is what they have been working on since their inception.  If anything, it gives off a Schmidhuber-esque 'actually it was me who invented that' vibe. But trying to retroactively claim credit for the hype is nowhere near the same as following the hype.<p>As for your impression that the company is more generally hype-chasing, I'm really not sure how you would come to that conclusion.  At the time of their founding, chatbots were the hype on the product side and model scaling was the hype on the research side -- topics they have largely eschewed.  They instead were founded with a focus on evolutionary and collective intelligence and have maintained a fairly cohesive research direction ever since.</p>
]]></description><pubDate>Fri, 05 Jun 2026 19:29:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=48417069</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=48417069</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48417069</guid></item><item><title><![CDATA[New comment by ansk in "Software engineering may no longer be a lifetime career"]]></title><description><![CDATA[
<p>I can assure you that a fully deterministic and equally effective claude is possible to build.  And yes, that would mean identical prompts would yield 100% identical output 100% of the time.  It would still  make the occasional logical or factual error, but it would do so deterministically.  Would this solve any of the problems with building reliable programs using LLMs?</p>
]]></description><pubDate>Mon, 11 May 2026 19:22:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=48099484</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=48099484</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48099484</guid></item><item><title><![CDATA[New comment by ansk in "Software engineering may no longer be a lifetime career"]]></title><description><![CDATA[
<p>I see what you're getting at, but determinism isn't the right word either.  LLMs are fundamentally deterministic -- they are pure functions which output text as a function of the input text and the network parameters[1].  Depending on your views on free will, it could be effectively argued that humans are deterministic as well.<p>The concept you're touching on is the idea that LLMs (and humans) are functions which are inscrutable.  Their behavior cannot be distilled into a series of logical steps that you can fit in your head, there are no invariants which neatly decompose their complexity into a few interpretable states, and the input and output spaces are unstructured, ambiguous, underspecified, and essentially infinite.  This makes them just about impossible to reason about or compose using the same strategies and analysis we apply to traditional programs.<p>[1] Optionally, they can take in a source of entropy to add nondeterminism, but this is not essential.  If LLM providers all fixed their prng seeds to a static value, hardly anyone would notice.  I can't imagine there are many workflows which feed an LLM the exact same prompt multiple times and rely on the output having some statistical distribution.  In fact, even if you wanted this you may just end up getting a cached response.</p>
]]></description><pubDate>Mon, 11 May 2026 18:08:12 +0000</pubDate><link>https://news.ycombinator.com/item?id=48098467</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=48098467</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48098467</guid></item><item><title><![CDATA[New comment by ansk in "How Did the FBI Get Nancy Guthrie's Nest Doorbell Footage?"]]></title><description><![CDATA[
<p>The guy writing a thumbnail pipeline isn't getting petabytes (exabytes?) of storage to cache all videos from the past week in their entirety.  If this quantity of data is being stored, it's being stored deliberately and at significant cost.</p>
]]></description><pubDate>Wed, 11 Feb 2026 21:00:05 +0000</pubDate><link>https://news.ycombinator.com/item?id=46980872</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=46980872</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46980872</guid></item><item><title><![CDATA[New comment by ansk in "How Did the FBI Get Nancy Guthrie's Nest Doorbell Footage?"]]></title><description><![CDATA[
<p>The other explanations here don't explain the long delay between the start of the investigation and the release of the footage. 
Yes, storing customer data is what we'd expect from Google and yes, the FBI can coerce Google to provide this data for their investigations.
But it does not take a week for Google to find a file on their servers.<p>My hunch is that Google initially tried to play dumb to avoid compliance, as to not reveal they do in fact retain customer data.
They had a plausible excuse as well -- the owner had no subscription so they don't store the data -- and took a gamble that this explanation would suffice until the situation resolved itself.  
I suspect that authorities initially took Google's excuse at face value, since they parroted this explanation to the public as well.
As pressure mounted on authorities to make some headway on the case, they likely formally exercised whatever legal mechanisms they have at their disposal to force Google's hand, and only then was the footage released.</p>
]]></description><pubDate>Wed, 11 Feb 2026 20:27:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=46980455</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=46980455</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46980455</guid></item><item><title><![CDATA[New comment by ansk in "New YC homepage"]]></title><description><![CDATA[
<p>The implication that OpenAI is a YC company in the same sense as the other listed companies is somewhere between misleading and dishonest.  Even more distasteful to show founding teams for all the others, then just Sam for OpenAI.</p>
]]></description><pubDate>Sat, 24 Jan 2026 00:02:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=46739620</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=46739620</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46739620</guid></item><item><title><![CDATA[New comment by ansk in "Who invented deep residual learning?"]]></title><description><![CDATA[
<p>Of all Schmidhuber's credit-attribution grievances, this is the one I am most sympathetic to.  I think if he spent less time remarking on how other people didn't actually invent things (e.g. Hinton and backprop, LeCun and CNNs, etc.) or making tenuous arguments about how modern techniques are really just instances of some idea he briefly explored decades ago (GANs, attention), and instead just focused on how this single line of research (namely, gradient flow and training dynamics in deep neural networks) laid the foundation for modern deep learning, he'd have a much better reputation and probably a Turing award.  That said, I do respect the extent to which he continues his credit-attribution crusade even to his own reputational detriment.</p>
]]></description><pubDate>Sat, 18 Oct 2025 18:18:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=45629333</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=45629333</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45629333</guid></item><item><title><![CDATA[New comment by ansk in "America’s semiconductor boom [video]"]]></title><description><![CDATA[
<p>I can only imagine what the Taiwanese can do in Arizona. Truly a synergy for the ages.</p>
]]></description><pubDate>Fri, 17 Oct 2025 01:47:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=45612617</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=45612617</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45612617</guid></item><item><title><![CDATA[New comment by ansk in "Depression reduces capacity to learn to actively avoid aversive events"]]></title><description><![CDATA[
<p>My personal experience is that the cost of enduring a negative stimulus is not simply a function of the magnitude of the negative stimulus, but rather the magnitude of the negative stimulus in relation to the magnitude of all other concurrent negative stimuli.  This study controls the environment so that a single negative stimulus is isolated and additional external negative stimuli are minimized, but it cannot control for the fact that a depressed person also endures a constant barrage of negative stimuli which are generated internally (hopelessness, exhaustion, fear, self-doubt, etc).  The magnitude of these internally generated negative stimuli is likely much larger than that of the aversive external stimulus used in this study, so it seems reasonable that the marginal relief obtained by avoiding the external stimulus may be perceived as relatively negligible, or at least diminished to the point that the cost of avoiding is greater than the cost of enduring.</p>
]]></description><pubDate>Wed, 17 Sep 2025 19:35:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=45280430</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=45280430</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45280430</guid></item><item><title><![CDATA[New comment by ansk in "FFmpeg Assembly Language Lessons"]]></title><description><![CDATA[
<p>For future reference, if you want proper python bindings for ffmpeg* you should use pyav.<p>* To be more precise, these are bindings for the libav* libraries that underlie ffmpeg</p>
]]></description><pubDate>Mon, 18 Aug 2025 16:20:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=44942343</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=44942343</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44942343</guid></item><item><title><![CDATA[New comment by ansk in "I should have loved biology too"]]></title><description><![CDATA[
<p>And on the seventh day, God ended His work which He had done and began vibe coding the remainder of the human genome.</p>
]]></description><pubDate>Tue, 22 Apr 2025 18:30:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=43764938</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=43764938</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43764938</guid></item><item><title><![CDATA[New comment by ansk in "Adobe's new image rotation tool is one of the most impressive AI tools seen"]]></title><description><![CDATA[
<p>Key-based attention is not attributable to the Transformer paper.  First paper I can find where keys, queries, and values are distinct matrices is <a href="https://arxiv.org/abs/1703.03906" rel="nofollow">https://arxiv.org/abs/1703.03906</a>, described at the end of section 2.  The authors of the Transformer paper are very clear in how they describe their contribution to the attention formulation, writing "Dot-product attention is identical to our algorithm, except for the scaling factor".  I think it's fair to state that multi-head is the paper's only substantial contribution to the design of attention mechanisms.<p>I think you're overestimating the degree to which this type of research is motivated by big-picture, top-down thinking.  In reality, it's a bunch of empirically-driven, in-the-weeds experiments that guide a very local search in a intractably large search space.  I can just about guarantee the process went something like this:<p>- The authors begin with an architecture similar to the current SOTA, which was a mix of recurrent layers and attention<p>- The authors realize that they can replace some of the recurrent layers with attention layers, and performance is equal or better.  It's also way faster, so they try to replace as many recurrent layers as possible.<p>- They realize that if they remove all the recurrent layers, the model sucks.  They're smart people and they quickly realize this is because the attention-only model is invariant to sequence order.  They add positional encodings to compensate for this.<p>- They keep iterating on the architecture design, incorporating best-practices from the computer vision community such as normalization and residual connections, resulting in the now-famous Transformer block.<p>At no point is any stroke of genius required to get from the prior SOTA to the Transformer.  It's the type of discovery that follows so naturally from an empirically-driven approach to research that it feels all but inevitable.</p>
]]></description><pubDate>Thu, 17 Oct 2024 22:13:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=41874338</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=41874338</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41874338</guid></item><item><title><![CDATA[New comment by ansk in "Adobe's new image rotation tool is one of the most impressive AI tools seen"]]></title><description><![CDATA[
<p>The scientific impact of the transformer paper is large, but in my opinion the novelty is vastly overstated.  The primary novelty is adapting the (already existing) dot-product attention mechanism to be multi-headed.  And frankly, the single-head -> multi-head evolution wasn't particularly novel -- it's the same trick the computer vision community applied to convolutions 5 years earlier, yielding the widely-adopted grouped convolution.  The lasting contribution of the Transformer paper is really just ordering the existing architectural primitives (attention layers, feedforward layers, normalization, residuals) in a nice, reusable block.  In my opinion, the most impactful contributions in the lineage of modern attention-based LLMs are the introduction of dot-product attention (Bahdanau et al, 2015) and the first attention-based sequence-to-sequence model (Graves, 2013).  Both of these are from academic labs.<p>As a side note, a similar phenomenon occurred with the Adam optimizer, where the ratio of public/scientific attribution to novelty is disproportionately large (the Adam optimizer is very minor modification of the RMSProp + momentum optimization algorithm presented in the same Graves, 2013 paper mentioned above)</p>
]]></description><pubDate>Thu, 17 Oct 2024 18:34:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=41872382</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=41872382</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41872382</guid></item><item><title><![CDATA[New comment by ansk in "PyTorch Native Architecture Optimization: Torchao"]]></title><description><![CDATA[
<p>Tensorflow is a lot like IBM -- it deserves praise not because it's great in its current state, but for its contributions towards advancing the broader technological front to where it is today.  Tensorflow walked so JAX could run, so to speak.  Frankly, I don't really draw much of a distinction between the two frameworks since I really just use them as lightweight XLA wrappers.</p>
]]></description><pubDate>Tue, 01 Oct 2024 16:39:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=41710799</link><dc:creator>ansk</dc:creator><comments>https://news.ycombinator.com/item?id=41710799</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41710799</guid></item></channel></rss>