- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper proposes a method for dealing with an intractability that arises in Neural Probabilistic Circuits (NPCs) at the connecting point of a neural network attribute extractor and the probabilistic circuit modelling the joint distribution of those features with a class label variable. To compute the conditional class probabilities given the data traditionally used for classification, it is required to marginalize over the space of attributes, the computational complexity of which grows exponentially in the number of attributes. Instead of computing the class conditional, the authors propose a method for computing a proxy class score based on evaluation of the class-attribute joint distribution, and which leverages the structural properties of the circuit to compute class scores in time linear w.r.t. the size of the circuit. The authors provide a bound for the error their approximate inference method induces, and compare their method with comparable SotA methods as well as the ground truth posterior where possible. The proposed method allows for at least an order of magnitude larger attribute spaces to be used, maintains similar performance to the ground truth in classification accuracy, and achieves performance comparable to SotA methods whilst having the added tractability of using a circuit model.
Critical strengths
- S1: The paper rigorously presents and justifies an approximate inference method that provides substantial efficiency gains in inference in NPCs, taking complexity from exponential to linear. This has a concrete outcome of allowing for NPCs to be used in tasks with substantially larger attribute sets, and hence data sets that were previously out of reach. Empirical results show that the approximation introduced by the method maintains similar performance to its exact counterpart and to SotA competitors, whilst still giving the added benefits of a circuit based model.
- S2: The authors derive a bound for the error that their generative inference method produces w.r.t. the true class posterior giving a guarantee for performance, and also a pointwise diagnostic for where the error is greatest.
Critical weaknesses
- W1: The paper does not have a limitations or discussion section, and does not discuss future work. In particular, it would be useful to have further discussion (and perhaps analysis) on the error bound that is derived and how this behaves empirically.
- W2: The paper would also benefit from discussing and analyzing other limitations that not evaluating the class conditional directly induces. For example, other performance metrics such as NLL or ECE that give insights into uncertainties in predictions could be shown.
Questions for authors
- Q1: How does the generative inference method proposed compare to the discriminative inference methods in terms of other inference tasks, such as those involving uncertainty quantification?
- Q2: What are the next steps for inference in NPCs? What are limitations that you might work on next, or applications that NPCs might be applied to with the added flexibility in attribute size? How could, for example, the performance gap between NPC models with CBMs and DNNs be further reduced?
- Q3 I did not find the "DNN" model shown in Table 1 specified in the main text. What exactly is this model, and how does it relate to the CBM and NPC models?
- Q4: Given that the model underperforms in terms of accuracy w.r.t. CBMs and DNNs (AwA2, CelebA, CUB200, SUN), what are some of the reasons practitioners might use an NPC instead?
- Q5: It is interesting to see the effects of the generative and discriminative (exact and sampled) inference methods disentangled in the training vs. inference stages. For example, using a model trained on the generative objective but evaluated on the discriminative objective and vice versa. Is this the experiment discussed in section 6.3, and what was the overall conclusion?
3 comments
Thank you for addressing my questions and concerns, and for adding the further experiments and sections to the paper.
The authors address and demonstrate an effective and low cost solution (fine-tuning) for the scenario of mismatched training and inference that reviewer 7Ykd identifies (W1). The authors also improved the method's computational efficiency based on reviewer 1NBq's observation in W2. The main weakness seems to be 1NBq's observation regarding the usefulness of the bound derived, which the authors address with new derivations and experiments.
The method proposed provides a clear contribution to NPCs in allowing these models to be applied to tasks with large attribute sets (for example, CUB-200 and SUN). The method outperforms a baseline approximation method in these cases.
Thank you for your careful review and thoughtful follow-up! We appreciate your recognition of the contribution and your constructive feedback, which has helped us strengthen the paper. Please let us know if there are any remaining questions or points we can clarify.
We thank the reviewer for the constructive suggestions. We appreciate your positive assessment of the efficiency gains, experiments with larger attribute sets, and theoretical analysis.
Section 5 explains diagnosis on annotated data and a sufficient condition after full correction. New Appendix F evaluates both the original bound and a tighter form using an annotation-based reference. Both hold on all evaluated inputs. The original bound matches the mean total-variation error on MNIST-Add and GTSRB, but exceeds one in mean on the other four. The tighter form is also below one in mean on AwA2 and CUB-200; Appendix F explains why (Table 7). Error detection without test annotations remains future work. Appendix H discusses accuracy, calibration, and training–inference mismatch; Section 7 summarizes the next steps.
New Appendix H, Table 11, reports expected calibration error (ECE), which measures the gap between confidence and accuracy, before and after validation-fitted temperature scaling. With training and inference matched, calibrated ECE differs by less than 1.6 percentage points on five benchmarks. SUN is the exception: 15.27% for generative inference versus 2.90% for discriminative inference. Before calibration, generative probabilities are underconfident on both CUB-200 and SUN. Omitting the learned training scale from the reported probabilities may contribute to this underconfidence.
In Appendix H and Section 7, we propose testing whether training the circuit on annotated attributes as well as recognizer predictions, and learning its structure, improve classification and correction. With larger attribute sets, the tractable attribute posteriors could also help choose which missing attribute to request from a user.
We adopt the DNN and joint-CBM baseline designs from Chen et al. (2025). The DNN has a linear class head and no attribute layer; the joint CBM applies a linear class head to attribute logits. Both use the same ResNet backbone as NPC: ResNet-34 on the first four datasets and ResNet-50 on CUB-200 and SUN. Section 6.1 and Appendix D give the configurations.
NPC offers these capabilities while maintaining accuracy close to the baselines on several benchmarks (Table 1):
Interpretability and prior knowledge. NPCs and CBMs expose named attributes for inspection and correction; our DNN baseline does not. NPC’s circuit can also encode logical rules, as demonstrated by Chen et al. (2025, Section 3.2.2). The standard CBM head has no corresponding logical component.
Missing attributes and corrections. The circuit is a generative model, so it can sum over missing attributes and condition on supplied values. A standard CBM’s deterministic head requires missing inputs to be filled. New Table 9 compares NPC with joint, sequential, and independent CBMs using all predicted attributes, half withheld, or all corrected. Corrections use each model’s training targets and Koh et al.’s (2020) percentile replacements for the joint and sequential CBMs; Appendices D and G give the details. NPC outperforms the joint CBM after full correction on five benchmarks, while the joint CBM does better with half the groups missing on five; CelebA reverses both comparisons. On CUB-200, the joint CBM is best in the first two settings, but full correction gives 72.5% for NPC and 1.7% for the joint CBM. Sequential and independent CBMs have higher accuracy after full correction, but lower accuracy than both NPC and the joint CBM with all predicted attributes available and with half the groups missing. NPC therefore offers a favorable tradeoff across these three settings.
Attribute inference without images. Given half the annotated attributes, NPC predicts the rest better than a baseline that always predicts the most frequent training value on five of six benchmarks. The gains in balanced accuracy range from 4.0 to 25.4 percentage points across these five benchmarks (new Table 10). Both methods are near chance on MNIST-Add, whose digits are independent.
Our contribution makes these NPC queries tractable at larger attribute counts.
Yes. Table 6 in Appendix E applies each feasible inference rule to each trained model across all six benchmarks; Table 1 compares matched training and inference. Switching rules can reduce accuracy in either direction. This supports training with the inference intended for use; the best pair depends on the dataset (Section 6.3).