- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes MC and MC-max for missing-cell completion in relational tables. Both models use paths from known values to possible completions. MC adds the path contributions. MC-max uses the largest path contribution. The paper gives Datalog rules with the same outputs as each model. It also gives a separate method for explaining MC outputs on a fixed database. The analysis covers expressive power and rule extraction cost. The tests use tabular data and binary relations. The test data include values not seen during training.
Critical strengths
The extracted global rules give the same completions as the models. The guarantee holds on every database at matching prediction and extraction thresholds. The paper also gives a separate extraction method for MC on a fixed database. Its completeness guarantee applies only to that database.
The proposed models achieve the highest reported mean accuracy and PR-AUC on each tabular dataset. The best settings vary by dataset and metric. The models do not lead on every metric. MC-max also extracts rules quickly in the reported tests.
Critical weaknesses
Both models build on earlier path-based rule learning. They extend this approach to higher-arity tables through pairs of column values. I find the added modeling contribution over prior faithful rule learning unclear.
The tests compare the models with hypergraph methods and LLMs. They omit closely related faithful rule-learning methods. The gains over earlier interpretable methods remain unclear.
Questions for authors
I would appreciate the authors' responses to the following points.
-
The extension gives faithful rules for higher-arity tables. Its paths still use pairs of column values. The added modeling power over rule learning on binary projections with column labels is not clear to me.
-
The binary tests compare only MC and MC-max. How do these models compare with earlier faithful rule learners in prediction quality and rule complexity?
-
The models pool evidence across observed columns with shared transition weights. Does this limit their use of source column roles in the tested tasks?
Thank you for the detailed response, the new example in Section 3.1, and the extra comparison in Table 11. These updates help clarify how the model works. However, I still have strong reservations about the overall contribution. I agree with Reviewer 5asF's assessment that the modeling advance over prior faithful rule-learning methods remains quite incremental.
Breaking high-arity tables down into pairwise column connections loses joint tuple information. Even in Table 2, most of the learned rules are still simple binary patterns. Summing paths from multiple cells in a row is a natural step, yet it feels like a modest extension compared to the heavy formalism used to present it.
There is also a clear gap between the theory and practical utility. Your response confirms that extracting the universal rule set for MC is too expensive to run in practice. To get around this, you fall back on database-specific rules, which lose global interpretability. Alternatively, MC-max allows fast extraction, but it drops the multi-cell summation that makes the model different from single-source methods in the first place.
Finally, the empirical validation remains incomplete. The evaluation still relies only on balanced candidate verification rather than full-space completion. In Table 11, tuning the rank for your models while comparing against baselines with a fixed rank also makes the comparison less direct, and the claimed benefits for data auditing remain untested.
While the theoretical proofs are sound, the practical and modeling gains are too limited for acceptance. I will therefore maintain my original score of 2.