paper-with-me

홈 › Papers

DP-Net: Dynamic Programming Guided Deep Neural Network Compression

2020-03-21 · Dingcheng Yang, Wenjian Yu, Ao Zhou, Haoyuan Mu, Gary Yao, Xiaoyi Wang

In this work, we propose an effective scheme (called DP-Net) for compressing the deep neural networks (DNNs). It includes a novel dynamic programming (DP) based algorithm to obtain the optimal solution of weight quantization and an optimization process to train a clustering-friendly DNN. Experiments showed that the DP-Net allows larger compression than the state-of-the-art counterparts while preserving accuracy. The largest 77X compression ratio on Wide ResNet is achieved by combining DP-Net with other compression techniques. Furthermore, the DP-Net is extended for compressing a robust DNN model with negligible accuracy loss. At last, a custom accelerator is designed on FPGA to speed up the inference computation with DP-Net.

📄 PDF Abstract BibTeX arXiv:2003.09615

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringNeural Network CompressionQuantization

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…
Average Pooling 설명 없음
ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…
1x1 Convolution A 1 x 1 Convolution is a convolution with some special properties in that it can be used for dimensionality reduction,…
Batch Normalization 설명 없음
Bottleneck Residual Block A Bottleneck Residual Block is a variant of the residual block that utilises 1x1 convolutions to create a bottleneck. The…
Global Average Pooling Global Average Pooling is a pooling operation designed to replace fully connected layers in classical CNNs. The idea is to generate one feature map for each corresponding…
Residual Block Residual Blocks are skip-connection blocks that learn residual functions with reference to the layer inputs, instead of learning unreferenced functions. They were introduced…

Similar Papers 제목 키워드 기반

Syzygy: Dual Code-Test C to (safe) Rust Translation using LLMs and Dynamic Analysis

2024-12-18 · Manish Shetty, Naman jain, Adwait Godbole, Sanjit A. Seshia 외

Despite extensive usage in high-performance, low-level systems programming applications, C is susceptible to vulnerabilities due to manual memory management and unsafe pointer operations. Rust, a modern systems programmi…

Code GenerationCode TranslationTranslation

Adaptive Control of Client Selection and Gradient Compression for Efficient Federated Learning

2022-12-19 · Zhida Jiang, Yang Xu, Hongli Xu, Zhiyuan Wang 외

Federated learning (FL) allows multiple clients cooperatively train models without disclosing local data. However, the existing works fail to address all these practical concerns in FL: limited communication resources, d…

Federated Learning

Bounded Approximate Symbolic Dynamic Programming for Hybrid MDPs

2013-09-26 · Luis Gustavo Vianna, Scott Sanner, Leliane Nunes de Barros

Recent advances in symbolic dynamic programming (SDP) combined with the extended algebraic decision diagram (XADD) data structure have provided exact solutions for mixed discrete and continuous (hybrid) MDPs with piecewi…

Tree Quantization for Large-Scale Similarity Search and Classification

2015-06-01 · CVPR 2015 6 · Artem Babenko, Victor Lempitsky

We propose a new vector encoding scheme (tree quantization) that obtains lossy compact codes for high-dimensional vectors via tree-based dynamic programming. Similarly to several previous schemes such as product quantiza…

ClassificationGeneral Classificationimage-classificationImage Classification+2

An Algorithm for Cellular Reprogramming

2017-07-14

The day we understand the time evolution of subcellular elements at a level of detail comparable to physical systems governed by Newton's laws of motion seems far away. Even so, quantitative approaches to cellular dynami…