paper-with-me

홈 › Papers

Matrix Is All You Need

2025-05-11 · Yuzhou Zhu

Deep neural networks employ specialized architectures for vision, sequential and language tasks, yet this proliferation obscures their underlying commonalities. We introduce a unified matrix-order framework that casts convolutional, recurrent and self-attention operations as sparse matrix multiplications. Convolution is realized via an upper-triangular weight matrix performing first-order transformations; recurrence emerges from a lower-triangular matrix encoding stepwise updates; attention arises naturally as a third-order tensor factorization. We prove algebraic isomorphism with standard CNN, RNN and Transformer layers under mild assumptions. Empirical evaluations on image classification (MNIST, CIFAR-10/100, Tiny ImageNet), time-series forecasting (ETTh1, Electricity Load Diagrams) and language modeling/classification (AG News, WikiText-2, Penn Treebank) confirm that sparse-matrix formulations match or exceed native model performance while converging in comparable or fewer epochs. By reducing architecture design to sparse pattern selection, our matrix perspective aligns with GPU parallelism and leverages mature algebraic optimization tools. This work establishes a mathematically rigorous substrate for diverse neural architectures and opens avenues for principled, hardware-aware network design.

📄 PDF Abstract BibTeX arXiv:2506.01966

Code (0)

등록된 구현이 없습니다.

Tasks

AllGPUimage-classificationImage ClassificationLanguage ModelingLanguage ModellingTime Series Forecasting

Methods 이 논문이 사용한 방법론

Absolute Position Encodings Absolute Position Encodings are a type of position embeddings for [Transformer-based models] where positional encodings are…
Layer Normalization Unlike batch normalization, Layer Normalization directly estimates the normalization statistics from the summed inputs…
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
Label Smoothing Label Smoothing is a regularization technique that introduces noise for the labels. This accounts for the fact that datasets may have mistakes in them, so maximizing the…
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Transformer A Transformer is a model architecture that eschews recurrence and instead relies entirely on an [attention…

Similar Papers 제목 키워드 기반

Sketching Transformed Matrices with Applications to Natural Language Processing

2020-02-23 · Yingyu Liang, Zhao Song, Mengdi Wang, Lin F. Yang 외

Suppose we are given a large matrix $A=(a_{i,j})$ that cannot be stored in memory but is in a disk or is presented in a data stream. However, we need to compute a matrix decomposition of the entry-wisely transformed matr…

CUR Algorithm for Partially Observed Matrices

2014-11-04 · Miao Xu, Rong Jin, Zhi-Hua Zhou

CUR matrix decomposition computes the low rank approximation of a given matrix by using the actual rows and columns of the matrix. It has been a very useful tool for handling large matrices. One limitation with the exist…

Matrix Completion

An iterative K-FAC algorithm for Deep Learning

2021-01-01 · Yingshi Chen

Kronecker-factored Approximate Curvature (K-FAC) method is a high efficiency second order optimizer for the deep learning. Its training time is less than SGD(or other first-order method) with same accuracy in many large-…

Deep Learning

The Matrix Calculus You Need For Deep Learning

2018-02-05 · Terence Parr, Jeremy Howard

This paper is an attempt to explain all the matrix calculus you need in order to understand the training of deep neural networks. We assume no math knowledge beyond what you learned in calculus 1, and provide links to he…

ArticlesDeep LearningMath

A two-dimensional decomposition approach for matrix completion through gossip

2017-11-21 · Mukul Bhutani, Bamdev Mishra

Factoring a matrix into two low rank matrices is at the heart of many problems. The problem of matrix completion especially uses it to decompose a sparse matrix into two non sparse, low rank matrices which can then be us…

Matrix CompletionVocal Bursts Valence Prediction