Exchangeability of the nested CRP
ProvedNestedCRP.ncrp_exchangeablebayesian-nonparametricsp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1topic-models
For , a permutation of the tourists and a tree ,
The law on trees does not depend on the order in which the tourists arrive. This is what makes any document exchangeable with the last one, which the path sampler relies on.
Differences from the source:
- generalization: the CRP is invariant to the order of arrival of customers → the nested CRP on trees is invariant to the order of arrival of tourists; reason: the nCRP runs one CRP in each restaurant, and its first level is the single CRP of the source
Preamble
import Mathlib import Definitions.Def_NestedCRP_ncrpMass
Formal statement
namespace NestedCRP
/-- The nCRP is invariant under reordering the tourists. Blei–Griffiths–Jordan, *The nested Chinese restaurant process and Bayesian nonparametric
inference of topic hierarchies*, J. ACM 57(2), Article 7 (2010), §3, p.7:10 (stated for one
CRP; the nCRP needs it node by node). -/
theorem ncrp_exchangeable {D : ℕ} {γ : ℝ} (hγ : 0 < γ) (σ : Equiv.Perm (Fin D)) (T : Tree D) :
ncrpMass γ (T.relabel σ) = ncrpMass γ T := by sorry
end NestedCRP
Source
Blei–Griffiths–Jordan, The nested Chinese restaurant process and Bayesian nonparametric inference of topic hierarchies, J. ACM 57(2), Article 7 (2010), https://doi.org/10.1145/1667053.1667056, §3, p.7:10
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.