Title: DEEP LEARNING AS A MIXED CONVEX-COMBINATORIAL OPTIMIZATION PROBLEM

Abstract: As neural networks grow deeper and wider, learning networks with hard-threshold activations is becoming increasingly important, both for network quantization, which can drastically reduce time and energy requirements, and for creating large integrated systems of deep networks, which may have non-differentiable components and must avoid vanishing and exploding gradients for effective learning. However, since gradient descent is not applicable to hard-threshold functions, it is not clear how to learn networks of them in a principled way. We address this problem by observing that setting targets for hard-threshold hidden units in order to minimize loss is a discrete optimization problem, and can be solved as such. The discrete optimization goal is to find a set of targets such that each unit, including the output, has a linearly separable problem to solve. Given these targets, the network decomposes into individual perceptrons, which can then be learned with standard convex approaches. Based on this, we develop a recursive mini-batch algorithm for learning deep hard-threshold networks that includes the popular but poorly justified straightthrough estimator as a special case. Empirically, we show that our algorithm improves classification accuracy in a number of settings, including for AlexNet and ResNet-18 on ImageNet, when compared to the straight-through estimator.

1. INTRODUCTION:

The original approach to neural classification was to learn single-layer models with hard-threshold activations, like the perceptron (Rosenblatt, 1958) . However, it proved difficult to extend these methods to multiple layers, because hard-threshold units, having zero derivative almost everywhere and being discontinuous at the origin, cannot be trained by gradient descent. Instead, the community turned to multilayer networks with soft activation functions, such as the sigmoid and, more recently, the ReLU, for which gradients can be computed efficiently by backpropagation (Rumelhart et al., 1986) . This approach has enjoyed remarkable success, enabling researchers to train networks with hundreds of layers and learn models that have significantly higher accuracy on a variety of tasks than any previous approach. However, as networks become deeper and wider, there has been a growing trend towards using hard-threshold activations for quantization purposes, where they enable binary or low-precision inference (e.g., Hubara et al. (2016) ; Rastegari et al. (2016) ; Zhou et al. (2016) ; Lin & Talathi (2016) ; Zhu et al. (2017) ) and training (e.g., Lin et al. (2016) ; Li et al. (2017) ; Tang et al. (2017) ; Micikevicius et al. (2017) ), which can greatly reduce the energy and computation time required by modern deep networks. Beyond quantization, the scale of the output of hard-threshold units is independent of (or insensitive to) the scale of their input, which can alleviate vanishing and exploding gradient issues and should help avoid some of the pathologies that occur during low-precision training with backpropagation (Li et al., 2017) . Avoiding these issues is crucial for developing large systems of deep networks that can be used to perform even more complex tasks.

For these reasons, we are interested in developing well-motivated and efficient techniques for learning deep neural networks with hard-threshold units. In this work, we propose a framework for learning deep hard-threshold networks that stems from the observation that hard-threshold units output discrete values, indicating that combinatorial optimization may provide a principled method for training these networks. By specifying a set of discrete targets for each hidden-layer activation, the network decomposes into many individual perceptrons, each of which can be trained easily given its inputs and targets. The difficulty in learning a deep hard-threshold network is thus in setting the targets so that each trained perceptron -including the output units -has a linearly separable problem to solve and thus can achieve its targets. We show that networks in which this is possible can be learned using our mixed convex-combinatorial optimization framework.

Building on this framework, we then develop a recursive algorithm, feasible target propagation (FTPROP), for learning deep hard-threshold networks. Since this is a discrete optimization problem, we develop heuristics for setting the targets based on per-layer loss functions. The mini-batch version of FTPROP can be used to explain and justify the oft-used straight-through estimator (Hinton, 2012; Bengio et al., 2013) , which can now be seen as an instance of FTPROP with a specific choice of per-layer loss function and target heuristic. Finally, we develop a novel per-layer loss function that improves learning of deep hard-threshold networks. Empirically, we show improvements for our algorithm over the straight-through estimator on CIFAR-10 for two convolutional networks and on ImageNet for AlexNet and ResNet-18, with multiple types of hard-threshold activation.

RELATED WORK:

The most common method for learning deep hard-threshold networks is to use backpropagation with the straight-through estimator (STE) (Hinton, 2012; Bengio et al., 2013) , which simply replaces the derivative of each hard-threshold unit with the identity function. The STE is used in the quantized network literature (see citations above) to propagate gradients through quantized activations, and is used in Shalev-Shwartz et al. (2017) for training with flat activations. Later work generalized the STE to replace the hard-threshold derivative with other functions, including saturated versions of the identity function (Hubara et al., 2016) . However, while the STE tends to work quite well in practice, we know of no rigorous justification or analysis of why it works or how to choose replacement derivatives. Beyond being unsatisfying in this regard, the STE is not well understood and can lead to gradient mismatch errors, which compound as the number of layers increases (Lin & Talathi, 2016) . We show here that the STE, saturated STE, and all types of STE that we have seen are special cases of our framework, thus providing a principled justification for it and a basis for exploring and understanding alternatives.

Another common approach to training with hard-threshold units is to use randomness, either via stochastic neurons (e.g., Bengio et al. (2013) ; Hubara et al. (2016) ) or probabilistic training methods, such as those of Soudry et al. (2014) or Williams (1992) , both of which are methods for softening hard-threshold units. In contrast, our goal is to learn networks with deterministic hard-threshold units.

Finally, target propagation (TP) (LeCun, 1986; 1987; Carreira-Perpiñán & Wang, 2014; Bengio, 2014; Lee et al., 2015; Taylor et al., 2016) is a method that explicitly associates a target with the output of each activation in the network, and then updates each layer's weights to make its activations more similar to the targets. Our framework can be viewed as an instance of TP that uses combinatorial optimization to set discrete targets, whereas previous approaches employed continuous optimization to set continuous targets. The MADALINE Rule II algorithm (Winter & Widrow, 1988) can also be seen as a special case of our framework and of TP, where only one target is set at a time.

2. LEARNING DEEP NETWORKS WITH HARD-THRESHOLD UNITS:

Given a dataset D = {(x (i) , t (i) )} m i=1 with vector-valued inputs x (i) ∈ R n and binary targets t ∈ {-1, +1}, we are interested in learning an -layered deep neural network with hard-threshold units X < l a t e x i t s h a 1 _ b a s e 6 4 = " A q a P p 2 F W 5 a M g i X

EQUATION

x 1 x 2 W 1 W 2 h 1 h 2 h 3 y 1 y 2 t 21 t 22 set T 1 x 1 x 2 t 11 h 1 W 1,1: x 1 x 2 t 12 h 2 W 1,2: x 1 x 2 t 13 h 3 W 1,3:

