- Rating
- 3
- Confidence
- 3(+1)
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 3(+1)
Read review
Paper summary
This paper extends score-matching-based causal discovery to count data. SCORE's constant-curvature sink criterion fails for counts because the node's own conditional density contributes an ``own-factor'' curvature that varies with the node's value even at a sink. The paper introduces the conditional curvature score (CCS)---the conditional variance of the diagonal log-density curvature given the node's value---which absorbs own-factor variation while retaining child-induced variation, and uses it to order nodes; an off-diagonal curvature score (OCS) then recovers parents given the order. Both scores are computed from concrete scores estimated by score-entropy discrete diffusion. The theoretical results are: in the bivariate setting, zero CCS exactly characterizes a semiparametric GLM conditional form whose family need not be prespecified; within this class, canonical-parameter nonlinearity is necessary and sufficient for identifiability; multivariate DAGs are recoverable by CCS ordering plus OCS parent selection; and a plug-in consistency result holds under an assumed convergence rate for the curvature estimates. The identifiable class strictly contains SCORE's nonlinear Gaussian ANMs. Experiments show that DISCO outperforms count-DAG baselines at scale on synthetic data, with a Lahman batting analysis as a real-data diagnostic.
Critical strengths
-
The model-class relaxation is well motivated and correctly sized relative to prior work. Existing routes to causal discovery from counts either do not cover count support at all (SCORE's nonlinear Gaussian ANMs) or require the conditional families to be prespecified: ODS (Park and Raskutti) within Poisson/QVF families, MRS (Park and Park) within generalized hypergeometric families, and CPCM (Bod'ik and Chavez-Demoulin) within a fixed list of parametric families. This paper drops the prespecified family while keeping a one-parameter exponential-tilt structure, so the conditional families need not be known in advance. The resulting class strictly contains SCORE's nonlinear Gaussian ANMs (the Gamma example: nonconstant sink curvature yet zero CCS) and covers the negative-binomial and binomial settings that motivate the experiments.
-
On the algorithmic side, the CCS construction is the right fix to a precisely diagnosed obstruction. SCORE's constant-curvature criterion fails on counts because the node's own conditional density contributes curvature that varies with the node's value even at a sink; prior count-DAG methods respond by presetting families and using moment conditions instead. Conditioning on the node's value to absorb own-factor curvature is simple, effective, and cleanly unified---one coordinate operator treats continuous and count coordinates in a single framework---and the rank-transform invariance (Proposition 12) is a practically valuable property that the experiments confirm. The ablations isolate the gain over the constant-curvature criterion (/ sink-selection points on Poisson/NB at , ), and the scalability is demonstrated concretely (, median in 57.4 minutes on a single GPU; Table 3).
-
The theory is coherent and, as far as I checked, correct under the stated assumptions. The bivariate necessary-and-sufficient characterization (Theorem 6), the multivariate recovery theorem (Theorem 8), and the strict-extension result (Corollary 13) fit together as one story, and I did not find substantive errors in the parts of the proofs I worked through. The limitations are scoped with unusual honesty (e.g., Appendix E.2's explicit statement of what is not proven).
Critical weaknesses
-
The estimation theory does not cover the implemented algorithm---a gap the authors themselves acknowledge. Assumption 15 assumes the uniform convergence of the curvature estimates, which is precisely what an end-to-end guarantee would need to prove from the score-entropy estimator [1], the amortized projection, the rank transform, and the boundary clipping; no convergence rates are available at any stage; the analyzed variant (raw OCS thresholding at a deterministic ) differs from the implementation (boundary clipping, median/IQR standardization, selection-frequency rule); and must be sandwiched between a rateless error level and the smallest true-edge signal, so no explicit choice is available. The authors state this openly (Appendix E.2: "does not give a global consistency guarantee''), and I appreciate the honesty; for a paper whose contribution is primarily theoretical, this remains the main incompleteness.
-
The closest prior method is not experimentally compared. Vo et al. (2026) [2]---ordering-based causal discovery via generalized score matching for discrete data---is the nearest relative of DISCO's approach and is discussed in the related-work section, yet it appears in no experiment. Without a head-to-head comparison, the empirical assessment leaves open how the two methods' coverage differs (which conditional families and data regimes each supports), which is better matched to real count data in practice, and how they perform on the same benchmarks. The comparisons that are present also carry caveats: the multivariate ODS baseline [3] uses regression estimates of the conditional mean and variance rather than the original exact-conditioning construction, so the Oracle gap may partly reflect this adaptation.
[1] A. Lou, C. Meng, and S. Ermon. Discrete diffusion modeling by estimating the ratios of the data distribution. ICML, 2024.
[2] V. Vo, T. Le, H. Zhao, E.,V. Bonilla, and D. Phung. Ordering-based causal discovery via generalized score matching. KDD, pages 4706--4717, 2026.
[3] G. Park and G. Raskutti. Learning quadratic variance function (QVF) DAG models via overdispersion scoring (ODS). Journal of Machine Learning Research, 18(224):1--44, 2018.
Questions for authors
-
The conditional form characterized by Theorem 5 seems to me related to the classical semiparametric density-ratio literature [1,2], and the affine-case non-identifiability in Theorem 6 to the symmetry behind reversible linear logistic models [3]. Is this reading correct? If so, how does the paper's contribution differ from what this literature establishes? Although DISCO's assumptions are more general, my sense is that its identifiability mechanism shares its core algebraic step with CPCM [4], and that neither class fully covers the other. Could you explain in detail the similarities and differences of the identifiability mechanisms, and state the cross-coverage explicitly?
-
My reading of the proof of Theorem 8(i) (Appendix C.3) is that it uses only the existence, for each nonsink , of a sink child in the induced child subgraph whose edge is nonlinear---strictly weaker than Definition 4's every-edge nonlinearity. Is this correct, and if so could the ordering theorem be stated under the weaker per-node condition? My reading of Condition R1 is that it supplies, at count-support endpoints, the interiority that the squeezing argument already yields at interior levels. Is this correct, and could you provide a concrete endpoint example? More generally, would you surface the regularity conditions in the main text, together with a discussion of what they exclude (parent-dependent dispersion, zero inflation, near-deterministic relations)?
-
Under what explicit conditions could Assumption 15 be verified---for example, at a single fixed noise level with exact marginalization, importing a consistency rate for the score-entropy estimator from Lou et al.\ (2024) [5]? Would you state any stage-wise rate, even under strong conditions?
-
The theory is established on the admissible finite-difference domain, under which the Lahman headline is 0.762 (stable across q4--q8), while the reported 0.905 uses the clipped boundary convention. What considerations favor the clipped convention on real data? Relatedly: the seven reference relations are accounting containments such as ---the set of values a child can take depends on its parent's value---whereas Definition 3 requires each node's support and density to be independent of the parent values (strict positivity on a fixed support). The data-generating process therefore appears to lie outside the model class in which the identifiability guarantees hold. Given this, would you consider presenting the Lahman section explicitly as a diagnostic (agreement with domain knowledge) rather than as evidence of causal recovery?
[1] J.,A. Anderson. Multivariate logistic compounds. Biometrika, 66(1):17--26, 1979.
[2] J. Qin. Inferences for case-control and semiparametric two-sample density ratio models. Biometrika, 85(3):619--630, 1998.
[3] R.,L. Prentice and R. Pyke. Logistic disease incidence models and case-control studies. Biometrika, 66(3):403--411, 1979.
[4] J. Bod'ik and V. Chavez-Demoulin. Identifiability of causal graphs under non-additive conditionally parametric causal models. Journal of Machine Learning Research, 26(264):1--55, 2025.
[5] A. Lou, C. Meng, and S. Ermon. Discrete diffusion modeling by estimating the ratios of the data distribution. In ICML, 2024.
6 comments
Q1-1. Relation to the density-ratio literature
We agree that Theorems 5 and 6 relate to this literature. The conditional form of Theorem 5 is the density-ratio model of Anderson (1979) [1] and Qin (1998) [2], with their group label in the role of our parent value. The affine non-identifiability of Theorem 6 is the symmetry of behind the equivalence of the prospective and retrospective logistic models of Prentice and Pyke (1979) [3, Section 2]. Our contribution is to characterize the conditional form of Theorem 5 by a zero CCS, which extends the constant-curvature criterion of SCORE. We also show the converse of this symmetry: a nonlinear canonical parameter makes the direction identifiable (Theorem 6), and nonlinear edges make the DAG identifiable (Corollary 9).
References
[1] Anderson, J. A. (1979). Multivariate logistic compounds. Biometrika, 66(1):17–26.
[2] Qin, J. (1998). Inferences for case-control and semiparametric two-sample density ratio models. Biometrika, 85(3):619–630.
[3] Prentice, R. L. and Pyke, R. (1979). Logistic disease incidence models and case-control studies. Biometrika, 66(3):403–411.
Q1-2. Relation to CPCM
In the bivariate case, both identifiability mechanisms are based on the canonical parameter of an exponential family and rest on the same algebraic step, which equates the forward and reverse factorizations of the joint density. The two classes differ in the conditional families they allow and in whether a list of known families must be given, so neither class contains the other. In multivariate DAGs, the algebraic steps differ.
(i) Shared algebraic step. In both classes, the direction is non-identifiable exactly when also factorizes in the reverse direction within the class, and Proposition 5 of Bodík and Chavez-Demoulin (2025) gives sufficient conditions for identifiability, whereas our Theorem 6 gives a necessary and sufficient condition. The same step also appears in the identifiability proofs for additive noise [1], post-nonlinear [2], location-scale [3], and heteroscedastic symmetric noise models (Lin et al., 2025).
(ii) Families covered by each class. Both classes contain one-parameter families such as Poisson, exponential, or Gaussian with fixed variance. Our class leaves the conditional family unspecified, whereas CPCM requires a list of known families. This list lets CPCM cover families with more than one parameter, such as a Gaussian with parent-dependent variance (their Theorem 4 and Consequence 12). We added the statement that neither class contains the other to the related work of the revised manuscript.
(iii) From the bivariate case to DAGs. CPCM extends the bivariate step to DAGs through Theorem 28 of Peters et al. (2014) (their Lemma 11), which requires the bivariate step for every edge given the other variables. Our Theorem 8 instead identifies sinks by a zero CCS on each ancestral remaining set.
References
[1] Hoyer, P. O., Janzing, D., Mooij, J. M., Peters, J., and Schölkopf, B. (2009). Nonlinear causal discovery with additive noise models. In NeurIPS, 21:689–696.
[2] Zhang, K. and Hyvärinen, A. (2009). On the identifiability of the post-nonlinear causal model. In UAI, pages 647–655.
[3] Immer, A., Schultheiss, C., Vogt, J. E., Schölkopf, B., Bühlmann, P., and Marx, A. (2023). On the identifiability and estimation of causal location-scale noise models. In ICML, PMLR 202:14316–14332.
Q2-1. A weaker condition for Theorem 8(i)
As the reviewer reads it, the proof of Theorem 8(i) uses only a per-node condition. We are grateful for this reading, since re-examining the proof with it led us to relax the condition further for count data so that linear edges are allowed (Theorem 9A).
(i) What the proof of Theorem 8(i) uses. The proof of Theorem 8(i) only requires that, for every ancestral set and every nonsink of , the subgraph of induced on has a sink with . This condition is strictly weaker than edgewise nonlinearity. We state a further count-specific relaxation as Theorem 9A.
(ii) Extension to linear edges in count DAGs. Theorem 9A(i) shows that, for almost every intercept vector, the CCS identifies the sinks of every ancestral remaining set if and only if no node with a single parent has a linear edge into it. This condition is weaker than the per-node condition of the question, since in a v-structure with two linear edges both nonsinks have positive CCS through the log-partition curvature of the child. For the identifiability of , Theorem 9A(ii) further shows that only the edges out of sources matter: is identifiable if and only if no source has a linear edge into a child with no other parent. The table below gives the largest share of edges that can be linear at once while each condition holds, over 300 random graphs for each setting (Table 8E of the revised manuscript).
| Graph | Sink characterization holds (9A(i)) | remains identifiable (9A(ii)) | |
|---|---|---|---|
| ER1 | 10 | 66.1% | 75.8% |
| 50 | 69.0% | 80.3% | |
| ER3 | 10 | 94.2% | 95.9% |
| 50 | 94.4% | 97.1% |
With the linear and mixed feature maps of Table 8A of the revised manuscript, DISCO recovers most of the order as with nonlinear feature maps, with of at least 0.86 on ER3 graphs with and .
| Family | Linear | Nonlinear | Mixed | Linear | Nonlinear | Mixed |
|---|---|---|---|---|---|---|
| Poisson | 0.905 | 0.899 | 0.910 | 0.821 | 0.805 | 0.795 |
| NB | 0.913 | 0.916 | 0.915 | 0.777 | 0.803 | 0.770 |
| Binomial | 0.867 | 0.910 | 0.882 | 0.674 | 0.884 | 0.812 |
Q2-2. Role of Condition R1 at support endpoints
We thank the reviewer for this precise reading, which is correct. Condition R1 is needed only at count-support endpoints. It is used only for linear edges, in the only-if direction of Theorem 6. At interior levels, and convexity of ensure interiority (proof of Theorem 6). At endpoints, R1 is satisfied if the cause has an exponential moment, for some , covering Poisson, negative binomial, and finite-support causes.
As a counterexample, let on and , with and . Then , so the endpoint violates R1. Indeed, has infinite variance. Thus, R1 excludes such heavy-tailed endpoint cases rather than standard count causes.
Q2-3. Regularity conditions and what they exclude
The revised main text states the regularity conditions and what they exclude below Table 1 in Section 4, and what the model excludes after Definition 4. Near-deterministic relations remain in the class, since the regularity conditions only require every count level to have positive probability, so they exclude only deterministic relations. Parent-dependent dispersion and zero inflation lie outside the model of Definition 3, where the parents change only through , by the same amount at every level . A parent-dependent dispersion changes this difference differently across levels, and zero inflation changes it only between levels 0 and 1.
We are thankful for the reviewer's close reading of the proofs and the questions on the estimation theory, related literature, and real data. Through them, the revised manuscript now gives stage-wise rates (Propositions 11A and 15A) and clarifies how DISCO relates to existing methods and how the real-data results should be read. More importantly, the reviewer's reading of the proof of Theorem 8(i) led to Theorem 9A, which allows linear edges in count DAGs. Revised passages of the manuscript are marked in blue.
W1. Gap between the estimation theory and the implemented algorithm
The boundary convention now follows the theory, Assumption 15 can be verified with explicit rates for the empirical score-entropy minimizer on a finite support, and the standardized OCS rule is one scalable choice that can be replaced by a parent test with a statistical guarantee, such as PCM-GAM (Lundborg et al., 2024).
(i) Boundary convention of the theory. All results of the revised manuscript now use the admissible differences of the theory, except the clipped Lahman values kept as a sensitivity analysis. In the synthetic experiments, this changed Atop and F1 by at most 0.02.
(ii) Verification of Assumption 15. Proposition 15A of the revised manuscript verifies Assumption 15 for the empirical score-entropy minimizer on a finite support (see our answer to Q3-1 and Q3-2). On finite supports, the fitted rank transform is the identity with probability tending to one.
(iii) Standardized parent rule and alternatives. The standardized OCS rule is one scalable choice for parent selection, and the order estimated by DISCO can also be combined with a parent test with a statistical guarantee, such as PCM-GAM (Lundborg et al., 2024).
W2-1. Comparison with Vo et al.
The two methods cover different data, and on the same benchmarks DISCO is more accurate on count data, where their method recovers little of the order, while their method is more accurate on categorical data.
(i) Comparison of the data covered by the two methods. DISCO covers count variables in the semiparametric GLM class, whose conditional family is unspecified and may differ across nodes, such as Poisson, negative binomial, and binomial conditionals (Theorem 8). Vo et al. cover categorical variables with finite unordered states, under the condition that conditional randomness, measured for example by conditional entropy, does not decrease along the causal order (Vo et al., 2026, Condition 3).
(ii) Results on the same benchmarks. We ran their released code with their hyperparameters and DISCO on our count benchmark (ER3, d=50, n=5000) and on their categorical benchmark (Vo et al., 2026, Sections 4 and 5.1), with parents selected by CAM. All entries are means over three seeds, and Time is the ordering time.
Their method refits its diffusion model after each sink removal, which took 165 to 341 minutes per count graph at d=50, so the d=100 benchmarks of the main text were out of reach. We will update these results with further seeds as the runs complete. We added the comparison to Table 6A of the revised manuscript.
W2-2. Adaptation of the ODS baseline
To compare with ODS as originally proposed, all ODS results in the revised manuscript use the exact-conditioning R code that the authors of Park and Raskutti (2018) shared with us, with only the QVF coefficient and the regression link changed for each family. When no conditioning group has enough observations, the original code stops before returning a score, so we set the score to zero. The exact-conditioning code and the regression estimates give F1 of ODS (Oracle) within about 0.02 of each other in every family, so the gap to DISCO does not come from this adaptation.