On learning the structure of sum-product networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
LearnSPN is the standard unsupervised learning algorithm for sum-product networks (SPNs). It is based upon a “chop” operation for splitting features (columns) and a “slice” operation for clustering instances (rows). However, a number of techniques can be applied to chop and slice meaning that LearnSPN can learn a wide variety of SPNs from the same dataset. In this paper, we perform an empirical study of LearnSPN. We consider g-test and mutual information for chopping and k-means and Gaussian mixture models for slicing. Our experiments, conducted on 20 real-world datasets, suggest that the deepest SPNs tend to be learned when using mutual information for chopping and k-means for slicing. This is important, since SPNs are the only deep learning model where it is provably the case that deeper models are more expressive than shallow models. Second, our results show that the pair of g-test and Gaussian mixture models tends to yield the most accurate SPNs, especially on larger datasets. These results suggest that the particular combination of mutual information and k-means may be prone to overfitting. Lastly, we examine the sparseness of the learned SPN. Our experiments show that the pair of g-test and Gaussian mixture models regularly yields SPNs with fewer edges. This knowledge is beneficial to SPN learning algorithms that penalize networks with more edges. Our study then extends the SPN deep learning literature in both practical and theoretical directions.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it