x P C X t X w J O u x u c = " > A A A B 8 n i c b Z B N S 8 N A E I Y n 9 a v W r 6 p H L 8 E i e J C S i q D e i l 4 8 t m B s o Q 1 l s 5 m 0 S z e b s L s p l N B f 4 F V P n s S r f 8 i D / 8 V t m o O 2 D i w 8 v O 8 M M / v 6 C W d K O 8 6 X V V p b 3 9 j c K m 9 X d n b 3 9 g + q h 0 d P K k 4 l R Z f G P J Z d n y j k T K C r m e b Y T S S S y O f Y 8 c f 3 c 7 8 z Q a l Y L B 7 1 N E E v I k P B Q k a J N l K 7 O 6 j W n L q T l 7 0 K j Q J q U F R r U P 3 u B z F N I x S a c q J U r + E k 2 s u I 1 I x y n F X 6 q c K E 0 D E Z Y s + g I B G q i 2 D C E p W j l + U 3 z + w z Y w Z 2 G E v z h L Z z 9 f d w R i K l p p F v O i O i R 2 r Z m 4 v / e b 1 U h z d e x k S S a h R 0 s S h M u a 1 j e x 6 A H T C J V P O p A U I l M 2 f b d E Q k o d r E V D F 5 N J Z / v w r u Z f 2 2 7 r S v

a s 2 7 I p g y n M A p n E M D r q E J D 9 A C F y g g P M M L v F q p 9 W a 9 W x + L 1 p J V z B z D n 7 I + f w D s 5 Z F X < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " A q a P p 2 F W 5 a M g i X x P C X t X w J O u x u c = " > A A A B 8 n i c b Z B N S 8 N A E I Y n 9 a v W r 6 p H L 8 E i e J C S i q D e i l 4 8 t m B s o Q 1 l s 5 m 0 S z e b s L s p l N B f 4

F V P n s S r f 8 i D / 8 V t m o O 2 D i w 8 v O 8 M M / v 6 C W d K O 8 6 X V V p b 3 9 j c K m 9 X d n b 3 9 g + q h 0 d P K k 4 l R Z f G P J Z d n y j k T K C r m e b Y T S S S y O f Y 8 c f 3 c 7 8 z Q a l Y L B 7 1 N E E v I k P B Q k a J N l K 7 O 6 j W n L q T l 7 0 K j Q J q U F R r U P 3 u B z F N I x S a c q J U r + E k 2 s u I 1 I x y n F X 6 q c K E 0 D E Z Y s + g I B G q i 2 D C E p W j l + U 3 z + w z Y w Z 2 G E v z h L Z z 9 f d w R i K l p p F v O i O i R 2 r Z m 4 v / e b 1 U h z d e x k S S a h R 0 s S h M u a 1 j e x 6 A H T C J V P O p A U I l M 2 f b d E Q k o d r E V D F 5 N J Z / v w r u Z f 2 2 7 r S v

a s 2 7 I p g y n M A p n E M D r q E J D 9 A C F y g g P M M L v F q p 9 W a 9 W x + L 1 p J V z B z D n 7 I + f w D s 5 Z F X < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " A q a P p 2 F W 5 a M g i X x P C X t X w J O u x u c = " > A A A B 8 n i c b Z B N S 8 N A E I Y n 9 a v W r 6 p H L 8 E i e J C S i q D e i l 4 8 t m B s o Q 1 l s 5 m 0 S z e b s L s p l N B f 4

F V P n s S r f 8 i D / 8 V t m o O 2 D i w 8 v O 8 M M / v 6 C W d K O 8 6 X V V p b 3 9 j c K m 9 X d n b 3 9 g + q h 0 d P K k 4 l R Z f G P J Z d n y j k T K C r m e b Y T S S S y O f Y 8 c f 3 c 7 8 z Q a l Y L B 7 1 N E E v I k P B Q k a J N l K 7 O 6 j W n L q T l 7 0 K j Q J q U F R r U P 3 u B z F N I x S a c q J U r + E k 2 s u I 1 I x y n F X 6 q c K E 0 D E Z Y s + g I B G q i 2 D C E p W j l + U 3 z + w z Y w Z 2 G E v z h L Z z 9 f d w R i K l p p F v O i O i R 2 r Z m 4 v / e b 1 U h z d e x k S S a h R 0 s S h M u a 1 j e x 6 A H T C J V P O p A U I l M 2 f b d E Q k o d r E V D F 5 N J Z / v w r u Z f 2 2 7 r S v a s 2 7 I p g y n M A p n E M D r q E J D 9 A C F y g g P M M L v F q p 9 W a 9 W x + L 1 p J V z B z D n 7 I + f w D s 5 Z F X < / l a t e x i t > H 1 < l a t e x i t s h a 1 _ b a s e 6 4 = " 4 g U g M m O F C V q k T 4 n b v a 9 D N X B 9 O f k = " > A A A B 9 H i c b Z D N S s N A F I V v 6 l + t f 1 W X b g a L 4 E J K I o K 6 K 7 r p s q K x h T a U y W T S D p 1 M w s y k U k I f w a 2 u X I l b 3 8 e F 7 + I 0 z U J b L w x 8 n H M v 9 8 7 x E 8 6 U t u 0 v q 7 S y u r a + U d 6 s b G 3 v 7 O 5 V 9 w 8 e V Z x K Q l 0 S 8 1 h 2 f K w o Z 4 K 6 m m l O O 4 m k O P I 5 b f u j 2 5 n f H l O p W C w e 9 C S h X o Q H g o W M Y G 2 k + 2 b f 6 V d r d t 3 O C y 2 D U 0 A N i m r 1 q 9 + 9 I C Z p R I U m H C v V d e x E e x m W m h F O p 5 V e q m i C y Q g P a N e g w B F V Z 8 G Y J S p H L 8 u v n q I T Y w Y o j K V 5 Q q N c / T 2 c 4 U i p S e S b z g j r o V r 0 Z u J / X j f V 4 Z W X M Z G k m g o y X x S m H O k Y z S J A A Z O U a D 4 x g I l k 5 m x E h l h i o k 1 Q F Z O H s / j 7 Z X D P 6 9 d 1 + + 6 i 1 r g p g i n D E R z D K T h w C Q 1 o Q g t c I D C A Z 3 i B V + v J e r

P e r Y 9 5 a 8 k q Z g 7 h T 1 m f P / 7 B k e s = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " 4 g

U g M m O F C V q k T 4 n b v a 9 D N X B 9 O f k = " > A A A B 9 H i c b Z D N S s N A F I V v 6 l + t f 1 W X b g a L 4 E J K I o K 6 K 7 r p s q K x h T a U y W T S D p 1 M w s y k U k I f w a 2 u X I l b 3 8 e F 7 + I 0 z U J b L w x 8 n H M v 9 8 7 x E 8 6 U t u 0 v q 7 S y u r a + U d 6 s b G 3 v 7 O 5 V 9 w 8 e V Z x K Q l 0 S 8 1 h 2 f K w o Z 4 K 6 m m l O O 4 m k O P I 5 b f u j 2 5 n f H l O p W C w e 9 C S h X o Q H g o W M Y G 2 k + 2 b f 6 V d r d t 3 O C y 2 D U 0 A N i m r 1 q 9 + 9 I C Z p R I U m H C v V d e x E e x m W m h F O p 5 V e q m i C y Q g P a N e g w B F V Z 8 G Y J S p H L 8 u v n q I T Y w Y o j K V 5 Q q N c / T 2 c 4 U i p S e S b z g j r o V r 0 Z u J / X j f V 4 Z W X M Z G k m g o y X x S m H O k Y z S J A A Z O U a D 4 x g I l k 5 m x E h l h i o k 1 Q F Z O H s / j 7 Z X D P 6 9 d 1 + + 6 i 1 r g p g i n D E R z D K T h w C Q 1 o Q g t c I D C A Z 3 i B V + v J e r

