←back to thread

296 points todsacerdoti | 1 comments | | HN request time: 0.267s | source
Show context
smeeth ◴[] No.44368465[source]
The main limitation of tokenization is actually logical operations, including arithmetic. IIRC most of the poor performance of LLMs for math problems can be attributed to some very strange things that happen when you do math with tokens.

I'd like to see a math/logic bench appear for tokenization schemes that captures this. BPB/perplexity is fine, but its not everything.

replies(6): >>44368862 #>>44369438 #>>44371781 #>>44373480 #>>44374125 #>>44375446 #
calibas ◴[] No.44368862[source]
It's a non-deterministic language model, shouldn't we expect mediocre performance in math? It seems like the wrong tool for the job...
replies(4): >>44368958 #>>44368999 #>>44369121 #>>44372463 #
1. drdeca ◴[] No.44368958[source]
Deterministic is a special case of not-necessarily-deterministic.