Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gil Shomron

dblp:201/8447 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2021
0000-0003-3752-3270ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Efficient and distributed learning · 90% Deep learning architectures and training · 10%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 67% Processor architecture and microarchitecture · 33%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
1.542021
Post-Training Sparsity-Aware Quantization · NeurIPS 2021
Robust Quantization: One Model to Rule Them All · NeurIPS 2020
Thanks for Nothing: Predicting Zero-Valued Activations with Lightweight Convolutional Neural Networks · ECCV (10) 2020
Machine learning › Efficient and distributed learning › model compression › quantization
post-training quantization
0.922021
Post-Training Sparsity-Aware Quantization · NeurIPS 2021
Robust Quantization: One Model to Rule Them All · NeurIPS 2020
Machine learning › Efficient and distributed learning › model compression › quantization
quantized neural network
0.922021
Post-Training Sparsity-Aware Quantization · NeurIPS 2021
Robust Quantization: One Model to Rule Them All · NeurIPS 2020
Machine learning › Efficient and distributed learning › model compression › sparsity
activation sparsity
0.512021
Post-Training Sparsity-Aware Quantization · NeurIPS 2021
Machine learning › Deep learning architectures and training
convolutional neural network
0.412020
Thanks for Nothing: Predicting Zero-Valued Activations with Lightweight Convolutional Neural Networks · ECCV (10) 2020
Hardware accelerators and domain-specific architectures › machine learning accelerator
neural network accelerator
0.412020
Non-Blocking Simultaneous Multithreading: Embracing the Resiliency of Deep Neural Networks · MICRO 2020
Processor architecture and microarchitecture › multithreading
simultaneous multithreading
0.412020
Non-Blocking Simultaneous Multithreading: Embracing the Resiliency of Deep Neural Networks · MICRO 2020
Hardware accelerators and domain-specific architectures
systolic array
0.412020
Non-Blocking Simultaneous Multithreading: Embracing the Resiliency of Deep Neural Networks · MICRO 2020

Methods — techniques the papers use, named apart from their topics

structural hazard handling · 0.9precision reduction · 0.9unstructured sparsity · 0.5dynamic bit-width selection · 0.5quantization-aware training · 0.4
YearPublicationVenuePosition
2021 Post-Training Sparsity-Aware Quantization
abstract
Quantization is a technique used in deep neural networks (DNNs) to increase execution performance and hardware efficiency. Uniform post-training quantization (PTQ) methods are common, since they can be implemented efficiently in hardware and do not require extensive hardware resources or a training set. Mapping FP32 models to INT8 using uniform PTQ yields models with negligible accuracy degradation; however, reducing precision below 8 bits with PTQ is challenging, as accuracy degradation becomes noticeable, due to the increase in quantization noise. In this paper, we propose a sparsity-aware quantization (SPARQ) method, in which the unstructured and dynamic activation sparsity is leveraged in different representation granularities. 4-bit quantization, for example, is employed by dynamically examining the bits of 8-bit values and choosing a window of 4 bits, while first skipping zero-value bits. Moreover, instead of quantizing activation-by-activation to 4 bits, we focus on pairs of 8-bit activations and examine whether one of the two is equal to zero. If one is equal to zero, the second can opportunistically use the other's 4-bit budget; if both do not equal zero, then each is dynamically quantized to 4 bits, as described. SPARQ achieves minor accuracy degradation and a practical hardware implementation.
Gil Shomron, Freddy Gabbay, Samer Kurzum, Uri C. Weiser
NeurIPS1
2020 Thanks for Nothing: Predicting Zero-Valued Activations with Lightweight Convolutional Neural Networks
Gil Shomron, Ron Banner, Moran Shkolnik, Uri C. Weiser
ECCV (10)1
2020 Non-Blocking Simultaneous Multithreading: Embracing the Resiliency of Deep Neural Networks
abstract
Deep neural networks (DNNs) are known for their inability to utilize underlying hardware resources due to hard-ware susceptibility to sparse activations and weights. Even in finer granularities, many of the non-zero values hold a portion of zero-valued bits that may cause inefficiencies when executed on hard-ware. Inspired by conventional CPU simultaneous multithreading (SMT) that increases computer resource utilization by sharing them across several threads, we propose non-blocking SMT (NB-SMT) designated for DNN accelerators. Like conventional SMT, NB-SMT shares hardware resources among several execution flows. Yet, unlike SMT, NB-SMT is non-blocking, as it handles structural hazards by exploiting the algorithmic resiliency of DNNs. Instead of opportunistically dispatching instructions while they wait in a reservation station for available hardware, NB-SMT temporarily reduces the computation precision to accommodate all threads at once, enabling a non-blocking operation. We demonstrate NB-SMT applicability using SySMT, an NB-SMT-enabled output-stationary systolic array (OS-SA). Compared with a conventional OS-SA, a 2-threaded SySMT consumes 1.4× the area and delivers 2× speedup with 33% energy savings and less than 1% accuracy degradation of state-of-the-art CNNs with ImageNet. A 4-threaded SySMT consumes 2.5× the area and delivers, for example, 3.4× speedup and 39%×energy savings with 1% accuracy degradation of 40%-pruned ResNet-18.
Gil Shomron, Uri C. Weiser
MICRO1
2020 Robust Quantization: One Model to Rule Them All
abstract
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. Robust quantization offers an alternative approach with improved tolerance to different classes of data-types and quantization policies. It opens up new exciting applications where the quantization process is not static and can vary to meet different circumstances and implementations. To address this issue, we propose a method that provides intrinsic robustness to the model against a broad range of quantization processes. Our method is motivated by theoretical arguments and enables us to store a single generic model capable of operating at various bit-widths and quantization policies. We validate our method's effectiveness on different ImageNet Models. A reference implementation accompanies the paper.
Moran Shkolnik, Brian Chmiel, Ron Banner, Gil Shomron, Yury Nahshan, Alexander M. Bronstein, Uri C. Weiser
NeurIPS4