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

Andrey Kuzmin

dblp:132/6964 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
2since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 2 first-author · 2 since 2021Systems, architecture and hardware · 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
2 papers
Efficient and distributed learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
1.222023
Pruning vs Quantization: Which is Better? · NeurIPS 2023
FP8 Quantization: The Power of the Exponent · NeurIPS 2022
Machine learning › Efficient and distributed learning › model compression
quantization
1.222023
Pruning vs Quantization: Which is Better? · NeurIPS 2023
FP8 Quantization: The Power of the Exponent · NeurIPS 2022
Machine learning › Efficient and distributed learning › model compression
pruning
0.712023
Pruning vs Quantization: Which is Better? · NeurIPS 2023
Machine learning › Efficient and distributed learning › model quantization
quantization error analysis
0.712023
Pruning vs Quantization: Which is Better? · NeurIPS 2023
Machine learning › Efficient and distributed learning › model quantization
FP8 quantization
0.612022
FP8 Quantization: The Power of the Exponent · NeurIPS 2022
Machine learning › Efficient and distributed learning › model compression › quantization
post-training quantization
0.612022
FP8 Quantization: The Power of the Exponent · NeurIPS 2022

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

fine-tuning · 0.7analytical error bounds · 0.7quantization-aware training · 0.6FP8 simulation · 0.6
YearPublicationVenuePosition
2023 Pruning vs Quantization: Which is Better?
abstract
Neural network pruning and quantization techniques are almost as old as neural networks themselves. However, to date, only ad-hoc comparisons between the two have been published. In this paper, we set out to answer the question of which is better: neural network quantization or pruning? By answering this question, we hope to inform design decisions made on neural network hardware going forward. We provide an extensive comparison between the two techniques for compressing deep neural networks. First, we give an analytical comparison of expected quantization and pruning error for general data distributions. Then, we provide lower and upper bounds for the per-layer pruning and quantization error in trained networks and compare these to empirical error after optimization. Finally, we provide an extensive experimental comparison for training 8 large-scale models trained on 3 tasks and provide insights into the representations learned during fine-tuning with quantization and pruning in the loop. Our results show that in most cases quantization outperforms pruning. Only in some scenarios with a very high compression ratio, compression might be beneficial from an accuracy standpoint.
Andrey Kuzmin, Markus Nagel, Mart van Baalen, Arash Behboodi, Tijmen Blankevoort
NeurIPS1
2022 FP8 Quantization: The Power of the Exponent
abstract
When quantizing neural networks for efficient inference, low-bit integers are the go-to format for efficiency. However, low-bit floating point numbers have an extra degree of freedom, assigning some bits to work on an exponential scale instead. This paper in-depth investigates this benefit of the floating point format for neural network inference. We detail the choices that can be made for the FP8 format, including the important choice of the number of bits for the mantissa and exponent, and show analytically in which settings these choices give better performance. Then we show how these findings translate to real networks, provide an efficient implementation for FP8 simulation, and a new algorithm that enables the learning of both the scale parameters and number of exponent bits in the FP8 format. Our chief conclusion is that when doing post-training quantization for a wide range of networks, the FP8 format is better than INT8 in terms of accuracy, and the choice of the number of exponent bits is driven by the severity of outliers in the network. We also conduct experiments with quantization-aware training where the difference in formats disappears as the network is trained to reduce the effect of outliers.
Andrey Kuzmin, Mart van Baalen, Markus Nagel, Jorn Peters, Tijmen Blankevoort
NeurIPS1
2018 Set2Model networks: Learning discriminatively to learn generative models
Alexander Vakhitov, Andrey Kuzmin, Victor S. Lempitsky
Comput. Vis. Image Underst.2
2013 Fast Methods for Computing Selected Elements of the Green's Function in Massively Parallel Nanoelectronic Device Simulations
Andrey Kuzmin, Mathieu Luisier, Olaf Schenk
Euro-Par1