- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes CAGI, a graph-based tabular imputation method that represents columns as nodes in a shared graph. CAGI estimates latent correlations under a Gaussian copula framework, employing rank-based, polyserial, and polychoric estimators to accommodate mixed-type columns. The model then constructs a graph using the resulting partial correlations. CAGl uses distinct source and target maps for each column using a bidirectional diffusion operator based on the CSNN (Column-wise Shared Neural Network) architecture.
Critical strengths
S1. The empirical results are consistent. CAGI ranks first in all averaged cells of Table 1 across nine datasets and diverse settings.
S2. The paper is clearly written and easy to follow.
S3. Estimating the graph with a Gaussian copula and polyserial / polychoric correlations is an interesting way to handle mixed-type columns without assuming a common marginal distribution.
Critical weaknesses
W1. I am not entirely convinced of the novelty. To me, the proposed formulation resembles a standard sheaf diffusion network, specifically CSNN (Ribeiro et al., 2026), applied with columns as nodes. Approaches that interpret columns as a graph structure already exist, such as GRAPE and BCGNN. Isn’t this an extension of that concept using sheaves? If so, what is tabular-specific in the design beyond applying CSNN?
W2. It is not clear why the sufficiency of the "conditional neighborhood" in Theorem 3 applies to the imputation setting. Theorem 3 assumes all other variables are observed, whereas in practice, one can condition only on observed variables. For instance, in a chain 1–2–3, variables 1 and 3 are conditionally independent given 2, so there is no edge between 1 and 3 in the conditional graph. However, if variable 2 is missing, variable 1 becomes directly necessary for predicting variable 3. As the missingness rate increases, these scenarios become more frequent, shifting the dependency structure required for imputation from the conditional graph toward the marginal graph.
I think multi-hop diffusion may indirectly propagate information through masked nodes, yet the paper does not empirically verify this.
W3. The experimental evidence supporting the conditional graph is weak. In Table 2, the conditional graph shows an MAE only 1.16% lower than that of a marginal-correlation graph with the same number of edges. Moreover, this result is obtained under the MCAR 30% setting, which is the most favorable scenario for the conditional graph. Following the logic in W2, the margin may shrink further at 50% and 70% missingness, where the marginal graph becomes relatively more significant. Furthermore, Gaussian copula imputation (Zhao & Udell, KDD 2020)—which employs a latent model similar to the one used for graph construction—would serve as a natural baseline, yet it is absent from the comparison.
Questions for authors
Q1. Could you report the graph ablation of Table 2 (conditional vs. marginal, complete, and random graphs) at MCAR 50% and 70%? It would be nice to run it over multiple seeds. In addition, how does CAGI compare with Gaussian copula imputation (Zhao & Udell, KDD 2020)?
Q2. Section 3.2 defines and as parameters learned for each column. However, the ablation study in Figure 4 replaces these maps with identity mappings. This does not merely remove column specificity; it effectively eliminates the learned transport mechanism entirely. To isolate the specific effect of column-specific maps, could you provide a comparison with a case where all columns share the same map—which is still learned during training (i.e., and )?
10 comments
Rebuttal Part 2: W1
3. An imputation-oriented theoretical analysis.
Another distinction from directly applying a general-purpose sheaf network is that our theoretical analysis is formulated around the statistical imputation objective. We study two complementary questions: (i) when the conditional neighborhood of a target column contains sufficient information for reconstructing that column, and (ii) when the graph propagation representation preserves sufficient information for Bayes-optimal imputation. This connects the graph construction and representation propagation to the information required by the reconstruction task, rather than analyzing diffusion only in terms of generic graph-learning properties.
In summary, we agree with the reviewer that CAGI builds upon existing ideas in column-based graph modeling and CSNN-style sheaf diffusion. We will make this relationship explicit and sharpen our novelty claims accordingly. The contribution of CAGI lies in the imputation-specific integration of conditional dependency modeling, heterogeneous column representation alignment, and masked cell reconstruction, together with a theoretical analysis of the information conditions required for effective imputation. We believe this distinction is important: the proposed framework is not intended as a new general sheaf architecture, but as a principled graph-based approach tailored to the statistical structure and reconstruction objective of heterogeneous tabular data.
Rebuttal Part 3: W2
W2: Mask-dependent Predictive Neighborhoods and Multi-hop Information Propagation
We thank the reviewer for this insightful comment. We agree that the sufficiency of the conditional neighborhood in Theorem 3 should not be directly interpreted as sufficiency for arbitrary missingness patterns. The reviewer’s chain example precisely illustrates an important distinction between the conditional dependency structure under complete observation and the predictive dependencies induced by a particular missingness pattern. We clarify this distinction and explain how our mask-aware theoretical analysis and multi-hop graph diffusion address this issue.
1. Conditional neighborhoods versus mask-dependent predictive neighborhoods.
Theorem 3 establishes that, under the Markov assumption and complete observation of the remaining variables, the conditional distribution of a target variable () depends only on its conditional neighborhood (). It does not imply that () remains sufficient when some of its members are missing.
Consider the chain (1-2-3). Under the Markov property, we have
.
When () is observed, it is sufficient to condition on () when predicting (), and () provides no additional information. However, when () is missing, the relevant conditional distribution becomes
,
which generally depends on (). Thus, () can become informative for predicting () after marginalizing over the missing intermediate variable.
This observation does not imply that the conditional dependency graph should be replaced by a marginal correlation graph. Rather, it shows that the set of variables sufficient for prediction is mask-dependent and may extend beyond the original one-hop conditional neighborhood. In particular, marginal association between two variables does not necessarily identify a direct conditional dependency; using it as the graph structure may introduce edges that do not represent direct dependencies in the underlying distribution.
2. How our mask-aware formulation addresses this issue.
We explicitly distinguish the conditional neighborhood () in Theorem 3 from the mask-aware predictive neighborhood () introduced in Definition 10. The latter is defined with respect to the information actually observed under mask ():
.
Equivalently, the observed variables in (), together with the graph and mask, are sufficient for the conditional distribution of the target cell.
For the chain example, when node 2 is masked and nodes 1 and 3 are observed, node 1 may belong to (), even though (). This formulation therefore accounts for the additional predictive information induced by marginalizing over missing intermediate variables, rather than assuming that the original conditional neighborhood is sufficient under every mask.
3. Why multi-hop diffusion can access information through masked intermediate nodes.
This mask-dependent predictive neighborhood also motivates our graph diffusion analysis. Definition 11 introduces the graph coverage condition, which requires the predictive neighborhood to be contained in the target node's receptive field:
.
As established by Lemma 12, each diffusion layer can propagate information by at most two graph hops. Consequently, in the chain example, information from node 1 can reach node 3 through node 2 even when the value of node 2 is masked. The masked cell does not remove node 2 from the graph or prevent its representation from receiving messages. Instead, node 2 can aggregate information from its observed neighbors and subsequently transmit the updated representation to node 3.
Importantly, this is an information propagation mechanism, not an assumption that the missing value at node 2 has been observed or reconstructed perfectly. Whether the relevant information is retained in the intermediate and target representations is addressed separately by the representation-sufficiency condition in Theorem 13. Theorem 14 further decomposes the excess imputation risk into representation information loss and decoder approximation error. Thus, graph coverage ensures that the required information is structurally accessible, while the representation and decoder conditions characterize whether it can be preserved and used for reconstruction.
Rebuttal Part 1: W1
We thank the reviewer for the constructive comments and suggestions.
W1: Clarifying the Novelty beyond Existing Graph and Sheaf Diffusion Methods
We thank the reviewer for raising this important concern. We agree that neither representing columns as graph nodes nor using sheaf-based diffusion is, by itself, a novel contribution of our work. We also acknowledge the close connection between our propagation mechanism and Cooperative Sheaf Neural Networks (CSNN; Ribeiro et al., 2026). In particular, CAGI adopts the source/target transformation principle and the associated bidirectional sheaf diffusion formulation introduced in CSNN. We will revise the manuscript to make this relationship explicit and avoid presenting the underlying sheaf diffusion mechanism as an independent methodological novelty.
Our contribution, however, is not simply to apply CSNN to a graph whose nodes correspond to table columns. Rather, CAGI develops an imputation-oriented framework in which the dependency structure, information propagation, and reconstruction objective are designed together. We clarify the distinctions below.
1. Modeling conditional dependencies rather than merely constructing a graph over columns.
Existing graph-based approaches have explored different graph representations for incomplete tabular data. For example, GRAPE represents observations and features as two types of nodes in a bipartite graph, with observed values as edge attributes, and formulates imputation as edge-level prediction. BCGNN further investigates feature interdependencies through a graph-based formulation. We agree that these works establish the relevance of graph structures for tabular missing-data problems.
CAGI focuses on a different aspect of the problem: which inter-column relationships should guide the reconstruction of a missing value? Pairwise marginal correlations can reflect indirect associations mediated by other variables, rather than direct conditional dependencies. Consequently, a graph constructed directly from marginal correlations may introduce edges that do not represent direct conditional relationships relevant to reconstruction.
To address this issue, CAGI estimates a latent correlation matrix for heterogeneous columns using a rank-based estimator, and then estimates a sparse precision matrix to construct a conditional dependency graph. Under the Gaussian latent-variable formulation, the nonzero off-diagonal entries of the precision matrix characterize conditional dependencies. Thus, the graph is intended to encode direct statistical dependencies among columns rather than simply their pairwise marginal associations. Importantly, this graph is shared across rows, while each row provides a distinct set of node features on the same column graph.
This graph construction is not a new sheaf-theoretic contribution; its role is to provide an imputation-oriented information structure that is not specified by a generic sheaf diffusion architecture.
2. Adapting information propagation to heterogeneous tabular variables and cell-wise reconstruction.
We acknowledge that the source/target conformal transformations and bidirectional diffusion in CAGI are closely related to CSNN. We do not claim to introduce a new general-purpose sheaf diffusion operator. Instead, CAGI uses this propagation principle to address a specific challenge in tabular imputation: different columns represent heterogeneous variables, whose values may have different domains, distributions, and semantics.
Accordingly, CAGI employs column-wise feature encoders to map numerical and categorical values into column-specific representation spaces. The source and target transformations then allow information to be communicated across these heterogeneous spaces, rather than imposing a single shared transformation on all columns. The propagation is performed on the shared conditional dependency graph, with row-specific node representations and missingness information. Finally, CAGI uses a masked reconstruction objective and column-specific reconstruction heads to recover missing cell values.
Therefore, the role of the sheaf-based mechanism in CAGI is not merely to improve generic graph representation learning. It provides a structured means of aligning and communicating information between heterogeneous variables within a cell-level reconstruction framework.