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

Eyyüb Sari

dblp:234/8877 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

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

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

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
1 paper
Efficient and distributed learning · 87% Optimization for machine learning · 13%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
0.512021
Demystifying and Generalizing BinaryConnect · NeurIPS 2021
Machine learning › Efficient and distributed learning › model compression › quantization
quantized neural network
0.512021
Demystifying and Generalizing BinaryConnect · NeurIPS 2021
Mathematical optimization › continuous optimization
convex optimization
0.512021
Demystifying and Generalizing BinaryConnect · NeurIPS 2021
Mathematical optimization › continuous optimization › convex optimization
proximal methods
0.512021
Demystifying and Generalizing BinaryConnect · NeurIPS 2021
Machine learning › Optimization for machine learning
convergence analysis
0.112021
Demystifying and Generalizing BinaryConnect · NeurIPS 2021

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

proximal maps · 1.0generalized conditional gradient · 1.0dual averaging · 1.0convergence analysis · 1.0
YearPublicationVenuePosition
2022 iRNN: Integer-only Recurrent Neural Network
abstract
Recurrent neural networks (RNN) are used in many real-world text and speech applications. They include complex modules such as recurrence, exponential-based activation, gate interaction, unfoldable normalization, bi-directional dependence, and attention. The interaction between these elements prevents running them on integer-only operations without a significant performance drop. Deploying RNNs that include layer normalization and attention on integer-only arithmetic is still an open problem. We present a quantization-aware training method for obtaining a highly accurate integer-only recurrent neural network (iRNN). Our approach supports layer normalization, attention, and an adaptive piecewise linear approximation of activations (PWL), to serve a wide range of RNNs on various applications. The proposed method is proven to work on RNN-based language models and challenging automatic speech recognition, enabling AI applications on the edge. Our iRNN maintains similar performance as its full-precision counterpart, their deployment on smartphones improves the runtime performance by $2\times$, and reduces the model size by $4\times$.
Eyyüb Sari, Vanessa Courville, Vahid Partovi Nia
ICPRAM1
2021 Demystifying and Generalizing BinaryConnect
abstract
BinaryConnect (BC) and its many variations have become the de facto standard for neural network quantization. However, our understanding of the inner workings of BC is still quite limited. We attempt to close this gap in four different aspects: (a) we show that existing quantization algorithms, including post-training quantization, are surprisingly similar to each other; (b) we argue for proximal maps as a natural family of quantizers that is both easy to design and analyze; (c) we refine the observation that BC is a special case of dual averaging, which itself is a special case of the generalized conditional gradient algorithm; (d) consequently, we propose ProxConnect (PC) as a generalization of BC and we prove its convergence properties by exploiting the established connections. We conduct experiments on CIFAR-10 and ImageNet, and verify that PC achieves competitive performance.
Tim Dockhorn, Yaoliang Yu, Eyyüb Sari, Mahdi Zolnouri, Vahid Partovi Nia
NeurIPS3