-
A claimed component of the method is missing from the objective and never evaluated. The abstract, Sec. 1 (l. 58–59), and Sec. 3 (l. 149–150) state that ReSuff includes a "class-conditioned subject-adversarial objective". However Eq. 16 contains only L_CE + λ D̂; the discriminator, its architecture, gradient reversal/weighting, and its loss weight are never defined, yet l. 268–269 refers to "the discriminator" and "the subject loss". It is therefore unclear what was actually trained, and — crucially — whether the reported gains come from the kernel sufficiency regularizer or from subject-adversarial training (which is a well-known source of cross-subject gains in EEG; cf. DANN, Ganin et al., 2016; CDAN, Long et al., 2018). There is no ablation separating the two. This alone makes the paper's central attribution unverifiable.
-
The empirical estimator does not cleanly target conditional dependence; the query-MSE control is confounded. D̂ in Eq. 15 is a V-statistic: since k_U(u,u)=k_T(t,t)=1, its diagonal contributes Σ_i w_i² ||e_i||², i.e., a subject-weighted query-MSE term. With a minibatch split 67/33 by subject (batch size never reported), the query set is small and this diagonal term may dominate D̂. Hence the distinction drawn in Sec. 4.3 between ReSuff and "query-MSE" may be largely a difference in weighting rather than in conditioning on U. An unbiased (U-statistic, diagonal-removed) estimator, or reporting the diagonal/off-diagonal decomposition, is needed. Furthermore, D̂ also penalizes dependence of residuals on T alone (since the joint kernel includes K_T), which is nonzero whenever the support-fit KRR is misspecified or does not transfer across subjects; minimizing this reshapes T to be "KRR-friendly across subjects", which is essentially an episodic, closed-form meta-learning loss (Bertinetto et al., 2019, R2D2) rather than sufficiency with respect to U. The decisive controls are missing: (a) K_U ≡ 1 (T-only kernel), (b) U replaced by a permuted/random/noise view, (c) U from a randomly initialized backbone. If (a)–(c) yield similar gains, the "task sufficiency" story is not what explains the results. Table 3 covers only one dataset (MA).
-
Statistical evidence is weak relative to the claims. Only three seeds are used, and standard deviations are frequently comparable to or larger than the gains (Table 1: REVE PhysioNet .641±.009 vs .630±.015; LaBraM PhysioNet .559±.027 vs .548±.025; LaBraM ISRUC .770±.004 vs .765±.004; REVE MA .764±.035 vs .731±.054; Table 2: FT+ReSuff PhysioNet .635±.055 vs .623±.007; LoRA+ReSuff MA .669±.114 vs .633±.022). No paired tests, CIs, or per-subject analysis are reported, yet the abstract states improvement "in all nine" combinations as the headline. With subject-level test sets of modest size, per-subject paired tests (e.g., Wilcoxon over test subjects, or across seeds × folds) are the minimum. Also, ReSuff does not beat the strongest baseline in several cells (e.g., CBraMod PhysioNet: Adapter .577 vs ReSuff .536; CBraMod avg .659 vs PEARL .658 — a tie), so the headline "ranking first among frozen-backbone methods" is fragile.
-
Hyperparameter selection is internally inconsistent and possibly test-informed. Sec. 4.1 (l. 306–307) sets λ = 0.5 / 0.02 / 0.01 for PhysioNet-MI / MA / ISRUC. Sec. 4.4 (l. 464–468) says REVE and LaBraM peak near λ=0.02 and that "increasing the weight to 0.50 generally lowers BA", yet then states "using 0.50 for PhysioNet-MI". Fig. 4a appears to be on MA only (y-range 0.60–0.76), so the PhysioNet choice is unexplained. λ is per-dataset, not per-backbone, despite Fig. 4a showing backbone-dependent optima. The baseline budget sweeps in Sec. 4.2 (LoRA rank 1–32, Adapter 4–126: "reaches at most 0.506") read like maxima over test BA; please clarify that all selection (baseline budgets, λ, warm-up, epoch/checkpoint) used validation only and that the baselines received an equivalent tuning budget to ReSuff (which has λ, warm-up, support fraction, ridge, and bandwidth as extra knobs).
-
Missing obvious baselines. (a) Late fusion with U: the simplest way to make the predictor "sufficient relative to U" is to concatenate U (a cheap pooled frozen feature) to T before the head, or ensemble a probe on U — at negligible inference cost for frozen-backbone methods since H0 is already computed. Without this, it is unclear why one should regularize rather than fuse. (b) Fine-tuning regularizers that preserve pretrained information: L2-SP (Li et al., 2018), DELTA (Li et al., 2019, feature-map regularization toward the frozen network), LP-FT (Kumar et al., 2022 — cited, but only for a different point), WiSE-FT (Wortsman et al., 2022), and feature distillation from the frozen backbone. (c) Subject-adversarial alone (see W1). (d) Other kernel dependence regularizers: an HSIC penalty in the style of the HSIC bottleneck (Ma et al., 2020), or a conditional-independence regularizer such as CIRCE (Pogodin et al., ICLR 2023) / HSCIC (Park & Muandet, 2020), which are the natural methodological comparators. Also tPoE-EIB appears in Table 1 without citation or description.
-
Novelty is limited. Props. 1–2 are direct restatements of the kernel conditional moment / maximum moment restriction framework (Muandet et al., 2020) applied to Y − E[Y|T]; the estimator is a weighted KRR plus a kernel V-statistic, with differentiable closed-form KRR as in Bertinetto et al. (2019). Kernel conditional-independence regularization of learned representations (CIRCE, HSCIC-based counterfactual invariance; Quinzan et al., 2022) and information-bottleneck/sufficiency regularization (e.g., Alemi et al., 2017 VIB; Federici et al., 2020 multi-view sufficiency) are closely related and not discussed. The EEG-specific contribution is the application and the subject-disjoint split; this is a reasonable engineering contribution but would need much stronger empirical evidence to clear the ICLR bar.
-
Gap between theory and practice is large and not analyzed. The population equivalence requires the true E[Y|T]; in practice T changes every step and the KRR is fitted on a handful of support subjects in one minibatch, with median-heuristic bandwidths that also move with T. No analysis is given of the bias of D̂ due to KRR plug-in error (which can be positive even under exact sufficiency, so the regularizer pushes toward something other than sufficiency), of the effect of the T-dependent bandwidth on gradients (the representation can change D̂ by rescaling its geometry), or of the variance with small query sets. Also, sufficiency relative to U is trivially attainable for frozen-backbone methods (T could contain U), so the constraint in Eq. 3 is weak; the paper should discuss why the regularized optimum is not just "copy U into T".
-
Motivational audit is under-specified. "SPLINCE" (Sec. 2.2) is neither defined nor cited; the correction construction, permutation control, and statistics behind Fig. 1 are not given. Fig. 1 also uses CSBrain and FACED, which are not in the main experiments; and the authors acknowledge it doesn't test sufficiency. The case studies in Fig. 5 / Sec. 4.3 are qualitative and on cached checkpoints different from the selected ones.
-
Reproducibility and completeness. The Reproducibility Statement promises supplementary "data preprocessing and splits, implementation settings, hyperparameters, random seeds, and diagnostic procedures", but the appendix contains only Fig. 5 and a Related Work section that ends mid-sentence ("encouraging the adapted representation to account"). Missing: number of subjects per split, what "limited-label" means (label fraction? per-subject trial budget?), batch size, epochs, optimizer, learning rates, which layers form U, dimensionality of U, how the support/query split handles batches with few subjects, number of query subjects, compute/memory overhead (FT requires a second frozen copy of the backbone plus an O(n³) solve per step), and code availability. Training overhead is never reported despite the "practical plug-in" claim.
The population-level idea is correct and cleanly motivated, but it is a direct application of known kernel conditional-moment machinery, so the paper's value rests on demonstrating that the specific sufficiency-relative-to-U mechanism yields reliable gains. The current evidence does not do that: a described component (subject-adversarial training) is missing from the objective and unablated, the V-statistic estimator contains a query-MSE term that confounds the key control, the essential U-ablations and a simple U-fusion baseline are absent, the gains are mostly within one standard deviation over three seeds with no significance testing, hyperparameter choices contradict the sensitivity study, and the promised appendix details are missing (with truncated related work and template residue). I would reconsider the paper, potentially moving toward weak acceptance, if the authors clarify and ablate the adversarial component, show that gains vanish when U is permuted/randomized (and persist with a U-statistic estimator), beat a U-concatenation baseline and standard fine-tuning regularizers, and provide paired significance across more seeds/subject folds with full implementation details and overhead. If the adversarial term or a T-only kernel accounts for most of the gain, this would further strengthen my concerns.