paper-with-me

홈 › Papers

Exploiting Redundancy: Separable Group Convolutional Networks on Lie Groups

2021-10-25 · David M. Knigge, David W. Romero, Erik J. Bekkers

Group convolutional neural networks (G-CNNs) have been shown to increase parameter efficiency and model accuracy by incorporating geometric inductive biases. In this work, we investigate the properties of representations learned by regular G-CNNs, and show considerable parameter redundancy in group convolution kernels. This finding motivates further weight-tying by sharing convolution kernels over subgroups. To this end, we introduce convolution kernels that are separable over the subgroup and channel dimensions. In order to obtain equivariance to arbitrary affine Lie groups we provide a continuous parameterisation of separable convolution kernels. We evaluate our approach across several vision datasets, and show that our weight sharing leads to improved performance and computational efficiency. In many settings, separable G-CNNs outperform their non-separable counterpart, while only using a fraction of their training time. In addition, thanks to the increase in computational efficiency, we are able to implement G-CNNs equivariant to the $\mathrm{Sim(2)}$ group; the group of dilations, rotations and translations. $\mathrm{Sim(2)}$-equivariance further improves performance on all tasks considered.

📄 PDF Abstract BibTeX arXiv:2110.13059

Code (1)

david-knigge/separable-group-convolutional-networks 공식 구현 pytorch

Tasks

Computational EfficiencyRotated MNIST

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

Similar Papers 제목 키워드 기반

Exploiting Learned Symmetries in Group Equivariant Convolutions

2021-06-09 · Attila Lengyel, Jan C. van Gemert

Group Equivariant Convolutions (GConvs) enable convolutional neural networks to be equivariant to various transformation groups, but at an additional parameter and compute cost. We investigate the filter parameters learn…

A Composite Decomposition Method for Large-Scale Global Optimization

2024-03-02 · Maojiang Tian, Minyang Chen, Wei Du, Yang Tang 외

Cooperative co-evolution (CC) algorithms, based on the divide-and-conquer strategy, have emerged as the predominant approach to solving large-scale global optimization (LSGO) problems. The efficiency and accuracy of the …

global-optimizationProblem DecompositionVariable Detection

Exploring the interplay of label bias with subgroup size and separability: A case study in mammographic density classification

2025-07-24 · Emma A. M. Stanley, Raghav Mehta, Mélanie Roschewitz, Nils D. Forkert 외 arxiv

Systematic mislabelling affecting specific subgroups (i.e., label bias) in medical imaging datasets represents an understudied issue concerning the fairness of medical AI systems. In this work, we investigated how size a…

KGroups: A Versatile Univariate Max-Relevance Min-Redundancy Feature Selection Algorithm for High-dimensional Biological Data

2026-03-30 · Malick Ebiele, Malika Bendechache, Rob Brennan arxiv

This paper proposes a new univariate filter feature selection (FFS) algorithm called KGroups. The majority of work in the literature focuses on investigating the relevance or redundancy estimations of feature selection (…

The non-overlapping statistical approximation to overlapping group lasso

2022-11-16 · Mingyu Qi, Tianxi Li

Group lasso is a commonly used regularization method in statistical learning in which parameters are eliminated from the model according to predefined groups. However, when the groups overlap, optimizing the group lasso …