I was a bit surprised by this: > For example, suppose you prompt with a sentence "What is the capital of California: ", it would take ten forward pass iterations to get back the full response of ["S", "a", "c", "r", “a”, "m", "e", "n", "t", "o"] From the content I have been reading trying to understand LLMs, I thought that the output was a token and not a string of chars. What am I missing here?
A number of submissions lately have "simplified" and presented every character as a token. This has only confused many readers. LLMs use a vocabulary of statistically chosen tokens. GPT 3 vocab, for instance, splits Sacramento into three tokens- Sac - 38318 rament - 15141 o - 78 There is a rule of thumb that about every four letters in English text becomes a token but that's just the average. California is a single t…
Continuous batching to increase LLM inference throughput and reduce p50 latency
21–28 of 28 posts
Re: Continuous batching to increase LLM inference throughput and reduce p50 latency
#22Earlier quoted context omitted.
A number of submissions lately have "simplified" and presented every character as a token. This has only confused many readers. LLMs use a vocabulary of statistically chosen tokens. GPT 3 vocab, for instance, splits Sacramento into three tokens- Sac - 38318 rament - 15141 o - 78 There is a rule of thumb that about every four letters in English text becomes a token but that's just the average. California is a single t…
Is that because four letters happen to pack into a word on most architectures or is there some other underlying reason? Also Sac and rament together already form a word so it's kind of logical have the final 'o' as a separate token.
Re: Continuous batching to increase LLM inference throughput and reduce p50 latency
#23Earlier quoted context omitted.
A number of submissions lately have "simplified" and presented every character as a token. This has only confused many readers. LLMs use a vocabulary of statistically chosen tokens. GPT 3 vocab, for instance, splits Sacramento into three tokens- Sac - 38318 rament - 15141 o - 78 There is a rule of thumb that about every four letters in English text becomes a token but that's just the average. California is a single t…
Is that because four letters happen to pack into a word on most architectures or is there some other underlying reason? Also Sac and rament together already form a word so it's kind of logical have the final 'o' as a separate token.
In the case of GPT-3 the vocabulary has a size of 50,257 tokens. GPT-4 increases that past 100k (see https://gist.github.com/s-macke/ae83f6afb89794350f8d9a1ad8a0...).
It's very similar to compression algos, really. Find recurring sets of characters.
Re: Continuous batching to increase LLM inference throughput and reduce p50 latency
#24[flagged]
Re: Continuous batching to increase LLM inference throughput and reduce p50 latency
#25Re: Continuous batching to increase LLM inference throughput and reduce p50 latency
#26Re: Continuous batching to increase LLM inference throughput and reduce p50 latency
#27So what? TGI also supports this.
Re: Continuous batching to increase LLM inference throughput and reduce p50 latency
#28Kinda hard to believe, but I have no intuition about this.