@zetalyrae Don't you feel like internet/social media can be described in exactly the same way? While it may feel sad, this comes with the territory and could be net gain.
@Benthamsbulldog@AlexBores Not publicly, sure, but candidates have enough leverage/tools to let PACs know that this is messaging they are okay with, or in worse case support.
@Benthamsbulldog@AlexBores https://t.co/2ggR4a6R0r
Sure. This is still very bad. And to some limits PACs are able to coordinate with candidates, it would be pretty easy to clarify that this is over the top messaging (Redboxing, b-rolls, references, etc) without FEC rules violation. This is very common.
@Benthamsbulldog@AlexBores https://t.co/k0LdWviWfr
https://t.co/hrnCHJiLS4
Those two ads. While I initially had very good impression of him, those were really over the top.
@lost_nomad__ This is was pretty much overdone in late 2000s with Knausgård tbh, even in movies with stuff like modern remake of «Scenes from the Marriage».
People don’t actually really like it, those things remain pretty niche and elitist (not esoteric/hard to understand, though)
(5/5) On a B200, Blackwell's tensor cores are so fast that the softmax now becomes a bottleneck in addition to the GEMMs. Quantizing PV adds scale-factor overhead that piles onto the softmax warps. So we run NVFP4 QK + BF16 PV, with a careful TMEM overlap schedule to fit scale factors into an already-full pipeline.
Result: 1801 TFLOPS and up to 1.39x over FlashAttention-4.
2x/4x faster exp on B300/Rubin should push this further, and end-to-end FP4 serving, once blocked by attention quality, is now within reach.
@Simon_Vt https://t.co/e6ZYmsUlPU
This sounds like an approach described in Alex Aiken's paper and the previous work on superoptimizers -- this is really cool, but I was always unsure about scalability of this as solvers take a ton of time, especially for JIT compilation.