- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
Submission 41043 looks at privacy risks in In-Context Tabular Foundation Models (TFMs), such as TabPFN-2.5 and TabICLv2. Instead of updating parameters for each dataset, these models classify data in one step by using the training dataset as input.
Sending raw training data to host services can expose sensitive information. Differential Privacy methods often add too much noise, which lowers accuracy. Deep generative models may memorize data or perform poorly with few samples.
The authors present Synthetic Data Shield (SDS), a local preprocessing method that trains a class-conditional generator and sends only synthetic samples to the TFM service.
This work is useful because it takes a thorough privacy approach, tests on 71 datasets and 6 TFM models, and reports clearly.
Critical strengths
Analytical Rigour & De-Coupled Privacy Taxonomy: The paper provides a principled mathematical framework that disentangles privacy into four independent distributional axes11more_horiz. By formally linking prediction utility to Wasserstein-1 distance, membership inference to replace-one KL divergence, and attribute inference to Total Variation, the authors prove that membership leakage and spatial layout can be suppressed independently of model accuracy. In my view, a key contribution is that Theorem 3 shows attribute inference is a structural residual risk of population learning rather than record memorization.
Exhaustive Cross-Model & Multi-Suite Validation: The experimental design is exceptionally thorough, spanning 71 distinct datasets across 5 benchmark suites (Core 6, Headline 14-tier, Mixed-Type 15, Breadth 40, TabZilla-Hard 31). Furthermore, demonstrating zero-shot model transfer, where a single generated synthetic context is evaluated across 6 heterogeneous TFMs (including column-row attention networks and the 8B-parameter LLM TabuLa-8B) with consistent accuracy preservation provides convincing evidence of model-agnostic utility.
Comprehensive Multi-Threat Privacy Auditing & Positive Controls: Rather than relying solely on superficial heuristics like Distance-to-Closest-Record (DCR), the paper audits SDS against a comprehensive suite of state-of-the-art attacks, including NN-MIA, query-adaptive QAPD, shadow models, density-ratio DOMIAS, and no-box local likelihood ratio Gen-LRA attacks. The authors validate the diagnostic sensitivity of their audit suite by running the same attacks against a deliberately memorizing generator as a positive control (where AUC jumps to approximately 0.73, proving that SDS's near-chance results reflect genuine protection rather than weak auditing.
Critical weaknesses
Structural Failure on High-Order Deterministic / Combinatorial Decision Rules:
- The underlying generative models (BIC-GMM + Copula, Chow–Liu trees) rely on smooth, low-order joint statistical structures14more_horiz. On datasets where class labels are governed by exact deterministic higher-order combinatorial rules or sharp arithmetic boundaries (e.g., Tic-Tac-Toe \Delta = -8.2%, Balance-Scale \Delta = -8.3%). I believe that in-context tabular foundation models excel at learning complex decision boundaries. When SDS smooths away higher-order combinatorial interactions, it undermines TFM performance precisely on the non-linear, rule-based tasks where TFMs offer the greatest advantage over simpler linear/tree (my view, of course).
Longitudinal Leakage Compounding on Small-Sample Datasets (N_{mem} < 100):
- When a data owner issues repeated synthetic context releases over time from a small training cohort (N_{mem} < 100, such as Iris or Seeds), pooling multiple synthetic contexts allows an adversary to track the generator's sampling variance. That should be a major concern. That said, it should be noted that the authors introduce an adaptive two-sided band-pass DCR filter () to mitigate small-N; this filter introduces distance-score asymmetry on larger datasets (N_{mem} > 100) that actually increases adversarial advantage above baseli. However, the system lacks a single, non-distorting protection mechanism for continuous re-scoring scenarios across arbitrary dataset sizes.
Questions for authors
Handling Higher-Order Deterministic Logic: It is known that Chow–Liu trees only capture tree-structured pairwise dependencies. Also, standard assumptions in Gaussian mixtures (GMM) or Copulas assume joint smoothness; how can SDS be improved to preserve sharp, higher-order combinatorial rules like parity, XOR, or multi-feature logic without listing every row?
Universal Distance Filtering: The two-sided band-pass DCR filter seems to reduce longitudinal leakage compounding on small datasets (N_{mem} < 100), but it distorts score symmetry on larger datasets. Is there a density-preserving filter that can stop longitudinal compounding without causing asymmetric score shifts on bigger tables?
Restoring PR-AUC on Imbalanced Data: What makes the synthetic context reorder predictions for the minority class? Is it possible to adjust per-class oversampling quotas dynamically?
2 comments
Follow-up to Reviewer HMJv
Thank you for your thoughtful review and for highlighting our privacy taxonomy, broad evaluation, and rigorous privacy audit; your suggestions have helped us improve the paper. As the discussion period ends soon, please let us know if you have any further questions, and we hope you will take our new results into account in your final assessment.
Response to Reviewer HMJv
Thank you for this detailed review, and in particular for identifying the four-axis decomposition and recognizing our structural reading of attribute inference in Theorem 3. We also appreciate your comments on our cross-model validation with the 8B LLM reader and the use of a positive control in the audit.
Deterministic combinatorial rules: As you note, the current low-order generators are not reliable here. Consider a three-bit parity rule with balanced, independent bits: the label depends on all three even when pairwise correlations give no signal. This is a limitation of the representation, not of the in-context reader. In a new experiment on Tic-Tac-Toe (3 folds), we increase the maximum number of parents in a standalone Bayesian network from one to three. This narrows the gap from -6.8 to -4.7 points, but the nearest-neighbor membership AUC goes from 0.52 to 0.58. This is the standalone Bayesian-network generator, not the full SDS pipeline. The gap for the full SDS pipeline in the paper is -8.2 points. The variants we tried still miss Balance-Scale and monks-2.
The revision reports the curve (Table 15) and recommends validating the task on owner-held data before release. In a new experiment we set tolerances in advance and check the synthetic context against the real one on a held-out 1/5 of the owner’s training rows. With the discrete generator SDS uses for these tasks, it rejects 17 of 18 runs on Tic-Tac-Toe, Balance-Scale and monks-2, and the one accepted run loses 6.5 points. It accepts 70% of releases on the 14 datasets, with an accuracy loss of 0.8 points on a different test fold. Only 2 of the 59 accepted releases lose more than 5 points. It does turn away 1 out of 5 useful releases. The revision gives the table of what it accepted and rejected. The check measures utility. Privacy still needs to be assessed separately. If the required rule is lost, then SDS in its current form is unsuitable for the task.
Longitudinal compounding and the band-pass asymmetry: We have not established that a filter will work for all table sizes. For a fixed context that is scored repeatedly, we can use the same synthetic release each time. Sending the same context again gives the recipient no new synthetic rows to pool. Any leakage from the original release remains, and refitting on an updated cohort is a separate case.
If fresh contexts are needed, the band-pass filter can help for tiny cohorts (on Iris, membership advantage goes from 0.161 to 0.006 at 20 releases), but can make things worse for larger tables (App. J.6). In a new sweep, parameter hardening avoids the distance-based selection. It stays within 0.004 of the generator without hardening on the 6 larger datasets, with no observed added asymmetry, but it does not stop the growth on Iris or Wine. It lowers accuracy by an additional 2.8 points over SDS without hardening on the 14-dataset suite (3 folds, 1 seed), on top of the gap from synthesis itself. The revision adds this sweep (Table 51), corrects the cost (Table 27), and distinguishes repeated use of one release, fresh releases and cohort updates (App. F.2). Density preservation and privacy under composition remain open.
PR-AUC on imbalanced data: One possibility is that smoothing the class-conditional model changes the ranking of borderline cases in the minority class. In a new diagnostic experiment, we find that minority classes do have fewer mixture components selected (3.0 vs. 5.0 for majority classes). This supports the explanation but does not isolate the cause.
In a new experiment (5 folds, 2 seeds), choosing the oversampling quota on the owner’s validation split improves the PR-AUC gap from -6.2 to -5.4 points, with no meaningful increase in AUC in the nearest-neighbor membership check. Calibration can be helped by using the temperature scaling of Guo et al. on the same split. With fixed quotas, expected calibration error goes from 0.085 to 0.050, compared with 0.041 in the real context. A positive temperature does not change the ranking or predicted classes on these binary tasks, so it does not fix PR-AUC, but it can help calibration.
The validation split is drawn from 20% of the training fold and is separate from the test fold. We select the quota and temperature using the generator trained without those rows, but draw the released context from the generator refitted with them. Both choices are made on the owner’s side. In a new audit of this complete procedure, every mean AUC difference vs. fixed quotas is at most 0.004 across five membership attacks. We report these runs in App. K (Table 57), along with minority precision, recall and calibration next to balanced accuracy. The revision adds your caveat that clinical suitability remains to be established.