--- id: wiki-2026-0508-evolutionary-computation title: Evolutionary Computation category: 10_Wiki/Topics status: needs_review canonical_id: self aliases: [EVO-COMP-001] duplicate_of: none source_trust_level: A confidence_score: 1.0 tags: [ai, evolutionary-computation, genetic-algorithm, Optimization, bio-inspired] raw_sources: [] last_reinforced: 2026-04-26 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) > "생쑴에 μœ λ¦¬ν•œ μ½”λ“œλ₯Ό 남기고 μ§„ν™”μ‹œμΌœ μ „μ—­ μ΅œμ ν•΄λ₯Ό ν–₯ν•œ 지름길을 찾아라" β€” λ‹€μœˆμ˜ μ§„ν™”λ‘ μ—μ„œ μ˜κ°μ„ μ–»μ–΄, 후보 ν•΄λ“€μ˜ 집단(Population)을 μƒμ„±ν•˜κ³  ꡐ배와 λŒμ—°λ³€μ΄λ₯Ό 거쳐 μ„ΈλŒ€λ₯Ό κ±°λ“­ν•˜λ©° ν•΄μ˜ ν’ˆμ§ˆμ„ λ†’μ—¬κ°€λŠ” ν™•λ₯ μ  μ΅œμ ν™” μ•Œκ³ λ¦¬μ¦˜. ## πŸ“– κ΅¬μ‘°ν™”λœ 지식 (Synthesized Content) - **μΆ”μΆœλœ νŒ¨ν„΄:** λͺ©ν‘œ 지점에 λ„λ‹¬ν•˜κΈ° μœ„ν•΄ μˆ˜ν•™μ  경사(Gradient)λ₯Ό λ”°λΌκ°€λŠ” λŒ€μ‹ , λ¬΄μž‘μœ„μ„±μ„ κ°€λ―Έν•œ 탐색과 μ μžμƒμ‘΄μ˜ 원칙을 κ²°ν•©ν•˜μ—¬ μ§€μ—­ μ΅œμ ν•΄(Local Minima)λ₯Ό λŒνŒŒν•˜λŠ” 진화적 탐색 νŒ¨ν„΄. - **μ£Όμš” ꡬ성 μš”μ†Œ:** - **Selection:** 적합도(Fitness)κ°€ 높은 μš°μˆ˜ν•œ ν•΄λ₯Ό λ‹€μŒ μ„ΈλŒ€μ˜ λΆ€λͺ¨λ‘œ 선택. - **Crossover (Recombination):** λΆ€λͺ¨ ν•΄λ“€μ˜ νŠΉμ§•μ„ κ²°ν•©ν•˜μ—¬ μƒˆλ‘œμš΄ μžμ† 생성. - **Mutation:** λ¬΄μž‘μœ„ λ³€ν™”λ₯Ό μ£Όμ–΄ μ§‘λ‹¨μ˜ 닀양성을 μœ μ§€ν•˜κ³  탐색 곡간 ν™•μž₯. - **Fitness Landscape:** ν•΄μ˜ ν’ˆμ§ˆμ΄ λΆ„ν¬λœ μ§€ν˜•μ„ νƒν—˜ν•˜λ©° 정상을 μ°ΎλŠ” κ³Όμ •. - **의의:** λ―ΈλΆ„ λΆˆκ°€λŠ₯ν•œ λΉ„μ„ ν˜• 문제, λ‹€λͺ©μ  μ΅œμ ν™”, 신경망 ꡬ쑰 탐색(NAS) λ“± κ΄‘λ²”μœ„ν•œ λΆ„μ•Όμ—μ„œ ν™œμš©. ## ⚠️ λͺ¨μˆœ 및 μ—…λ°μ΄νŠΈ (Contradictions & Updates) - **κ³Όκ±° λ°μ΄ν„°μ™€μ˜ 좩돌:** μ΄ˆκΈ°μ—λŠ” μ—°μ‚°λŸ‰μ΄ λ§Žμ•„ λΉ„νš¨μœ¨μ μΈ λ°©μ‹μœΌλ‘œ μ—¬κ²¨μ‘ŒμœΌλ‚˜, 병렬 μ»΄ν“¨νŒ…μ˜ λ°œλ‹¬κ³Ό μ‹ κ²½λ§κ³Όμ˜ κ²°ν•©([[Neuroevolution]])을 톡해 λ‹€μ‹œ μ£Όλͺ©λ°›μŒ. - **μ •μ±… λ³€ν™”:** Antigravity ν”„λ‘œμ νŠΈλŠ” μ—μ΄μ „νŠΈμ˜ μ „λž΅ 수립 λͺ¨λΈ μ΅œμ ν™” μ‹œ, κ°•ν™”ν•™μŠ΅κ³Ό μ§„ν™” 연산을 κ²°ν•©ν•˜μ—¬ μ•ˆμ •μ„±κ³Ό 탐색 λŠ₯λ ₯의 κ· ν˜•μ„ 맞좀. ## πŸ”— 지식 μ—°κ²° (Graph) - [[Genetic-Algorithms]], [[Black-Box-Optimization]], [[Neural-[[Architecture]]-[[Search]]-NAS]], [[Neural-Darwinism]] - **Raw Source:** 10_Wiki/Topics/AI/Evolutionary-Computation.md ## πŸ€– 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: 무엇을 ν•˜λ©΄ μ•ˆ λ˜λŠ”κ°€ + 이유 + λŒ€μ‹  무엇을)*