Pith. sign in

REVIEW 4 major objections 4 minor 77 references

A leaf node in a discrete causal model is the variable whose conditional probability given the rest is most random; peeling such leaves recovers the causal order.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · deepseek-v4-flash

2026-08-03 08:38 UTC pith:7PV22V3B

load-bearing objection Novel discrete score-matching ordering idea with a real gap: both certification routes collapse, so Condition 2 is unverified and the variance measure used in experiments is not a randomness measure. the 4 major comments →

arxiv 2601.16249 v3 pith:7PV22V3B submitted 2026-01-22 cs.LG cs.AI

Ordering-based Causal Discovery via Generalized Score Matching

Vy Vo , He Zhao , Trung Le , Edwin V. Bonilla , Dinh Phung This is my paper
classification cs.LG cs.AI
keywords causal discoverydiscrete datascore matchingtopological orderleaf detectionrandomness measuregeneralized score matchingstructural causal model
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper extends score-matching causal discovery, previously limited to continuous additive-noise models, to discrete categorical data. It claims that when a randomness measure such as entropy never decreases along a causal edge, leaf nodes are exactly the variables maximizing the expected randomness of the reciprocal conditional probability p(X_i | X_-i). Peeling that leaf and repeating recovers a valid topological order without assuming additive noise or a particular functional form. The authors test the criterion on simulated and real-world networks and show that the recovered order improves existing structure-learning baselines on most settings. The load-bearing assumption is a monotonicity condition on randomness that the paper itself notes may fail on real data.

Core claim

The central result is Theorem 1: in a discrete structural causal model obeying a 'non-decreasing randomness' condition, a node j is a leaf exactly when j = arg max_i E_{X_-i}[φ(r_i(X_-i))], where r_i(x_-i)=p(X_i|x_-i) is the reciprocal discrete score and φ is a randomness measure such as entropy or negative variance. Since every induced subgraph inherits the condition, repeating the argmax — peel the leaf, drop its column — yields a full topological order. The paper presents this as the first score-matching method for complete causal order from discrete data, subsuming non-decreasing-variance ANM conditions and generalizing entropic causality to multivariate order.

What carries the argument

The argument rides on two objects. The reciprocal discrete score function r_i(x_-i) := p(X_i | x_-i), the inverse of the generalized score for discrete distributions, turns leaf identification into a comparison of conditional distributions. The randomness measure φ — a symmetric, strictly concave function on probability vectors, e.g., entropy or negative variance — orders those distributions by spread. Condition 2 (non-decreasing randomness) requires φ(X_i | X_pa_i) ≤ φ(X_j | X_pa_j) for every edge i→j; Theorem 1 shows this monotonicity, together with the conditional-information inequality φ(X|Y) ≤ φ(X), makes the leaf's reciprocal score strictly maximal. A continuous-time discrete diffusion

Load-bearing premise

Everything rests on Condition 2: the randomness of a child's conditional distribution must never be smaller than its parent's — a monotonicity the paper admits is likely violated on several real-world networks, and for which the proposed checkable proxy is not yet backed by a sound proof.

What would settle it

Simulate a discrete SCM that explicitly enforces non-decreasing randomness on every edge and check whether the argmax criterion always selects a true leaf; a counterexample would refute Theorem 1. In parallel, recompute the asymptotic expansion in Proposition 1's proof (Appendix A.2, Eqs. 16–21) — the current derivation appears to contain an algebraic slip, so criterion (9) needs independent verification before Condition 2 can be certified from graph statistics alone.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

Share X Bluesky LinkedIn Reddit HN

If this is right

  • Recovering a valid topological order from categorical observations requires no additive-noise or functional-form assumption; the discrete score alone suffices.
  • The recovered order can be fed to existing structure learners such as PC, GAM, and GES, improving F1 and SID on most simulated and real-world settings in the paper.
  • The non-decreasing randomness condition subsumes and generalizes earlier non-decreasing-noise-variance identifiability conditions for additive noise models.
  • When the condition holds only locally, the experiments suggest that partially correct sub-orders still carry enough signal to improve downstream DAG recovery.
  • The method stabilizes with roughly 500 samples, so it is usable in moderate-data regimes; remaining error is attributed more to assumption violation than to estimation noise.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Boundary test (inference): construct a chain A→B→C in which the child is a deterministic function of the parent, so its conditional randomness is lower rather than higher; the criterion would then select the wrong leaf, marking the precise boundary of the theory.
  • Independent check (inference): the asymptotic expansion in Proposition 1's proof (Appendix A.2, Eqs. 16–21) appears to contain an algebraic slip, so criterion (9) should not yet be treated as a certified test of Condition 2 until the derivation is repaired and re-verified.
  • Extension (inference): the theorem's proof machinery does not fundamentally depend on discreteness beyond the score definition, so a tractable estimator for singleton conditional densities could plausibly carry the same leaf criterion to continuous or mixed data.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper proposes an ordering-based causal discovery method for discrete data. It defines a leaf-detection criterion based on the expected randomness, under a chosen measure φ, of the reciprocal singleton conditional p(X_i | X_{-i}). Theorem 1 states that, under a non-decreasing randomness condition along every directed edge, the leaf is exactly the variable maximizing E_{X_{-i}}[φ(p(X_i|X_{-i}))]; iterating this yields a topological order. The singleton conditionals are estimated with a continuous-time discrete diffusion model. The paper also provides a Dirichlet-based sufficient condition for the key assumption (Proposition 1), a variance-based instantiation (Corollary 1), a heuristic order-validity diagnosis, and experiments on synthetic and real-world discrete Bayesian networks, showing that the inferred orders can improve downstream PC/GES/GAM baselines.

