- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes DP-MixMin, a novel approach to select optimal data mixture for public pretraining before fine-tuning model with DP-SGD. Authors build on two insights from prior work: public pretraining helps downstream private fine-tuning, and data mixture optimization can be reduced to a convex optimization problem without expensive retraining on every candidate mixture. Authors propose an approach that guarantees end-to-end differenttial privacy by splitting the dataset into two parts: one for learning the mixture, another for training the target model. They then use DP-SGD at both stages.
Critical strengths
- The paper is very clearly written, identifies a reasonable gap in the literature, positions itself well within the field and builds on the prior work. It is very clear what authors are doing, why, and what is the contribution.
- The algorithm itself is well-designed. As far as I can tell DP claims are correct. Using disjoint datasets to avoid epsilon composition is a clever move.
- Empirical results (especially Image Classification results) are very strong and convincing
Critical weaknesses
Some of the empirical claims look a little surprising (mostly for language modelling), and I would love to see better ablations and baselines to understand the nature of the phenomena.
For instance, Table 1 shows that for Enron experiments increasing leads to better downstream performance. Generally I would find that quite surprising -- privacy amplification by subsampling in DP-SGD usually has a strong impact of the downstream performance, and I would have expected that larger dataset in the second stage would lead to a better final model. We, however see the opposite.
Additionally, the fact that random search underperforms compared to the uniform version, even though random search omits privacy while exploring options, suggests that better hyperparameter search is possible -- it should recover uniform's performance at least.
At the very least I would like to see the following baselines for Enron data to understand the upper bounds in this setup
- Non-DP mixture + non-DP training (upper bound)
- DP-mixture + non-DP training (upper bound for the second stage)
- non-DP-mixture + DP training (upper bound for the first stage)
Additionally, a baseline that is better that uniform mixture should be possible, e.g. gradient-based alignment from Gu et al. should be applicable for language modelling. Also, method from Yu et al. looks applicable.
I would be happy to raise my score if authors show that DP-MixMin outperforms baselines stronger than uniformly mixing all available data sources.
Questions for authors
- Why do you think random search does performs worse than the uniform mixture?
3 comments
I thank the authors for the response. It covers my concerns and I will raise my score
Response to Reviewer nJzy
Thank you for raising your score!
We have also implemented both of the other suggested baselines, and ran each through the same pipeline as DP-MixMin: pretraining GPT-2 medium from random initialization on 7.1B CommonPile tokens, followed by user-level DP fine-tuning at and on the same 84 fine-tuning users, with so 70% is left for fine-tuning, over two data splits.
We found DP-MixMin also beats these baselines for language modeling (Gu et al. [3], and Yu et al.,[4]), with no overlapping error bars: see the table below. Note we also applied Gu et al [3] without DP guarantees, favoring them. See Appendix A.11 for details on implementation.
Enron test perplexity (mean ± std, lower is better)
| Method | Seeds | After pretraining | After DP fine-tuning |
|---|---|---|---|
| DP-MixMin () | 3 | 17.83 ± 1.01 | 16.78 ± 0.55 |
| Uniform | 3 | 21.15 ± 1.59 | 19.88 ± 1.10 |
| Yu et al. (private) | 2 | 19.94 ± 1.24 | 19.11 ± 1.07 |
| Gu et al., GSD on github_archive (all non-test users) | 2 | 27.68 ± 0.09 | 26.38 ± 0.08 |
| OpenAI GPT-2 medium (all non-test users) | 3 | 21.5 ± 1.47 | 20.18 ± 1.28 |
[3] Gu et al., "Choosing Public Datasets for Private Machine Learning via Gradient Subspace Distance." IEEE Conference on Secure and Trustworthy Machine Learning (SaTML), 2025.
[4] Yu et al., "Selective Pre-training for Private Fine-tuning." arXiv:2305.13865, 2023.
Response to Reviewer nJzy
We thank the reviewer for their time and feedback! Below we discuss questions and concerns brought up by the reviewer.
Note that we selected the number of samples for random search, m, to match compute used for MixMin. This results in m=4 for the image classification tasks and m=16 for the language modeling tasks; this is far smaller than needed to exhaustively search the simplex. In fact, note the uniform mixture minimizes worst-case distance to any mixture, so it can often be the case it is closer to the best mixture than the m randomly selected mixtures. Past work had similarly found that at small compute budgets for mixture selection, a uniform baseline outperformed all data mixing methods except MixMin (see the “Balanced” column in Figure 3 of Thudi et al., 2025 [1]).
[1] Thudi et al., "Mixmin: Finding data mixtures via convex minimization." International Conference on Machine Learning, 2025
We actually found that most of the difference in performance comes from the pretraining stage, and so by increasing ρ we get a pre-training mixture closer to optimal. Below are the downstream Enron perplexities (mean ± std over 3 trials) of just the pre-trained model, before fine-tuning:
Note that DP fine-tuning reduced the loss for uniform by just under 7% (to perplexity 19.88) , whereas the relative gap between uniform and DP-MixMin after pre-training was already 15%.
Thank you for that suggestion! Below are the perplexities we obtained from one seed:
We had already found DP MixMin mixture pretraining + DP finetuning had a perplexity of 16.78 ± 0.55, which is within one standard deviation of our one-seed Non-DP MixMin pretraining + DP finetuning. So the DP MixMin mixture already matches the “upper-bound” for the first stage (data mixing). In the paper we already described how the mixtures found by DP-MixMin and non-DP MixMin were comparable (Section 5.3), and the above results confirm any slight differences in mixtures did not lead to significant differences in performance for language modeling.
As mentioned in the above response, DP-MixMin already recovers the non private MixMin mixtures, which is the best known data mixing procedure (as far as we are aware). Comparisons in mixture weights and final training performance for image classification are described in Section 5.3 with results in the Appendix. We additionally included direct performance comparisons for language modeling in our earlier response and found they were comparable. So we have shown that DP-MixMin matches the “upper-bound” for data mixing performance, and can do so despite imposing DP guarantees; we attribute this to the problem being a convex learning problem, which comes with relatively little utility degradation when doing DP [2]. Let us know if this did not address the concerns.
[2] Bassily, et al. "Private stochastic convex optimization with optimal rates." Advances in neural information processing systems, 2019