Live data from Hacker News

Viewing profile — miven

miven

HN member
Joined
Tue, Jun 13, 2023, 10:48 AM UTC
HN karma
97
Public activity
34 items

About miven

No profile information was provided.

Recent public activity

  1. comment
    Comment #46544991

    I'm really glad that these HNet-inspired approaches are getting traction, I'm a big fan of that paper. Though I wonder how much of the gains in this case are actually due to 75% ex…

  2. comment
    Comment #45075319

    Correct me if I'm misinterpreting something in your argument but as I see it Matryoshka embeddings just sort the vector bases of the output space roughly by order of their importan…

  3. comment
    Comment #45074274

    The ARC Prize Foundation ran extensive ablations on HRM for their slew of reasoning tasks and noted that the "hierarchical" part of their architecture is not much more impactful th…

  4. comment
    Comment #44576173

    As far as I understand the "chunking" of input bytes is learned completely end to end, so it's basically up to the model to figure out how to most efficiently delineate and aggrega…

  5. comment
  6. comment
    Comment #43596239

    According to [0] it's partly due to a key change they introduced in interleaving layers that use standard RoPE positional encodings and layers using what's called NoPE [1], not enc…

  7. comment
    Comment #43575064

    That's absolutely correct, KV cache is just an optimization trick, you could run the model without it, that's how encoder-only transformers do it. I guess what I'm trying to convey…

  8. comment
    Comment #43574517

    The key and value vectors are cached, that's kind of the whole point of autoregressive transformer models, the "state" not only survives within the KV cache but, in some sense, gro…

  9. comment
    Comment #43574288

    I'm not sure I understand what you're trying to say here, information between tokens is propagated through self-attention, and there's an attention block inside each transformer bl…

  10. comment
    Comment #43013365

    Chain of thought isn't exactly transparent either, you shouldn't fall into the pitfall of believing that the final sequence of tokens thinking about the task is the only processing…

  11. comment
    Comment #42709237

    AFAIK retrieving documents that look like the query is more commonly avoided by using a bi-encoder explicitly trained for retrieval, those generally are conditioned to align embedd…

  12. comment
    Comment #42379443

    In section 2 they briefly mention studies such as [1] that point out that the token outputs of a chain of thought aren't always entirely faithful to the responses of the models I'm…

  13. comment
    Comment #41941192

    I mean, it's no free lunch, you still need to expend significantly more compute for the QLoRA training compared to any usual PTQ method, be it SpinQuant or any other more conventio…

  14. comment
    Comment #41779046

    Is there an intuitive reason why this ends up working this well compared to, say, applying some kind of thresholding to attention activations that are below average for a given hea…

  15. comment
    Comment #41776250

    Residual connections are also worth mentioning as an extremely ubiquitous adaptation, one will be hard-pressed to find a modern architecture that doesn't use those at least to some…

  16. comment
    Comment #40642948

    Yeah, it just got updated, here's the new link, they added sections on block-wise quantization for both the rounding-based and LUT-based approach: https://apple.github.io/coremltoo…

  17. comment
    Comment #40642785

    Huh, generally whenever I saw the lookup table approach in literature it was also referred to as quantization, guess they wanted to disambiguate the two methods Though I'm not sure…

  18. comment
    Comment #40642453

    > For on-device inference, we use low-bit palletization, a critical optimization technique that achieves the necessary memory, power, and performance requirements. Did they go over…

  19. comment
    Comment #40410358

    I don't get your point, how is what you're suggesting here different from a few papers we already have on KV cache pruning methods like [1]? [1] https://arxiv.org/abs/2305.15805

  20. comment
    Comment #40303071

    The authors mention that Jacobi decoding is equivalent to greedy autoregressive decoding, but in practice don't we often want the sampling temperature to be above zero to avoid rep…

  21. comment
    Comment #40085272

    Any guesses as to why they bumped the parameter count up from 7B to 8B?

  22. comment
    Comment #39962719

    What you describe here sounds a little like the line of work centered around Universal Transformers, which basically process the input embeddings through a single transformer block…

  23. comment
    Comment #39954630

    I think the author of this method said it's coming in a month or so

  24. comment
    Comment #38964602

    Correct me if I'm wrong but usually when you do normal token by token inference in a transformer you store calculations made in the previous step in a KV cache so you can reuse it …

  25. comment
    Comment #38959979

    Now that I think about it, doesn't this "technique" triple the amount of compute and memory per generated token since each model needs to also compute and store the KV values for t…