Search Results for author:
Found 13 papers, 9 papers with code
Bimodal Distributed Binarized Neural Networks
The proposed method consists of a training scheme that we call Weight Distribution Mimicking (WDM), which efficiently imitates the full-precision network weight distribution to their binary counterpart.
Optimal Fine-Grained N:M sparsity for Activations and Neural Gradients
We show that while minimization of the MSE works fine for pruning the activations, it catastrophically fails for the neural gradients.
Logarithmic Unbiased Quantization: Simple 4-bit Training in Deep Learning
Based on this, we suggest a \textit{logarithmic unbiased quantization} (LUQ) method to quantize all both the forward and backward phase to 4-bit, achieving state-of-the-art results in 4-bit training without overhead.
Logarithmic Unbiased Quantization: Practical 4-bit Training in Deep Learning
Based on this, we suggest a logarithmic unbiased quantization (LUQ) method to quantize both the forward and backward phase to 4-bit, achieving state-of-the-art results in 4-bit training.
Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Masks
Finally, to solve the problem of switching between different structure constraints, we suggest a method to convert a pre-trained model with unstructured sparsity to an N:M fine-grained block sparsity model with little to no training.
Neural gradients are near-lognormal: improved quantized and sparse training
While training can mostly be accelerated by reducing the time needed to propagate neural gradients back throughout the model, most previous works focus on the quantization/pruning of weights and activations.
Colored Noise Injection for Training Adversarially Robust Neural Networks
Even though deep learning has shown unmatched performance on various tasks, neural networks have been shown to be vulnerable to small adversarial perturbations of the input that lead to significant performance degradation.
Robust Quantization: One Model to Rule Them All
Neural network quantization methods often involve simulating the quantization process during training, making the trained model highly dependent on the target bit-width and precise way quantization is performed.
Loss Aware Post-training Quantization
We show that with more aggressive quantization, the loss landscape becomes highly non-separable with steep curvature, making the selection of quantization parameters more challenging.
Smoothed Inference for Adversarially-Trained Models
In this work, we study the application of randomized smoothing as a way to improve performance on unperturbed data as well as to increase robustness to adversarial attacks.
CAT: Compression-Aware Training for bandwidth reduction
Our method trains the model to achieve low-entropy feature maps, which enables efficient compression at inference time using classical transform coding methods.
Feature Map Transform Coding for Energy-Efficient CNN Inference
We analyze the performance of our approach on a variety of CNN architectures and demonstrate that FPGA implementation of ResNet-18 with our approach results in a reduction of around 40% in the memory energy footprint, compared to quantized network, with negligible impact on accuracy.
Towards Learning of Filter-Level Heterogeneous Compression of Convolutional Neural Networks
While mainstream deep learning methods train the neural networks weights while keeping the network architecture fixed, the emerging neural architecture search (NAS) techniques make the latter also amenable to training.
