20260601
This commit is contained in:
33
concepts/unconditional-generation-latent.md
Normal file
33
concepts/unconditional-generation-latent.md
Normal file
@@ -0,0 +1,33 @@
|
||||
---
|
||||
title: "Unconditional Generation via Latent Reasoning"
|
||||
created: 2026-05-23
|
||||
updated: 2026-05-23
|
||||
type: concept
|
||||
tags: [generation, unconditional, latent]
|
||||
sources: [raw/papers/gram-generative-recursive-reasoning-2026.md]
|
||||
confidence: medium
|
||||
---
|
||||
|
||||
# Unconditional Generation via Latent Reasoning
|
||||
|
||||
> GRAM 的独特性:同一个递归潜在模型在无输入或固定输入时,可以执行**无条件生成**——从先验分布中采样推理轨迹并解码出数据。
|
||||
|
||||
## 工作原理
|
||||
|
||||
- 条件推理:p_theta(y|x) — 输入 x -> 推理 -> 输出 y
|
||||
- **无条件生成**:p_theta(x) — 从先验采样轨迹 -> 解码为数据(如 MNIST 数字)
|
||||
|
||||
## 为什么重要
|
||||
|
||||
- 证明 GRAM 不仅是推理引擎,也是**生成模型**
|
||||
- 同一架构在推理和生成两个方向上一致
|
||||
- 暗示潜在推理轨迹编码了**数据生成过程**
|
||||
|
||||
## 实验验证
|
||||
|
||||
Binarized MNIST:GRAM 在无条件生成上展现出清晰的数字结构,证实了潜在递归过程可以学会生成数据的结构。
|
||||
|
||||
## 相关概念
|
||||
|
||||
- [[latent-variable-generative-model]]
|
||||
- [[gram-generative-recursive-reasoning|GRAM]]
|
||||
Reference in New Issue
Block a user