paper-with-me

홈 › Papers

Deep Neural Network Approximation using Tensor Sketching

2017-10-21 · Shiva Prasad Kasiviswanathan, Nina Narodytska, Hongxia Jin

Deep neural networks are powerful learning models that achieve state-of-the-art performance on many computer vision, speech, and language processing tasks. In this paper, we study a fundamental question that arises when designing deep network architectures: Given a target network architecture can we design a smaller network architecture that approximates the operation of the target network? The question is, in part, motivated by the challenge of parameter reduction (compression) in modern deep neural networks, as the ever increasing storage and memory requirements of these networks pose a problem in resource constrained environments. In this work, we focus on deep convolutional neural network architectures, and propose a novel randomized tensor sketching technique that we utilize to develop a unified framework for approximating the operation of both the convolutional and fully connected layers. By applying the sketching technique along different tensor dimensions, we design changes to the convolutional and fully connected layers that substantially reduce the number of effective parameters in a network. We show that the resulting smaller network can be trained directly, and has a classification accuracy that is comparable to the original network.

📄 PDF Abstract BibTeX arXiv:1710.07850

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Effective Streaming Low-tubal-rank Tensor Approximation via Frequent Directions

2021-08-23 · Qianxin Yi, Chenhao Wang, Kaidong Wang, Yao Wang

Low-tubal-rank tensor approximation has been proposed to analyze large-scale and multi-dimensional data. However, finding such an accurate approximation is challenging in the streaming setting, due to the limited computa…

Fast and Guaranteed Tensor Decomposition via Sketching

2015-06-14 · NeurIPS 2015 12 · Yining Wang, Hsiao-Yu Tung, Alexander Smola, Animashree Anandkumar

Tensor CANDECOMP/PARAFAC (CP) decomposition has wide applications in statistical learning of latent variable models and in data mining. In this paper, we propose fast and randomized tensor CP decomposition algorithms bas…

Tensor Decomposition

Efficient Tensor Contraction via Fast Count Sketch

2021-06-24 · Xingyu Cao, Jiani Liu

Sketching uses randomized Hash functions for dimensionality reduction and acceleration. The existing sketching methods, such as count sketch (CS), tensor sketch (TS), and higher-order count sketch (HCS), either suffer fr…

Computational EfficiencyDimensionality Reduction

Effective Tensor Sketching via Sparsification

2017-10-31 · Dong Xia, Ming Yuan

In this paper, we investigate effective sketching schemes via sparsification for high dimensional multilinear arrays or tensors. More specifically, we propose a novel tensor sparsification algorithm that retains a subset…

Cost-efficient Gaussian Tensor Network Embeddings for Tensor-structured Inputs

2022-05-26 · Linjian Ma, Edgar Solomonik

This work discusses tensor network embeddings, which are random matrices ($S$) with tensor network structure. These embeddings have been used to perform dimensionality reduction of tensor network structured inputs $x$ an…

Dimensionality ReductionTensor Decomposition