- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes FedTau, an observation-aware framework for federated learning that attributes certain forms of local target discrepancy to client-specific observation mechanisms. The paper introduces a shared reference response distribution , models each client’s observed data as a transformation of this reference distribution through an observation mechanism , and derives a -correction that converts the conventional supervised loss into the corresponding observed-data negative log-likelihood. The framework is instantiated for class-selective sampling in classification, right-censored responses in regression, and truncated targets in sequence prediction.
Critical strengths
-
Unified formulation across heterogeneous learning tasks. The idea of expressing local supervision through an observation-aware likelihood provides a coherent mathematical formulation that connects class-selective sampling, censoring, and sequence truncation. The resulting common-optimum analysis is conceptually interesting.
-
Simple integration with federated optimization. FedTau modifies the local objective while retaining standard model architectures and FedAvg-style aggregation, making the framework potentially compatible with existing FL algorithms without requiring a new aggregation procedure.
Critical weaknesses
-
The central concept and modeling assumption are insufficiently justified. The proposed “observation-induced target mismatch” appears to unify several established problems, including label distribution shift, censoring/capping, truncation, and measurement or label corruption. The paper does not yet establish what is fundamentally new about treating these phenomena as a single class of problems, nor whether there exists a sufficiently general observation model with a clear statistical interpretation that meaningfully unifies them. More importantly, the assumption that all client observations arise from a shared reference response distribution through client-specific observation mechanisms may be too strong for realistic FL, where clients can have genuinely different populations or conditional relationships.
-
The practical availability and estimation of the observation mechanism and reference distribution are unclear. FedTau requires the client-specific observation mechanism to construct the -correction, while the theoretical guarantee relies on the true . However, clients may only have access to the final observed datasets and may not know how the data were generated or transformed. It is therefore unclear when is identifiable, how is obtained in practice, and how errors in affect the claimed common optimum. The shared reference distribution also appears difficult to determine when the deployment distribution is unavailable. These assumptions substantially affect the practical validity of the proposed method.
Questions for authors
-
What is the precise statistical definition of “observation-induced target mismatch”? How does it differ from existing notions such as label shift, covariate shift, concept shift, censoring, truncation, and label/measurement corruption? What property makes these seemingly different problems instances of the same phenomenon?
-
What is the source of the shared reference distribution in practice? Is it assumed to be known, externally specified, or estimated from client data? If it is estimated, how is it distinguished from the heterogeneous client distributions? What information is assumed to be available for estimating ? Can be identified from the observed client data alone, or does FedTau require additional metadata or knowledge of the data-collection process?
-
The theoretical result is derived using , whereas the practical method uses . What conditions or quantitative guarantees ensure that the common-optimum property remains approximately valid when ?
-
In the classification experiments, Dirichlet label-skew partitioning produces conventional differences in local class distributions but does not explicitly construct an observation mechanism that transforms a shared reference target. How exactly does this setting instantiate the proposed observation-induced target mismatch? Are the observation mechanisms used in all experiments treated as oracle information? If so, how robust is FedTau when these mechanisms are estimated or misspecified?
5 comments
Response by Authors (Part 2)
Q3: vs.
There exists an underlying observation mechanism , but it may not be directly accessible. Therefore, our practical objective is to obtain an estimated mechanism that approximates as closely as possible. Using estimated quantities rather than their exact counterparts is common in optimization and statistical learning. The important question is how estimation errors affect the theoretical properties and practical performance of FedTau.
In fact, Appendix A.5.4 and Eq. (20) already provide quantitative answers to this question. We define the residual gradient at the reference optimum as , which measures the effect of mechanism-estimation errors on local optimization. Eq. (26) shows that the distance between a client's updated model and the reference optimum is upper-bounded by
\leq r^{H_k}\|\theta_t-\theta^\star\|_2 + (1-r^{H_k})\frac{\varepsilon_k}{m},$$ where $r=1-\eta m$. Equation (27) extends this bound to federated aggregation. Thus, when $\varepsilon_k\leq\bar\varepsilon$ for all participating clients, the residual error is controlled by $\bar\varepsilon/m$. Furthermore, Eq. (20) directly upper-bounds the residual gradient by the estimation error in the classification logit offset, i.e., $\varepsilon_k\leq\frac{M}{2}\|b_k-b_k^\star\|_2$. These results establish that **smaller mechanism-estimation errors lead to tighter bounds on the deviation from the shared reference optimum**, under the specified theoretical conditions. Our mechanism-mismatch experiments in Tables 4 and 12 provide complementary empirical evidence. These results are consistent with our theoretical analysis, demonstrating that inaccurate observation mechanisms can introduce additional optimization errors and degrade prediction performance. **Q4**: Observation mechanism in Dirichlet label-skew partitioning The Dirichlet label-skew partitioning itself is an observation mechanism that FedTau can learn. The observation mechanism can change which kind of samples are seen by the client. Under the label-shift assumption, clients share the same class-conditional feature distribution, \$ p_k(x\mid y)=p^\star(x\mid y), \$ but have different class priors, i.e., $\pi_k(y)\neq\pi^\star(y)$. According to Bayes' rule, \$ p_k(y\mid x)\propto p^\star(y\mid x)\frac{\pi_k(y)}{\pi^\star(y)}. \$ This relationship directly corresponds to the observation mechanism defined in FedTau's classification formulation (Eq. (4)). In our experiments, samples are randomly partitioned within each class according to class-specific Dirichlet proportions. Thus, the probability that a sample is assigned to a particular client depends on its label, which simulates different client-specific sampling mechanisms. Conventional local cross-entropy learns client-specific posteriors, whereas FedTau accounts for the prior differences to align local supervision with the shared reference target. Regarding oracle information, FedTau does not use the underlying Dirichlet allocation probabilities as oracle information. The local and reference class priors are estimated from the observed training-label counts. For right-censored regression, the censoring thresholds and indicators are obtained from the recording protocol, while sequence prediction uses the observed prefixes and continuation indicators. These mechanisms are therefore constructed from available training statistics or recording metadata, without requiring access to unobserved true responses. In Proposition 1, we prove that clients can train on their own observed data while sharing a common reference predictive optimum, even when their observation mechanisms differ.Thank you to the authors for the detailed responses and additional clarifications. The revised explanations, particularly the estimation-error analysis in Q3 and the discussion of observation mechanisms in Q4, have addressed several of my initial concerns.
However, some questions remain. In particular, I am still not entirely clear about how the reference distribution can be reliably estimated from heterogeneous client data and whether the aggregated class priors necessarily represent the intended deployment distribution. I also believe the distinction between FedTau's unified formulation and existing approaches to label shift, censoring, and selection bias could be further clarified to better establish its novelty. Furthermore, the applicability of FedTau appears to rely on access to observation-related metadata or prior knowledge of the data-collection process, which is an important assumption worth emphasizing.
Overall, I appreciate the authors' efforts and the additional theoretical and empirical clarifications. While the responses have improved my understanding of the method, some questions regarding its practical applicability and novelty remain. Therefore, I have decided to maintain my original score.
Response by Authors (Part 1)
We value the reviewer's positive assessment of FedTau's unified mathematical formulation, common-optimum analysis, and compatibility with existing FL methods. We will further clarify our statistical assumptions, practical applicability, and theoretical guarantees under mechanism-estimation errors.
W1 & Q1: Novelty and statistical definition
The main novelty is that we are the first to address the client-drift issue (caused by non-i.i.d. data) from where it actually first occurs. We redefine and correct the local learning objectives/observation for each client and align them to obtain a global predictor, whereas existing methods optimize training from a given specified local objective/target, but cannot correct the target that was already defined from a distorted observation (discrepancy). FedTau addresses this fundamental issue by correcting how local supervision is defined, rather than merely improving how predefined local objectives are optimized. This is the core gap that existing methods cannot jump over.
More precisely, observation-induced target mismatch occurs when directly fitting locally recorded observations leads to a population-optimal predictor different from the predictor required by the shared deployment task. This mismatch persists even with unlimited data and perfect local optimization. For example, as shown in Eq. (2) in the main paper, directly fitting U=min(Y,ck) with squared error learns E[U∣X] rather than E[Y∣X], potentially producing different prediction targets across clients with different thresholds.
FedTau provides a unified statistical formulation for this problem, rather than merely grouping existing task-specific corrections. Eq. (1) distinguishes the shared reference distribution p⋆ from client observations, while Eq. (3) constructs local supervision from the observation likelihood. Appendix Eq. (11) further defines a general observation model:
\frac{\int R_k(A\mid y,x)s_k(y,x)q(dy\mid x)} {\int s_k(y,x)q(dy\mid x)},$$ where $s_k$ describes response-dependent sampling and $R_k$ describes how selected responses are recorded. This formulation covers class-selective sampling, right-censoring, sequence truncation, and other specified observation processes. These phenomena have different statistical forms, but share the same underlying issue: the observation mechanism changes the supervision received by the model relative to the intended reference prediction. FedTau derives the corresponding local objectives from the same observation-likelihood principle. Proposition 1 establishes that, under correctly specified observation mechanisms, we have $\mathbb E_{X\sim p_k^X}D_{\mathrm{KL}}\left(\mathcal T_k[p^\star](\cdot\mid X)\Vert\mathcal T_k[q_\theta](\cdot\mid X)\right)\geq0.$ Therefore, although clients have different input distributions $p_k^X$ and different observation mechanisms, our proposed $\tau$-correction can still minimize every client's local objective, referred to as a common predictive target. **W2 & Q2**: Practical availability and estimation FedTau does not require the true reference response distribution $p^\star(y\mid x)$ to be known before training. It is the underlying prediction distribution that the shared model $q_\theta$ aims to learn. What must be specified is the intended deployment task and sufficient information about how each client records its observations. In practice and also in our experiments, the required information has explicit sources and is used locally without transmitting raw observations. - Classification: Local class priors are estimated from client training-label counts. The reference prior is constructed from aggregated class counts using Eq. (9), $\widetilde\pi^\star(c)=(N_c+1)/(N+C)$, through federated aggregation procedures, or can be externally specified for a particular deployment task. - Right-censored regression: The censoring threshold $c_k$ and indicator $\delta$ come from the recording protocol. A censored record provides the event $Y\geq c_k$, even when the exact response is unavailable. - Sequence prediction: The observed prefix and continuation indicator are available from the truncation procedure. When a record is known to continue, the corresponding boundary probability is $1-p_{\mathrm{EOS}}$. We acknowledge that arbitrary observation mechanisms cannot always be identified from final recorded datasets alone. FedTau assumes that the relevant recording rules are available from the collection protocol, retained metadata, or estimable statistics. This is an explicit applicability condition (necessary).