- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
The paper studies the problem with SPDNet-based networks that are used for EEG decoding. It builds upon the assertion that layers (BiMap->ReEig) within an SPDNet often act as a single BiMap filter and therefore SPDNet performance does not improve by adding more layers. Starting from this point, the paper shows that a single BiMap has a capacity ceiling. Specifically, in the case of a single BiMap filter \in St(n,k) that is shared across m domains, the average per-domain subspace overlap is at most k/m (conditioned on mutually orthogonal subspaces, the worst-case). The paper next proposes a scheme to break through the capacity ceiling where instead of using a single BiMap filter, the input is routed through K Stiefel-manifold experts. These experts interact with each other via cross-attention and are combined as a Riemannian barycenter at learned anchor. The paper also address three routing-collapse where the K experts do not specialize. In this case the K attention weights become roughly uniform and set of experts is essentially reduced to a single filter. The proposed scheme is evaluated on five EEG datasets and the proposed scheme outperforms SPDNet.
Critical strengths
- The paper makes an important observation that stacking BiMap->ReEig in SPDNet is reduced to a single BiMap filter in practice because ReEig never engages.
- Lemma 1 that shows the capacity ceiling of using a single filter is easy to understand and is useful for practitioners.
- Section 6 that discusses routing collapse failure and the three proposals for addressing this routing collapse are important.
Critical weaknesses
- Experiments are conducted on motor-imagery EEG. The paper, however, claims that the method is equally useful for medical imaging and radar applications. No results are presented to support this claim.
- MUSUME (Yamamoto et al., 2021 ) also uses multiple Stiefel filters for EEG. This should be included in the comparison table.
- The paper will benefit from an analysis of what each of the K experts learns.
- How would the claim about ceiling capacity hold when the subspaces are not mutually orthogonal?
Questions for authors
- On real EEG, how close to mutually orthogonal are the per-domain optimal subspaces U_d?
- Appendix H mentions that domain identity is the dominant routing signal. Is there a way to confirm if the proposed method is learning a per-domain filter bank? If so, how would this method compare against simple per-domain BiMap, each of which is trained for a single domain.
- How sensitive is this method to the choice of K?
2 comments
Response with pointers to revised article pdf ,2
W4 / Q1 (non-orthogonal subspaces; how close to orthogonal on real EEG).
Lemma 1 extends to overlapping subspaces. Let . Since , we have . By Ky Fan's maximum principle, this trace is at most the sum of the largest eigenvalues of , with equality when spans the corresponding eigenvectors. Hence
For mutually orthogonal subspaces, is a projector and the bound is , as in Lemma 1. The bound rises as the subspaces overlap, and it reaches only when all coincide. A fixed filter therefore keeps a ceiling below whenever domains differ, and the orthogonal case is its least favourable instance.
The optimal subspaces on real EEG cannot be measured directly (see our reply to qvkh W3/Q2). Within the model of Lemma 1, however, the dimensions we use rule out the orthogonal case. In , at most subspaces of dimension can be mutually orthogonal, and any two of them share at least dimensions (Grassmann formula). Our filters keep about half of the channels or more, so at most two domains can be mutually orthogonal. On BNCI2014001 and BNCI2015001 even two cannot be. On BNCI2014001 (, ), any two domain subspaces share at least 18 of their 20 dimensions. Real domains therefore lie far from the worst case, and routing still improves over a fixed filter there (Table R2). This is consistent with the compression we observe. On the three datasets where we varied K, four experts already come within 1 point of K = m (Table R4). The revised PDF adds this bound next to Lemma 1 (Remark 1), and the dimension argument to Appendix F.
Q2 (is SCAP learning a per-domain bank; comparison with per-domain BiMaps). SCAP learns fewer shared experts than domains (Table R3, row domains / experts), and each domain has a preferred blend of them. The domain-routing alignment r_d confirms this. It compares how much the routing varies between domains with how much it varies across trials, and values near 1 mean the domain explains almost all of it. For input-routed SCAP it ranges from .77 to 1.11 (Table R1, row r_d), as in submitted Table 7, so routing is mostly driven by the domain. On BNCI2015001 and BNCI2014001, r_d is lower (.77 and .91), so routing also varies with the trial within a domain.
We added per-domain SPDNets, each trained on a single domain, as row (e) of Table R3. When the domain id is known, such per-domain baselines are the upper reference, and they use more parameters, 1.5 to 3.4 times SCAP's. Input-routed SCAP (c) is not significantly below them on Weibo2014 and BNCI2014001. They are significantly ahead on BNCI2015001 (+2.5 points), GrosseWentrup2009 (+5.2) and Schirrmeister2017 (+3.2). Against row (d), which learns one filter per domain with a shared classifier, SCAP is not significantly below on three of five datasets.
Q3 (sensitivity to K). Table R4. From K = 4 up to K = m, accuracy varies by at most 1.2 points on each dataset, and K = 2 already exceeds SPDNet on all three (+1.6 to +2.5 points). Tables R1–R3 use the paper's K, fixed before this sweep.
Response with pointers to revised article pdf
W1 (medical imaging and radar claims). We agree that our results cover motor-imagery EEG only. The Discussion mentioned medical imaging and radar as settings where the same depth collapse could plausibly occur, as a direction for future work. To avoid any overreach, the revised Conclusion removes this conjecture and keeps these domains only in the list of future directions.
W2 (MUSUME as baseline). We implemented MUSUME from the paper and ran it on the same folds and inputs as every method of Table 1, as one model shared by all domains. MUSUME learns several Stiefel filters, fits an MDM classifier in each of their subspaces, and keeps the filter with the best validation accuracy. At test time it applies this single filter to every trial, while SCAP builds a filter for each trial. We use the published number of filters (4) and the subspace dimension of SPDNet and SCAP.
MUSUME scores below SPDNet and SCAP on all five datasets. SCAP exceeds it by 6.5 to 26.3 points, significantly on four datasets. Giving MUSUME as many filters as SCAP has experts changes its accuracy by at most 0.3 points. MUSUME also takes 4 to 9 times longer than training SCAP, mostly to optimise its cost over pairs of neighbouring trials. MUSUME is now in Table 1 of the revised PDF (details in Appendix I).
W3 (what each expert learns). We analysed how the experts are used, on the runs of Table R1. Across trials, every expert is in use. The effective number of experts, the exponential of the entropy of the routing weights averaged over all trials, is 7.9 of 8, 7.9 of 9, 14.4 of 16, 7.8 of 8 and 10.0 of 12 (Weibo / GW09 / BNCI15 / BNCI14 / Schirr.). Within a single trial, the weight concentrates on fewer experts (Table R1, row H̄), and each domain has a preferred blend (row r_d). The experts therefore act as building blocks shared across domains. Appendix H now reports these quantities per dataset, with their discussion.