P e r Y 9 5 a 8 k q Z g 7 h T 1 m f P / 7 B k e s = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " 4 g r Y 9 5 6 4 r Y 9 5 6 4 r Y 9 5 6 4 

U g M m O F C V q k T 4 n b v a 9 D N X B 9 O f k = " > A A A B 9 H i c b Z D N S s N A F I V v 6 l + t f 1 W X b g a L 4 E J K I o K 6 K 7 r p s q K x h T a U y W T S D p 1 M w s y k U k I f w a 2 u X I l b 3 8 e F 7 + I 0 z U J b L w x 8 n H M v 9 8 7 x E 8 6 U t u 0 v q 7 S y u r a + U d 6 s b G 3 v 7 O 5 V 9 w 8 e V Z x K Q l 0 S 8 1 h 2 f K w o Z 4 K 6 m m l O O 4 m k O P I 5 b f u j 2 5 n f H l O p W C w e 9 C S h X o Q H g o W M Y G 2 k + 2 b f 6 V d r d t 3 O C y 2 D U 0 A N i m r 1 q 9 + 9 I C Z p R I U m H C v V d e x E e x m W m h F O p 5 V e q m i C y Q g P a N e g w B F V Z 8 G Y J S p H L 8 u v n q I T Y w Y o j K V 5 Q q N c / T 2 c 4 U i p S e S b z g j r o V r 0 Z u J / X j f V 4 Z W X M Z G k m g o y X x S m H O k Y z S J A A Z O U a D 4 x g I l k 5 m x E h l h i o k 1 Q F Z O H s / j 7 Z X D P 6 9 d 1 + + 6 i 1 r g p g i n D E R z D K T h w C Q 1 o Q g t c I D C A Z 3 i B V + v J e r P e r Y 9 5 a 8 k q Z g 7 h T 1 m f P / 7 B k e s = < / l a t e x i t > Y < l a t e x i t s h a 1 _ b a s e 6 4 = " h R l M 8 j T v 7 l x x h U l v 7 o p C d C d l t Y E = " > A A A B 8 n i c b Z B N S 8 N A E I Y n f t b 6 V f X o J V g E D 1 J S E d R b 0 Y v H F o y t t K F s N p N 2 6 W Y T d j e F E v o L v O r J k 3 j 1 D 3 n w v 7 h N c 9 D W g Y W H 9 5 1 h Z l 8 / 4 U x p x / m y V l b X 1 j c 2 S 1 v l 7 Z 3 d v f 3 K w e G j i l N J 0 a U x j 2 X H J w o 5 E + h q p j l 2 E o k k 8 j m 2 / d H d z G + P U S o W i w c 9 S d C L y E C w k F G i j d R 6 6 l e q T s 3 J y 1 6 G e g F V K K r Z r 3 z 3 g p i m E Q p N O V G q W 3 c S 7 W V E a k Y 5 T s u 9 V G F C 6 I g M s G t Q k A j V e T B m i c r R y / K b p / a p M Q M 7 j K V 5 Q t u 5 + n s 4 I 5 F S k 8 g 3 n R H R Q 7 X o z c T / v G 6 q w 2 s v Y y J J N Q o 6 X x S m 3 N a x P Q v A D p h E q v n E A K G S m b N t O i S S U G 1 i K p s 8 6 o u / X w b 3 o n Z T c 1 q X 1 c Z t E U w J j u E E z q A O V 9 C A e 2 i C C x Q Q n u E F X q 3 U e r P e

p V z B z B n 7 I + f w D u c 5 F Y < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " h R l M 8 j T v 7 l x x h U l v 7 o p C d C d l t Y E = " > A A A B 8 n i c b Z B N S 8 N A E I Y n f t b 6 V f X o J V g E D 1 J S E d R b 0 Y v H F o y t t K F s N p N 2 6 W Y T d j e F E v o L v O r J k 3 j 1 D 3 n w v 7 h N c 9 D W g Y W H 9 5 1 h Z l 8 / 4 U x p x / m y V l b X 1 j c 2 S 1 v l 7 Z 3 d v f 3 K w e G j i l N J 0 a U x j 2 X H J w o 5 E + h q p j l 2 E o k k 8 j m 2 / d H d z G + P U S o W i w c 9 S d C L y E C w k F G i j d R 6 6 l e q T s 3 J y 1 6 G e g F V K K r Z r 3 z 3 g p i m E Q p N O V G q W 3 c S 7 W V E a k Y 5 T s u 9 V G F C 6 I g M s G t Q k A j V e T B m i c r R y / K b p / a p M Q M 7 j K V 5 Q t u 5 + n s 4 I 5 F S k 8 g 3 n R H R Q 7 X o z c T / v G 6 q w 2 s v Y y J J N Q o 6 X x S m 3 N a x P Q v A D p h E q v n E A K G S m b N t O i S S U G 1 i K p s 8 6 o u / X w b 3 o n Z T c 1 q X 1 c Z t E U w J j u E E z q A O V 9 C A e 2 i C C x Q Q n u E F X q 3 U e r P e

p V z B z B n 7 I + f w D u c 5 F Y < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " h R l M 8 j T v 7 l x x h U l v 7 o p C d C d l t Y E = " > A A A B 8 n i c b Z B N S 8 N A E I Y n f t b 6 V f X o J V g E D 1 J S E d R b 0 Y v H F o y t t K F s N p N 2 6 W Y T d j e F E v o L v O r J k 3 j 1 D 3 n w v 7 h N c 9 D W g Y W H 9 5 1 h Z l 8 / 4 U x p x / m y V l b X 1 j c 2 S 1 v l 7 Z 3 d v f 3 K w e G j i l N J 0 a U x j 2 X H J w o 5 E + h q p j l 2 E o k k 8 j m 2 / d H d z G + P U S o W i w c 9 S d C L y E C w k F G i j d R 6 6 l e q T s 3 J y 1 6 G e g F V K K r Z r 3 z 3 g p i m E Q p N O V G q W 3 c S 7 W V E a k Y 5 T s u 9 V G F C 6 I g M s G t Q k A j V e T B m i c r R y / K b p / a p M Q M 7 j K V 5 Q t u 5 + n s 4 I 5 F S k 8 g 3 n R H R Q 7 X o z c T / v G 6 q w 2 s v Y y J J N Q o 6 X x S m 3 N a x P Q v A D p h E q v n E A K G S m b N t O i S S U G 1 i K p s 8 6 o u / X w b 3 o n Z T c 1 q X 1 c Z t E U w J j u E E z q A O V 9 C A e 2 i C C x Q Q n u E F X q 3 U e r P e

