arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.09716cs.LGeess.SP
收藏

规则化的分类感知Quantization

Regularized Classification-Aware Quantization

University of Toronto(多伦多大学)

Daniel Severo, Elad Domanovitz, Ashish Khisti

摘要:

传统上,量化被设计为最小化数据源的重构误差。当考虑下游分类任务时,其他失真度量可能是感兴趣的;例如0-1分类损失。此外,理想的是,这些量化器的性能不会恶化,一旦它们被部署到生产中,因为重新学习的方案在线并不总是可能的。在这项工作中,我们提出了一类学习分布式量化方案的二进制分类任务的算法。我们的方法在看不见的数据上表现良好,并且比以前的方法更快,与数据集大小的二次项成比例。它的工作原理是用重建误差正则化0-1损失。我们目前的实验合成混合和双变量高斯数据和比较训练,测试和泛化误差与一个家庭的基准量化方案的文献。我们的方法被称为正则化分类感知量化。

英文摘要:

Traditionally, quantization is designed to minimize the reconstruction error of a data source. When considering downstream classification tasks, other measures of distortion can be of interest; such as the 0-1 classification loss. Furthermore, it is desirable that the performance of these quantizers not deteriorate once they are deployed into production, as relearning the scheme online is not always possible. In this work, we present a class of algorithms that learn distributed quantization schemes for binary classification tasks. Our method performs well on unseen data, and is faster than previous methods proportional to a quadratic term of the dataset size. It works by regularizing the 0-1 loss with the reconstruction error. We present experiments on synthetic mixture and bivariate Gaussian data and compare training, testing, and generalization errors with a family of benchmark quantization schemes from the literature. Our method is called Regularized Classification-Aware Quantization.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