REVIEW 3 major objections 4 minor 12 references
Out-of-Distribution Federated Distillation with Domain-Aware Proxy
T0 review · 3 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read Domain-aware proxy selection lets federated distillation keep its accuracy when test data shifts.
desk verdict Proxy data in the main OOD experiments is sampled from the same unseen domains as the test set, so the reported gains measure test-domain adaptation, not OOD generalization; the core selection idea is still salvageable. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the domain-aware proxy set $D_p^* = \bigcup_{k} P_k \cup P_g$, rebuilt each round. Client $k$ picks $P_k$ as the top-$K$ proxy samples with highest cosine similarity between the proxy sample's feature vector and the client's mean feature vector (centroid) over private data; the server picks $P_g$ similarly using the global centroid over proxy data. Distillation then runs on this union. The complementary machinery is the vocabulary-constrained LLM generator: a global vocabulary is built by tokenizing real proxy data, and few-shot prompts force the LLM to produce reviews using only that vocabulary, pulling synthetic text toward the real lexical distribution (shown by TF-IDF projection).
What would settle it
Run DPS-FD and FD-GP with proxy data drawn only from the five client domains (automotive, baby, clothing, health, sport) and evaluate on the five held-out domains; if the F1 gap over FD-LP shrinks or vanishes, the reported 82.9% result is an artifact of target-domain leakage rather than evidence of OOD generalization.
Extended reading notes
Core claim
On its own terms, DPS-FD establishes two things. First, substituting a domain-aware proxy set, the union of each client's top-K proxy samples closest to its private-data centroid and the server's top-K samples closest to the global centroid, for the raw proxy set improves global and local F1 under domain shift while slightly reducing communication cost (98.3% and 95.9% of the standard FD cost). Second, when proxy data is unavailable, proxy text generated by an LLM under a vocabulary constraint drawn from real data is close enough to real proxy data to keep most of the benefit; constrained generation outperforms unconstrained generation by about 2.9 F1 points. The paper also reports that global-domain proxy data helps more than local-domain proxy data, and that DPS-FD lifts the weakest client domain (baby) from 47.6% F1 to 84.6%.
Load-bearing premise
The entire OOD claim depends on treating proxy data sampled from the test domains as though it still measures out-of-distribution robustness; if that assumption is dropped, the reported gains may only show that training on target-domain proxy data helps, which is expected.
Editorial extensions
If this is right
- If proxy selection is the main lever, FD can be made more resistant to domain shift without changing client training or aggregation rules.
- Because the selected proxy set is smaller than the full set, communication cost drops while accuracy rises, so the method's benefit does not trade against bandwidth.
- The vocabulary-constraint result implies that lexical distribution matching, not just semantic plausibility, is a controllable factor in LLM-generated proxy data.
- The global model's held-out accuracy improves with more clients (from 5 to 10), suggesting that broader domain coverage in private data strengthens the global centroid and the selected proxy.
Reading between the lines
- Editorial inference: the comparison FD-GP uses global proxy data composed of samples from the very domains that are unseen by the clients, so the strong result may be measuring adaptation to the test domains via proxy leakage rather than generalization to truly unseen domains; a stricter protocol with proxy restricted to client domains would separate the two.
- Editorial inference: since selection is by similarity to centroids, a testable extension is replacing the top-K cosine rule with uncertainty- or diversity-aware sampling to see whether the gains come from denoising or from retaining hard samples; the paper itself notes that smaller top-K can remove informative near-boundary samples.
- Editorial inference: the same selection-plus-constrained-generation recipe could transfer to other token-based modalities such as code or clinical notes, where domain vocabularies are cheap to construct, though the paper only demonstrates sentiment classification.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes DPS-FD, a domain-aware proxy selection framework for federated distillation, in which each client and the server select top-K proxy samples most similar to their feature centroids (Eqs. 6-9) to construct a domain-aware proxy set. When no proxy data is available, the authors introduce a vocabulary-constrained LLM-based generation strategy (Section 4.3) that uses a global vocabulary derived from real proxy data. Experiments on Amazon review sentiment classification with heterogeneous clients report improved global F1 over baselines: 82.9% with proxy data and 80.6% without proxy data in Tables 1 and 4.
Significance. The idea of jointly selecting proxy samples at both client and server levels is coherent, and the method is computationally light and clearly described. The release of code and data is commendable. However, the experimental protocol does not measure out-of-distribution generalization as claimed: the with-proxy baseline FD-GP uses proxy data from the same domains as the OOD test set, and the without-proxy pipeline depends on real proxy data for vocabulary construction. As a result, the central advertised claim that DPS-FD addresses OOD distribution shifts is not supported by the evidence presented.
major comments (3)
- [5.3, 5.1, 4.1] The main with-proxy evaluation does not constitute an OOD test. Section 5.3 defines FD-GP as using "global proxy data composed of samples from all domains that are unseen by the clients," and Section 4.1 defines the OOD test set as "sampled from the domains not seen by the clients." Thus the proxy data in the principal comparison is drawn from the same domains as the test set. DPS-FD then selects top-K proxy samples via Eqs. (6)-(9), and the global model is distilled on unlabeled samples from the test distribution. The reported improvement in Table 1 (DPS-FD 82.9 vs FD-GP 81.4 global F1) therefore measures target-domain adaptation, not out-of-distribution robustness. This invalidates the abstract's claim that the model "effectively address[es] the challenges of distribution shifts under OOD."
- [4.3] The without-proxy pipeline is not self-contained. Section 4.3 states that "we first construct a vocabulary from tokenizing real proxy data," which presupposes access to proxy data even in the no-proxy scenario. If that real proxy data includes the unseen test domains (as in the with-proxy setup), the generated proxy inherits lexical information from the test distribution, so the without-proxy results in Table 1 also fail to establish OOD generalization. The Limitations section does not acknowledge this dependency on real proxy data for the vocabulary constraint.
- [Tables 1-2, 5.4] The captions of Tables 1 and 2 report p<0.001, but the manuscript does not state the statistical test used, the number of random seeds, or any variance measure over runs. Without this information, the small reported gaps (e.g., 82.9 vs 81.4 global F1) cannot be assessed for significance, further weakening the support for the central claim.
minor comments (4)
- [1] There is a typo in Section 1: "promblem" should read "problem."
- [4.3] The phrase "aVocabulary-Constrained" in Section 4.3 is missing a space; it should read "a Vocabulary-Constrained."
- [5.3] In Section 5.3, "DPS-FDis" is missing a space; it should read "DPS-FD is."
- [Figure 3] Figure 3's axis labels appear garbled in the manuscript text, with repeated "/uni000000..." strings, which makes the figure caption and the top-K analysis hard to interpret.
Circularity Check
Reported OOD gains rely on proxy data drawn from the same unseen domains as the test set; the no-proxy arm also builds its vocabulary from real proxy data.
-
self definitional
[Section 4.1 (OOD Benchmark Construction) and Section 5.3 (Baselines)]
"we simulate OOD settings by replacing the original test set, which is composed of data from the client domains, with a test set sampled from the domains not seen by the clients. ... FD-GP uses global proxy data composed of samples from all domains that are unseen by the clients. ... DPS-FD is our proposed model, applying DPS on FD with global domain proxy data..."
The OOD test set is sampled from domains not seen by the clients, and the with-proxy baselines and DPS-FD are distilled on proxy data from exactly those same unseen domains. The server therefore transfers knowledge about the test distribution into the global model before evaluation; Table 1's global-distribution F1 measures adaptation to target-domain proxy data, not generalization to truly unseen domains. The claimed OOD setting and the proxy input are the same domain set by construction.
-
fitted input called prediction
[Section 4.3 (LLM-Based Proxy Generation) and Section 5.3 (Baselines)]
"we first construct a vocabulary from tokenizing real proxy data, which serves as a constraint to ensure that generated samples adhere to realistic lexical distributions and domain-specific semantics. ... FD-VC leverages a vocabulary-constrained LLM-based generation strategy to synthesize proxy data without proxy data."
The "without proxy data" arm is evaluated after constructing its generation constraint from real proxy data. The LLM's vocabulary and few-shot demonstrations are fitted to the real proxy distribution, so the generated proxy is anchored to the data that the scenario claims to do without. If the real proxy data includes the unseen target domains (as in the global proxy setting), the no-proxy pipeline inherits target-domain lexical patterns, so the advertised no-proxy OOD result is not independent of proxy data.
full rationale
The central empirical claim is circular in its operationalization. Section 4.1 defines the OOD test set as domains unseen by the clients, while Section 5.3 defines FD-GP, and the with-proxy DPS-FD, as using global proxy data from all domains unseen by the clients. Distilling on unlabeled data from the test domains and then evaluating on those same domains measures target-domain adaptation, not out-of-distribution generalization. The without-proxy arm has a parallel issue: Section 4.3 constructs the vocabulary from real proxy data, so the allegedly proxy-free generation still depends on real proxy text. These are not mathematical tautologies, but the benchmark makes the headline result largely an in-distribution or transductive result. Self-citations such as Xiao and Liu (2025) appear for the non-IID setup and the claim that distillation struggles without proxy data, but they are not the primary source of circularity; even setting them aside, the proxy/test domain overlap is sufficient to invalidate the OOD claim as stated. A design that kept proxy domains disjoint from test domains would have avoided this problem.
Assumptions & free parameters
free parameters (4)
- client top-K (per-client selection size) =
25,000
- server top-K (server selection size) =
35,000
- average generated review length =
~90 words
- softmax temperature tau
assumptions (4)
- domain assumption The global model and client models produce comparable feature spaces for centroid similarity (Eq. 6-7).
- domain assumption The OOD test domains are not represented in the proxy data used for training.
- ad hoc to paper The LLM can be constrained to generate only words from a fixed vocabulary.
- standard math Weighted KL aggregation of soft labels in Eq. (4) is a valid global objective.
Cite this review
Pith. "Pith review of Out-of-Distribution Federated Distillation with Domain-Aware Proxy." pith.science (2026). https://pith.science/paper/SJIXD2AN
@misc{pith2026260808525,
author = {Pith},
title = {Pith review of: Out-of-Distribution Federated Distillation with Domain-Aware Proxy},
year = {2026},
howpublished = {\url{https://pith.science/paper/SJIXD2AN}},
note = {Machine review of arXiv:2608.08525}
}
read the original abstract
Federated Learning is a distributed machine learning paradigm that trains a global model by aggregating local clients without sharing private data of each client. Federated Distillation (FD) builds upon this paradigm by leveraging knowledge distillation to exchange soft predictions on proxy data instead of model parameters, enabling more efficient communication and supporting heterogeneous model collaboration. However, FD models trained on In-Distribution data are hardly adapted to Out-of-Distribution (OOD) scenarios. In this paper, we propose a domain-aware proxy selection framework to better adopt proxy data for OOD problems. The experimental results show that the proposed models effectively address the challenges of distribution shifts under OOD with and without proxy data by achieving average 82.9\% and 80.6\% over existing works on standard benchmarks. The codes and data are released in https://anonymous.4open.science/r/DPS-FD-8596.
Figures
Reference graph
Works this paper leans on
-
[1]
Identify the product domains and senti- ment tendencies represented in the exam- ples above, and infer additional potential domains that could reasonably exist
-
[2]
Based on the examples’ and inferred do- mains, generate exactly realistic and diverse unlabeled review texts
-
[3]
InProceedings of the ACM Web Conference 2023, pages 3077–3085
Duet: A tuning-free device-cloud collaborative parameters generation framework for efficient device model generalization. InProceedings of the ACM Web Conference 2023, pages 3077–3085. Xinge Ma, Jin Wang, and Xuejie Zhang. 2025. Data- free black-box federated learning via zeroth-order gradient estimation. InProceedings of the AAAI Con- ference on Artifici...
work page 2023
-
[4]
Do not shorten because you need to output many
Each review should be about 90 words (minimum 40, maximum 180). Do not shorten because you need to output many
-
[5]
Maintain variability in tone, sentence structure, and vocabulary
The reviews should not be templates or mechanically repeated. Maintain variability in tone, sentence structure, and vocabulary. Output format:
-
[7]
Each review should be fluent, reflecting the natural style of customer reviews
-
[10]
Output each reviews on a separate line
-
[11]
Ensure the quality of each generated sen- tence and do not sacrifice quality for the sake of quantity
Show all 12 references
-
[12]
Begin now:
Do not add any prefix, numbering, head- ers, or label—only the raw reviews. Begin now:
-
[2022]
In2022 IEEE International Conference on Trust, Security and Pri- vacy in Computing and Communications (TrustCom), pages 687–694
Flightner: A federated learning approach to lightweight named-entity recognition. In2022 IEEE International Conference on Trust, Security and Pri- vacy in Computing and Communications (TrustCom), pages 687–694. IEEE. Rohan Anil, Gabriel Pereyra, Alexandre Passos, Robert Ormand...
2018 arXiv
-
[2023]
InProceedings of the 31st ACM International Conference on Multimedia, pages 1536–1545
Joint local relational augmentation and global nash equilibrium for federated learning with non-iid data. InProceedings of the 31st ACM International Conference on Multimedia, pages 1536–1545. Xinting Liao, Weiming Liu, Chaochao Chen, Pengyang Zhou, Fengyuan Yu, Huabin Zhu, Bi...
2020 arXiv
-
[2024]
In 2024 IEEE International Conference on Multimedia and Expo (ICME), pages 1–6
Attentive modeling and distillation for out-of- distribution generalization of federated learning. In 2024 IEEE International Conference on Multimedia and Expo (ICME), pages 1–6. Zhuang Qi, Sijin Zhou, Lei Meng, Han Hu, Han Yu, and Xiangxu Meng. 2025. Federated deconfounding a...
2024 arXiv
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.