- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposes a simple method to fix functional dependency (FD) violations in synthetic tabular data (an FD X --> Y between two sets of attributes X and Y means that X uniquely determines Y). The approach consists of traversing the FDs of the table in topological order and replacing the dependent value (Y) with the correct value. For cases where the determinant's value (X) has not been observed in the training data, a separately trained conditional generative model is used to sample Y conditioned on X. Unsurprisingly, this approach yields higher consistency rates than with unprocessed data.
Critical strengths
The problem the paper addresses is practically interesting, and the solution is simple and seems to work, but I found no critical strengths that would support acceptance at venues like ICLR.
Critical weaknesses
The proposed method is extremely simple and straightforward. The core idea is a post-processing algorithm that can be applied to synthetic data. While the method trains an additional conditional generative model, it does not introduce any new insights of interest to machine learning research.
Questions for authors
The following questions are clarification requests:
- Can the authors elaborate on [... FDs ... cannot be easily formulated or guaranteed by tabular generative objectives.] (L15-16)?
- In L71-72, the authors say that after repairing a tuple for one FD, the determinant of the second FD also changes, which might create an unseen determinant for the second FD. However, couldn't it also be the case that the determinant A of the first FD is unseen since it is generated by the generative model?
- For an FD A --> B, can one simply remove column B in a pre-processing step, train the generative model on the resulting table, then add it back based on generated values in A? How does this relate to the proposed approach?
3 comments
Response to Reviewer 8QBa (2/2)
Q2. Can the determinant of the first FD already be unseen because it is generated by the base model, rather than introduced by an earlier repair?
Yes. This is the native-unseen case explicitly handled in Section 4.1 and Algorithm 2 (Lines 16--19).
SynFD distinguishes two types of unseen determinant configurations. For native-unseen configurations, the determinant is absent from the reference mapping but has not been modified by earlier repairs. SynFD retains the jointly generated dependent value and stores it in the mapping table for consistent reuse.
For repair-induced unseen configurations, an upstream repair changes the determinant, so the original dependent value may no longer match the updated context. SynFD instead uses MCGEN for conditional completion and stores the generated value for subsequent reuse.
Q3. Could FD-dependent columns simply be removed before generation and reconstructed afterward using the determinant values?
For a single FD with a complete reference mapping, this is a reasonable approach. However, it faces two challenges.
First, predefined mappings cannot directly determine dependent values for unseen determinant combinations. For example, given , a generator may produce an unseen combination even when both attributes have been individually observed.
Second, interacting FDs require coordinated reconstruction. For and , reconstructing may create an unseen configuration, for which mapping lookup alone cannot determine .
SynFD handles these cases through DAG-guided repair, dynamic mapping updates, and selective conditional completion (Sections 4.1--4.2), while retaining jointly generated values whenever possible.
We also evaluate this alternative using an HFGF-style reconstruction baseline with the same base generator (Table 4 and Appendix D.1). It reconstructs dependent attributes through mapping lookup and uses empirical sampling for unseen configurations. SynFD achieves higher average Trend (0.799 vs. 0.759) and -Precision (0.875 vs. 0.825).
Thank you for answering my questions; that clarifies things.
However, my main concern regarding the paper's contribution still holds, and the rebuttal only summarized it. Therefore, I maintain my score.
Response to Reviewer 8QBa (1/2)
We thank the reviewer for the constructive feedback. We address the concerns below and will incorporate the additional results and clarifications into the revised manuscript.
W1. The proposed method appears to be a straightforward post-processing procedure, and the additional conditional generative model provides limited methodological insight.
We respectfully disagree. As discussed in Section 5.2, the challenge is to enforce FD constraints without substantially degrading distributional fidelity and downstream utility. SynFD addresses this through theoretical analysis, DAG-guided repair, and empirical validation.
Theoretical characterization: Section 3 formalizes exact FD preservation under probabilistic generation. Proposition 1 shows that learning a deterministic relationship does not necessarily recover the reference FD mapping, highlighting the distinction between statistical dependency learning and exact FD preservation.
Algorithmic design: Interacting FDs require more than independent mapping corrections. Consider A→B and (B,D)→C. Repairing B may introduce an unseen downstream determinant (B,D), for which the original C may no longer match the repaired context. SynFD addresses this through DAG-guided repair and dynamic mapping updates (Sections 4.1--4.2). It handles three cases: (i) known configurations through reference mapping lookup, (ii) native-unseen configurations by retaining jointly generated values, and (iii) repair-induced unseen configurations through conditional completion. This avoids reconstructing dependent attributes unnecessarily.
Empirical validation: SynFD improves average FD-valid retention from 54.21% to 98.40% and reference-mapping agreement from 87.39% to 99.77%.
We also compare against HFGF-style reconstruction using the same base generator. This baseline reconstructs dependent attributes through mapping lookup and uses empirical random assignment for unseen configurations. SynFD instead selectively repairs jointly generated tuples, achieving higher average Trend (0.799 vs. 0.759) and α-Precision (0.875 vs. 0.825). On Hospital, which contains 154 FDs, Trend improves from 0.421 to 0.623.
Q1. Why cannot exact FDs be easily formulated or guaranteed by conventional tabular generative objectives (L15--16)?
Section 3 shows that exact FD preservation requires the dependent attribute to agree with the reference mapping with probability one for every determinant configuration with positive generated probability. While FD constraints can be explicitly formulated, conventional generative objectives focus on approximating the joint distribution and do not guarantee this requirement.
Proposition 1 further shows that even a deterministic relationship may differ from the reference FD mapping. Thus, learning statistical dependencies alone does not guarantee exact FD preservation, as also reflected in the FD violations reported in Table 1.
This motivates SynFD's DAG-guided repair framework, which explicitly handles interacting FD constraints while retaining jointly generated values whenever possible.