3 ms·
Stictly speaking (non-recurrent) LLMs are Markov chains. Per e.g. Wikipedia: "In probability theory and statistics, a Markov chain or Markov process is a stoch
by jampekka 2y ago
Stictly speaking (non-recurrent) LLMs are Markov chains.
Per e.g. Wikipedia: "In probability theory and statistics, a Markov chain or Markov process is a stochastic process describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event."