p V z B z B n 7 I + f w D u c 5 F Y < / l a t e x i t >

Figure 1 : After setting the hidden-layer targets T1 of a deep hard-threshold network, the network decomposes into independent perceptrons, which can then be learned with standard methods. at layer d. Our goal will be to learn f by finding the weights W that minimize an aggregate loss L(Y, T ) = m i=1 L(y (i) , t (i) ) for some convex per-instance loss L(y, t). In the simplest case, a hard-threshold network with no hidden layers is a perceptron Y = g(W 1 X), as introduced by Rosenblatt (1958) . The goal of learning a perceptron, or any hard-threshold network, is to classify unseen data. A useful first step is to be able to correctly classify the training data, which we focus on here for simplicity when developing our framework; however, standard generalization techniques such as regularization are easily incorporated into this framework and we do this for the experiments. Since a perceptron is a linear classifier, it is only able to separate a linearly-separable dataset.

Definition 1. A dataset {(x (i) , t (i) )} m

i=1 is linearly separable iff there exists a vector w ∈ R n and a real number γ > 0 such that (w

• x (i) )t (i) > γ for all i = 1 . . . m.

When a dataset is linearly separable, the perceptron algorithm is guaranteed to find its separating hyperplane in a finite number of steps (Novikoff, 1962) , where the number of steps required is dependent on the size of the margin γ. However, linear separability is a very strong condition, and even simple functions, such as XOR, are not linearly separable and thus cannot be learned by a perceptron (Minsky & Papert, 1969) . We would thus like to be able to learn multilayer hard-threshold networks.

Consider a simple single-hidden-layer hard-threshold network

Y = f (X; W ) = g(W 2 g(W 1 X)) = g(W 1 H 1 ) for a dataset D = (X, T 2 )

, where H 1 = g(W 1 X) are the hidden-layer activations. An example of such a network is shown on the left side of Figure 1 . Clearly, Y and H 1 are both collections of (single-layer) perceptrons. Backpropagation cannot be used to train the input layer's weights W 1 because of the hard-threshold activations but, since each hidden activation h 1j is the output of a perceptron, if we knew the value t 1j ∈ {-1, +1} that each hidden unit should take for each input x (i) , we could then use the perceptron algorithm to set the first-layer weights, W 1 , to produce these target values. We refer to t 1j as the target of h 1j . Given a matrix of hidden-layer targets T 1 ∈ {-1, +1} n1×m , each layer (and in fact each perceptron in each layer) can be learned separately, as they no longer depend on each other, where the goal of perceptron learning is to update the weights of each layer d so that its activations H d equal its targets T d given inputs T d-1 . Figure 1 shows an example of this decomposition. We denote the targets of an -layer network as T = {T 1 , . . . , T }, where T k for k = 1 . . . -1 are the hidden-layer targets and T are the dataset targets. We often let T 0 = X for notational convenience.

Auxiliary-variable-based approaches, such as ADMM (Taylor et al., 2016; Carreira-Perpiñán & Wang, 2014) and other target propagation methods (LeCun, 1986; Lee et al., 2015) use a similar process for decomposing the layers of a network; however, these focus on continuous variables and impose (soft) constraints to ensure that each activation equals its auxiliary variable. We take a different approach here, inspired by the combinatorial nature of the problem and the perceptron algorithm.

Since the final layer is a perceptron, the training instances can only be separated if the hidden-layer activations H 1 are linearly separable with respect to the dataset targets T 2 . Thus, the hidden-layer targets T 1 must be set such that they are linearly separable with respect to the dataset targets T 2 , since the hidden-layer targets T 1 are the intended values of their activations H 1 . However, in order to ensure that the hidden-layer activations H 1 will equal their targets T 1 after training, the hidden-layer targets T 1 must be able to be produced (exactly) by the first layer, which is only possible if the hidden-layer targets T 1 are also linearly separable with respect to the inputs X. Thus, a sufficient condition for f (X; W ) to separate the data is that the hidden-layer targets induce linear separability in all units in both layers of the network. We refer to this property as feasibility. Definition 2. A setting of the targets T = {T 1 , . . . , T } of an -layer deep hard-threshold network f (X; W ) is feasible for a dataset D = (X, T ) iff for each unit j = 1 . . . n d in each layer d = 1 . . . the dataset formed by its inputs T d-1 and targets T d,j: is linearly separable, where T 0 X.

Feasibility is a much weaker condition than linear separability, since the output decision boundary of a multilayer hard-threshold network with feasible targets is in general highly nonlinear. It follows from the definition of feasibility and convergence of the perceptron algorithm that if a feasible setting of a network's targets on a dataset exists, the network can separate the training data. Proposition 1. Let D = {(x (i) , t (i) )} be a dataset and let f (X; W ) be an -layer hard-threshold network with feasible targets T = {T 1 , . . . , T } in which each layer d of f was trained separately with inputs T d-1 and targets T d , where T 0 X, then f will correctly classify each instance x (i) , such that f (x (i) ; W )t (i) > 0 for all i = 1 . . . m.

Learning a deep hard-threshold network thus reduces to finding a feasible setting of its targets and then optimizing its weights given these targets, i.e., mixed convex-combinatorial optimization. The simplest method for this is to perform exhaustive search on the targets. Exhaustive search iterates through all possible settings of the hidden-layer targets, updating the weights of each perceptron whose inputs or targets changed, and returns the weights and feasible targets that result in the lowest loss. While impractical, exhaustive search is worth briefly examining to better understand the solution space. In particular, because of the decomposition afforded by setting the targets, exhaustive search over just the targets is sufficient to learn the globally optimal deep hard-threshold network, even though the weights are learned by gradient descent. Proposition 2. If a feasible setting of a deep hard-threshold network's targets on a dataset D exists, then exhaustive search returns the global minimum of the loss in time exponential in the number of hidden units.

Learning can be improved and feasibility relaxed if, instead of the perceptron algorithm, a more robust method is used for perceptron learning. For example, a perceptron can be learned for a non-linearlyseparable dataset by minimizing the hinge loss L(z, t) = max(0, 1 -tz), a convex loss on the perceptron's pre-activation output z and target t that maximizes the margin when combined with L2 regularization. In general, however, any method for learning linear classifiers can be used. We denote the loss used to train the weights of a layer d as L d , where the loss of the final layer L is the output loss.

At the other end of the search spectrum is hill climbing. In each iteration, hill climbing evaluates all neighboring states of the current state (i.e., target settings that differ from the current one by only one target) and chooses the one with the lowest loss. The search halts when none of the new states improve the loss. Each state is evaluated by optimizing the weights of each perceptron given the state's targets, and then computing the output loss. Hill climbing is more practical than exhaustive search, since it need not explore an exponential number of states, and it also provides the same local optima guarantee as gradient descent on soft-threshold networks. Proposition 3. Hill climbing on the targets of a deep hard-threshold network returns a local minimum of the loss, where each iteration takes time linear in the size of the set of proposed targets.

