- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
KASS is a -anonymity-aware sequential sampling framework that does not require training of generative models. It gradually samples from the empirical conditional distributions of the original data in random column order, and removes candidate values with support numbers below at each step; When the current conditions prevent further sampling, it relaxes the conditions from weakly correlated variables based on the NMI with the current variable, thus balancing privacy constraints with data distribution fidelity.
Critical strengths
1.This paper introduces a -anonymity-aware sequential sampling framework that provides explicit privacy control through parameter and NMI threshold, which can structurally prevent the generation of synthetic records corresponding to rare or unique individuals in the original data.
2.This paper analyzes from the perspective of differential privacy and discusses its relationship with l-diversity, providing theoretical support.
Critical weaknesses
1.KASS relies on empirical support counting and paired NMI estimation, both of which may be unreliable when the original dataset is very small. In this case, -anonymity-aware sequential sampling may become impractical, leading to frequent conditional relaxation or restarts, and potentially reducing data utility. Furthermore, this article does not determine whether the experiential privacy benefits persist under these low data regimes (<100), as reliable support estimates are particularly challenging. Evaluating small datasets will help clarify the robustness and practical privacy utility trade-off of this approach.
2.Using paired NMIs to guide conditional relaxation may not be sufficient to capture higher-order dependencies between attributes. Paired NMI measures marginal pairwise associations, which may not be able to identify dependency relationships that arise solely through joint interactions between multiple variables. Therefore, the proposed heuristic method may remove a condition variable that is crucial for maintaining high-order structure. Although the ablation study compared NMI based sorting with random dropout, it did not establish the reliability of this heuristic method under complex high-order dependencies. Evaluating synthetic data with controlled higher-order interactions will help clarify this limitation.
Questions for authors
1.How robust is KASS in very small-data regimes, where empirical support counts and pairwise NMI estimates may be unreliable?
2.Pairwise NMI may fail to capture higher-order or context-dependent dependencies. Have you evaluated KASS on datasets with controlled higher-order interactions?
3.Beyond Authenticity and UiOiS, have you evaluated KASS against stronger privacy attacks such as membership inference or attribute inference?
4 comments
To evaluate the robustness of the pairwise NMI thresholding strategy on datasets with higher-order interactions, we compute the cluster-wise joint TVD and removal rate, which measure the preservation of joint correlations and the proportion of correlated features removed, respectively. For a detailed description of each metric, please refer to the section, Evaluation on adaptive condition relaxation and creation of suspiciously empty regions, in our response to Reviewer [Ekyx]. Clearly, the removal rate is high (around 0.33), especially within the minority cluster when generating the dataset. This highlights a limitation of KASS under complex dependence structures. Nevertheless, accounting for standard deviations, KASS achieves a joint TVD closely aligned with those of other baseline models, except within the minority cluster for the dataset. The joint TVD results reveal that even though KASS may inadvertently drop conditioning variables involved in higher-order interactions, the algorithm still manages to preserve the overall joint distribution.
We will discuss these findings in Section 3.2 and report the detailed simulation results in the appendix.
| N | Model | Cluster | Sample counts | Joint TVD | Removal rate |
|---|---|---|---|---|---|
| 100 | KASS () | 1 | |||
| KASS () | 2 | ||||
| SMOTE | 1 | - | |||
| SMOTE | 2 | - | |||
| TabSyn | 1 | - | |||
| TabSyn | 2 | - | |||
| 500 | KASS () | 1 | |||
| KASS () | 2 | ||||
| SMOTE | 1 | - | |||
| SMOTE | 2 | - | |||
| TabSyn | 1 | - | |||
| TabSyn | 2 | - |
Adding MIA and AIA for privacy measure (Q3)
Please refer to responses Membership inference attacks, Attribute inference attacks, and Subgroup analysis of inference attacks to the reviewer [Q2vE] who raised the same concern.
Thank you for the response and additional experiments. However, my concerns about small-sample robustness and higher-order dependency preservation remain, particularly given the high removal rate in the minority cluster at and its higher Joint TVD compared with SMOTE and TabSyn at . I therefore maintain my original score.
We appreciate your careful reassessment of our paper and your constructive feedback throughout the discussion. Your comments have been valuable in helping us improve the quality of the manuscript. Thank you again for your time and thoughtful consideration.
Evaluation on the small datasets with higher-order interactions (Q1, Q2)
We evaluate KASS on simulated datasets with small sample sizes (N=100 and 500) and higher-order interactions between variables. To simulate these higher-order interactions, we consider a scenario where the data samples are partitioned into two imbalanced clusters at an 8:2 ratio, with each cluster exhibiting a different correlation structure. Out of eight variables (X1,…,X8), variables X1,X2,X3,X4,and X5 are correlated within Cluster 1 (the majority cluster). On the other hand, within Cluster 2 (the minority cluster), variables X1,X2,X6,X7,and X8 are correlated. For the detailed data generation process, please refer to the earlier section, Evaluation on adaptive condition relaxation and creation of suspiciously empty regions, in our response to Reviewer [Ekyx]. With this cluster-wise correlation structure, we can emulate a dataset with "higher-order or context-dependent" interactions between variables.
The table below shows the comparison results of KASS (k=2 and η=1) against SMOTE and TabSyn on these small-sample, higher-order interaction datasets. The average values and standard deviations across 10 iterations are reported. Indeed, KASS exhibits a high restart rate (around 0.69) for the dataset with a sample size of N=100. Additionally, KASS shows suboptimal data utility performance with respect to column similarity and the Alpha-Beta score compared to SMOTE and TabSyn. This reflects the difficulty of sampling privacy-preserving synthetic data under a limited sample size. Nevertheless, KASS still succeeds in preventing privacy leakage, yielding zero UiOiS counts. This demonstrates that the utility-privacy tradeoff still holds in the small-sample regime. The restart rate drops drastically (to around 0.13) as we increase the sample size to N=500, which is still small compared to typical datasets used in synthetic data generation. Furthermore, the data utility metrics of KASS become comparable to those of TabSyn, although SMOTE remains optimal in terms of data utility. However, this comes at the cost of replicating rare values, as evidenced by its high UiOiS counts, an issue that KASS successfully avoids.