Likelihood와 information-theoretic quantity는 probability model, loss function, generative model, representation learning을 연결합니다.
θ^=argθmaxi=1∑nlogpθ(xi)
Maximum likelihood는 modeling assumption 아래에서 관측된 data에 높은 probability를 주도록 model을 학습합니다.
Route Map
Core Quantities
| Quantity | Formula | 쓰임 |
|---|
| Negative log-likelihood | −logpθ(x) | 관측 data에 probability model을 fit |
| Cross-entropy | H(p,q)=−Ex∼plogq(x) | supervised classification, distribution matching |
| Entropy | H(p)=−Ex∼plogp(x) | distribution의 uncertainty |
| KL divergence | DKL(p∥q)=Ex∼plogq(x)p(x) | distribution을 비대칭적으로 비교 |
| ELBO | Eqϕ(z∣x)[logpθ(x∣z)]−DKL(qϕ(z∣x)∥p(z)) | latent-variable model 학습 |
Labeled dataset에서 cross-entropy는 관측 class의 negative log-likelihood입니다.
LCE=−k=1∑Kyklogpθ(y=k∣x)
yk는 one-hot target 또는 soft target입니다.
Likelihood Reading Checklist
| 질문 | 중요한 이유 | 시작점 |
|---|
| 어떤 probability가 정의되는가? | p(x), p(y∣x), p(x,y), p(x∣c), unnormalized score는 서로 다른 claim을 지지합니다 | Maximum likelihood |
| support가 무엇인가? | probability는 model이 정의한 vocabulary, class set, coordinate space, sample space 안에서만 의미가 있습니다 | Probability distribution |
| 무엇을 평균내는가? | token, example, graph, atom, residue, pair, trajectory denominator가 objective를 바꿉니다 | Loss function |
| likelihood가 exact인가? | normalized likelihood, variational bound, score objective, implicit model은 같은 evidence가 아닙니다 | Density estimation |
| loss가 utility와 맞는가? | 더 좋은 likelihood가 더 좋은 ranking, generation, calibration, domain utility를 항상 뜻하지는 않습니다 | Objective-metric alignment |
| probability가 어떻게 쓰이는가? | training loss, model selection, calibration, sampling, final decision은 서로 다른 evidence를 요구할 수 있습니다 | Probabilistic prediction |
Generative Models
Reading Generative Objectives
| Objective Type | 학습 대상 | 볼 점 |
|---|
| Likelihood | normalized probability 또는 tractable factorization | high likelihood가 useful sample을 항상 뜻하지는 않음 |
| Bayesian posterior | prior와 likelihood를 evidence로 update | posterior approximation과 prior assumption이 중요함 |
| Variational bound | latent encoder와 decoder | bound tightness와 posterior assumption을 확인 |
| Denoising / score | noisy data 위의 gradient 또는 denoising target | sampling path와 noise schedule이 behavior를 정의 |
| Flow matching | probability path 위의 velocity field | path choice와 ODE integration이 sample에 영향 |
| Adversarial | discriminator feedback을 통한 generator | mode collapse와 unstable training을 확인 |
Boundary With AI and Domain Notes
Likelihood 식 자체는 Math에 두고, 식이 무엇을 주장하는지는 가까운 domain으로 넘깁니다.
| Main question | Route | Record |
|---|
| pθ(x), pθ(y∣x), KL, entropy, ELBO가 무엇인가? | Math, Information and Likelihood | distribution, support, expectation, approximation |
| likelihood가 어떤 training signal인가? | Learning Methods, Machine Learning | loss, target, masking, conditioning, optimizer relation |
| likelihood가 sample generation으로 어떻게 이어지는가? | Generative Models | factorization, sampler, latent/noise path, denominator |
| probability score가 decision evidence인가? | Evaluation, Evaluation Math | calibration, proper score, uncertainty, selection rule |
| molecule/protein likelihood나 score인가? | Computational Biology, Data and Evaluation | object unit, chemical/protein state, split, assay or structure context |
Common Misreads
| Misread | Better reading |
|---|
| lower NLL means better downstream model | check task metric, selection rule, calibration, and domain utility |
| likelihood is always comparable across models | compare only when support, tokenization, preprocessing, and denominator match |
| generative likelihood proves sample quality | inspect sampling procedure, filtering, validity, diversity, and failure modes |
| probabilistic output is calibrated | calibration needs separate evidence such as reliability or proper scoring |
Checks
- 어떤 distribution을 modeling하는가?
- loss가 likelihood, variational bound, denoising target, score target, velocity target 중 무엇인가?
- probability가 ranking, calibration, sampling, decision-making 중 어디에 쓰이는가?
- 낮은 loss가 해당 task의 downstream utility 개선을 의미하는가?