Exhaustive search and hill climbing comprise two ends of the discrete optimization spectrum. Beam search, which maintains a beam of the most promising solutions and explores each, is another powerful approach that contains both hill climbing and exhaustive search as special cases. In general, however, any discrete optimization algorithm can be used for setting targets. For example, methods from satisfiability solving, integer linear programming, or constraint satisfaction might work well, as the linear separability requirements of feasibility can be viewed as constraints on the search space.

We believe that our mixed convex-combinatorial optimization framework opens many new avenues for developing learning algorithms for deep networks, including those with non-differentiable modules. In the following section, we use these ideas to develop a learning algorithm that hews much closer to standard methods, and in fact contains the straight-through estimator as a special case.

3. FEASIBLE TARGET PROPAGATION:

The open question from the preceding section is how to set the hidden-layer targets. Generating good, feasible targets for the entire network at once is a difficult problem; instead, an easier approach is to propose targets for only one layer at a time. As in backpropagation, it makes sense to start from the output layer, since the final-layer targets are given, and successively set targets for each upstream layer. Further, since it is hard to know a priori if a setting of a layer's targets is feasible for a given network architecture, a simple alternative is to set the targets for a layer d and then optimize the upstream weights (i.e., weights in layers j ≤ d ) to check if the targets are feasible. Since the goals when optimizing a layer's weights and when setting its upstream targets (i.e., its inputs) are the same -namely, to induce feasibility -a natural method for setting target values is to choose targets that reduce the layer's loss L d . However, because the targets are discrete, moves in target space are large and non-smooth and cannot be guaranteed to lower the loss without actually performing the move. Thus, heuristics are necessary. We discuss these in more detail below.

Determining feasibility of the targets at layer d can be done by recursively updating the weights of layer d and proposing targets for layer d -1 given the targets for layer d. This recursion continues until the input layer is reached, where feasibility (i.e., linear separability) can be easily determined by optimizing that layer's weights given its targets and the dataset inputs. The targets at layer d can then be updated based on the information gained from the recursion and, if the upstream weights were altered, based on the new outputs of layer d -1. We call this recursive algorithm feasible target propagation, or FTPROP. Pseudocode is shown in Algorithm 1.

Algorithm 1 Train an -layer hard-threshold network Y = f (X; W ) on dataset D = (X, T ) with feasible target propagation (FTPROP) using loss functions L = {L d } d=1 .

1: initialize weights W = {W 1 , . . . , W } randomly 2: initialize targets T 1 , . . . , T -1 as the outputs of their hidden units in f (X; W ) 3: set T 0 ← X and set T ← {T 0 , T 1 , . . . , T } 4: FTPROP(W, T, L, ) // train the network by searching for a feasible target setting return False As the name implies, FTPROP is a form of target propagation (LeCun, 1986; 1987; Lee et al., 2015) that uses discrete optimization to set discrete targets, instead of using continuous optimization to set continuous targets. FTPROP is also highly related to RDIS (Friesen & Domingos, 2015) , a powerful nonconvex optimization algorithm based on satisfiability (SAT) solvers that recursively chooses and sets subsets of variables in order to decompose the underlying problem into simpler subproblems. While RDIS is applied only to continuous problems, the ideas behind RDIS can be generalized to discrete variables via the sum-product theorem (Friesen & Domingos, 2016) . This suggests an interesting connection between FTPROP and SAT that we leave for future work.

Of course, modern deep networks will not always have a feasible setting of their targets for a given dataset. For example, a convolutional layer imposes a large amount of structure on its weight matrix, making it less likely that the layer's input will be linearly separable with respect to its targets. Further, ensuring feasibility will in general cause learning to overfit the training data, which will worsen generalization performance. Thus, we would like to relax the feasibility requirements.

In addition, there are many benefits of using mini-batch instead of full-batch training, including improved generalization gap (e.g., see LeCun et al. (2012) or Keskar et al. (2016) ), reduced memory usage, the ability to exploit data augmentation, and the prevalence of tools (e.g., GPUs) designed for it.

Fortunately, it is straightforward to convert FTPROP to a mini-batch algorithm and to relax the feasibility requirements. In particular, since it is important not to overcommit to any one mini-batch, the mini-batch version of FTPROP (i) only updates the weights and targets of each layer once per mini-batch; (ii) only takes a small gradient step on each layer's weights, instead of optimizing them fully; (iii) sets the targets of the downstream layer in parallel with updating the current layer's weights, since the weights will not change much; and (iv) removes all checks for feasibility. We call this algorithm FTPROP-MB and present pseudocode in Algorithm 2. FTPROP-MB closely resembles backpropagation-based methods, allowing us to easily implement it with standard libraries. 

d = W d T d-1 = W d H d-1 9: if d > 1 then FTPROP-MB(W, {T 0 , . . . , Td-1 , . . . , T }, L, d -1)

3.1. TARGET HEURISTICS:

When the activations of each layer are differentiable, backpropagation provides a method for telling each layer how to adjust its outputs to improve the loss. Conversely, in hard-threshold networks, target propagation provides a method for telling each layer how to adjust its outputs to improve the next layer's loss. While gradients cannot propagate through hard-threshold units, the derivatives within a layer can still be computed. An effective and efficient heuristic for setting the target t dj for an activation h dj of layer d is to use the (negative) sign of the partial derivative of the next layer's loss. Specifically, we set t dj = r(h dj ), where

r(h dj ) sign - ∂ ∂h dj L d+1 (Z d+1 , T d+1 ) (2)

and Z d+1 is either the pre-activation or post-activation output, depending on the choice of loss.

When used to update only a single target at a time, this heuristic will often set the target value that correctly results in the lowest loss. In particular, when L d+1 is convex, its negative partial derivative with respect to h dj by definition points in the direction of the global minimum of L d+1 . Without loss of generality, let h dj = -1. Now, if r(h dj ) = -1, then it follows from the convexity of the loss that flipping h dj and keeping all other variables the same would increase L d+1 . On the other hand, if r(h dj ) = +1, then flipping h dj may or may not reduce the loss, since convexity cannot tell us which of h dj = +1 or h dj = -1 results in a smaller L d+1 . However, the discrepancy between h dj and r(h dj ) indicates a lack of confidence in the current value of h dj . A natural choice is thus to set t dj to push the pre-activation value of h dj towards 0, making h dj more likely to flip. Setting t dj = r(h dj ) = +1 accomplishes this. We note that, while this heuristic performs well, there is still room for improvement, for example by extending r(•) to better handle the h dj = r(h dj ) case or by combining information across the batch. We leave such investigations for future work.

3.2. LAYER LOSS FUNCTIONS:

