- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces Flash EQ-Linear, an efficient implementation of equivariant linear layers for cyclic-group regular representations. It uses Fourier transforms and conjugate symmetry to simplify equivariant computation, while fused CUDA kernels further improve runtime efficiency. Experiments on equivariant ViTs and other architectures demonstrate substantial latency and throughput improvements without retraining or accuracy degradation.
Critical strengths
-
The paper is clearly written and well organized。
-
The CUDA implementation is carefully optimized and translates the theoretical reduction in computation into substantial practical speedups.
Critical weaknesses
-
The proposed acceleration is limited to cyclic-group regular representations, and its extension to non-abelian groups such as is not established. Such groups require matrix-valued Fourier blocks rather than the simple scalar-frequency decomposition exploited by Flash EQ-Linear.
-
The theoretical contribution of this paper is limited, as Quick ViT already introduced a framework for accelerating equivariant linear layers based on Fourier transformation. Flash EQ-Linear can be viewed as its specialization to cyclic groups, and reinterpret through Fourier analysis and convolution.
-
For the experiments comparing against Quick ViTs, the paper does not report the training recipes for either the Quick ViT baselines or the Naive EQ-ViT checkpoints used by Flash EQ-ViT. Moreover, Table 5 does not provide a compute-matched comparison, as the Quick ViTs use substantially fewer FLOPs and parameters, which may partly explain their lower accuracy.
Questions for authors
see weakness
10 comments
Weaknesses 1: Limited to cyclic-group regular representations, the extension to non-abelian groups such as is not established.
Response 1: We sincerely thank the reviewer for this insightful comment regarding the scope of our group formulations. Before introducing our extension to dihedral groups, we first wish to respectfully emphasize the standalone practical value of our initial cyclic-group formulation. Finite cyclic groups (especially and ) form the foundation of the most widely deployed regular-representation equivariant networks in 2D vision, such as G-CNN, GSA-Net, EQ-ViT, and EQ-VMamba. These architectures have already demonstrated state-of-the-art performance across diverse real-world applications. Therefore, providing a training-free, operator-level acceleration specifically tailored for cyclic groups inherently delivers substantial, immediate practical value to the computer vision community.
Nevertheless, we fully agree with the reviewer that extending our framework to non-abelian groups (such as ) is a crucial and highly meaningful generalization. We are pleased to report that our methodology is indeed fully extensible to these cases. In the revised manuscript, we have successfully extended our derivation to general dihedral groups—utilizing matrix-valued Fourier blocks as you perceptively noted—and implemented the corresponding fused CUDA inference kernels for the non-abelian group .
The measured end-to-end speedups for are highly significant:
| Model | FP32 speedup | FP16 speedup |
|---|---|---|
| Flash EQ-Linear-D8 | 4.6x | 4.3x |
| Flash EQ-ViT-D8-H | 2.2x | 1.6x |
We also extend the derivation to general dihedral groups, following Algorithm 1's transform–multiply–inverse-transform structure with matrix-valued Fourier blocks, as detailed below.
1) Setup. Denote the dihedral group as of order , with rotations and reflections ordered as where is the identity, rotates by , and is a reflection. For one token and input–output channel pair, collect the real inputs, outputs, and weights into . The EQ-Linear layer computes Split the input and output into rotation and reflection halves: Thus, the layer becomes
\quad A,B\in\mathbb{R}^{n\times n}\ \text{circulant},$$ with $A_{t,u}=W_{(u-t)\bmod n}, ~~B_{t,u}=W_{n+(u-t)\bmod n}, ~~t,u=0,\ldots,n-1$. **2) Algorithm R3: Flash EQ-Linear for $D_{2n}$** **Step 1 — Real group Fourier transform.** Apply an $n$-point DFT to each half, $U_k=\sum_{t<n}x_t e^{-2\pi ikt/n}$, $V_k=\sum_{t<n}x_{n+t}e^{-2\pi ikt/n}$, with $U_{n-k}=\overline{U_k}, ~V_{n-k}=\overline{V_k}$. The independent components include $q$ real scalars ($q=4$ even $n$, $2$ odd) plus $m=\lfloor(n-1)/2\rfloor$ real $2\times2$ matrices, giving $q+4m=2n$ coordinates. For $k=1,\dots,m$, $$\hat X^{(k)}=\begin{pmatrix}Re(U_k)+Re(V_k) & Im(U_k)-Im(V_k)\\\\ -Im(U_k)-Im(V_k) & Re(U_k)-Re(V_k)\end{pmatrix}.$$ Stacking scalars then matrix entries gives $\hat{x}=\mathbf{T}x, \mathbf{T}\in\mathbb{R}^{2n\times2n}$, which uses only additions. Since $\mathbf T$ block-diagonalizes $M$, the multiplication in Step 2 is block-wise. **Step 2 — Multiply the Fourier blocks.** Scalars are independent, $\hat y_j=\hat x_j\hat w_j$; matrices multiply as $\hat Y^{(k)}=\hat X^{(k)}\hat W^{(k)}$. For $D_8$, $$\begin{pmatrix}\hat y_4&\hat y_5\\\\ \hat y_6&\hat y_7\end{pmatrix} =\begin{pmatrix}\hat x_4&\hat x_5\\\\ \hat x_6&\hat x_7\end{pmatrix} \begin{pmatrix}\hat w_4&\hat w_5\\\\ \hat w_6&\hat w_7\end{pmatrix},$$ so the four scalar products plus one $2\times2$ matrix product cost $4+4\times2=12$ real multiplications. This computation follows directly from the identity $\mathbf{T}M\mathbf{T}^{-1}=diag\big(\hat w_0,\hat w_1,\hat w_2,\hat w_3,(\hat W^{(1)})^{\top},(\hat W^{(1)})^{\top}\big)$. **Step 3 — Inverse real group Fourier transform.** Because the rows of $\mathbf T$ are orthogonal, the inverse is $$y=\mathbf T^\top D^{-1}\hat{y}, ~~D=\mathbf T\mathbf T^\top=diag(2nI_q,nI_{4m}),$$ where $I_d$ is the $d\times d$ identity matrix. Add the original shared bias afterward. These steps recover $Mx$ in exact arithmetic. **3) Theoretical MAC reduction.** Per token and input–output channel pair, the core multiplication count is $$q+8m=\begin{cases}4n-4,&n\text{ even},\\\\ 4n-2,&n\text{ odd},\end{cases}$$ versus $(2n)^2$ for the dense layer. For $D_8$ the reduction is $64/12\approx5.33\times$. **Revision.** We have added the dihedral-group derivation, explicit $D_8$ transforms, and the operator-level benchmarks and end-to-end Flash EQ-ViT-$D_8$ evaluations in Appendices B and E.Weaknesses 2: The theoretical contribution beyond Quick ViT is limited.
Response 2: We sincerely thank the reviewer for pointing this out. We fully agree that the representation-theoretic foundation (Fourier block-diagonalization) was elegantly established in Quick ViTs. Accordingly, we have revised the manuscript to explicitly attribute this foundational observation to them and narrowed our novelty claims.
However, we would like to kindly clarify that, as insightfully noted by Reviewer 5aQV, our contribution lies in translating the theoretical observation into a highly practical acceleration paradigm, which enables training-free operator replacement and unlocks practical speedups for small models. Specifically, beyond the theoretical observation in Quick ViTs, our contributions are fourfold:
1) Operator-level, training-free replacement across equivariant architectures. Unlike Quick ViTs which keep features in the Fourier domain throughout the network (requiring architectural redesign and retraining), Flash EQ-Linear strictly preserves the regular-representation input and output interfaces of each layer, changing bases only internally. Thus, a pretrained model can be accelerated entirely out-of-the-box by replacing its EQ-Linear layers, with no retraining, no architectural change, and exactly zero accuracy degradation. This operator-level design provides a general and easy-to-use acceleration paradigm for the community.
2) Fused CUDA kernels that make the savings practical at small sizes. Turning theoretical FLOP reduction into measured wall-clock speedup matters immensely in practice. Quick ViTs leave the practical speedup in the small-model regime open: Bökman et al., 2025 [1] report that "for small models, such as ViT-S and ConvNeXt-S, the equivariant versions have a worse throughput" and state that "custom GPU-code is likely required"; Nordström et al., 2026 [2] attribute this gap to insufficient arithmetic intensity at low channel widths. We completely close this gap on small models with dedicated fused CUDA kernels, successfully yielding end-to-end speedups at every model scale, in both precisions.
3) Explicit arithmetic and efficient implementation for finite cyclic groups. While Quick ViTs focus on reflection and dihedral groups (e.g., and ), whose irreducible representations are entirely of real type, we derive the explicit arithmetic framework for finite cyclic groups (e.g., ). The real Fourier decomposition of these cyclic groups inherently contains complex-type components. We explicitly model these carefully coupled real and imaginary computations. Establishing this explicit arithmetic for complex-type representations is mathematically distinct from the real-type block diagonalizations used in [1, 2].
For complex-type blocks, Gauss's three-product identity reduces each complex matrix product from 4 real matrix multiplications to 3:
\Updownarrow&\\\\ T_1=Re(\hat X)Re(\hat W)^\top, ~~T_2=Im(\hat X)Im(\hat W)^\top, ~~&T_3=\bigl(Re(\hat X)+Im(\hat X)\bigr)\bigl(Re(\hat W)+Im(\hat W)\bigr)^\top,\\\\ Re(\hat Y)=T_1-T_2, ~~&Im(\hat Y)=T_3-T_1-T_2.\end{aligned}$$ This would push the theoretical FLOPs reduction bound even higher—from $16/6$ to $16/5=3.20\times$ for $p_4$, and from $64/14$ to $64/11 \approx 5.82\times$ for $p_8$. **Beyond cyclic groups, our operator-level framework seamlessly accommodates the dihedral groups.** We provide explicit cyclic-group arithmetic and a fused operator implementation for complex-type components. Our plug-and-play formulation is fully compatible with the real-type irreducible representations of non-abelian groups. We have explicitly extended our derivation to general dihedral groups and implemented the corresponding fused CUDA kernels for $D_8$. **4) Comprehensive empirical validation demonstrating the universal viability of equivariant networks.** By conducting plug-and-play experiments across diverse architectures, ranging from standard Transformers (EQ-ViT, EQ-Swin) to State Space Models (EQ-VMamba) and Implicit Neural Representations (EQ-INR), we prove that regular-representation equivariant methods can simultaneously deliver superior accuracy and faster inference across modern vision architectures. This breaks the stereotype that equivariance inevitably trades speed for robustness, making a significant contribution to the broader adoption of equivariant networks in latency-critical, real-time image processing scenarios, such as remote sensing (which heavily relies on $p_4$ and $p_8$ equivariance) and autonomous driving (which utilizes $D_2$ equivariance). **Revision.** We have clarified the contribution statements and attribution to Quick ViTs, expanded the arithmetic analysis, and added the dihedral-group derivation and corresponding $D_8$ experiments.
We sincerely thank the reviewer for appreciating the clear presentation and carefully optimized CUDA implementation, and for recognizing the practical speedups. In the revision, we have extended Flash EQ-Linear to the non-abelian group D8, clarified our contributions relative to Quick ViTs, and added comparisons at matched parameter and FLOP budgets.
The revised manuscript has been uploaded (with all changes highlighted in red), and our point-by-point responses are detailed below.