paper-with-me

Papers

ProdSumNet: reducing model parameters in deep neural networks via product-of-sums matrix decompositions

2018-09-06 · Chai Wah Wu

We consider a general framework for reducing the number of trainable model parameters in deep learning networks by decomposing linear operators as a product of sums of simpler linear operators. Recently proposed deep learning architectures such as CNN, KFC, Dilated CNN, etc. are all subsumed in this framework and we illustrate other types of neural network architectures within this framework. We show that good accuracy on MNIST and Fashion MNIST can be obtained using a relatively small number of trainable parameters. In addition, since implementation of the convolutional layer is resource-heavy, we consider an approach in the transform domain that obviates the need for convolutional layers. One of the advantages of this general framework over prior approaches is that the number of trainable parameters is not fixed and can be varied arbitrarily. In particular, we illustrate the tradeoff of varying the number of trainable variables and the corresponding error rate. As an example, by using this decomposition on a reference CNN architecture for MNIST with over 3x10^6 trainable parameters, we are able to obtain an accuracy of 98.44% using only 3554 trainable parameters.

📄 PDF Abstract BibTeX arXiv:1809.02209

Code (1)

Defasium/bayesVec2Midi tf

Similar Papers 제목 키워드 기반

Concentration Inequalities for Exchangeable Tensors and Matrix-valued Data

2026-01-28 · Chen Cheng, Rina Foygel Barber arxiv

We study concentration inequalities for structured weighted sums of random data, including (i) tensor inner products and (ii) sequential matrix sums. We are interested in tail bounds and concentration inequalities for th…

On Dimension-free Tail Inequalities for Sums of Random Matrices and Applications

2019-10-08 · Chao Zhang, Min-Hsiu Hsieh, DaCheng Tao

In this paper, we present a new framework to obtain tail inequalities for sums of random matrices. Compared with existing works, our tail inequalities have the following characteristics: 1) high feasibility--they can be …

compressed sensing

Quantum algorithms for spectral sums

2020-11-12 · Alessandro Luongo, Changpeng Shao

We propose new quantum algorithms for estimating spectral sums of positive semi-definite (PSD) matrices. The spectral sum of an PSD matrix $A$, for a function $f$, is defined as $ \text{Tr}[f(A)] = \sum_j f(\lambda_j)$, …

High-Performance Variance-Covariance Matrix Construction Using an Uncentered Gram Formulation

2025-11-11 · Felix Reichel arxiv

Reichel (2025) defined the bariance as a pairwise-difference measure that can be rewritten in linear time using only scalar sums. We extend this idea to the covariance matrix by showing that the standard matrix expressio…

In-training Matrix Factorization for Parameter-frugal Neural Machine Translation

2019-09-27 · Zachary Kaden, Teven Le Scao, Raphael Olivier

In this paper, we propose the use of in-training matrix factorization to reduce the model size for neural machine translation. Using in-training matrix factorization, parameter matrices may be decomposed into the product…

Machine TranslationTranslation