Dimension Mixer: Group Mixing of Input Dimensions for Efficient Function Approximation

Suman Sapkota, Binod Bhattarai
11/30/2023
cs.LG

Official code: tsumansapkota/Solving-LRA-PathX (2 stars, last commit 2024-12-24). 1 more implementation below.

Abstract

The recent success of multiple neural architectures like CNNs, Transformers, and MLP-Mixers motivated us to look for similarities and differences between them. We found that these architectures can be interpreted through the lens of a general concept of dimension mixing. Research on coupling flows and the butterfly transform shows that partial and hierarchical signal mixing schemes are sufficient for efficient and expressive function approximation. In this work, we study group-wise sparse, non-linear, multi-layered and learnable mixing schemes of inputs and find that they are complementary to many standard neural architectures. Following our observations and drawing inspiration from the Fast Fourier Transform, we generalize Butterfly Structure to use non-linear mixer function allowing for MLP as mixing function called Butterfly MLP. We were also able to sparsely mix along sequence dimension for Transformer-based architectures called Butterfly Attention. Experiments on CIFAR and LRA datasets demonstrate that the proposed Non-Linear Butterfly Mixers are efficient and scale well when the host architectures are used as mixing function. Additionally, we propose Patch-Only MLP-Mixer for processing spatial 2D signals demonstrating a different dimension mixing strategy.

View on arXivView PDF

Code Implementations(2)

20Shell, PythonOct 9, 20241 years agoNOASSERTION
MIT
10Shell, PythonAug 29, 20231 years agoMIT

Cite this paper

@article{sapkota2023dimension,
  title  = {Dimension Mixer: Group Mixing of Input Dimensions for Efficient Function Approximation},
  author = {Suman Sapkota and Binod Bhattarai},
  year   = {2023},
  eprint = {2311.18735},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2311.18735v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2311.18735.svg)](https://codeofpaper.com/paper/2311.18735)

Discussion