--- id: wiki-2026-0508-evolutionary-computation title: Evolutionary Computation category: 10_Wiki/Topics status: needs_review canonical_id: self aliases: [P-Reinforce-AI-EVO-COMP] duplicate_of: none source_trust_level: A confidence_score: 0.98 tags: [AI, EvolutionaryComputation, Optimization, GeneticAlgorithm] 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 --- # [[Evolutionary Computation]] (μ§„ν™” μ—°μ‚°) ## πŸ“Œ ν•œ 쀄 톡찰 (The Karpathy Summary) > "생물 μ§„ν™”μ˜ 원리λ₯Ό λΉŒλ €μ™€ κ°€μž₯ 효율적인 해닡을 μ°Ύμ•„λ‚΄λŠ” λ””μ§€ν„Έ μ μžμƒμ‘΄." μžμ—°μ˜ μ§„ν™” κ³Όμ •(선택, ꡐ차, 변이)을 λͺ¨λ°©ν•˜μ—¬ λ³΅μž‘ν•œ μ΅œμ ν™” 문제λ₯Ό ν•΄κ²°ν•˜λŠ” νœ΄λ¦¬μŠ€ν‹± 기반 인곡지λŠ₯ 기법이닀. ## πŸ“– κ΅¬μ‘°ν™”λœ 지식 (Synthesized Content) - **Genetic Algorithm (GA)**: 염색체 연산을 톡해 졜적 ν•΄λ₯Ό νƒμƒ‰ν•˜λŠ” κ°€μž₯ λŒ€μ€‘μ μΈ 방식. - **Evolutionary Strategies (ES)**: μ‹€μˆ˜ κ°’ 벑터 μ΅œμ ν™”μ— νŠΉν™”λœ μ ‘κ·Ό. - **Fitness Function**: κ°œμ²΄κ°€ μ–Όλ§ˆλ‚˜ 문제 해결에 μ ν•©ν•œμ§€λ₯Ό ν‰κ°€ν•˜λŠ” 척도. - **Mutation & Crossover**: μ§€μ—­ 졜적점(Local Minima)에 λΉ μ§€μ§€ μ•Šκ²Œ ν•˜κ³  μƒˆλ‘œμš΄ 탐색 μ˜μ—­μ„ λ„“νžˆλŠ” 핡심 λ©”μ»€λ‹ˆμ¦˜. ## ⚠️ λͺ¨μˆœ 및 μ—…λ°μ΄νŠΈ (Contradictions & Updates) - λ”₯λŸ¬λ‹μ˜ μ—­μ „νŒŒ([[Backpropagation]]) 방식은 λ―ΈλΆ„ κ°€λŠ₯ν•œ ν•¨μˆ˜μ—μ„œλ§Œ μž‘λ™ν•˜μ§€λ§Œ, μ§„ν™” 연산은 'λ―ΈλΆ„ λΆˆκ°€λŠ₯ν•˜κ±°λ‚˜ λΈ”λž™λ°•μŠ€ ν˜•νƒœ'의 μ΅œμ ν™” λ¬Έμ œμ—μ„œλ„ κ°•λ ₯ν•œ μœ„λ ₯을 λ°œνœ˜ν•œλ‹€. μ΅œκ·Όμ—λŠ” μ‹ κ²½λ§μ˜ ꡬ쑰 자체λ₯Ό μ§„ν™”μ‹œν‚€λŠ” '[[Neuroevolution]]'κ³Ό κ°•ν™”ν•™μŠ΅μ˜ λŒ€μ•ˆμœΌλ‘œ λŒ€λ‘λ˜λ©° λ‹€μ‹œ μ£Όλͺ©λ°›κ³  μžˆλ‹€. ## πŸ”— 지식 μ—°κ²° (Graph) - Related: [[Optimization-Algorithms]] , [[Genetic-Algorithms]] - AI Context: [[Reinforcement-Learning]]-vs-[[Evolutionary-Computation]] ## πŸ€– 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: 무엇을 ν•˜λ©΄ μ•ˆ λ˜λŠ”κ°€ + 이유 + λŒ€μ‹  무엇을)*