Significance. If Theorem 1 is correct, the paper contributes a genuinely conditional identifiability result for full topological order recovery from discrete data without additive-noise assumptions, extending score-matching causal discovery to a setting where classical scores are undefined. The central derivation is structured as a clean conditional-information inequality with no fitted constants, and the authors provide code and extensive synthetic/real experiments. These are real strengths. However, two load-bearing supporting results are technically defective: Proposition 1's asymptotic expansion is wrong, and the variance functional used in Corollary 1 and in most experiments is not a valid randomness measure under the paper's own Definition 3. As a result, the claimed practical testability and the theoretical coverage of the empirical evaluation are currently unsupported. The central idea remains defensible, but the manuscript needs substantive revision.

major comments (4)
  1. [App. A.2, Eqs. (16)–(21)] The asymptotic expansion in Proposition 1 is algebraically incorrect. Expanding Eq. (16) to leading order in 1/α0 gives H(X_i|X_pa_i) ≈ log n_i − (n_i−1)K_i/(2α0). Substituting into ΔH_{i,j} yields, at leading order, log(n_j/n_i) + [K_i(n_i−1) − K_j(n_j−1)]/(2α0). The paper instead produces the extra term [(1+n_i)K_i − (1+n_j)K_j]/α0 in Eq. (19), leading to c(n) = (3n+1)/2. The correct coefficient is (n−1)/2. Therefore inequality (9) is not derived from Eq. (16) and the stated sufficient condition for Condition 2 is unsupported. Since Proposition 1 is the only analytical certification of the key condition, this is a load-bearing error.
  2. [§4, Corollary 1 and text before it] The variance functional Var(p)=Σ_k p_k(log p_k − μ)^2, μ=Σ_k p_k log p_k, is claimed to be Schur-convex because it is convex, and hence −Var is a valid randomness measure. This is false. For n=2, Var(0.99,0.01)=0.209 < Var(0.9,0.1)=0.435 although (0.99,0.01) majorizes (0.9,0.1), so Var is not Schur-convex. Consequently −Var is not Schur-concave and does not satisfy the conditional information inequality (10) that is essential to Theorem 1. A concrete failure: the equal mixture of (0.99,0.01) and (0.6,0.4) gives E[Var(X|Y)]=0.124 < Var(marginal)=0.2995, so E[−Var(X|Y)] > −Var(X). Thus Theorem 1 does not apply to Corollary 1. Since the experiments overwhelmingly use this variance measure, the reported experiments cannot be interpreted as validating the theorem.
  3. [§6 and App. C.3] The paper explicitly admits in Sec. 6 that Condition 2 'is likely violated' on Sachs and Insurance, and that the experiments intentionally do not enforce any randomness measure or exact monotonicity. This is acceptable for a robustness study, but the paper also claims to address the testability gap. The proposed diagnosis (App. C.3) is explicitly heuristic and non-definitive, and Proposition 1 — the only analytic check — is invalid as shown above. Once Corollary 1 is also removed, no correct, checkable sufficient condition for Condition 2 remains, and no experimental configuration is guaranteed to be in the theorem's regime. The paper should provide a correct verifiable condition (e.g., a repaired Dirichlet analysis or a different parametric family) or clearly re-label the empirical results as heuristic demonstrations not covered by Theorem 1.
  4. [App. A.1 and Algorithm 1] The proof of Theorem 1, as written, focuses on the full graph and then asserts the same argument works for any induced subgraph G[S]. The sequential leaf-peeling algorithm needs the criterion to hold on the remaining variables, where the conditioning set is X_{S\i}, not the original X_{-i}. The proof does not explicitly define pa_i, mb_i in the induced subgraph, nor verify that a leaf in G[S] satisfies E_{X_{S\l}}[φ(p(X_l|X_{S\l}))]=φ(X_l|X_pa_l) and that a non-leaf satisfies E_{X_{S\i}}[φ(p(X_i|X_{S\i}))]=φ(X_i|X_mb_i^S). This is likely repairable — parents of remaining nodes are unchanged and the Markov blanket in the induced subgraph contains the parents — but as written the sequential guarantee is not fully established. Please spell out the subgraph induction.
