Further response to the benefits of left singular vectors
We thank the reviewer for the reply. We provide the following 3 aspects to address your concerns and eliminate possible confusions.
### 1. Projection scores involving left singular vectors are beneficial to the performance.
For clarity, in Table R.1 we summarize the setups and architectures of Table 2pAx-1. We use the 2-layer backbone baseline commonly used on LRA. To make the ablation more comprehensive, we **respectively** conduct this study on the two main architectures in this work, i.e., Primal. and Primal.$+$Trans. (see the 1st paragraph of Sec.5 in the paper for details).
**Table R.1:** Ablation setups on LRA.
|Primal.|w/o $r$-scores|w/ $r$-scores|
|:-:|:-:|:-:|
|Layer 1|[right]|[right;left]|
|Layer 2|[right]|[right;left]|
|Avg. Acc.|45.6|**57.5**|
|Primal.$+$Trans.|w/o $r$-scores|w/ $r$-scores|
|:-:|:-:|:-:|
|Layer 1|canonical attention|canonical attention|
|Layer 2|[right]|[right;left]|
|Avg. Acc.|59.4|**60.4**|
The two subtables in Table 2pAx-1 are the ablation study of using the left singular vectors on **two different network architectures respectively**, so that their results are not directly comparable under the setups in this ablation. Therefore, it is not the left singular vectors that bring bad influence on the performance, and such evaluations should be considered separately in these two subtables. More specifically,
1. Using the projections of left singular vectors, i.e., (w/ $r$-scores), is helpful to the performance, when Primal-Attention is applied to all layers (Primal.) and also when it is applied only to deep layer (Primal.$+$Trans.). The role of the left singular vectors is more influential in Primal. for boosting the performance, where all canonical attention is replaced with the KSVD-based Primal-Attention.
2. As mentioned by the reviewer, Primal.(w/ $r$-scores) has inferior performance than Primal.$+$Trans.(w/o $r$-scores). This is due to: Primal.(w/ $r$-scores) applies low-rank KSVD to the first layer, where the learning in this shallow layer does not always desire for the low-rank property from KSVD as much as the deep layer does on LRA.
### 2. Performance gain is substantial.
From the results of Primal.$+$Trans. in Table 2pAx-1, the mentioned performance improvement is substantial on LRA.
1. *We obtain 1% gain (59.4% $\to$ 60.4%) in average accuracy:* In Table 2 in paper, recent SoTA method YOSO-E has only 0.4\% gain compared to the baseline. Hence, 1% gain can be regarded as substantial on LRA.
2. *LRA benchmark should be evaluated as a whole:* Since there are five different tasks in this benchmark, the average accuracy is the most conclusive measure, which is also attached great importance by almost all SoTA methods. In Table 2 in paper, YOSO-E even has inferior performance on Pathfinder dataset than baseline. However, this cannot diminish its overall better performance on this benchmark.
3. *In each individual task, using both projection scores consistently brings improvement*: As in Table R.2, the accuracy gain is significant on at least 3 tasks: Retrieval, Image and Pathfinder; besides, using both projection scores consistently improves performances in all tasks, which is substaintial for the LRA benchmark.
**Table R.2:** Acc.(%) gain of Primal.$+$Trans.(w/ $r$-scores) over Primal.$+$Trans.(w/o $r$-scores).
|Primal.$+$Trans.|ListOps|Text|Retrieval|Image|Pathfinder|Avg.Acc.|
|:-:|:-:|:--:|:-:|:-:|:-:|:-:|
|Acc.$\uparrow$|0.2|0.3|1.8|1.1|1.5|1.0|
### 3. Necessity remarks
1. **Theoretically,** the derived KSVD can be regarded as a low-rank approximation to the self-attention kernel matrix where utilizing both left and right singular vectors leads to the optimal approximation.
2. **Experimentally,** using both projection scores brings substantial performance gain than using only one.
3. **Intuitively,** using both projection scores can be treated as considering both directions in a directed graph. Section 2 in the paper presents the asymmetric attention weight $K_{ij}=\kappa(\boldsymbol x_i, \boldsymbol x_j)=\text{softmax}(a(\boldsymbol x_i, \boldsymbol x_j))$ with $a(\boldsymbol x_i, \boldsymbol x_j)=\left<q(\boldsymbol x_i), k(\boldsymbol x_j)\right>/\sqrt{d_k}$. This shows that the attention kernel $K$ can be interpreted as message passing in a directed graph in relation to queries and keys, with asymmetric similarity measures $\kappa(\boldsymbol x_i, \boldsymbol x_j)\neq\kappa(\boldsymbol x_j, \boldsymbol x_i)$. Using only the right singular vectors means considering only one directionality, where additional information might reside in another directionality to enhance the learning on such an asymmetric kernel matrix. Useful references can be checked on page 128-129 in [1] for graph theory. In the asymmetric case, it is natural to consider directed information, i.e., both right and left singular vectors as in our case, for enhancing performance.
[1] Estrada, E. "The structure of complex networks: theory and applications." Oxford University Press, 2012.