The hinge loss, shown in Figure 2a , is a robust version of the perceptron criterion and is thus a natural per-layer loss function to use for finding good settings of the targets and weights, even when there are no feasible target settings. However, in preliminary experiments we found that learning tended to stall and become erratic over time when using the hinge loss for each layer. We attribute this to two separate issues. First, the hinge loss is sensitive to noisy data and outliers (Wu & Liu, 2007) , which can cause learning to focus on instances that are unlikely to ever be classified correctly, instead of on instances near the separator. Second, since with convolutional layers and large, noisy datasets it is unlikely that a layer's inputs are entirely linearly separable, it is important to prioritize some targets over others.

Ideally, the highest priority targets would be those with the largest effect on the output loss.

The first issue can be solved by saturating (truncating) the hinge loss, thus making it less sensitive to outliers (Wu & Liu, 2007) . The saturated hinge loss, shown in Figure 2b , is sat hinge(z, t; b) = max(0, 1 -max(tz, b)) for some threshold b, where we set b = -1 to make its derivative symmetric.

The second problem can be solved in a variety of ways, including randomly subsampling targets or weighting the loss associated with each target according to some heuristic. The simplest and most accurate method that we have found is to weight the loss for each target t dj by the magnitude of the Figure (d) shows the quantized ReLU activation (solid blue line), which is a sum of step functions, its corresponding sum of saturated-hinge-loss derivatives (dashed red line), and the soft-hinge-loss approximation to this sum that was found to work best (dotted yellow line).

partial derivative of the next layer's loss L d+1 with respect to the target's hidden unit h dj , such that

EQUATION

While the saturated hinge loss works well, if the input z dj ever moves out of the range [-1, +1] then its derivative will become zero and the unit will no longer be trainable. To avoid this, we propose the soft hinge loss, shown in Figure 2c , where soft hinge(z, t) = tanh(-tz) + 1. Like the saturated hinge, the soft hinge has slope 1 at the threshold and has a symmetric derivative; however, it also benefits from having a larger input region with non-zero derivative. Note that Bengio et al. (2013) report that using the derivative of a sigmoid as the STE performed worse than the identity function.

Based on our experiments with other loss functions, including variations of the squared hinge loss and the log loss, this is most likely because the slope of the sigmoid is less than unity at the threshold, which causes vanishing gradients. Loss functions with asymmetric derivatives around the threshold also seemed to perform worse than those with symmetric derivatives (e.g., the saturating and soft hinge losses). In our experiments, we show that the soft hinge loss outperforms the saturated hinge loss for both sign and quantized ReLU activations, which we discuss below.

3.3. RELATIONSHIP TO THE STRAIGHT-THROUGH ESTIMATOR:

When each loss term in each hidden layer is scaled by the magnitude of the partial derivative of its downstream layer's loss and each target is set based on the sign of the same partial derivative, then target propagation transmits information about the output loss to every layer in the network, despite the hard-threshold units. Interestingly, this combination of loss function and target heuristic can exactly reproduce the weight updates of the straight-through estimator (STE). Specifically, the weight updates that result from using the scaled saturated hinge loss from (3) and the target heuristic in (2) are exactly those of the saturated straight-through estimator (SSTE) defined in Hubara et al. (2016) , which replaces the derivative of sign(z) with 1 |z|≤1 , where 1 (•) is the indicator function.

Other STEs correspond to different choices of per-layer loss function. For example, the original STE corresponds to the linear loss L(z, t) = -tz with the above target heuristic. This connection provides a justification for existing STE approaches, which can now each be seen as an instance of FTPROP with a particular choice of per-layer loss function and target heuristic. We believe that this will enable more principled investigations and extensions of these methods in future work.

3.4. QUANTIZED ACTIVATIONS:

Straight-through estimation is also commonly used to backpropagate through quantized variants of standard activations, such as the ReLU. Figure 2d shows a quantized ReLU (qReLU) with 6 evenly-spaced quantization levels. The simplest and most popular straight-through estimator (STE) for qReLU is to use the derivative of the saturated (or clipped) ReLU ∂ sat ReLU(x) ∂x = 1 0<x<1 , where sat ReLU(x) = min(1, max(x, 0)). However, if we instead consider the qReLU activation from the viewpoint of FTPROP, then the qReLU becomes a (normalized) sum of step functions qReLU

(z) = 1 k k-1 i=0 step(z -i k-1

), where step(z) = 1 if z > 0 and 0 otherwise, and is a linear transformation of sign(z). The resulting derivative of the sum of saturated hinge losses (one for each step function) is shown in red in Figure 2d , and is clearly quite different than the STE described above. In initial experiments, this performed as well as or better than the STE; however, we achieved additional performance improvements by using the softened approximation shown in yellow in Figure 2d , which is simply the derivative of a soft hinge that has been scaled and shifted to match the qReLU domain. This is a natural choice because the derivative of a sum of a small number of soft hinge losses has a shape similar to that of the derivative of a single soft hinge loss.

4. EXPERIMENTS:

We evaluated FTPROP-MB with soft hinge per-layer losses (FTP-SH) for training deep networks with sign and 2-and 3-bit qReLU activations by comparing models trained with FTP-SH to those trained with the saturated straight-through estimators (SSTEs) described earlier (although, as discussed, these SSTEs can also be seen as instances of FTPROP-MB). We compared to these SSTEs because they are the standard approach in the literature and they significantly outperformed the STE in our initial experiments (Hubara et al. (2016) observed similar behavior). Computationally, FTPROP-MB has the same performance as straight-through estimation; however, the soft hinge loss involves computing a hyperbolic tangent, which requires more computation than a piecewise linear function. This is the same performance difference seen when using sigmoid activations instead of ReLUs in soft-threshold networks.

We also trained each model with ReLU and saturated-ReLU activations as full-precision baselines.

We did not use weight quantization because our main interest is training with hard-threshold activations, and because recent work has shown that weights can be quantized with little effect on performance (Hubara et al., 2016; Rastegari et al., 2016; Zhou et al., 2016) . We tested these training methods on the CIFAR-10 ( Krizhevsky, 2009) and ImageNet (ILSVRC 2012) (Russakovsky et al., 2015) datasets. On CIFAR-10, we trained a simple 4-layer convolutional network and the 8-layer convolutional network of Zhou et al. (2016) . On ImageNet, we trained AlexNet (Krizhevsky et al., 2012) , the most common model in the quantization literature, and ResNet-18 (He et al., 2015a) . Further experiment details are provided in Appendix A, along with learning curves for all experiments, and code is available at https://github.com/afriesen/ftprop.

4.1. CIFAR-10:

Test accuracies for the 4-layer and 8-layer convolutional networks on CIFAR-10 are shown in Table 1 .

For the 4-layer model, FTP-SH shows a consistent 0.5-1% accuracy gain over SSTE for the entire training trajectory, resulting in the 0.7% improvement shown in Table 1 . However, for the 2-bit qRELU activation, SSTE and FTP-SH perform nearly identically in the 4-layer model. Conversely, for the more complex 8-layer model, the FTP-SH accuracy is only 0.3% above SSTE for the sign activation, but for the qReLU activation FTP-SH achieves a consistent 1.4% improvement over SSTE.

