Viewing profile — marcelroed
marcelroed
HN member- Joined
- Thu, Mar 02, 2023, 5:18 PM UTC
- HN karma
- 138
- Public activity
- 21 items
- HN profile
- View on Hacker News ↗
About marcelroed
Recent public activity
-
comment
Comment #49030900
Yes! I will publish a Rust crate soon. If you have thoughts about how to structure the API I would love to hear them.
-
comment
Comment #49017356
The output tokens are identical in either case, but there are quite a few additional settings and formats that huggingface compat mode can generate. In general it also requires inp…
-
comment
Comment #49016624
Thanks for the kind words, Craig! I'm planning to do a technical writeup+paper and a presentation video on the project in the near future. Will make sure to share it with the Disco…
-
comment
Comment #49015028
Added numbers here: https://news.ycombinator.com/item?id=49015014
-
comment
Comment #49015014
Author here: Actually, depending on the nature of the inference you're doing it can be quite significant. Here are some numbers for time-to-first-token (time to process the entire …
-
comment
Comment #49014640
Running the numbers now
-
comment
Comment #49013747
It's usually not as binary as "hit" or "miss" with a prefix cache, and you need to know the token boundaries to know where the cache hit ends. The current structures used for KV-ca…
-
comment
Comment #49013327
Time to first token refers to the time until the model outputs one token, which includes the time to process the entire prompt (doing prefill). The GPU time per token is much lower…
- comment
-
comment
Comment #49011741
I can add some benchmarks for compatibility mode in the future. I have a little more juice to squeeze out of the Python interop though, so not quite ready for it yet.
-
comment
Comment #49011719
Numbers are for the Gigatoken API, but compatibility mode just means eating a bunch of Python overhead (creating lists, reading strings to bytes). You can expect a modest ~200-300x…
-
comment
Comment #49011648
You can, but this usually results in sequences with padding/truncation, since you won't know how many tokens your inputs map to before you actually tokenize them. This also makes s…
-
comment
Comment #49011028
Author here! In my case it's mostly pretraining experiments, where you might want to change your data mixture/filtering/processing of training data, and splits are usually done at …
-
comment
Comment #48364566
We have autograding for code through tests written by hand, and additionally do manual code audits if we see suspicious behavior. We also do grading the old-fashioned way for write…
-
comment
Comment #48361507
TA here. Noted! I now have more resources to test more environments, and will do so whenever possible. I think freezing due to memory overuse is going to be a problem with anything…
-
comment
Comment #48360275
We do provide resources for enrolled students. The online suggestions are for external students or Stanford students who we weren't able to admit.
-
comment
Comment #48360261
TA here. Biggest changes are in the second assignment (distributed) where we added a bunch of memory, profiling and distributed tasks, as well as in the fifth assignment (alignment…
-
comment
Comment #48360097
TA here. Definitely not! In fact we explicitly added sections in the first assignment to allow for scaling down to even local compute (M-series GPUs). For assignment 2 there are a …
-
comment
Comment #44681525
I am only familiar with MLIR for accelerator-specific compilation, but my understanding is that by describing operations at a higher level, you don’t need the frontend to know what…
-
comment
Comment #44238330
After trying this out on my iphone, I can say your conclusion is exactly correct. The icons look subtly out of focus in a way that's quite unsettling.
-
comment
Comment #40582278
It’s worth noting that Shreyas (the first author) was a student with Tenenbaum at MIT before he went to Berkeley