- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper explores a new perspective on causal discovery. Conventional causal discovery methods are primarily based on conditional independence tests (CITs), score optimization, or assumptions about specific functional causal models. In contrast, this paper proposes a new causal discovery method based on the idea of artificially decoupling dependencies among variables through sample reweighting. The proposed method first selects a target variable and assigns sample weights to the remaining variables so that they become mutually independent. Variables that remain dependent on the target variable after reweighting are then identified as belonging to the target variable’s Markov Boundary (MB). The method subsequently exploits the structural asymmetry in how the MB changes for parent/child variables versus spouse variables to determine causal relationships among the nodes.
The paper theoretically establishes the validity of MB identification under the assumptions of Strict Positivity and Weighting Faithfulness. It further shows that Weighting Faithfulness holds almost everywhere over an appropriate weight space. To learn the sample weights in practice, the method minimizes the sum of weighted HSIC values over all pairs of non-target variables. Experiments on synthetic data demonstrate that the proposed method can recover causal structures more robustly than several representative existing causal discovery methods, particularly in settings with high levels of noise.
Critical strengths
The primary strength of this paper is that it proposes a novel approach to causal discovery based on artificially decoupling dependencies among variables through reweighting, which is fundamentally different from major existing causal discovery paradigms based on conditional independence tests (CITs), score optimization, or assumptions about specific functional causal models. The paper further provides a theoretical foundation for its key MB identification mechanism, showing that it is valid under the assumptions of Strict Positivity and Weighting Faithfulness. This theoretical analysis substantially strengthens the main methodological contribution.
Another important strength is the empirical demonstration that the proposed method achieves more robust causal structure estimation than representative existing causal discovery methods, particularly under high-noise conditions. This provides useful empirical evidence of a distinctive practical advantage of the proposed approach.
Critical weaknesses
The proposed causal discovery perspective is highly interesting, and the paper is commendable for establishing identifiability under two explicit assumptions. However, a major limitation is that the practical optimization of the weights used to make the non-target variables mutually independent relies on the heuristic minimization of the sum of pairwise weighted HSIC values. The paper does not sufficiently analyze how well this optimization actually achieves the required mutual independence among the non-target variables, nor how deviations from ideal decoupling affect Markov boundary identification and, ultimately, causal discovery accuracy. A deeper analysis of this connection would substantially improve the clarity and technical completeness of the paper.
In addition, I understand that the main contribution of this work is to introduce a fundamentally different perspective from major existing causal discovery approaches. However, the motivation remains somewhat unclear in terms of what specific limitations of existing causal discovery methods the proposed approach is intended to overcome, and which components of the proposed method are responsible for these advantages. The experiments empirically show that the method is particularly robust in high-noise settings, but the paper does not clearly explain why the proposed method exhibits this robustness or which aspect of the method contributes to it. A deeper discussion of these points would help clarify the practical regimes in which this interesting approach should be preferred over existing methods.
Questions for authors
-
Can the authors discuss how much the use of minimizing the sum of weighted HSIC values affects performance compared with the ideal case in which optimal decoupling weights can be obtained?
-
Can the authors discuss which components of the proposed method address which limitations of existing causal discovery approaches, particularly how and why these components contribute to robustness in high-noise settings?
3 comments
Thank you for your detailed response and for conducting the additional experiments using dHSIC. This result has partially addressed my concerns. I also appreciate the explanation of the challenges involved in directly learning from a finite sample. I recommend that the authors incorporate these additional experiments into the paper and discuss the difficulty of evaluating the quality of the learned decoupling weights. With these additions, I believe my primary concerns will be sufficiently resolved. As I was already leaning toward acceptance, I will maintain my current rating.
Thank you for your appreciation. We have incorporated these additional experiments into the revised manuscript (Appendix C.1), and added the discussion of the difficulty (Appendix D).
Thank you again for your time and valuable feedback, which has significantly enhanced our manuscript.
Response to Reviewer ywLn
We sincerely appreciate your recognition of our novel causal discovery perspective and theoretical foundation. Below, we provide detailed responses to your comments. If anything remains unclear or if you have further questions, please do not hesitate to let us know.
Thank you for this insightful question. At the population level, for a non-degenerate continuous distribution, there can be infinitely many weight functions that satisfy the decoupling condition. However, at the finite-sample estimation level, we do not have access to the ground truth of the decoupling weights and can only perform unsupervised learning based on statistical objectives. Even if certain metrics of distributional decoupling are optimized to their optimum, these metrics are still sample-based estimators, which means their corresponding true population values fail to guarantee simultaneous optimality (even when the estimators are unbiased). Therefore, it is inherently difficult to directly compare against the optimal decoupling weights given a finite dataset.
To further investigate this, we conducted an additional comparative experiment by optimizing the joint independence objective (dHSIC) of the weighted data (under the same setting as Section 4.1 Func, d=10, with all optimization and testing hyperparameters fixed; added in the revised manuscript, Appendix C.1):
As shown above, the performance gap is not substantial, indicating that our decoupling strategy remains highly effective.
In summary, while different finite-sample estimation methods can serve our decoupling objective, it remains challenging to measure how close an empirical estimate is to the true population-level optimal decoupling. How to better learn decoupling weights in practice is a crucial and promising future research direction, not only for our method, but also for related fields in causal inference.
Thank you for raising this important question. We believe the robustness of our method to high noise stems from the following estimation dynamics:
First, suppose we were given an ideal set of sample weights with a high effective sample size (ESS) that perfectly decouples the true population distribution. In that case, MB identification would become a very straightforward problem. Consequently, most of the estimation error in our current method likely arises from the imperfections in the learned decoupling weights. Specifically (as discussed in the Sample selection paragraph of Appendix C / revised PDF Appendix D), learning decoupling weights is essentially performing sample selection. This reduces the effective sample size and can lead to potential information loss over the support, ultimately introducing estimation error.
However, noise can actually be beneficial in mitigating this specific issue (as discussed in the Noise paragraph of Appendix C / revised PDF Appendix D). An intuitive example is a nearly deterministic system: the probability mass of the decoupled distribution collapses almost onto a single point, causing high-weight samples to cluster tightly together and fail to provide sufficient variation to detect dependencies. In contrast, higher noise spreads the distribution more evenly across the space. As a result, the learned decoupled distribution covers a broader support, making genuine dependencies much easier to detect.
Therefore, while higher noise generally makes standard statistical estimation harder for most methods, it actually facilitates the decoupling weight learning phase in our framework. The interplay between these two competing effects explains why our method demonstrates effectiveness under high-noise regimes.