We posit that the decrease in performance gap for the sign activation when moving from the 4-to 8layer model is because both methods are able to effectively train the higher-capacity model to achieve close to its best possible performance on this dataset, whereas the opposite is true for the qReLU activation; i.e., the restricted capacity of the 4-layer model limits the ability of both methods to train the more expressive qReLU effectively. If this is true, then we expect that FTP-SH will outperform SSTE for both the sign and qReLU activations on a harder dataset. Unsurprisingly, none of the lowprecision methods perform as well as the baseline high-precision methods; however, the narrowness of the performance gap between 2-bit qReLU with FTP-SH and full-precision ReLU is encouraging.

4.2. IMAGENET:

The results from the ImageNet experiments are also shown in qReLU activations on the more challenging ImageNet dataset. This is also shown in Figure 3 , which plots the top-1 train and test accuracy curves for the six different activation functions for AlexNet on ImageNet. The left-hand plot shows that training sign activations with FTP-SH provides consistently better test accuracy than SSTE throughout the training trajectory, despite the hyperparameters being optimized for SSTE. This improvement is even larger for the 2-bit qReLU activation in the righthand plot, where the FTP-SH qReLU even outperforms the full-precision ReLU for part of its trajectory, and outperforms the SSTE-trained qReLU by almost 2%. Interestingly, we find that the saturated ReLU outperforms the standard ReLU by almost a full point of accuracy. We believe that this is due to the regularization effect caused by saturating the activation. This may also account for the surprisingly good performance of the FTP-SH qReLU relative to full-precision ReLU, as hard-threshold activations also provide a strong regularization effect.

Finally, we ran a single experiment with ResNet-18 on ImageNet, using hyperparameters from previous works that used SSTE, to check (i) whether the soft hinge loss exhibits vanishing gradient behavior due to its diminishing slope away from the origin, and (ii) to evaluate the performance of FTP-SH for a less-quantized ReLU (we used k = 5 steps, which is less than the full range of a 3-bit ReLU). While FTP-SH does slightly worse than SSTE for the sign function, we believe that this is because the hyperparameters were tuned for SSTE and not due to vanishing gradients, as we would expect much worse accuracy in that case. Results from the qReLU activation provide further evidence against vanishing gradients as FTP-SH for qReLU outperforms SSTE by almost 4% in top-1 accuracy (Table 1 ).

5. CONCLUSION:

In this work, we presented a novel mixed convex-combinatorial optimization framework for learning deep neural networks with hard-threshold units. Combinatorial optimization is used to set discrete targets for the hard-threshold hidden units, such that each unit only has a linearly-separable problem to solve. The network then decomposes into individual perceptrons, which can be learned with standard convex approaches, given these targets. Based on this, we developed a recursive algorithm for learning deep hard-threshold networks, which we call feasible target propagation (FTPROP), and an efficient mini-batch variant (FTPROP-MB). We showed that the commonly-used but poorly-justified saturating straight-through estimator (STE) is the special case of FTPROP-MB that results from using a saturated hinge loss at each layer and our target heuristic and other types of STE correspond to other heuristic and loss combinations in FTPROP-MB. Finally, we defined the soft hinge loss and showed that FTPROP-MB with a soft hinge loss at each layer improves classification accuracy for multiple models on CIFAR-10 and ImageNet when compared to the saturating STE.

In future work, we plan to develop novel target heuristics and layer loss functions by investigating connections between our framework and constraint satisfaction and satisfiability. We also intend to further explore the benefits of deep networks with hard-threshold units. In particular, while recent research clearly shows their ability to reduce computation and energy requirements, they should also be less susceptible to vanishing and exploding gradients and may be less susceptible to covariate shift and adversarial examples. We trained the Zhou et al. (2016) variant of AlexNet (Krizhevsky et al., 2012) on ImageNet with sign, 2-bit qReLU, ReLU, and saturated ReLU activations. This version of AlexNet removes the dropout and replaces the local contrast normalization layers with batch normalization. Our implementation does not split the convolutions into two separate blocks. We used the Adam optimizer with learning rate 1e-4 on the cross-entropy loss for 80 epochs, decaying the learning rate by 0.1 after 56 and 64 epochs. For the sign activation, we used a weight decay of 5e-6 as in Zhou et al. (2016) . For the ReLU and saturated ReLU activations, which are much more likely to overfit, we used a weight decay of 5e-4, as used in Krizhevsky et al. (2012) . For the 2-bit qReLU activation, we used a weight decay of 5e-5, since it is more expressive than sign but less so than ReLU.

As with AlexNet, we trained ResNet-18 (He et al., 2015b) on ImageNet with sign, qReLU, ReLU, and saturated ReLU activations; however, for ResNet-18 we used a qReLU with k = 5 steps (i.e., 6 quantization levels, requiring 3 bits). We used the ResNet code provided by PyTorch. We optimized the cross-entropy loss with SGD with learning rate 0.1 and momentum 0.9 for 90 epochs, decaying the learning rate by a factor of 0.1 after 30 and 60 epochs. For the sign activation, we used a weight decay of 5e-7. For the ReLU and saturated ReLU activations, we used a weight decay of 1e-4. For the qReLU activation, we used a weight decay of 1e-5.

:



Figures and Tables:

with weight matrices W = {W d : W d ∈ R n d ×n d-1 } d=1 and element-wise activation function g(x) = sign(x), where sign is the sign function such that sign(x) = 1 if x > 0 and -1 otherwise. Each layer d has n d units, where we define n 0 = n for the input layer, and we let h d = g(W d . . . g(W 1 x) . . . ) denote the output of each hidden layer, where h d = (h d1 , . . . , h dn d ) and h dj ∈ {-1, +1} for each layer d and each unit j. Similarly, we let z d = W d g(. . . g(W 1 x) . . . ) denote the pre-activation output of layer d. For compactness, we have incorporated the bias term into the weight matrices. We denote a row or column of a matrix W d as W d,:j and W d,j: , respectively, and the entry in the jth row and kth column as W d,jk . Using matrix notation, we can write this model as Y = f (X; W ) = g(W . . . g(W 1 X) . . . ), where X is the n × m matrix of dataset instances and Y is the n × m matrix of outputs. We let T denote the matrix of final-layer targets, H d denote the n d × m matrix of hidden activations at layer d, and Z d denote the n d × m matrix of pre-activations

5: function FTPROP(weights W , targets T , losses L, and layer index d)6: optimize W d with respect to layer loss L d (Z d , T d ) // check feasibility; Z d = W d T d-1 7: if activations H d = g(W d T d-1 ) equal the targets T d then return True // feasible 8:else if this is the first layer (i.e., d = 1) then return False // infeasible 9:while computational budget of this layer not exceeded do // e.g., determined by beam search 10: T d-1 ← heuristically set targets for upstream layer to reduce layer loss L d (Z d , T d ) 11: if FTPROP(W, T, L, d -1) then // check if targets T d-1 are feasible 12: optimize W d with respect to layer loss L d (Z d , T d ) 13: if activations H d = g(W d T d-1 ) equal the targets T d then return True // feasible 14:

