Foothill: A Quasiconvex Regularization for Edge Computing of Deep Neural Networks
Deep neural networks (DNNs) have demonstrated success for many supervised learning tasks, ranging from voice recognition, object detection, to image classification. However, their increasing complexity might yield poor generalization error that make them hard to be deployed on edge devices. Quantization is an effective approach to compress DNNs in order to meet these constraints. Using a quasiconvex base function in order to construct a binary quantizer helps training binary neural networks (BNNs) and adding noise to the input data or using a concrete regularization function helps to improve generalization error. Here we introduce foothill function, an infinitely differentiable quasiconvex function. This regularizer is flexible enough to deform towards $L_1$ and $L_2$ penalties. Foothill can be used as a binary quantizer, as a regularizer, or as a loss. In particular, we show this regularizer reduces the accuracy gap between BNNs and their full-precision counterpart for image classification on ImageNet.
Code (0)
등록된 구현이 없습니다.
Tasks
Edge-computingGeneral Classificationimage-classificationImage Classificationobject-detectionObject DetectionQuantizationSimilar Papers 제목 키워드 기반
A note on the quasiconvex Jensen divergences and the quasiconvex Bregman divergences derived thereof
We first introduce the class of strictly quasiconvex and strictly quasiconcave Jensen divergences which are oriented (asymmetric) distances, and study some of their properties. We then define the strictly quasiconvex Bre…
Decomposable sums and their implications on naturally quasiconvex risk measures
Convexity and quasiconvexity are two properties that capture the concept of diversification for risk measures. Between the two, there is natural quasiconvexity, an old but not so well-known property weaker than convexity…
Quasiconvex risk measures with markets volatility
Since the quasiconvex risk measures is a bigger class than the well known convex risk measures, the study of quasiconvex risk measures makes sense especially in the financial markets with volatility. In this paper, we wi…
Bauer's Maximum Principle for Quasiconvex Functions
This note shows that in Bauer's maximum principle, the assumed convexity of the objective function can be relaxed to quasiconvexity.
Can we globally optimize cross-validation loss? Quasiconvexity in ridge regression
Models like LASSO and ridge regression are extensively used in practice due to their interpretability, ease of use, and strong theoretical guarantees. Cross-validation (CV) is widely used for hyperparameter tuning in the…
regression