minor comments (4)
  1. [Theorem 1 statement] The statement 'X_j is a leaf ⇔ j = arg max_i ...' presumes uniqueness of the arg max. If multiple leaves attain the same maximum, each leaf is an arg max but not necessarily the unique one. The intended statement is likely 'j is a leaf ⇔ j ∈ arg max_i ...'. Please clarify tie handling.
  2. [§4, Proposition 1 setup] The notation in Eq. (8) is ambiguous: 'p(X_i | x_pa_i) ~ Dirichlet(α0/(n_i K_i) 1_{n_i})' should specify the vector length and the normalizing convention. Also, Condition 2 is stated with 'min_{j∈chi}' but what happens when ch_i=∅ is not stated explicitly in the definition; clarify that it applies only to nodes with children.
  3. [§5, choice of randomness measure] The text says the randomness measure is selected 'yielding the least risk of violations based on the proposed diagnosis,' but the diagnosis is only described in App. C.3 and its results are not shown for this selection. Since the variance measure is theoretically invalid, the measure-selection procedure needs to be reported transparently and preferably repeated with a valid measure.
  4. [Figure 1 and Tables] The main text reports only selected baselines and aggregated curves; error bars or standard deviations are not visible. Given the 10 random initializations, please add error bars to the figures or state that they were omitted for readability.

Circularity Check

0 steps flagged

No significant circularity: Theorem 1 is a conditional derivation from an explicit monotonicity assumption, not an equation-level reduction to its inputs.

full rationale

The central result (Theorem 1, App. A.1) takes Condition 2 (non-decreasing randomness along edges) as an antecedent and derives that leaves maximize E[phi(p(X_i|X_-i))] using the conditional-information inequality (10) that follows from concavity (Definition 3). Condition 2 is not defined as the conclusion 'leaf = argmax'; it is a separate property of local CPTs, and the theorem's converse direction relies on the same inequality plus monotonicity. No fitted parameter is renamed as a prediction; no self-citation is load-bearing; no known result is merely relabeled. Concerns raised by the skeptical review are correctness/verifiability issues, not circularity: Sec. 6 explicitly concedes Condition 2 may be violated on real data; App. A.2 Eqs. (16)-(21) contain a questionable algebraic expansion for Proposition 1; and the claim in Sec. 4 (Corollary 1) that Var(p)=sum p_k(log p_k - mu)^2 is Schur-convex is contradicted by the binary example (0.99,0.01) vs (0.9,0.1), so -Var is not established as a valid randomness measure. These would undermine the applicability or proof of the theorem, but they do not make the derivation equivalent to its inputs. The per-dataset selection of variance vs entropy via the in-degree diagnosis is transparent model selection, not a constructed prediction.

Axiom & Free-Parameter Ledger

4 free parameters · 7 axioms · 0 invented entities

No new physical entities are introduced. The central theorem is conditional on Condition 2; the only fitted ingredients in the method are the choice of randomness measure and the estimator hyperparameters. The diffusion estimator and the discrete score operator are adopted from prior literature.

free parameters (4)
  • Randomness measure φ = Variance for simulations, Insurance, Mildew; Shannon entropy for Earthquake, Sachs, Child, Alarm
    Chosen per dataset based on the proposed in-degree diagnosis (§5), i.e., selected using the test data; the leaf criterion argmax E[φ] depends on this choice.
  • Diffusion estimator hyperparameters = 300 epochs, 3000 time steps, lr=0.001, hidden units=2d
    Hand-chosen training configuration for the continuous-time discrete diffusion score estimator (App. B.1); accuracy of the estimated singleton conditionals, and hence the order, depends on these.
  • Independence-test threshold / pruning cutoffs = α=0.01 for χ² tests; cut-off 0.001 for GAM
    Hand-chosen thresholds in the order-validity diagnosis and edge-pruning post-processing (Sec. 5, App. C.3); affects final DAG quality.
  • Dirichlet equivalent sample size α0 = large but unspecified
    Parameter in Proposition 1's sufficient condition (8); the proposition only holds 'for sufficiently large α0', so the practical test requires choosing α0.
axioms (7)
  • domain assumption Standard SCM conditions: Markov property, no latent confounders, independent exogenous variables with strictly positive density (Sec 2.1)
    The factorization p(x)=∏ p(x_i|pa_i) and the Markov-blanket arguments in the proof of Theorem 1 (A.1) rely on these.
  • domain assumption Condition 1 (non-degeneracy): every conditional p(x_i|pa_i) is strictly positive
    Needed so reciprocal scores r_i are well-defined and the conditional-information inequality is strict (A.1, Eq 13).
  • ad hoc to paper Condition 2 (non-decreasing randomness): φ(X_i|pa_i) ≤ φ(X_j|pa_j) for every edge i→j
    The central identifiability assumption; Theorem 1 and the sequential leaf-peeling guarantee hold only under this monotonicity.
  • standard math Hickey's conditional information property: for a symmetric strictly concave φ, E[φ(X|Y)] ≤ φ(X), equality iff independence
    Used in Eq (10) and throughout the proof of Theorem 1; also requires φ to be a valid measure of randomness (Definition 3).
  • standard math Completeness of the marginalization operator M (Brook 1964, Lyu 2012)
    Justifies using singleton conditionals as a complete discrete 'score' (Sec 2.2).
  • domain assumption Consistency of the continuous-time discrete diffusion score estimator (Sun et al. 2022)
    Algorithm 1 (B.1) assumes the trained network solves the ratio-matching objective (29) accurately enough to identify the argmax; no sample-complexity or sequential error-propagation guarantee is given.
  • domain assumption Faithfulness for the order-validity diagnosis (Algorithm 2)
    The in-degree test treats each detected conditional dependence X_j ⊥̸⊥ X_i | S\{i} as a true edge; the paper notes 'conclusion is not definitive unless faithfulness is strongly assumed' (Sec 4, C.3).

