mlsanityData to 14 Oct 2026

Quantaized Winograd/Toom-Cook Convolution for DNNs: Beyond Canonical Polynomials Base

arXiv 2004.11077 ↗First posted 23 Apr 2020cs.LG cs.NA math.NAcited by 3

Not on the map. Why?

Abstract (arXiv)

The problem how to speed up the convolution computations in Deep Neural Networks is widely investigated in recent years. The Winograd convolution algorithm is a common used method that significantly reduces time consumption. However, it suffers from a problem with numerical accuracy particularly for lower precisions. In this paper we present the application of base change technique for quantized Winograd-aware training model. We show that we can train the 8 bit quantized network to nearly the same accuracy (up to 0.5% loss) for tested network (Resnet18) and dataset (CIFAR10) as for quantized direct convolution with few additional operations in pre/post transformations. Keeping Hadamard product on 9 bits allow us to obtain the same accuracy as for direct convolution.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 23 Apr 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 0; 2025: 0; 2026: 1.

3 papers.