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

Yair Hanani

dblp:141/1316 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

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
2 papers
Efficient and distributed learning · 83% Planning, search and constraint satisfaction · 17%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › distributed training › large model training
distributed training of large language models
0.912025
Tensor-Parallelism with Partially Synchronized Activations · NeurIPS 2025
Parallel and multicore computing › distributed deep learning training
tensor parallelism
0.912025
Tensor-Parallelism with Partially Synchronized Activations · NeurIPS 2025
Machine learning › Efficient and distributed learning › model quantization
bit-width allocation
0.512021
Accurate Post Training Quantization With Small Calibration Sets · ICML 2021
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › constraint optimization
integer programming
0.512021
Accurate Post Training Quantization With Small Calibration Sets · ICML 2021
Machine learning › Efficient and distributed learning
model compression
0.512021
Accurate Post Training Quantization With Small Calibration Sets · ICML 2021
Machine learning › Efficient and distributed learning › model compression › quantization
post-training quantization
0.512021
Accurate Post Training Quantization With Small Calibration Sets · ICML 2021

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

tensor parallelism · 1.7partial activation synchronization · 1.7integer programming · 0.5calibration set optimization · 0.5
YearPublicationVenuePosition
2025 Tensor-Parallelism with Partially Synchronized Activations
abstract
Training and inference of Large Language Models (LLMs) with tensor-parallelism requires substantial communication to synchronize activations. Our findings suggest that with a few minor adjustments to current practices, LLMs can be trained without fully synchronizing activations, reducing bandwidth demands. We name this “Communication-Aware Architecture for Tensor-parallelism” (CAAT-Net). We train a 7B parameter CAAT-Net model and show that tensor-parallel communication can be reduced by up to 50% with no significant drop in pretraining accuracy across nearly all evaluated benchmarks. We also experiment with smaller 130M and 1.1B models to show the robustness and scalability of our method. We find that, in some scenarios, validation loss can even improve when reducing communication. Finally, we demonstrate how CAAT-Net accelerates both training and inference workloads across various settings and model sizes.
Itay Lamprecht, Asaf Karnieli, Yair Hanani, Niv Giladi, Daniel Soudry
NeurIPS3
2021 Accurate Post Training Quantization With Small Calibration Sets
abstract
Lately, post-training quantization methods have gained considerable attention, as they are simple to use, and require only a small unlabeled calibration set. This small dataset cannot be used to fine-tune the model without significant over-fitting. Instead, these methods only use the calibration set to set the activations’ dynamic ranges. However, such methods always resulted in significant accuracy degradation, when used below 8-bits (except on small datasets). Here we aim to break the 8-bit barrier. To this end, we minimize the quantization errors of each layer or block separately by optimizing its parameters over the calibration set. We empirically demonstrate that this approach is: (1) much less susceptible to over-fitting than the standard fine-tuning approaches, and can be used even on a very small calibration set; and (2) more powerful than previous methods, which only set the activations’ dynamic ranges. We suggest two flavors for our method, parallel and sequential aim for a fixed and flexible bit-width allocation. For the latter, we demonstrate how to optimally allocate the bit-widths for each layer, while constraining accuracy degradation or model compression by proposing a novel integer programming formulation. Finally, we suggest model global statistics tuning, to correct biases introduced during quantization. Together, these methods yield state-of-the-art results for both vision and text models. For instance, on ResNet50, we obtain less than 1% accuracy degradation — with 4-bit weights and activations in all layers, but first and last. The suggested methods are two orders of magnitude faster than the traditional Quantize Aware Training approach used for lower than 8-bit quantization. We open-sourced our code \textit{https://github.com/papers-submission/CalibTIP}.
Itay Hubara, Yury Nahshan, Yair Hanani, Ron Banner, Daniel Soudry
ICML3
2016 Quality scores for deep regression systems
abstract
Deep methods based on Convolutional Neural Networks serve as accurate facial points and body parts detectors. However, most methods do not provide a confidence score for the quality of the localization process. In real world applications, such a score could be invaluable. We, therefore, study the problem of estimating the success of the localization process during test time. Our method is based on mapping the network activation features to the area under the point-accuracy-curve. Our method greatly outperforms methods that were recently suggested, such as those which are based on the stability of the detection or on the norm of the representation layer.
Yaron Gurovich, Imry Kissos, Yair Hanani
ICIP3