pith-pipeline@v1.3.0-alltime-deepseek · 23948 in / 24549 out tokens · 206438 ms · 2026-08-03T08:38:38.018409+00:00 · methodology

0 comments
Cite this review

Pith. "Pith review of Ordering-based Causal Discovery via Generalized Score Matching." pith.science (2026). https://pith.science/paper/7PV22V3B

@misc{pith2026260116249,
  author       = {Pith},
  title        = {Pith review of: Ordering-based Causal Discovery via Generalized Score Matching},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7PV22V3B}},
  note         = {Machine review of arXiv:2601.16249}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Learning DAG structures from purely observational data remains a long-standing challenge across scientific domains. An emerging line of research leverages the score of the data distribution to initially identify a topological order of the underlying DAG via leaf node detection and subsequently performs edge pruning for graph recovery. This paper extends the score matching framework for causal discovery, which is originally designated for continuous data, and introduces a novel leaf discriminant criterion based on the discrete score function. Through simulated and real-world experiments, we demonstrate that our theory enables accurate inference of true causal orders from observed discrete data and the identified ordering can significantly boost the accuracy of existing causal discovery baselines on nearly all of the settings.

Figures

Figures reproduced from arXiv: 2601.16249 by Dinh Phung, Edwin V. Bonilla, He Zhao, Trung Le, Vy Vo.