Train an -layer hard-threshold network Y = f (X; W ) on dataset D = (X, T ) with mini-batch feasible target propagation (FTPROP-MB) using loss functions L = {L d } d=1 . 1: initialize weights W = {W 1 , . . . , W } randomly 2: for each minibatch (X b , T b ) from D do 3: initialize targets T 1 , . . . , T -1 as the outputs of their hidden units in f (X b ; W ) // forward pass 4: set T 0 ← X b , set T ← T b , and set T ← {T 0 , . . . , T } 5: FTPROP-MB(W, T, L, ) 6: function FTPROP-MB(weights W , targets T , losses L, and layer index d) 7: Td-1 ← set targets for upstream layer based on current weights W d and loss L d (Z d , T d ) 8: update W d with respect to layer loss L d (Z d , T d ) // where Z

Figure 2: Figures (a)-(c) show different per-layer loss functions (solid blue line) and their derivatives (dashed red line).Figure (d)  shows the quantized ReLU activation (solid blue line), which is a sum of step functions, its corresponding sum of saturated-hinge-loss derivatives (dashed red line), and the soft-hinge-loss approximation to this sum that was found to work best (dotted yellow line).

Figure 5: The top-1 test accuracies for the 8-layer convolutional network with different activation functions on CIFAR-10. The inset figures show the test accuracy for the final 100 epochs in detail. The left figure shows the network with sign activations. The right figure shows the network with 2-bit quantized ReLU (qReLU) activations and with the full-precision baselines. Best viewed in color.

The best top-1 test accuracy for each network over all epochs when trained with sign, qReLU, and full-precision baseline activations on CIFAR-10 and ImageNet. The hard-threshold activations are trained with both FTPROP-MB with per-layer soft hinge losses (FTP-SH) and the saturated straight-through estimator (SSTE). Bold numbers denote the best performing quantized activation in each experiment.

Table content: <table><tr><td/><td/><td>Sign</td><td colspan="2">qReLU</td><td colspan="2">Baselines</td></tr><tr><td/><td colspan="2">SSTE FTP-SH</td><td colspan="2">SSTE FTP-SH</td><td colspan="2">ReLU Sat. ReLU</td></tr><tr><td>4-layer convnet (CIFAR-10)</td><td>80.6</td><td>81.3</td><td>85.6</td><td>85.5</td><td>86.5</td><td>87.3</td></tr><tr><td>8-layer convnet (CIFAR-10)</td><td>84.6</td><td>84.9</td><td>88.4</td><td>89.8</td><td>91.2</td><td>91.2</td></tr><tr><td>AlexNet (ImageNet)</td><td>46.7</td><td>47.3</td><td>59.4</td><td>60.7</td><td>61.3</td><td>61.9</td></tr><tr><td>ResNet-18 (ImageNet)</td><td>49.1</td><td>47.8</td><td>60.6</td><td>64.3</td><td>69.1</td><td>66.9</td></tr></table>

As predicted from the CIFAR-10 experiments, we see that FTP-SH improves test accuracy on AlexNet for both sign and 2-bit The top-1 train (thin dashed lines) and test (thicker solid lines) accuracies for AlexNet with different activation functions on ImageNet. The inset figures show the test accuracy for the final 25 epochs in detail. In both figures, FTPROP-MB with soft hinge (FTP-SH, red) outperforms the saturated straight-through estimator (SSTE, blue). The left figure shows the network with sign activations. The right figure shows that the 2-bit quantized ReLU (qReLU) trained with our method (FTP-SH) performs nearly as well as the full-precision ReLU. Interestingly, saturated ReLU outperforms standard ReLU. Best viewed in color.

Table content: <table><tr><td/><td>55</td><td colspan="2">Sign (FTP-SH) Sign (SSTE)</td><td/><td/><td/><td/><td/><td/><td>80</td><td colspan="2">qReLU (FTP-SH) qReLU (SSTE)</td><td/><td/><td/><td/><td/></tr><tr><td>Top-1 Accuracy</td><td>35 40 45 50</td><td/><td/><td>46 47</td><td/><td/><td/><td/><td>Top-1 Accuracy</td><td>70 40 50 60</td><td colspan="2">ReLU Saturated ReLU</td><td>60 62</td><td/><td/><td/><td/></tr><tr><td/><td>30</td><td/><td/><td>55 45</td><td>60</td><td>65</td><td>70</td><td>75</td><td>80</td><td>30</td><td/><td/><td>55 58</td><td>60</td><td>65</td><td>70</td><td>75</td><td>80</td></tr><tr><td/><td>0</td><td>10</td><td>20</td><td>30</td><td>40</td><td>50</td><td>60</td><td>70</td><td>80</td><td>0</td><td>10</td><td>20</td><td>30</td><td>40</td><td>50</td><td>60</td><td>70</td><td>80</td></tr><tr><td/><td/><td/><td/><td colspan="2">Epoch</td><td/><td/><td/><td/><td/><td/><td/><td colspan="2">Epoch</td><td/><td/><td/></tr><tr><td colspan="3">Figure 3:</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr></table>

Peer review (iclr2018):
 The paper discusses the problem of optimizing neural networks with hard threshold and proposes a novel solution to it. The problem is of significance because in many applications one requires deep networks which uses reduced computation and limited energy. The authors frame the problem of optimizing such networks to fit the training data as a convex combinatorial problems. However since the complexity of such a problem is exponential, the authors propose a collection of heuristics/approximations to solve the problem. These include, a heuristic for setting the targets at each layer, using a soft hinge loss, mini-batch training and such. Using these modifications the authors propose an algorithm (Algorithm 2 in appendix) to train such models efficiently. They compare the performance of a bunch of models trained by their algorithm against the ones trained using straight-through-estimator (SSTE) on a couple of datasets, namely, CIFAR-10 and ImageNet. They show superiority of their algorithm over SSTE. I thought the paper is very well written and provides a really nice exposition of the problem of training deep networks with hard thresholds. The authors formulation of the problem as one of combinatorial optimization and proposing Algorithm 1 is also quite interesting. The results are moderately convincing in favor of the proposed approach. Though a disclaimer here is that I*m not 100% sure that SSTE is the state of the art for this problem. Overall i like the originality of the paper and feel that it has a potential of reasonable impact within the research community. There are a few flaws/weaknesses in the paper though, making it somewhat lose. - The authors start of by posing the problem as a clean combinatorial optimization problem and propose Algorithm 1. Realizing the limitations of the proposed algorithm, given the assumptions under which it was conceived in, the authors relax those assumptions in the couple of paragraphs before section 3.1 and pretty much throw away all the nice guarantees, such as checks for feasibility, discussed earlier. - The result of this is another algorithm (I guess the main result of the paper), which is strangely presented in the appendix as opposed to the main text, which has no such guarantees. - There is no theoretical proof that the heuristic for setting the target is a good one, other than a rough intuition - The authors do not discuss at all the impact on generalization ability of the model trained using the proposed approach. The entire discussion revolves around fitting the training set and somehow magically everything seem to generalize and not overfit.