- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces Generation-Resistant Data Publishing (GRDP), aiming to release a modified dataset that preserves utility for training downstream classifiers while degrading the quality of generative models trained on the same data. The authors motivation is that classification relies primarily on local boundary geometry, whereas generative models rely on global distributional statistics. To formalize this, they model embedded samples as expanding bubbles governed by intra-class attraction and inter-class repulsion, formulating the shell evolution via a Hamilton-Jacobi equation under an induced Finsler metric to enforce local force invariance. To degrade generative utility, they relax the force-invariance constraint into a quadratic covariance budget and derive a rank-one covariance shift along the minimum-eigenvalue direction to maximize the Gaussian FID mismatch.
Critical strengths
- Well-motivated problem and intuitive high-level insight: Protecting released datasets from unauthorized generative training while maintaining discriminative utility is a timely and practical problem. The conceptual idea of decoupling local decision-boundary geometry from global feature moments is intuitive and appealing.
Critical weaknesses
- Severe over-complication ("mathiness") and a huge gap between theory and implementation: The main text spends pages building an elaborate mathematical apparatus—NTK Taylor expansions, Finsler geometry, dual norms, and Hamilton-Jacobi PDEs. However, this heavy machinery is largely abandoned in both the subsequent derivations and the actual implementation:
- When simulating shell trajectories, the update step simply normalizes the force vector using the standard Euclidean norm. Later, when deriving the covariance constraint, the Finsler metric is upper-bounded by a standard quadratic form, effectively collapsing the anisotropic Finsler structure back to a basic weighted Euclidean metric.
- While Algorithm 1 in the main text claims to optimize all dataset embedding centers directly, Appendix D reveals that the actual implementation only modifies a tiny fraction (e.g., 5%) of the training images by passing them through a learned autoencoder with random Gaussian latent noise and an MLP.
- Most importantly, the ablation study (Table 18 / Figure 2c) shows that simply injecting random Gaussian noise into the autoencoder latent space without any of the proposed modules (
Random Shift) already achieves almost the exact same ResNet accuracy and FID degradation as the full GRDP framework. This strongly suggests that the generative degradation comes almost entirely from replacing 5% of the dataset with blurry, low-fidelity autoencoder reconstructions, rather than from the Finsler geometry or rank-one covariance matching.
- Flawed threat model and experimental inconsistencies:
- Despite being framed as "data publishing", the method only modifies a small subset (1%–10%) of the data while leaving the remaining 90%–99% of raw images untouched. Furthermore, there is no explicit perceptual bound on the modified images, which suffer from severe visual distortion (very low PSNR and SSIM in Table 20). In practice, a downstream user training a generative model could easily filter out this 5% of heavily degraded outliers using basic image quality metrics and train cleanly on the remaining 95% of untouched data.
- There are unexplained inconsistencies in the experimental tables. For instance, the baseline DDIM-FID on the raw CIFAR-100 dataset differs drastically between Table 18 and Table 21, and poisoning the dataset with UIB in Table 21 somehow yields a much better (lower) FID than training on the clean raw dataset. Moreover, in the dataset distillation comparison, GRDP does not distill data itself but merely modifies 5% of an existing distilled dataset (D3HR), yielding marginal differences.
Questions for authors
- Clarification Requests:
- True contribution of the theoretical framework: Given that the
Random Shiftablation variant (autoencoder + random Gaussian latent noise) achieves nearly identical classification accuracy and FID degradation asFull GRDP, how do you justify the necessity of the Finsler geometry, Hamilton-Jacobi trajectory sampling, and rank-one covariance matching? - Vulnerability to simple outlier filtering: Since only a small fraction of images are modified and they exhibit heavy visual degradation without any pixel-space perturbation bound, what prevents an adversary from simply filtering out the modified subset via basic anomaly or quality detection? What happens if 100% of the published dataset is passed through your pipeline?
- Experimental discrepancies: Why does the raw CIFAR-100 DDIM-FID change so dramatically between Table 18 and Table 21, and why does UIB poisoning improve generative quality (lower FID/KID) over the clean dataset in Table 21?
- Computational tractability: How are the pairwise force fields, Jacobians, and the dual Finsler gauge optimization actually computed for tens of thousands of samples—are they only approximated within small mini-batches?
- True contribution of the theoretical framework: Given that the
- Suggestions for Future Work:
- A realistic data publishing framework should process the entire released dataset under strict perceptual fidelity constraints (e.g., bounded LPIPS or perturbations) and provide visual comparisons of the images before and after publishing.
7 comments
W2: Connection Between Theory and Implementation
The mathematical formulation and practical implementation of GRDP are connected through three steps: constructing boundary-sensitive monitor points, deriving the covariance target, and optimizing the published representations.
1. Finsler geometry and Hamilton–Jacobi shell evolution. Theorem 3.2 establishes the Finsler metric in Eq. (9) and its dual gauge in Eq. (10), which characterize the direction-dependent geometry induced by the original force field. The dual gauge defines the theoretical propagation speed in Eq. (11), and Eq. (12) describes the continuous shell evolution. In the numerical implementation, we construct force-guided trajectories using explicit Euler updates. The propagation direction is determined by the normalized Euclidean resultant force, while the propagation speed is approximated using the Euclidean force norm, threshold , and coefficient , without explicitly solving the dual Finsler gauge optimization in Eq. (10). These trajectories provide the monitor points at which the original and published force fields are compared through the Finsler force-invariance loss in Eq. (16).
2. Finsler geometry and quadratic covariance formulation. The quadratic formulation in Section 4 follows from the original Finsler metric. Since and , Jensen's inequality gives
Thus, Eq. (18) provides a quadratic upper bound derived from the Finsler metric. The matrix retains the original directional weights, while the force Jacobians in Eq. (22) describe local changes in the resultant force. Combining them gives the force-induced matrix in Eq. (23), leading to the covariance constraint in Eq. (24) under the local linear approximation. Theorem 4.1 then identifies the minimum eigenvalue direction of to construct the rank-one covariance target. The final objective in Eq. (31) combines covariance matching with the original force-invariance loss.
3. Algorithm 1 and budget-constrained publishing. Algorithm 1 describes the embedding-space optimization, while Appendix D implements it through a learnable publishing transformation under a fixed modification budget. Let denote the selected sample indices. For selected samples (), we set , where the publishing MLP transforms the optionally perturbed latent representation. For unselected samples (), we keep . The force-invariance and covariance-matching objectives are defined over the resulting published embedding configuration, with unselected centers fixed at their original values. A ResNet-18-based encoder maps images into 64-dimensional embeddings, and the decoder converts the modified representations back into images. Under the 5% modification budget on CIFAR-100, 2,500 samples are modified, while the remaining 47,500 images remain unchanged.
We have clarified the numerical shell evolution, covariance construction, and budget constrained publishing implementation in Appendix D.
W3: Computational Efficiency and Scalability We clarify the computational implementation of pairwise forces, Jacobians, covariance construction, and shell evolution. All geometric computations are performed in a 64-dimensional embedding space using a two-level batching strategy to control memory consumption.
1. Monitor-point construction and pairwise forces. Under the 5% modification budget on CIFAR-100, monitor points are constructed from the 2,500 selected samples instead of all 50,000 training samples. Each selected sample uses 16 initial directions and three trajectory sampling points, resulting in 120,000 monitor points. The resultant force in Eq. (7) includes contributions from all 50,000 embedding centers. To avoid constructing the full pairwise interaction matrix, we process 32 monitor points per batch and divide the embedding centers into chunks of 256. The force contributions from successive center chunks are accumulated for each monitor-point batch.
2. Analytical Jacobians and covariance construction. The force Jacobians are computed directly using the analytical expression in Eq. (22), without PyTorch autograd. We apply the same two-level batching strategy, processing 32 monitor points and 256 embedding centers per chunk. Each chunk contributes to the Jacobians of the current monitor-point batch. The resulting Jacobians are immediately combined with the Finsler-related matrix to accumulate the force-induced matrix in Eq. (23). Since is a matrix, only the current batch of Jacobians and the accumulated matrix need to be stored, without retaining Jacobians for all monitor points.
3. Numerical shell evolution and publishing optimization. The Hamilton–Jacobi equation in Eq. (12) describes the continuous shell evolution. In the numerical implementation, we construct force-guided trajectories using explicit Euler updates, with the propagation speed approximated from the Euclidean resultant-force norm, threshold , and coefficient . This provides a numerical approximation for trajectory sampling without explicitly solving the dual Finsler gauge optimization in Eq. (10). The Finsler metric remains part of the force-invariance loss and covariance target construction. The publishing transformation is then optimized through a three-hidden-layer MLP with 256 hidden units per layer, using a batch size of 128, a learning rate of , and 10 training epochs. The implementation retains contributions from all original embedding centers without storing the full pairwise interaction matrix or the Jacobians of all monitor points. Chunked force computation and batch-wise accumulation of reduce memory usage while preserving the original force-field formulation.
We have added the monitor point construction, chunked force computation, analytical Jacobian calculation, and covariance matrix construction details in Appendix D.
We would like to thank the reviewer for the helpful and constructive comments. We have tried our best to address your concerns and have revised the manuscript accordingly. Our detailed responses and the corresponding revisions are provided below.
W1:Necessity of Proposed Components We conduct additional ablation experiments on CIFAR-100 under a 5% modification ratio to examine the contributions of force invariance, Finsler geometry, covariance matching, covariance direction selection, and bubble expansion monitor points. All variants use the same classification and DDIM evaluation settings.
1. Contribution of Force Invariance, Finsler Geometry, and Covariance Matching.
Random Gaussian Shift achieves 76.48% classification accuracy and 47.360 FID, compared with 77.22% and 53.836 for Full GRDP. Covariance Matching Only increases FID to 50.555, but remains below Full GRDP. Replacing the Finsler constraint with a Euclidean constraint reduces accuracy from 77.22% to 76.74% and FID from 53.836 to 50.309. Using Euclidean geometry throughout further reduces FID to 50.723. These results show that the Finsler constraint improves the balance between classification accuracy and generative degradation compared with its Euclidean alternatives.
The covariance direction also affects the results. Theorem 4.1 selects the minimum eigenvalue direction of Σ01/2AΣ01/2 to maximize the FID objective under the derived covariance constraint. Replacing this direction with a random covariance direction reduces accuracy from 77.22% to 76.50% and FID from 53.836 to 52.054. This supports the use of the force induced covariance direction instead of an arbitrary statistical shift.
2. Contribution of Bubble Expansion Monitor Points.
We further examine the monitor point selection process. In Full GRDP, monitor points are sampled along bubble expansion trajectories. In the ablation, we replace them with randomly sampled points around the same control centers using random directions and a fixed radius of 0.5.
Both variants use the same 2,500 control samples, with 16 directions and three samples per direction, resulting in 120,000 monitor points. The reference forces are recomputed at the random monitor points using all 50,000 embedding centers. Force matching, Finsler geometry, covariance matching, and the publishing network remain unchanged.
Replacing bubble expansion monitor points with random points reduces classification accuracy by 0.59 percentage points and FID by 5.401. LPIPS also decreases slightly, while KID increases. Since the number of monitor points and all remaining components are unchanged, the differences in classification accuracy and FID reflect the contribution of trajectory based monitor point selection.