Language Modelling
Tags: #machine learningEquation
$$p(x)=\prod^{n}_{i=1} p(s_{n}|s_{1},...,s_{n-1})$$Latex Code
p(x)=\prod^{n}_{i=1} p(s_{n}|s_{1},...,s_{n-1})
Have Fun
Let's Vote for the Most Difficult Equation!
Introduction
Latex Code
p(x)=\prod^{n}_{i=1} p(s_{n}|s_{1},...,s_{n-1})
Explanation
: Language modeling is usually framed as unsupervised distribution estimation from a set of examples of
: Variable length sequences of symbols
: Factorize the joint probabilities over symbols p(x) as the product of conditional probabilities
![](/scripts/img/blog_gpt/gpt1_2_models.png)
Discussion
Comment to Make Wishes Come True
Leave your wishes (e.g. Passing Exams) in the comments and earn as many upvotes as possible to make your wishes come true
-
Sarah RodriguezI have high hopes for passing this exam.Kevin Harris reply to Sarah RodriguezGooood Luck, Man!2023-09-15 00:00 -
Randy MurphyHoping to make it through this exam successfully.Mildred Turner reply to Randy MurphyYou can make it...2023-11-15 00:00 -
Clarence BriggsAiming for the stars with this test.Anne Brooks reply to Clarence BriggsYou can make it...2024-01-12 00:00
Reply