arXiv Machine Learning By Hao Luo, Yiting Yang, Wenyi Zhao, Man Jiang, Zhijun Lin, Ghulam Mohiuddin, Ting Jiang, Kunming Luo, Zihao Zhang, Qingsen Yan, Guoqing Wang, Wei Dong, Peng Wang

Group-Shared Low-Rank Approximation for Mobile-Efficient Pointwise Convolutions in Large-Kernel CNNs

Read the original on arXiv Machine Learning →

The paper introduces Channel Group-Shared (CGS) low‑rank approximation, a Singular Value Decomposition–based strategy that shares down/up‑projection matrices across channel groups while using lightweight diagonal matrices for each group. This design dramatically cuts the parameter count of pointwise convolutions, which dominate the size of large‑kernel CNNs such as RepLKNet, ConvNeXt, and SLaK. Experiments show that CGS‑enhanced models maintain competitive accuracy while substantially reducing storage, memory bandwidth, and loading latency, making them viable for deployment on edge devices.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jul 3

WBMM: Windowed Batch Matrix Multiplication for Efficient Large Receptive Field Convolution

arXiv:2607. 02097v1 Announce Type: cross Abstract: Large kernel depthwise convolutions achieve strong performance but suffer from significant degradation as kernel size grows due to irregular memory access from gather-based computation; while Large Kernel Acceleration (LKA) helps on small feature maps, it becomes counterproductive on large feature maps, even slower than non-accelerated implementations.

By Wan Song, Wei Zhou, Rui Wang, Jun Yu, Toru Kurihara, Jiajia Xu, Shu Zhan