--- id: wiki-2026-0508-expectation-maximization title: Expectation Maximization category: 10_Wiki/Topics status: needs_review canonical_id: self aliases: [P-Reinforce-AUTO-EXMA-001] duplicate_of: none source_trust_level: A confidence_score: 0.94 tags: [auto-reinforced, em-algorithm, expectation-maximization, latent-variable, gmm, Statistics, clustering, unSupervised-Learning] raw_sources: [] last_reinforced: 2026-04-20 github_commit: pending inferred_by: Claude Opus 4.7 (auto-normalize 2026-05-08) tech_stack: language: unspecified framework: unspecified --- # [[Expectation-Maximization|Expectation-Maximization]] ## πŸ“Œ ν•œ 쀄 톡찰 (The Karpathy Summary) > "μˆ¨κ²¨μ§„ λ°μ΄ν„°μ˜ μΆ”μ μž: 'μ–΄λ–€ 그룹에 μ†ν•˜λŠ”μ§€(잠재 λ³€μˆ˜)' μ •ν•΄μ§€μ§€ μ•Šμ€ 데이터 덩어리λ₯Ό 보고, 그룹의 νŠΉμ„±μ„ μž„μ˜λ‘œ μΆ”μΈ‘(E-step)ν•œ λ’€ κ·Έ 좔츑에 맞좰 졜적의 λͺ¨λΈμ„ μ—…λ°μ΄νŠΈ(M-step)ν•˜λŠ” 과정을 λ°˜λ³΅ν•˜μ—¬ κ²°κ΅­ 보이지 μ•Šλ˜ μ§ˆμ„œλ₯Ό μ°Ύμ•„λ‚΄λŠ” 톡계적 수수께끼 풀이법." ## πŸ“– κ΅¬μ‘°ν™”λœ 지식 (Synthesized Content) κΈ°λŒ€κ°’ μ΅œλŒ€ν™”(Expectation-Maximization, EM) μ•Œκ³ λ¦¬μ¦˜μ€ κ΄€μΈ‘λ˜μ§€ μ•Šμ€ 잠재 λ³€μˆ˜κ°€ ν¬ν•¨λœ ν™•λ₯  λͺ¨λΈμ˜ μ΅œλŒ€ μš°λ„(Maximum Likelihood) 좔정값을 μ°ΎλŠ” 반볡적인 μ•Œκ³ λ¦¬μ¦˜μž…λ‹ˆλ‹€. 1. **2단계 ν”„λ‘œμ„ΈμŠ€**: * **E-Step (Expectation)**: ν˜„μž¬ λͺ¨λΈ νŒŒλΌλ―Έν„°λ₯Ό μ‚¬μš©ν•΄ 각 데이터가 νŠΉμ • 잠재 λ³€μˆ˜κ°’(예: ν΄λŸ¬μŠ€ν„° μ†Œμ†)을 κ°€μ§ˆ ν™•λ₯ μ„ 계산. * **M-Step (Maximization)**: E-stepμ—μ„œ κ΅¬ν•œ κΈ°λŒ€κ°’μ„ λ°”νƒ•μœΌλ‘œ, 전체 λͺ¨λΈμ˜ 둜그 μš°λ„λ₯Ό μ΅œλŒ€ν™”ν•˜λŠ” λ°©ν–₯으둜 νŒŒλΌλ―Έν„°λ₯Ό μ—…λ°μ΄νŠΈ. 2. **μ™œ μ€‘μš”ν•œκ°€?**: * 데이터가 λˆ„λ½(Missing data)λ˜μ—ˆκ±°λ‚˜ μ •λ‹΅ 라벨이 μ—†λŠ” 비지도 ν•™μŠ΅ ν™˜κ²½ μ •μ±…μ—μ„œ λ°μ΄ν„°μ˜ λ‚΄μž¬μ  ꡬ쑰 정책을 νŒŒμ•…ν•˜λŠ” κ°€μž₯ 정석적인 방법이기 λ•Œλ¬Έμž„. (Statistics와 μ—°κ²°) ## ⚠️ λͺ¨μˆœ 및 μ—…λ°μ΄νŠΈ (Contradictions & Updates) - **κ³Όκ±° λ°μ΄ν„°μ™€μ˜ 좩돌**: κ³Όκ±°μ—λŠ” λ‹¨μˆœνžˆ κ°€μš°μ‹œμ•ˆ ν˜Όν•© λͺ¨λΈ(GMM) μ •μ±… 등에 μ‚¬μš©λ˜μ—ˆμœΌλ‚˜, ν˜„λŒ€ 정책은 κ±°λŒ€ μ–Έμ–΄ λͺ¨λΈμ˜ '지식 증강(Knowledge augmentation)' κ³Όμ •μ΄λ‚˜ λ³΅μž‘ν•œ μΆ”μ²œ μ‹œμŠ€ν…œμ˜ 'μ‚¬μš©μž μ·¨ν–₯ 잠재 곡간 μ •μ±…'을 μ°Ύμ•„λ‚΄λŠ” 데 ν•΅μ‹¬μ μœΌλ‘œ μ“°μž„(RL Update). - **μ •μ±… λ³€ν™”(RL Update)**: μ΄μ œλŠ” λ‹¨μˆœ 수렴 정책을 λ„˜μ–΄, λ³€λΆ„ μΆ”λ‘ (Variational Inference) μ •μ±…κ³Ό κ²°ν•©ν•˜μ—¬ λ”₯λŸ¬λ‹ λ‚΄λΆ€μ˜ ν™•λ₯ μ  뢄포 정책을 μ‘°μ •ν•˜λŠ” κ³ μˆ˜μ€€ 생성 λͺ¨λΈ(VAE)의 이둠적 ν† λŒ€λ‘œ 진화함. (Deep Learning (DL)와 μ—°κ²°) ## πŸ”— 지식 μ—°κ²° (Graph) - [[Statistics|Statistics]], [[Analysis|Analysis]], Deep Learning (DL), [[Logic|Logic]], [[Complexity-Theory|Complexity-Theory]], Generalization - **Key Use Case**: Gaussian Mixture Models (GMM), Hidden Markov Models (HMM). --- ## πŸ€– LLM ν™œμš© 힌트 (How to Use This Knowledge) **μ–Έμ œ 이 지식을 μ“°λŠ”κ°€:** - *(TODO)* **μ–Έμ œ μ“°λ©΄ μ•ˆ λ˜λŠ”κ°€:** - *(TODO)* ## πŸ§ͺ 검증 μƒνƒœ (Validation) - **정보 μƒνƒœ:** needs_review - **좜처 신뒰도:** A - **κ²€ν†  이유:** *(P-Reinforce Phase 1 μžλ™ μ •κ·œν™”. λ³Έλ¬Έ 검증 ν•„μš”.)* ## 🧬 쀑볡 검사 (Duplicate Check) - **κΈ°μ‘΄ μœ μ‚¬ λ¬Έμ„œ:** *(TODO: μΈλ±μ„œ ν΄λŸ¬μŠ€ν„° 리포트 μ°Έμ‘°)* - **처리 방식:** UPDATE (μžλ™ μ •κ·œν™”) - **처리 이유:** Phase 1 μ •κ·œν™” β€” μ˜› ν…œν”Œλ¦Ώ/λˆ„λ½ ν•„λ“œ 보강. ## πŸ•“ λ³€κ²½ 이λ ₯ (Changelog) | λ‚ μ§œ | λ³€κ²½ λ‚΄μš© | 처리 방식 | 신뒰도 | |------|-----------|-----------|--------| | 2026-05-08 | P-Reinforce Phase 1 μ •κ·œν™” (frontmatter + 헀더 ν‘œμ€€ν™”) | UPDATE | A | ## πŸ’» μ½”λ“œ νŒ¨ν„΄ (Code Patterns) **νŒ¨ν„΄ 1:** *(TODO: 이 ν”„λ‘œμ νŠΈ μ»¨λ²€μ…˜ λ°˜μ˜ν•œ ꡬ쑰 μŠ€μΌˆλ ˆν†€)* ```text # TODO ``` ## πŸ€” μ˜μ‚¬κ²°μ • κΈ°μ€€ (Decision Criteria) **선택 Aλ₯Ό 써야 ν•  λ•Œ:** - *(TODO)* **선택 Bλ₯Ό 써야 ν•  λ•Œ:** - *(TODO)* **κΈ°λ³Έκ°’:** > *(TODO)* ## ❌ μ•ˆν‹°νŒ¨ν„΄ (Anti-Patterns) - **[μ•ˆν‹°νŒ¨ν„΄]:** *(TODO: 무엇을 ν•˜λ©΄ μ•ˆ λ˜λŠ”κ°€ + 이유 + λŒ€μ‹  무엇을)*