Figure 1
Figure 1. Figure 1: Experiments with (top) ER graphs of 2d degree, (bottom) real-world networks on 10, 000 samples. 6 Results and Discussion It is worth emphasizing that our simulations are de￾liberately designed to be noisy, without enforcing any specific randomness measure or exact monotonicity in the true causal order. Likewise, the real-world settings provide no guarantee that Condition 2 holds, and even there is a substa… view at source ↗
Figure 2
Figure 2. Figure 2: Experiments on synthetic ER graphs of 4d degree. 5 10 15 20 d 0.00 0.05 0.10 0.15 0.20 0.25 0.30 0.35 SHD Dtop SCORE+PC PC SCORE+GAM GAM SCORE+BDeu GES-BDeu GES-BIC ORDCD 5 10 15 20 d 0.0 0.2 0.4 0.6 0.8 SID 5 10 15 20 d 0.0 0.2 0.4 0.6 0.8 1.0 F1 [PITH_FULL_IMAGE:figures/full_fig_p017_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Experiments on synthetic SF graphs of 2d degree. C.2 Sensitivity Analysis on Sample Size In Figures 5 to 11, we report the full experimental results on the real-world datasets where our methods are evaluated at varying sample sizes N ∈ {100, 500, 1000, 5000, 10000, 15000, 20000}. Meanwhile, the baseline performance is maximally fixed at N = 20000 for the ease of comparison. It can be seen that our performa… view at source ↗
Figure 4
Figure 4. Figure 4: Experiments on synthetic SF graphs of 4d degree. EQ (5) SA (11) CH (20) IS (27) MD (35) AL (37) 0.00 0.02 0.04 0.06 0.08 0.10 0.12 0.14 SHD SCORE+PC PC SCORE+GAM GAM SCORE+BDeu GES-BDeu EQ (5) SA (11) CH (20) IS (27) MD (35) AL (37) 0.0 0.2 0.4 0.6 0.8 1.0 SID EQ (5) SA (11) CH (20) IS (27) MD (35) AL (37) 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1.0 F1 [PITH_FULL_IMAGE:figures/full_fig_p018_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Experiments with real-world networks on 100 samples. EQ (5) SA (11) CH (20) IS (27) MD (35) AL (37) 0.00 0.02 0.04 0.06 0.08 0.10 0.12 0.14 SHD SCORE+PC PC SCORE+GAM GAM SCORE+BDeu GES-BDeu EQ (5) SA (11) CH (20) IS (27) MD (35) AL (37) 0.0 0.2 0.4 0.6 0.8 1.0 SID EQ (5) SA (11) CH (20) IS (27) MD (35) AL (37) 0.4 0.5 0.6 0.7 0.8 0.9 1.0 F1 [PITH_FULL_IMAGE:figures/full_fig_p018_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Experiments with real-world networks on 500 samples. C.3 Practical Diagnosis for Order Validity We now discuss a heuristic diagnosis for the correctness of a topological order estimated from an ordering-based causal discovery algorithm. The proposed approach mainly relies on (conditional) independence tests and some mild assumption about the sparsity of the underlying DAG G. Given an estimated ordering π, … view at source ↗
Figure 7
Figure 7. Figure 7: Experiments with real-world networks on 1, 000 samples. EQ (5) SA (11) CH (20) IS (27) MD (35) AL (37) 0.00 0.02 0.04 0.06 0.08 0.10 0.12 0.14 SHD SCORE+PC PC SCORE+GAM GAM SCORE+BDeu GES-BDeu EQ (5) SA (11) CH (20) IS (27) MD (35) AL (37) 0.0 0.2 0.4 0.6 0.8 1.0 SID EQ (5) SA (11) CH (20) IS (27) MD (35) AL (37) 0.4 0.5 0.6 0.7 0.8 0.9 1.0 F1 [PITH_FULL_IMAGE:figures/full_fig_p019_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Experiments with real-world networks on 5, 000 samples. EQ (5) SA (11) CH (20) IS (27) MD (35) AL (37) 0.00 0.02 0.04 0.06 0.08 0.10 0.12 0.14 SHD SCORE+PC PC SCORE+GAM GAM SCORE+BDeu GES-BDeu EQ (5) SA (11) CH (20) IS (27) MD (35) AL (37) 0.0 0.2 0.4 0.6 0.8 1.0 SID EQ (5) SA (11) CH (20) IS (27) MD (35) AL (37) 0.4 0.5 0.6 0.7 0.8 0.9 1.0 F1 [PITH_FULL_IMAGE:figures/full_fig_p019_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Experiments with real-world networks on 10, 000 samples. samples and rejecting the null hypothesis at a significance level of 0.01. Suppose the maximum in-degree of G is deg− max (i.e., every node has at most deg− max incoming edges), any node j with the estimated in-degree from π large than deg− max is thus potentially invalid in that a parent j might be placed later and/or a descendant of j might be plac… view at source ↗
Figure 10
Figure 10. Figure 10: Experiments with real-world networks on 15, 000 samples. EQ (5) SA (11) CH (20) IS (27) MD (35) AL (37) 0.00 0.02 0.04 0.06 0.08 0.10 0.12 0.14 SHD SCORE+PC PC SCORE+GAM GAM SCORE+BDeu GES-BDeu EQ (5) SA (11) CH (20) IS (27) MD (35) AL (37) 0.0 0.2 0.4 0.6 0.8 1.0 SID EQ (5) SA (11) CH (20) IS (27) MD (35) AL (37) 0.4 0.5 0.6 0.7 0.8 0.9 1.0 F1 [PITH_FULL_IMAGE:figures/full_fig_p020_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Experiments with real-world networks on 20, 000 samples. the correlation between Dtop and the in-degree distributions estimated from the topological orders given the knowledge of deg− max = 3. We here normalize Dtop over the maximal number of edges in DAGs of d 2  to remove the effect of graph size. A positive correlation can be observed in the illustration. We confirm this observation with Kernel-based … view at source ↗
Figure 12
Figure 12. Figure 12: (a) Illustration of the correlation between Dtop and the in-degree distribution given deg− max = 3 across various graph degrees. (b) p-values of KCI tests across sample sizes and hypotheses of deg− max. Ordering-based Causal Discovery This family of methods typically assume the (continuous) observational data is generated from an additive noise model. They first estimate a topological ordering of the caus… view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

77 extracted references · 9 linked inside Pith

  1. [1]

    Anderson, W. J. (2012). Continuous-time Markov chains: An applications-oriented approach . Springer Science & Business Media

    2012

  2. [2]

    Ban, T., Chen, L., Wang, X., Wang, X., Lyu, D., and Chen, H. (2024). Differentiable structure learning with partial orders. In The Thirty-eighth Annual Conference on Neural Information Processing Systems

    2024

  3. [3]

    Bello, K., Aragam, B., and Ravikumar, P. (2022). Dagma: Learning dags via m-matrices and a log-determinant acyclicity characterization. Advances in Neural Information Processing Systems , 35:8226--8239

    2022

  4. [4]

    Brook, D. (1964). On the distinction between the conditional probability and the joint probability approaches in the specification of nearest-neighbour systems. Biometrika , 51(3/4):481--483

    1964

  5. [5]

    Bruffaerts, N., De Smedt, T., Delcloo, A., Simons, K., Hoebeke, L., Verstraeten, C., Van Nieuwenhuyse, A., Packeu, A., and Hendrickx, M. (2018). Comparative long-term trend analysis of daily weather conditions with daily pollen concentrations in brussels, belgium. International journal of biometeorology , 62:483--491

    2018

  6. [6]

    B \"u hlmann, P., Peters, J., and Ernest, J. (2014). Cam: Causal additive models, high-dimensional order search and penalized regression. The Annals of Statistics , 42(6):2526--2556

    2014

  7. [7]

    Cai, R., Qiao, J., Zhang, K., Zhang, Z., and Hao, Z. (2018). Causal discovery from discrete data using hidden compact representation. Advances in neural information processing systems , 31

    2018

  8. [8]

    Campbell, A., Benton, J., De Bortoli, V., Rainforth, T., Deligiannidis, G., and Doucet, A. (2022). A continuous time framework for discrete denoising models. Advances in Neural Information Processing Systems , 35:28266--28279

    2022

  9. [9]

    Chao, C.-H., Sun, W.-F., Cheng, B.-W., Lo, Y.-C., Chang, C.-C., Liu, Y.-L., Chang, Y.-L., Chen, C.-P., and Lee, C.-Y. (2022). Denoising likelihood score matching for conditional score-based data generation. arXiv preprint arXiv:2203.14206

    Pith/arXiv arXiv 2022

  10. [10]

    Chen, W., Drton, M., and Wang, Y. S. (2019). On causal discovery with an equal-variance assumption. Biometrika , 106(4):973--980

    2019

  11. [11]

    Chickering, D. M. (1996). Learning bayesian networks is np-complete. Learning from data: Artificial intelligence and statistics V , pages 121--130

    1996

  12. [12]

    Chickering, D. M. (2002). Optimal structure identification with greedy search. Journal of machine learning research , 3(Nov):507--554

    2002

  13. [13]

    Chickering, M., Heckerman, D., and Meek, C. (2004). Large-sample learning of bayesian networks is np-hard. Journal of Machine Learning Research , 5:1287--1330

    2004

  14. [14]

    Cochran, W. G. (1952). The 2 test of goodness of fit. The Annals of mathematical statistics , pages 315--345

    1952

  15. [15]

    A., and Kocaoglu, M

    Compton, S., Greenewald, K., Katz, D. A., and Kocaoglu, M. (2022). Entropic causal inference: Graph identifiability. In International Conference on Machine Learning , pages 4311--4343. PMLR

    2022

  16. [16]

    Compton, S., Kocaoglu, M., Greenewald, K., and Katz, D. (2020). Entropic causal inference: Identifiability and finite sample results. Advances in Neural Information Processing Systems , 33:14772--14782

    2020

  17. [17]

    Cussens, J., Haws, D., and Studen \`y , M. (2017). Polyhedral aspects of score equivalence in bayesian network structure learning. Mathematical Programming , 164:285--324

    2017

  18. [18]

    Denton, B., Viapiano, J., and Vogl, A. (2007). Optimization of surgery sequencing and scheduling decisions under uncertainty. Health care management science , 10:13--24

    2007

  19. [19]

    and Honorio, J

    Ghoshal, A. and Honorio, J. (2018). Learning linear structural equation models in polynomial time and sample complexity. In International Conference on Artificial Intelligence and Statistics , pages 1466--1475. PMLR

    2018

  20. [20]

    Glymour, C., Zhang, K., and Spirtes, P. (2019). Review of causal discovery methods based on graphical models. Frontiers in genetics , 10:524

    2019

  21. [21]

    Heckerman, D., Geiger, D., and Chickering, D. M. (1995). Learning bayesian networks: The combination of knowledge and statistical data. Machine learning , 20:197--243

    1995

  22. [22]

    Hickey, R. J. (1982). A note on the measurement of randomness. Journal of Applied Probability , 19(1):229--232

    1982

  23. [23]

    Hickey, R. J. (1983). Majorisation, randomness and some discrete distributions. Journal of applied probability , 20(4):897--902

    1983

  24. [24]

    M., Peters, J., and Sch \"o lkopf, B

    Hoyer, P., Janzing, D., Mooij, J. M., Peters, J., and Sch \"o lkopf, B. (2008). Nonlinear causal discovery with additive noise models. Advances in neural information processing systems , 21

    2008

  25. [25]

    Hyv \"a rinen, A. (2007). Some extensions of score matching. Computational statistics & data analysis , 51(5):2499--2512

    2007

  26. [26]

    and Dayan, P

    Hyv \"a rinen, A. and Dayan, P. (2005). Estimation of non-normalized statistical models by score matching. Journal of Machine Learning Research , 6(4)

    2005

  27. [27]

    Kingma, D. P. (2014). Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980

    Pith/arXiv arXiv 2014

  28. [28]

    K., Constantinou, A

    Kitson, N. K., Constantinou, A. C., Guo, Z., Liu, Y., and Chobtham, K. (2023). A survey of bayesian network structure learning. Artificial Intelligence Review , 56(8):8721--8814

    2023

  29. [29]

    Kocaoglu, M., Dimakis, A., Vishwanath, S., and Hassibi, B. (2017). Entropic causal inference. In Proceedings of the AAAI Conference on Artificial Intelligence , volume 31

    2017

  30. [30]

    Lachapelle, S., Brouillard, P., Deleu, T., and Lacoste-Julien, S. (2019). Gradient-based neural dag learning. In International Conference on Learning Representations

    2019

  31. [31]

    and Turner, R

    Li, Y. and Turner, R. E. (2017). Gradient estimators for implicit models. arXiv preprint arXiv:1705.07107

    Pith/arXiv arXiv 2017

  32. [32]

    and Chan, L

    Liu, F. and Chan, L. (2016). Causal inference on discrete data via estimating distance correlations. Neural computation , 28(5):801--814

    2016

  33. [33]

    Lou, A., Meng, C., and Ermon, S. (2024). Discrete diffusion modeling by estimating the ratios of the data distribution. In Forty-first International Conference on Machine Learning

    2024

  34. [34]

    G., Moffa, G., and Kuipers, J

    Luo, X. G., Moffa, G., and Kuipers, J. (2021). Learning bayesian networks from ordinal data. Journal of Machine Learning Research , 22(266):1--44

    2021

  35. [35]

    Lyu, S. (2012). Interpretation and generalization of score matching. arXiv preprint arXiv:1205.2629

    Pith/arXiv arXiv 2012

  36. [36]

    W., Olkin, I., and Arnold, B

    Marshall, A. W., Olkin, I., and Arnold, B. C. (1979). Inequalities: theory of majorization and its applications

    1979

  37. [37]

    Meng, C., Choi, K., Song, J., and Ermon, S. (2022). Concrete score matching: Generalized score matching for discrete data. Advances in Neural Information Processing Systems , 35:34532--34545

    2022

  38. [38]

    M., Bloebaum, P., Kirschbaum, E., and Locatello, F

    Montagna, F., Faller, P. M., Bloebaum, P., Kirschbaum, E., and Locatello, F. (2024a). Score matching through the roof: linear, nonlinear, and latent variables causal discovery. arXiv preprint arXiv:2407.18755

    Pith/arXiv arXiv

  39. [39]

    Montagna, F., Mastakouri, A., Eulig, E., Noceti, N., Rosasco, L., Janzing, D., Aragam, B., and Locatello, F. (2024b). Assumption violations in causal discovery and the robustness of score matching. Advances in Neural Information Processing Systems , 36

  40. [40]

    Montagna, F., Noceti, N., Rosasco, L., and Locatello, F. (2023a). Shortcuts for causal discovery of nonlinear models by score matching. arXiv preprint arXiv:2310.14246

    Pith/arXiv arXiv

  41. [41]

    Montagna, F., Noceti, N., Rosasco, L., Zhang, K., and Locatello, F. (2023b). Causal discovery with score matching on additive models with arbitrary noise. In Conference on Causal Learning and Reasoning , pages 726--751. PMLR

  42. [42]

    Montagna, F., Noceti, N., Rosasco, L., Zhang, K., and Locatello, F. (2023c). Scalable causal discovery with score matching. In Conference on Causal Learning and Reasoning , pages 752--771. PMLR

  43. [43]

    Murphy, K. P. (2023). Probabilistic machine learning: Advanced topics . MIT press

    2023

  44. [44]

    and Mallick, B

    Ni, Y. and Mallick, B. (2022). Ordinal causal discovery. In Uncertainty in Artificial Intelligence , pages 1530--1540. PMLR

    2022

  45. [45]

    Olson, E. N. (2006). Gene regulatory networks in the evolution and development of the heart. Science , 313(5795):1922--1927

    2006

  46. [46]

    and Miyano, S

    Ott, S. and Miyano, S. (2003). Finding optimal gene networks using biological constraints. Genome Informatics , 14:124--133

    2003

  47. [47]

    Pearl, J. (2009). Causality . Cambridge university press

    2009

  48. [48]

    Peters, J., Janzing, D., and Sch \"o lkopf, B. (2010). Identifying cause and effect on discrete data using additive noise models. In Proceedings of the thirteenth international conference on artificial intelligence and statistics , pages 597--604. JMLR Workshop and Conference Proceedings

    2010

  49. [49]

    M., Janzing, D., and Sch \"o lkopf, B

    Peters, J., Mooij, J. M., Janzing, D., and Sch \"o lkopf, B. (2014). Causal discovery with continuous additive noise models

    2014

  50. [50]

    Qiao, J., Bai, Y., Cai, R., and Hao, Z. (2021). Learning causal structures using hidden compact representation. Neurocomputing , 463:328--333

    2021

  51. [51]

    Quine, M. P. and Robinson, J. (1985). Efficiencies of chi-square and likelihood ratio goodness-of-fit tests. The Annals of Statistics , pages 727--742

    1985

  52. [52]

    G., Lee, C

    Richens, J. G., Lee, C. M., and Johri, S. (2020). Improving the accuracy of medical diagnosis with causal machine learning. Nature communications , 11(1):3923

    2020

  53. [53]

    Rolland, P., Cevher, V., Kleindessner, M., Russell, C., Janzing, D., Sch \"o lkopf, B., and Locatello, F. (2022). Score matching enables causal discovery of nonlinear additive noise models. In International Conference on Machine Learning , pages 18741--18753. PMLR

    2022

  54. [54]

    A., and Nolan, G

    Sachs, K., Perez, O., Pe'er, D., Lauffenburger, D. A., and Nolan, G. P. (2005). Causal protein-signaling networks derived from multiparameter single-cell data. Science , 308(5721):523--529

    2005

  55. [55]

    Q., and Tsaftaris, S

    Sanchez, P., Liu, X., O'Neil, A. Q., and Tsaftaris, S. A. (2022). Diffusion models for causal discovery via topological ordering. arXiv preprint arXiv:2210.06201

    Pith/arXiv arXiv 2022

  56. [56]

    Schwarz, G. (1978). Estimating the dimension of a model. The annals of statistics , pages 461--464

    1978

  57. [57]

    J., Buschur, K., Shi, I., Ramsey, J

    Sedgewick, A. J., Buschur, K., Shi, I., Ramsey, J. D., Raghu, V. K., Manatakis, D. V., Zhang, Y., Bon, J., Chandra, D., Karoleski, C., et al. (2019). Mixed graphical models for integrative causal analysis with application to chronic lung disease diagnosis and prognosis. Bioinformatics , 35(7):1204--1212

    2019

  58. [58]

    and Ermon, S

    Song, Y. and Ermon, S. (2019). Generative modeling by estimating gradients of the data distribution. Advances in neural information processing systems , 32

    2019

  59. [59]

    Song, Y., Garg, S., Shi, J., and Ermon, S. (2020). Sliced score matching: A scalable approach to density and score estimation. In Uncertainty in Artificial Intelligence , pages 574--584. PMLR

    2020

  60. [60]

    and Glymour, C

    Spirtes, P. and Glymour, C. (1991). An algorithm for fast recovery of sparse causal graphs. Social science computer review , 9(1):62--72

    1991

  61. [61]

    N., Scheines, R., and Heckerman, D

    Spirtes, P., Glymour, C. N., Scheines, R., and Heckerman, D. (2000). Causation, prediction, and search . MIT press

    2000

  62. [62]

    Sun, H., Yu, L., Dai, B., Schuurmans, D., and Dai, H. (2022). Score-based continuous-time discrete diffusion models. arXiv preprint arXiv:2211.16750

    Pith/arXiv arXiv 2022

  63. [63]

    and Koller, D

    Teyssier, M. and Koller, D. (2012). Ordering-based search: A simple and effective algorithm for learning bayesian networks. arXiv preprint arXiv:1207.1429

    Pith/arXiv arXiv 2012

  64. [64]

    Tsagris, M., Borboudakis, G., Lagani, V., and Tsamardinos, I. (2018). Constraint-based causal discovery with mixed data. International journal of data science and analytics , 6:19--30

    2018

  65. [65]

    Vincent, P. (2011). A connection between score matching and denoising autoencoders. Neural computation , 23(7):1661--1674

    2011

  66. [66]

    J., Camgoz, N

    Vowels, M. J., Camgoz, N. C., and Bowden, R. (2022). D’ya like dags? a survey on structure learning and causal discovery. ACM Computing Surveys , 55(4):1--36

    2022

  67. [67]

    Wang, Y., Liang, D., Charlin, L., and Blei, D. M. (2020). Causal inference for recommender systems. In Proceedings of the 14th ACM Conference on Recommender Systems , pages 426--431

    2020

  68. [68]

    Wenjuan, W., Lu, F., and Chunchen, L. (2018). Mixed causal structure discovery with application to prescriptive pricing. In Proceedings of the 27th International Joint Conference on Artificial Intelligence , pages 5126--5134

    2018

  69. [69]

    Wood, S. N. (2017). Generalized additive models: an introduction with R . chapman and hall/CRC

    2017

  70. [70]

    Xu, Z., Li, Y., Liu, C., and Gui, N. (2024). Ordering-based causal discovery for linear and nonlinear relations. In The Thirty-eighth Annual Conference on Neural Information Processing Systems

    2024

  71. [71]

    Yu, Y., Chen, J., Gao, T., and Yu, M. (2019). Dag-gnn: Dag structure learning with graph neural networks. In International Conference on Machine Learning , pages 7154--7163. PMLR

    2019

  72. [72]

    Zhang, K., Peters, J., Janzing, D., and Sch \"o lkopf, B. (2011). Kernel-based conditional independence test and application in causal discovery. In Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence , pages 804--813

    2011

  73. [73]

    Zheng, X., Dan, C., Aragam, B., Ravikumar, P., and Xing, E. (2020). Learning sparse nonparametric dags. In International Conference on Artificial Intelligence and Statistics , pages 3414--3425. Pmlr

    2020

  74. [74]

    Zhu, Z., Locatello, F., and Cevher, V. (2024). Sample complexity bounds for score-matching: causal discovery and generative modeling. Advances in Neural Information Processing Systems , 36

    2024

  75. [75]

    @esa (Ref

    \@ifxundefined[1] #1\@undefined \@firstoftwo \@secondoftwo \@ifnum[1] #1 \@firstoftwo \@secondoftwo \@ifx[1] #1 \@firstoftwo \@secondoftwo [2] @ #1 \@temptokena #2 #1 @ \@temptokena \@ifclassloaded agu2001 natbib The agu2001 class already includes natbib coding, so you should not add it explicitly Type <Return> for now, but then later remove the command n...

  76. [76]

    \@lbibitem[] @bibitem@first@sw\@secondoftwo \@lbibitem[#1]#2 \@extra@b@citeb \@ifundefined br@#2\@extra@b@citeb \@namedef br@#2 \@nameuse br@#2\@extra@b@citeb \@ifundefined b@#2\@extra@b@citeb @num @parse #2 @tmp #1 NAT@b@open@#2 NAT@b@shut@#2 \@ifnum @merge>\@ne @bibitem@first@sw \@firstoftwo \@ifundefined NAT@b*@#2 \@firstoftwo @num @NAT@ctr \@secondoft...

  77. [77]

    @open @close @open @close and [1] URL: #1 \@ifundefined chapter * \@mkboth \@ifxundefined @sectionbib * \@mkboth * \@mkboth\@gobbletwo \@ifclassloaded amsart * \@ifclassloaded amsbook * \@ifxundefined @heading @heading NAT@ctr thebibliography [1] @ \@biblabel @NAT@ctr \@bibsetup #1 @NAT@ctr @ @openbib .11em \@plus.33em \@minus.07em 4000 4000 `\.\@m @bibit...