Title: LEARNING BOOLEAN CIRCUITS WITH NEURAL NET-WORKS

Abstract: Training neural-networks is computationally hard. However, in practice they are trained efficiently using gradient-based algorithms, achieving remarkable performance on natural data. To bridge this gap, we observe the property of local correlation: correlation between small patterns of the input and the target label. We focus on learning deep neural-networks with a variant of gradient-descent, when the target function is a tree-structured Boolean circuit. We show that in this case, the existence of correlation between the gates of the circuit and the target label determines whether the optimization succeeds or fails. Using this result, we show that neural-networks can learn the (log n)-parity problem for most product distributions. These results hint that local correlation may play an important role in differentiating between distributions that are hard or easy to learn.

1. INTRODUCTION AND MOTIVATION:

It is well known (e.g. Livni et al. (2014) ) that while deep neural-networks can express any function that can be run efficiently on a computer, in the general case, training them is computationally hard. Despite this theoretic pessimism, in practice, deep neural networks are successfully trained on real world datasets. Bridging this theoretical-practical gap seems to be the holy grail of theoretical machine learning nowadays. Maybe the most natural direction to bridge this gap is to find a property of data distributions that determines whether training is computationally easy or hard. The goal of this paper is to propose such a property.

To motivate this, we first recall the k-parity problem: the input is n bits, there is a subset of k relevant bits (which are unknown to the learner), and the output should be 1 if the number of 1's among the relevant bits is even and -1 otherwise. It is well known (e.g. Shalev-Shwartz et al. (2017) ) that the parity problem can be expressed by a fully connected two layer network or by depth log(n) locally connected1 network. We observe the behavior of a one hidden-layer neural network trained on the k-parity problem, in two different instances: first, when the underlying distribution is the uniform distribution (i.e. the probability to see every bit is 1 2 ); and second, when the underlying distribution is a slightly biased product distribution (the probability for every bit to be 1 is 0.6). As can be clearly seen in figure 1 , adding a slight bias to the probability of each bit dramatically affects the behavior of the network: while on the uniform distribution the training process completely fails, in the biased case it converges to a perfect solution.

This simple experiment shows that a small change in the underlying distribution can cause a dramatic change in the trainability of neural-networks. A key property that differentiates the uniform from the biased distribution is the correlation between input bits and the target label. While in the uniform distribution, the correlation between each bit and the label is zero, in the biased case every bit of the k bits in the parity has a non-negligible correlation to the label (we show this formally in section 5). So, local correlations between bits of the input and the target label seems to be a promising property which separates easy and hard distributions.

In this paper, we analyze the problem of learning tree-structured Boolean circuits with neuralnetworks. The key property that we assume is having sufficient correlation between every gate in the circuit and the label. We show that a variant of gradient-descent can efficiently learn such circuits for some families of distributions, where at the same time, without correlation, gradientdescent is likely to fail. More concretely, we discuss specific target functions and distributions that satisfy the local correlation requirement. We show that for most product distributions, gradientdescent learns the (log n)-parity problem (parity on log n bits of an input with dimension n). We further show that for every circuit with AND/OR/NOT gates, there exists a generative distribution, such that gradient-descent recovers the Boolean circuit exactly.

Admittedly, as the primary focus of this paper is on theoretical analysis, the distributions we study are synthetic in nature. However, to explain the empirical success of neural-networks, we need to verify whether the local correlation property holds for natural datasets as well. To confirm this, we perform the following simple experiment: we train a network with two hidden-layers on a single random patch from images in the ImageNet dataset. We observe that even on a complex task such as ImageNet, a network that gets only a 3 × 3 patch as an input, achieves 2.6% top-5 accuracy -much better than a random guess (0.5% top-5 accuracy). The full results of the experiment are detailed in the appendix. This experiment highlights that, to some extent, natural datasets display a local correlation property: even a few "bits" of the input already have some non-negligible information on the target label.

2. RELATED WORK:

In recent years, the success of neural-networks has inspired an ongoing theoretical research, trying to explain empirical observations about their behavior. Some theoretical works show failure cases of neural-networks. Other works give different guarantees on various learning algorithms for neuralnetworks. In this section, we cover the main works that are relevant to our paper. Shamir (2018) shows failures of gradient descent, both in learning natural target functions and in learning natural distributions. The work of Shalev-Shwartz et al. (2017) shows that gradient-descent fails to learn parities and linear-periodic functions under the uniform distribution. In Das et al. (2019) , a hardness result for learning random deep networks is shown. Other similar failure cases are also covered in Abbe & Sandon (2018) ; Malach & Shalev-Shwartz (2019) . While the details of these works differ, they all share the same key principal -if there is no local correlation, gradient-descent fails. Our work complements these results, showing that in some cases, when there are local correlations to the target, gradient-descent succeeds to learn the target function.

Failures of gradient-based algorithms. Various works have shown different examples demonstrating failures of gradient-based algorithm. The work of:

Learning neural-networks with gradient-descent. Recently, a large number of papers have provided positive results on learning neural-networks with gradient-descent. Generally speaking, most of these works show that over-parametrized neural-networks, deep or shallow, achieve performance that is competitive with kernel-SVM. Daniely (2017) shows that SGD learns the conjugate kernel associated with the architecture of the network, for a wide enough neural-network. The work of Brutzkus et al. (2017) shows that SGD learns a neural-network with good generalization, when the target function is linear. A growing number of works show that for a specific kernel induced by the network activation, called the Neural Tangent Kernel (NTK), gradient-descent learns overparametrized networks, for target functions with small norm in the reproducing kernel Hilbert space (see the works of Jacot et al. (2018) ; Xie et al. (2016) ; Oymak & Soltanolkotabi (2018) ; Allen-Zhu et al. (2018a; b) ; Oymak & Soltanolkotabi (2019) ; Arora et al. (2019); Du et al. (2018) ; Ma et al. (2019) ; Lee et al. (2019) ). While these results show that learning neural-networks with gradientdescent is not hopeless, they are in some sense disappointing -in practice, neural-networks achieve performance that are far better than SVM, a fact that is not explained by these works. A few results do discuss success cases of gradient-descent that go beyond the kernel-based analysis (Brutzkus & Globerson, 2017; 2019; Allen-Zhu & Li, 2019; Yehudai & Shamir, 2019) . However, these works still focus on very simple cases, such as learning a single neuron, or learning shallow neural-networks in restricted settings. In this work we deal with learning deep networks, going beyond the common reduction to linear classes of functions.

Layerwise optimization algorithms.:

In this paper, we analyze the behavior of layerwise gradientdescent -optimizing one layer at a time, instead of the common practice to optimize the full network end-to-end. We do so since such algorithm greatly simplifies our theoretical analysis. While layerwise training is not a common practice, recent works (Belilovsky et al., 2018; 2019) have shown that such algorithms achieve performance that are competitive with the standard end-to-end approach, scaling up to the ImageNet dataset. We note that other theoretical works have studied iterative algorithms that learn neural-networks layer-by-layer (Arora et al., 2014; Malach & Shalev-Shwartz, 2018) . However, our work focuses specifically on layerwise gradient-descent, considering the problem of learning Boolean circuits.

Learning Boolean Circuits. The problem of learning Boolean circuits has been studied in the classical literature of theoretical machine learning. The work of Kearns et al. (1987) gives various positive and negative results on the learnability of Boolean Formulas, including Boolean circuits. The work of Linial et al. (1989) introduces an algorithm that learns a constant-depth circuit in quasipolynomial time. Another work by Kalai (2018) discusses various properties of learning Boolean formulas and Boolean circuits. Our work differs from the above in various aspects. Our main focus is learning deep neural-networks with gradient descent, where the target function is implemented by a Boolean circuit, and we do not aim to study the learnability of Boolean circuits in general. Furthermore, we consider Boolean circuits where a gate can take any Boolean functions, and not only AND/OR/NOT, as is often considered in the literature of Boolean circuits. On the other hand, we restrict ourselves to the problem of learning circuits with a fixed structure of full binary trees. We are not aware of any work studying a problem similar to ours.

3. PROBLEM SETTING:

We consider the problem of learning binary classification functions over the Boolean cube. So, let X = {±1} n be the instance space and Y = {±1} be the label set. Throughout the paper, we assume the target function is given by a Boolean circuit. In general, such assumption effectively does not limit the set of target functions, as any computable function can be implemented by a Boolean circuit. We define a circuit C to be a directed graph with n input nodes and a single output node, where each inner node has exactly two incoming edges, and is labeled by some arbitrary Boolean function f : {±1}2 → {±1}, which we call a gate 2 . For each node v in C we denote by γ(v) ∈ f : {±1} 2 → {±1} its gate. We recursively define h v,C : {±1} n → {±1} to be:

h v,C (x) = γ(v) (h u1,C (x), h u2,C (x))

where u 1 , u 2 are the two nodes with outcoming edges to v. Finally, define h C = h o,C , where o is the output node.

We study the problem of learning the target function h C , when C is a full binary tree, and n = 2 d , where d is the depth of the tree. The leaves of the tree are the input bits, ordered by x 1 , . . . x n . Admittedly, such assumption greatly limits the set of target functions, but still gives a rather rich family of functions. For example, such circuit can calculate the parity function on any k bits of the input (the function calculated by f (x) = i∈I x i for some set of indexes I). We note that the total number of functions calculated by such tree grows like 6 n , as shown in Farhoodi et al. (2019) .

We introduce a few notations that are used in the sequel. Fix some tree structured binary circuit C. This circuit has d levels, and we denote v i,j the j-th node in the i-th level of the tree, and denote γ i,j = γ(v i,j ). Fix some i ∈ [d], let n i := 2 i , and denote by Γ i : {±1} ni → {±1} ni/2 the function calculated by the i-th level of the circuit:

Γ i (x) = γ i-1,1 (x 1 , x 2 ), . . . , γ i-1,ni/2 (x ni-1 , x ni ) For i < i , we denote: Γ i...i := Γ i • • • • • Γ i . So, the full circuit is given by h C (x) = Γ 1...d (x).

As noted, our goal is to learn Boolean circuits with neural-networks. To do so, we use a network architecture that aims to imitate the Boolean circuits described above. We replace each Boolean gate with a neural-gate: a one hidden-layer ReLU network, with a hard-tanh3 activation on its output. Formally, let σ be the ReLU activation, and let φ be the hard-tanh activation, so:

σ(x) = max(x, 0), φ(x) =    -1 x ≤ -1 x x ∈ (-1, 1) 1 x ≥ 1

Define a neural-gate to be a neural-network with one hidden layer, input dimension 2, with ReLU activation for the hidden-layer and hard-tanh for the output node. Namely, denote g w,v : R 2 → R such that:

g w,v (x) = φ( k l=1 v i σ( w l , x ))

Notice that a neural-gate g w,v of width 4 or more can implement any Boolean gate. That is, we can replace any Boolean gate with a neural-gate, and maintain the same expressive power. To implement the full Boolean circuit defined above, we construct a deep network of depth d (the depth of the Boolean circuit), with the same structure as the Boolean circuit. We define d blocks, each block has neural-gates with the same structure and connectivity as the Boolean circuit. A block

B W (i) ,V (i) : R 2 i → R 2 i-1

, is defined by:

B W (i) ,V (i) (x) = [g w (i,1) ,v (i,1) (x 1 , x 2 ), g w (i,2) ,v (i,2) (x 3 , x 4 ), . . . , g w (i,2 i-1 ) ,v (i,2 i-1 ) (x 2 i -1 , x 2 i )]

We consider the process of training neural-networks of the form d) . Notice that indeed, a network N W,V can implement any tree-structured Boolean circuit of depth d. In practice, neural-networks are trained with gradient-based optimization algorithm, in an end-to-end fashion. That is, the weights of all the layers are optimized together, with gradient updates on a given sample. To simplify the analysis, we instead consider a layerwise optimization algorithm, that performs gradient updates layer-by-layer. While this approach is much less popular, it has been recently shown to achieve performance that are comparable to end-to-end training, scaling up to the ImageNet dataset (Belilovsky et al., 2018) .

EQUATION

Denote by P the average-pooling operator, defined by

P (x 1 , . . . , x n ) = 1 n n i=1 x i .

Denote the hinge-loss by (ŷ, y) = max(1 -y ŷ, 0) and denote the loss on the distribution by

L D (f ) = E (x,y)∼D [ (f (x), y)]. For a sample S ⊆ X × Y, denote the loss on the sample by L S (f ) = 1 |S| (x,y)∈S (f (x), y).

The layerwise gradient-descent algorithm for learning deep networks is described in algorithm 1.

For simplicity, we assume that the second layer of every neural-gate is fixed, such that v ∈ {±1}. Notice that this does not limit the expressive power of the network. Algorithm 1 iteratively optimizes the output of the network's layers, starting from the bottom-most layer. For each layer, the average-pooling operator is applied to reduce the output of the layer to a single bit, and this output is optimized with respect to the target label. Note that in fact, we can equivalently optimize each neural-gate separately and achieve the same algorithm. However, we present a layerwise training process to conform with algorithms used in practice.

Algorithm 1 Layerwise Gradient-Descent input: Sample S ⊆ X × Y, number of iterations T ∈ N, learning rate η ∈ R. Let N d ← id for i = d . . . 1 do Initialize W (i) 0 , V (i) 0 . for t = 1 . . . T do Update W (i) t ← W (i) t-1 -η ∂ ∂W (i) t-1 L S (P (B W (i) t-1 ,V (i) 0 • N i )) end for Update N i-1 ← B W (i) T ,V (i) 0

• N i end for Return N 0

4. MAIN RESULTS:

Our main result shows that algorithm 1 can learn a function implemented by the circuit C, when running on "nice" distributions, with the local correlation property. We start by describing the distributional assumptions needed for our main results. Let D be some distribution over X × Y. For some function f : X → X , we denote by f (D) the distribution of (f (x), y) where (x, y) ∼ D. Let D (i) be the distribution Γ (i+1)...d (D). Denote by c i,j the correlation between the output of the j-th gate in the i-th layer and the label, so:

c i,j := E D (i) [x j y].

Define the influence of the j-th gate in the i-th layer with respect to the uniform distribution (U ) by:

I i,j := P x∼U [Γ i-1 (x) = Γ i-1 (x ⊕ e j )] := P x∼U [Γ i-1 (x) = Γ i-1 (x 1 , . . . , -x j , . . . , x n )]

Now, we introduce the main assumption on the distribution D. We assume the following: Assumption 1. (local correlation) There exists some ∆ ∈ (0, 1) such that for every layer i ∈ [d] and for every gate j ∈ [2 i ] with I i,j = 0, the value of c i,j satisfies

|c i,j | > |E D [y]| + ∆.

Another technical assumption we need to make is the following: Assumption 2. (label bias) There exists some β ∈ (0, 1)

such that |E D [y]| > β.

Before we present the main results, we wish to discuss the distributional assumptions given above. Assumption 1 is the key assumption required for the algorithm to succeed in learning the target function. Essentially, this assumption requires that the output of every gate in the circuit will "explain" the label slightly better then simply observing the bias between positive and negative examples.

Clearly, gates that have no influence on the target function never satisfy this property, so we require it only for influencing gates. While this is a strong assumption, in section 5 we discuss examples of distributions where this assumption typically holds. Furthermore, the experiment described in section 1 hints that this assumption may hold for natural data. Assumption 2 is a simple technical assumption, that requires that the distribution of positive and negative examples is slightly biased.

In a sense, we expect that "most" distributions would not be exactly balanced, so this assumption is easy to satisfy. Now, consider the case where D (limited to X ) is a product distribution: for every j = j , the variables x j and x j are independent, for (x, y) ∼ D. A simple argument shows that any product distribution D that satisfies assumptions 1, satisfies the following properties: Property 1. There exists some ∆ ∈ (0, 1) such that for every layer i ∈ [d] and for every gate j ∈ [2 i ], the output of the j-th gate in the i-th layer satisfies one of the following:

• The value of the gate j is independent of the label y, and its influence is zero:

I i,j = 0. • The value of c i,j satisfies |c i,j | > |E D [y]| + ∆. Property 2. For every layer i ∈ [d],

and for every gate j ∈ [2 i-1 ], the value of (x 2j-1 , x 2j ) (i.e, the input to the j-th gate of layer i -1) is independent of the label y given the output of the j-th gate:

P (x,y)∼D (i) [(x 2j-1 , x 2j ) = p, y = y |γ i-1,j (x 2j-1 , x 2j )] = P (x,y)∼D (i) [(x 2j-1 , x 2j ) = p|γ i-1,j (x 2j-1 , x 2j )] • P (x,y)∼D (i) [y = y |γ i-1,j (x 2j-1 , x 2j )]

Property 1 is immediate from assumption 1. The following lemma shows that property 2 is satisfied as well for any product distribution: Lemma 1. Assume D (restricted to X ) is a product distribution (i.e., for every j = j we have that x j and x j are independent, for (x, y) ∼ D). Then D satisfies property 2.

Notice that properties 1, 2 may hold for distributions that are not product distribution (as we show in the next section). Specifically, property 2 is a very common assumption in the field of Graphical Models (see Koller & Friedman (2009) ). For our results to hold in a more general setting, we use properties 1 and 2, instead of assuming that D is a product distribution satisfying assumption 1. So, given a distribution satisfying properties 1, 2 and assumption 2, we show that algorithm 1 achieves an arbitrarily good approximation with high probability, with sample complexity and run-time quasipolynomial in the dimension n: Theorem 1. Let D be a distribution satisfying properties 1, 2 and assumption 2. Assume that for every i we initialize

W (i) 0 such that W (i) 0 max ≤ 1 4 √ 2k .

Fix some , δ > 0 and assume that k ≥ log -1 ( 4 3 ) log( 2nd δ ), and that η ≤ 1 16k . Assume we sample S ∼ D, with |S| > 128 2 min{∆,2β} 2 n 11+4 log n-2 log min{∆,2β} log( 8nd δ ). Then, with probability at least 1 -δ, when running algorithm 1 on the sample S, the algorithm returns the a function such that:

E (x,y)∼D [N 0 (x) = h C (x)] ≤ when running T > 3 √ 2

η min{∆,2β} n 6.5+2 log n-log min{∆,2β} steps for each layer.

The above shows a learnability result in the standard PAC setting (given our distributional assumptions), where we only guarantee approximation of the target function under the given distribution.

In fact, we can get a stronger result, and show that the algorithm learns the function h C exactly, with run-time and sample complexity polynomial in n. To get this result, we need to require that there is no feasible pattern (pair of bits) in the Boolean circuit that is extremely rare: Assumption 3. There exists some ∈ (0, 1) such that for every layer i ∈ [d], for every gate j ∈ [2 i-1 ] and for every p ∈ {±1} 2 such that P (x,y)∼D (i) [(x 2j-1 , x 2j ) = p] = 0, it holds that:

P (x,y)∼D (i) [(x 2j-1 , x 2j ) = p] ≥ .

In section 5 we discuss distributions that satisfies assumption 3. Given all the above assumptions, we get the following: Theorem 2. Let D be a distribution satisfying properties 1, 2 and assumptions 2, 3. Assume that for every i we initialize

W (i) 0 such that W (i) 0 max ≤ 1 4 √ 2k .

Fix some δ > 0 and assume that k ≥ log -1 ( 4 3 ) log( 2nd δ ), and that η ≤ 1 16k . Assume we sample S ∼ D, with |S| > 128 2 min{∆,2β} 2 log( 8nd δ ). Then, with probability at least 1 -δ, when running algorithm 1 on the sample S, the algorithm returns a function such that N 0 (x) = h C (x) for all x ∈ X , when running T > 3 √ 2n η min{∆,2β} steps for each layer.

We give the full proof of the theorems in the appendix, and give a sketch of the argument here.

Observe that the input to the (i, j)-th neural-gate is a pattern of two bits. The target gate (the (i, j)-th gate in the circuit C) identifies each of the four possible patterns with a single output bit. For example, if the gate is OR, then the patterns {(1, 1), (-1, 1), (1, -1)} get the value 1, and the pattern (-1, -1) gets the value -1. Fix some pattern p ∈ {±1} 2 , and assume that the output of the (i, j)-th gate on the pattern p is 1. Since we assume the output of the gate is correlated with the label, the loss function draws the output of the neural-gate on the pattern p toward the correlation of the gate. In the case where the output of the gate on p is -1, the output of the neural-gate is drawn to the opposite sign of the correlation. All in all, the optimization separates the patterns that evaluate to 1 from the patterns that evaluate to -1. In other words, the neural-gate learns to implement the target gate. This way, we can show that the optimization process makes the network recover all the influencing gates, so that at the end of the optimization the network implements the circuit.

Observe that when there is no correlation, the above argument fails immediately. Since the label is slightly biased, when there is no correlation the output of the neural-gate is drawn towards the bias of the label for all the input patterns, regardless of the value of the gate. If the gate is not influencing the target function (i.e. I i,j = 0), then this clearly doesn't effect the overall behavior. However, if there exists some influencing gate with no correlation to the label, then the output of the neural-gate will be constant on all its input patterns. Hence, the algorithm will fail to learn the target function. This shows that assumption 1 is in fact critical for the success of the algorithm.

5. DISTRIBUTIONS:

In the previous section we showed that algorithm 1 can learn tree-structured Boolean circuits in polynomial run-time and sample complexity. These results require some non-trivial distributional assumptions. In this section we study specific families of distributions, and show that they satisfy the above assumptions.

First, we study the problem of learning a parity function on log n bits of the input, when the underlying distribution is a product distribution. The problem of learning parities was studied extensively in the literature of machine learning theory (Feldman et al., 2006; 2009; Blum et al., 2003; Shalev-Shwartz et al., 2017; Brutzkus et al., 2019) , and serves as a good case-study for the above results.

In the (log n)-parity problem, we show that in fact most product distributions satisfy assumptions 1-3, hence our results apply to most product distributions. Next, we study distributions given by a generative model. We show that for every circuit with gates AND/OR and NOT, there exists a distribution that satisfies the above assumptions, so algorithm 1 can learn any such circuit exactly.

5.1. PRODUCT DISTRIBUTIONS:

We observe the k-Parity problem, where the target function is f (x) = j∈I x j some subset I ⊆ [n] of size |I| = k. A simple construction shows that f can be implemented by a tree structured circuit as defined previously. We define the gates of the first layer by:

γ d-1,j (z 1 , z 2 ) =        z 1 z 2 x 2j-1 , x 2j ∈ I z 1 x 2j-1 ∈ I, x 2j / ∈ I z 2 x 2j ∈ I, x 2j-1 / ∈ I 1 o.w

And for all other layers i < d -1, we define: γ i,j (z 1 , z 1 ) = z 1 z 2 . Then we get the following: Lemma 2. Let C be a Boolean circuit as defined above. Then: h C (x) = j∈I x j = f (x).

Now, let D X be some product distribution over X , and denote p j := P D X [x j = 1]. Let D be the distribution of (x, f (x)) where x ∼ D X . Then for the circuit defined above we get the following result: Lemma 3. Fix some ξ ∈ (0, 1 4 ). For every product distribution D with p j ∈ (ξ, 1 2 -ξ)∪( 1 2 +ξ, 1-ξ) for every j, it holds that if

I i,j = 0 then |c i,j | -|E [y]| ≥ ξ k and P (z,y)∼Γ (i+1)...d (D) [z j = 1] ∈ (ξ, 1 -ξ).

The above lemma shows that every product distribution that is far enough from the uniform distribution, or from a constant distribution, satisfies assumptions 1 and 2 with β, ∆ = (2ξ) k . Using the fact that at each layer, the output of each gate is an independent random variable (since the input distribution is a product distribution), we get that assumption 3 is satisfied with = ξ 2 . This gives us the following result: Corollary 1. Let D be a product distribution with p j ∈ (ξ, 1 2 -ξ) ∪ ( 1 2 + ξ, 1 -ξ) for every j, with the target function being the (log n)-Parity (i.e., k = log n). Then, when running algorithm 1 as described in Theorem 2, with probability 1 -δ the algorithm returns the true target function h C , with run-time and sample complexity polynomial in n.

5.2. GENERATIVE MODELS:

Next, we move beyond product distributions, and observe families of distributions given by a generative model. We limit ourselves to circuits where each gate is chosen from the set {∧, ∨, ¬∧, ¬∨}. For every such circuit, we define a generative distribution as follows: we start by sampling a label for the example, from a slightly imbalanced distribution (to satisfy assumption 2). Then iteratively, for every gate, we sample uniformly at random a pattern from all the pattern that give the correct output. For example, if the label is 1 and the topmost gate is OR, we sample a pattern uniformly from {(1, 1), (1, -1), (-1, 1)}. The sampled pattern determines what should be the output of the second topmost layer. For every gate in this layer, we sample again a pattern that will result in the correct output. We continue in this fashion until reaching the bottom-most layer, which defines the observed example.

Formally, for a given gate Γ ∈ {∧, ∨, ¬∧, ¬∨}, we denote the following sets of patterns:

S Γ = {v ∈ {±1} 2 : Γ(v 1 , v 2 ) = 1}, S c Γ = {±1} 2 \ S Γ

We recursively define D (0) , . . . , D (d) , where

D (i) is a distribution over {±1} 2 i × {±1}: • D (0) is a distribution supported on {(1, 1), (-1, -1)} such that P D (0) [(1, 1)] = 1 2 + ξ and P D (0) [(-1, -1)] = 1 2 -ξ, for some 0 < ξ < 1 12 2 3 d .

• To sample (x, y) ∼ D (i) , first sample (z, y) ∼ D (i-1) . Then, for all j ∈ [2 i-1 ], if z j = 1 sample x j ∼ U ni(S γi,j ), and if

z j = -1 sample x j ∼ U ni(S c γi,j ). Set x = [x 1 , . . . , x 2 i-1 ] ∈ {±1} 2 i

, and return (x, y).

Then we have the following results: Lemma 4. For every i ∈ [d] and every j ∈ [2 i ], denote c i,j = E (x,y)∼D (i) [x j y]. Then we have:

|c i,j | -|E [y]| > 1 3 2 3 d = 1 3 n log(2/3)

We also need the following simple observation: -1) .

Lemma 5. For every i ∈ [d] we have Γ i (D (i) ) = D (i

By definition, we have d) satisfies assumption 2 with β = ξ. Notice that from Lemma 4, the distribution D (d) satisfies property 1 with ∆ = 1 3 n log(2/3) (note that since we restrict the gates to AND/OR/NOT, all gates have influence). By its construction, the distribution also satisfies property 2, and it satisfies assumption 3 with = 1 4 d = 1 n 2 . Therefore, we can apply Theorem 2 on the distribution D (d) , and get that algorithm 1 learns the circuit C exactly in polynomial time. This leads to the following nice corollary: Corollary 2. With the assumptions and notations of Theorem 2, for every circuit C with gates in {∧, ∨, ¬∧, ¬∨}, there exists a distribution D such that when running algorithm 1 on a sample from D, the algorithm returns h C with probability 1 -δ, in polynomial run-time and sample complexity.

E [y] = 2ξ, so D (

Note that the fact that for every circuit there exists a distribution that can be learned in the PAC setting is trivial: simply take a distribution that is concentrated on a single positive example, and approximating the target function on such distribution is achieved by a classifier that always returns a positive prediction. However, showing that there exists a distribution on which algorithm 1 exactly recovers the circuit, is certainly non-trivial.

6. DISCUSSION:

In this paper we suggested the property of local corrleation as a possible candidate for differentiating between hard and easy distributions. We showed that on the task of learning tree-structured Boolean circuits, the existence of local correlations between the gates and the target label allows layerwise gradient-descent to learn the target circuit. Furthermore, we showed specific tasks and distributions which satisfy the local correlation property. These results raise a few open questions, which we leave for future work. The most immediate research problem is showing similar results for more general structures of Boolean circuit, and on a wider range of distributions (beyond product distributions or generative models). More generally, we suggest that the local correlation property may be important in a broader context, beyond Boolean circuits. For example, examining whether an equivalent property exists when the target function is a convolutional network is an extremely interesting open problem. Needless to say, finding other properties of natural distribution that determine whether gradient-based algorithms succeed or fail is another promising research direction. 

A EXPERIMENTS:



B PROOFS OF SECTION 4:

We assume w.l.o.g that for every i, j such that I i,j = 0, the (i, j) gate is constant γ i,j ≡ sign(E D [y]). Since the output of this gate has no influence on the output y, we can choose it freely without changing the target function. To prove Theorem 1 and Theorem 2, we observe the behavior of the algorithm on the i-th layer. Let ψ : {±1} ni → {±1} ni be some mapping such that ψ(x) = (ξ 1 • x 1 , . . . , ξ ni • x ni ) for ξ 1 , . . . , ξ ni ∈ {±1}. We also define ϕ i : {±1} ni/2 → {±1} ni/2 such that:

ϕ i (z) = (ν 1 z 1 , . . . , ν ni/2 z ni/2 )

where

ν j := sign(c i-1,j ) c i-1,j = 0 1 I i-1,j = 0

Fix some > 0. We need to handle "bad" examples -examples that "rare" patches appear in them.

For every (i, j) gate, we observe all the input patterns p to the (i, j) gate that appear with probability at most . Denote the following set of triplets:

P := (i, j, p) : P (x,y)∼D (i) [(x 2j-1 , x 2j ) = p] <

Denote the following set of "bad" examples:

X := x ∈ X : ∃(i, j, p) ∈ P s.t. (z 2j-1 , z 2j ) = p f or z = Γ (i+1)...d (x)

We have the following important result, which we prove in the sequel:

Lemma 6. Fix > 0 and let ≤ such that P (x,y)∼D x ∈ X < 8 √ 2ni min{∆, 2β}. Assume we initialize w (0) l such that w (0) l ≤ 1 4k . Fix δ > 0. Assume we sample S ∼ D, with |S| > 128 2 min{∆,2β} 2 log( 8ni δ ). Assume that k ≥ log -1 ( 4 3 ) log( 8ni δ ), and that η ≤ ni 16k . Let Ψ : X → [-1, 1] ni/2 such that for every x / ∈ X we have Ψ(x) = ψ • Γ (i+1)...d (x)

for some ψ as defined above. Assume we perform the following updates:

W (i) t ← W (i) t-1 -η ∂ ∂W (i) t-1 L S (P (B W (i) t-1 ,V (i) 0 ))

Then with probability at least 1-δ, for t > 3ni √ 2η min{∆,2β} we have:

B W (i) t ,V (i) 0 (x) = ϕ i •Γ i •ψ(x)

for every x / ∈ X .

Given these results, we can prove the main theorems:

Proof. of Theorem 1 and Theorem 2. Fix δ = δ d . Let 0 ≥ • • • ≥ d > 0 such that for every i ∈ [d] we have: P (x,y)∼D x ∈ X i < i-1 min{∆,2β} 8 √ 2ni

(we will note the exact value of i later). We show that for every i ∈ [d], w.p at least 1 -(d -i + 1)δ , after the i-th step of the algorithm we have

N i-1 (x) = ϕ i • Γ i...d (x) for every x / ∈ X i-1

. By induction on i:

• For i = d, we get the required using Lemma 6 with ψ, Ψ = id and = d-1 , = d .

• Assume the above holds for i, and we show it for i -1. By the assumption, w.p at least 1 -

(d -i + 1)δ we have N i-1 (x) = ϕ i • Γ i...d (x) for every x / ∈ X i-1 .

Observe that:

EQUATION

))

So using Lemma 6 with ψ = ϕ i , Ψ = N i and = i-2 , = i-1 we get that w.p at least 1 -δ we have B W (i-1)

T ,V (i-1) 0 (x) = ϕ i-1 • Γ i-1 • ϕ i (x) for every x / ∈ X i-2 .

In this case, since ϕ i • ϕ i = id, we get that for every x / ∈ X i-2 :

N i-2 (x) = B W (i-1) T ,V (i-1) 0 • N i-1 (x) = (ϕ i-1 • Γ i-1 • ϕ i ) • (ϕ i • Γ i...d )(x) = ϕ i-1 • Γ (i-1)...d (x)

and using the union bound gives the required.

Notice that ϕ 1 = id: by definition of D (0) = Γ 1...d (D), for (z, y) ∼ D (0) we have z = Γ 1...d (x) and also y = Γ 1...d (x) for (x, y) ∼ D. Therefore, we have c 0,1 = E (x,y)∼D (0) [xy] = 1, and therefore ϕ i (z) = sign(c 0,1 )z = z. Now, choosing i = 1, the above result shows that with probability at least 1 -δ, the algorithm returns

N 0 such that N 0 (x) = ϕ 1 • Γ 1 • • • • • Γ d (x) = h C (x) for every x / ∈ X 0 .

To prove Theorem 2, it is enough to observe that when taking 0 = • • • = d = , assumption 3 implies that P = ∅ and therefore X = ∅, so the theorem follows. To prove Theorem 1, we take 0 = and inductively define i = i-1 min{∆,2β} 32 √ 2n 2

. Notice that

P i ≤ i∈[d] ni 2 {±1} 2 = 4

log n i=0 2 i-1 = 4n. So, using the union bound we get:

P (x,y)∼D x ∈ X i = P (x,y)∼D ∪ (i,j,p)∈ P i Γ (i+1)...d (x) (2j-1,2j) = p ≤ (i,j,p)∈ P i P (x,y)∼D Γ (i+1)...d (x) (2j-1,2j) = p ≤ (i,j,p)∈ P i P (x,y)∼D (i) [(x 2j-1 , x 2j ) = p] < P • i ≤ i-1 ∆ 8 √ 2n i

Now, observing that d = min{∆,2β} d 2 5.5d n 2d

= n log min{∆,2β} n 5.5+2 log n gives the required.

In the rest of this section we prove Lemma 6. Fix some i ∈ [d] and let j ∈ [n i /2]. With slight abuse of notation, we denote by w (t) the value of the weight w (i,j) at iteration t, and denote v := v (i,j) and g t := g w (t) ,v . Recall that we defined ψ

(x) = (ξ 1 • x 1 , . . . , ξ ni • x ni ) for ξ 1 . . . ξ ni ∈ {±1}. Denote D (i) := ψ(D (i)

) the distribution of (ψ(x), y), where (x, y) ∼ D (i) . Let γ := γ i-1,j , and let

γ such that γ(x 1 , x 2 ) = γ(ξ 2j-1 • x 1 , ξ 2j • x 2 ).

For every p ∈ {±1} 2 , denote p := (ξ 2j-1 p 1 , ξ 2j p 2 ), so we have γ( p) = γ(p). Then we have the following:

Lemma 7. Fix some p ∈ {±1} 2 such that (i, j, p) / ∈ P . For every l ∈ [k] such that w (t) l , p > 0 and g t (p) ∈ (-1, 1), the following holds:

-γ(p)v l ν j ∂L D (i) ∂w (t) l , p > √ 2 n i min{∆, 2β}

Proof. Observe the following:

∂L D (i) ∂w (t) l (P (B W (i) ,V (i) )) = E (x,y)∼ D (i)   (P (B W (i) ,V (i) )(x)) • ∂ ∂w (t) l 2 n i ni/2 j =1 g w (i,j ) ,v (i,j ) (x 2j -1 , x 2j )   = 2 n i E (x,y)∼ D (i) -y ∂ ∂w (t) l g t (x 2j-1 , x 2j ) = 2 n i E (x,y)∼ D (i) -yv l 1{g t (x 2j-1 , x 2j ) ∈ (-1, 1)} • 1{ w (t) l , (x 2j-1 , x 2j ) > 0} • (x 2j-1 , x 2j )

We use the fact that (P (B

W (i) ,V (i) )(x)) = -y, unless P (B W (i) ,V (i) )(x) ∈ {±1}, in which case g t (x 2j-1 , x 2j ) ∈ {±1}, so ∂ ∂w (t) l g t (x 2j-1 , x 2j ) = 0. Fix some p ∈ {±1} 2 such that w (t)

l , p > 0. Note that for every p = p ∈ {±1} 2 we have either p, p = 0, or p = -p in which case w (t) l , p < 0. Therefore, we get the following:

∂L D (i) ∂w (t) l , p = 2 n i E (x,y)∼ D (i) -yv l 1{g t (x 2j-1 , x 2j ) ∈ (-1, 1)} • 1{ w (t) l , (x 2j-1 , x 2j ) ≥ 0} • (x 2j-1 , x 2j ), p = 2 n i E (x,y)∼ D (i) [-yv l 1{g t (x 2j-1 , x 2j ) ∈ (-1, 1)} • 1{(x 2j-1 , x 2j ) = p} p ] Denote q p := P (x,y)∼D (i) [(x 2j-1 , x 2j ) = p|γ(x 2j-1 , x 2j ) = γ(p)].

Using property 2, we have:

P (x,y)∼D (i) [(x 2j-1 , x 2j ) = p, y = y ] = P (x,y)∼D (i) [(x 2j-1 , x 2j ) = p, y = y , γ(x 2j-1 , x 2j ) = γ(p)] = P (x,y)∼D (i) [(x 2j-1 , x 2j ) = p, y = y |γ(x 2j-1 , x 2j ) = γ(p)] P (x,y)∼D (i) [γ(x 2j-1 , x 2j ) = γ(p)] = q p P (x,y)∼D (i) [γ(x 2j-1 , x 2j ) = γ(p), y = y ] = q p P (z,y)∼D (i-1) [z j = γ(p), y = y ]

And therefore:

E (x,y)∼D (i) [y1{(x 2j-1 , x 2j ) = p}] = y ∈{±1} y P (x,y)∼D (i) [(x 2j-1 , x 2j ) = p, y = y ] = q p y ∈{±1} y P (z,y)∼D (i-1) [z j = γ(p), y = y ] = q p E (z,y)∼D (i-1) [y1{z j = γ(p)}]

Assuming g t (p) ∈ (-1, 1), using the above we get:

∂L D (i) ∂w (t) l , p = 2 √ 2v l n i E (x,y)∼ D (i) [-y1{(x 2j-1 , x 2j ) = p}] = 2 √ 2v l n i E (x,y)∼D (i) [-y1{(ξ 2j-1 x 2j-1 , ξ 2j x 2j ) = p}] = - 2 √ 2v l n i E (x,y)∼D (i) [y1{(x 2j-1 , x 2j ) = p}] = - 2 √ 2v l q p n i E (z,y)∼D (i-1) [y1{z j = γ(p)}]

Now, we have the following cases:

• If I i-1,j = 0, then by property 1 z j and y are independent, so:

∂L D (i) ∂w (t) l , p = - 2 √ 2v l q p n i E (z,y)∼D (i-1) [y1{z j = γ(p)}] = - 2 √ 2v l q p n i E (z,y)∼D (i-1) [y] P (z,y)∼D (i-1) [z j = γ(p)] = - 2 √ 2v l n i E (z,y)∼D (i-1) [y] P (z,y)∼D (i-1) [(x 2j-1 , x 2j ) = p]

Since we assume γ(p) = sign(E [y]), and using the fact that (i, j, p) / ∈ P , we get that:

-γ(p)v l ν j ∂L D (i) ∂w (t) l , p = -sign(E [y])v l ∂L D (i) ∂w (t) l , p = 2 √ 2 n i |E [y]| P (z,y)∼D (i-1) [(x 2j-1 , x 2j ) = p] > 2 √ 2 n i β

• Otherwise, observe that:

∂L D (i) ∂w (t) l , p = - 2 √ 2v l q p n i E (z,y)∼D (i-1) [y1{z j = γ(p)}] = - 2 √ 2v l q p n i E (z,y)∼D (i-1) y 1 2 (z j • γ(p) + 1) = - √ 2v l q p n i γ(p)c i-1,j + E (z,y)∼D (i-1) [y]

And therefore, using property 1, since I i-1,j = 0, we get:

-γ(p)v l sign(c i-1,j ) ∂L D (i) ∂w (t) l , p = √ 2q p n i (|c i-1,j | + sign(c i-1,j ) γ(p)E [y]) ≥ √ 2q p n i (|c i-1,j | -|E [y]|) > √ 2 n i ∆

where we use the fact that (i, j, p) / ∈ P .

We introduce the following notation: for a sample S ⊆ X × Y, and some function f : X → X , denote by f (S) the sample f (S) := {(f (x), y)} (x,y)∈S .

Lemma 8. Fix δ > 0. Assume we sample S ∼ D, with |S| > 128 2 min{∆,2β} 2 log 4 δ . Then, with probability at least 1 -δ, for every p ∈ {±1} 2 such that w (t) l , p > 0 it holds that:

∂L Ψ(D) ∂w (t) l , p - ∂L Ψ(S) ∂w (t) l , p ≤ 2 √ 2n i min{∆, 2β}

Proof. Fix some p ∈ {±1}2 with w (t) l , p > 0. Similar to what we previously showed, we get that:

∂L Ψ(S) ∂w (t) l , p = 2 n i E (x,y)∼Ψ(S) -yv l 1{g t (x 2j-1 , x 2j ) ∈ (-1, 1)} • 1{ w (t) l , (x 2j-1 , x 2j ) ≥ 0} • (x 2j-1 , x 2j ), p = 2 n i E (x,y)∼Ψ(S) [-yv l 1{g t (x 2j-1 , x 2j ) ∈ (-1, 1)} • 1{(x 2j-1 , x 2j ) = p} p ] = 2 √ 2 n i E (x,y)∼Ψ(S) [-yv l 1{g t (x 2j-1 , x 2j ) ∈ (-1, 1)} • 1{(x 2j-1 , x 2j ) = p}] Denote f (x, y) = -yv l 1{g t (x 2j-1 , x 2j ) ∈ (-1, 1)} • 1{(x 2j-1 , x 2j ) = p}, and notice that f (x, y) ∈ [-1, 1]

. Now, from Hoeffding's inequality we get that:

P S E Ψ(S) [f (x, y)] -E Ψ(D) [f (x, y)] ≥ τ ≤ exp - 1 2 |S|τ 2

So, for |S| > 2 τ 2 log 4 δ we get that with probability at least 1 -δ 4 we have:

∂L Ψ(D) ∂w (t) l , p - ∂L Ψ(S) ∂w (t) l , p = 2 √ 2 n i E Ψ(S) [f (x, y)] -E Ψ(D) [f (x, y)] < 2 √ 2 n i τ

Taking τ = 8 min{∆, 2β} and using the union bound over all p ∈ {±1} 2 completes the proof.

Lemma 9. Fix δ > 0. Assume P (x,y)∼D x ∈ X < 8 √ 2ni min{∆, 2β}. Assume we sample S ∼ D, with |S| > 128 2 min{∆,2β} 2 log 4

δ . Then, with probability at least 1 -δ, for every p ∈ {±1} 2 such that (i, j, p) / ∈ P , and for every l ∈ [k] such that w 

(P B (i) • Ψ(x)) • 1 x ∈ X ≤ E (x,y)∼D ψ • Γ (i+1)...d (x) (2j-1,2j) -Ψ(x) (2j-1,2j) • 1 x ∈ X ≤ 2 √ 2P (x,y)∼D x ∈ X = 2 √ 2α

So we get, using Lemma 7 and Lemma 8, with probability at least 1 -δ:

-γ(p)v l ν j ∂L Ψ(S) P (x,y)∼D (i) [γ i-1,j (x 2j-1 , x 2j ) = γ i-1,j (p)] > 0 Assume w.l.o.g. that j = 1. Denote by W the set of all possible choices for x 3 , . . . , x ni , such that when (x 1 , x 2 ) = p, the resulting label is y . Formally:

W := {(x 3 , . . . , x ni ) : Γ i...d (p 1 , p 2 , x 3 , . . . , x ni ) = y }

Then we get:

P D (i) [(x 1 , x 2 ) = p, y = y , γ i-1,j (x 1 , x 2 ) = γ i-1,j (p)] = P D (i) [(x 1 , x 2 ) = p, (x 3 , . . . , x ni ) ∈ W, γ i-1,j (x 1 , x 2 ) = γ i-1,j (p)] = P D (i) [(x 1 , x 2 ) = p, γ i-1,j (x 1 , x 2 ) = γ i-1,j (p)] • P D (i) [(x 3 , . . . , x ni ) ∈ W ] = P D (i) [(x 1 , x 2 ) = p|γ i-1,j (x 1 , x 2 ) = γ i-1,j (p)] • P D (i) [γ i-1,j (x 1 , x 2 ) = γ i-1,j (p), (x 3 , . . . , x ni ) ∈ W ] = P D (i) [(x 1 , x 2 ) = p|γ i-1,j (x 1 , x 2 ) = γ i-1,j (p)] • P D (i) [y = y , γ i-1,j (x 1 , x 2 ) = γ i-1,j (p)]

And dividing by P D (i) [γ i-1,j (x 1 , x 2 ) = γ i-1,j (p)] gives the required.

C PROOFS OF SECTION 5:

Proof. of Lemma 2.

For every gate (i, j), let J i,j be the subset of leaves in the binary tree whose root is the node (i, j). Namely, J i,j := {(j -1)2 d-i + 1, . . . , j2 d-i }. Then we show inductively that for an input x ∈ {±1} n , the (i, j) gate outputs: l∈I∩Ji,j x l :

• For i = d -1, this is immediate from the definition of the gate γ d-1,j .

• Assume the above is true for some i and we will show this for i -1. By definition of the circuit, the output of the (i -1, j) gate is a product of the output of its inputs from the previous layers, the gates (i, 2j -1), (i, 2j) . By the inductive assumption, we get that the output of the (i -1, j) gate is therefore:

  l∈Ji,2j-1∩I x l   •   l∈Ji,2j ∩I x l   =

l∈(Ji,j2-1∪Ji,2j )∩I

x l = l∈Ji-1,j

x l

From the above, the output of the target circuit is l∈J0,1∩I x l = l∈I x l , as required.

Proof. of Lemma 3.

By definition we have: Since we require I i,j = 0, then we cannot have Γ (i+1)...d (x) j ≡ 1. So, from what we showed previously, it follows that Γ (i+1)...d (x) j = j ∈I x j for some ∅ = I ⊆ I. Therefore, we get that:

c i,j = E (x,

c i,j = E D   j ∈I\I x j   = j ∈I\I E D [x j ] = j ∈I\I (2p j -1)

Furthermore, we have that:

E D [y] = E D   j ∈I x j   = j ∈I E D [x j ] = j ∈I (2p j -1)

:

i.e. every two adjacent neurons are only connected to one neuron in the upper layer.

Note that in the literature on Boolean circuits it is often assumed that the gates are limited to being AND/OR and NOT. We allow the gates to take any Boolean function, which makes this model somewhat stronger.

We chose to use the hard-tanh activation over the more popular tanh activation since it simplifies our theoretical analysis. However, we believe the same results can be given for the tanh activation.

√2n i min{∆, 2β} -4αSo for α < 8 √ 2ni min{∆, 2β} we get the required.

Formally, there is no gradient, but we'll just take the sub-gradient zero.

Figures and Tables:

Figure 1: Trainig ReLU networks with one hidden-layer of size 128 with Adam optimizer, on both instances of the k-Parity problem (k = 5, n = 128). The figure shows the accuracy on a test set.

Figure 2 details the results of the ImageNet experiment discussed in the introduction.

, p > 0 and g t (p) ∈ (-1, 1), the following holds:-γ(p)v l ν j ∂L ΨDenote α := P (x,y)∼D x ∈ X , and denote B (i) := B W (i) ,V (i) . Then, we have the following:(i) • ψ • Γ (i+1)...d (x)) -∂ ∂w (t) l (P B (i) • Ψ(x)) ≤ E (x,y)∼D ∂ ∂w (t) l (P B (i) • ψ • Γ (i+1)...d (x)) -∂ ∂w (t) l

y)∼D Γ (i+1)...d (x) j y = E (x,y)∼D Γ (i+1)...d (x) j y = E (x,y)∼D Γ (i+1)...d (x) j x 1 • • • x k

Proof. of Lemma 1. Fix some i ∈ [d], j ∈ [n i /2], p ∈ {±1} 2 , y ∈ {±1}, such that:

Table content: <table><tr><td>∂w</td><td>(t) l</td><td>, p = -γ(p)v l ν j</td><td>∂L D (i) ∂w (t) l</td><td>, p +</td><td>∂L Ψ(S) ∂w (t) l</td><td>, p -</td><td>∂L Ψ(D) ∂w (t) l</td><td>, p +</td><td>∂L Ψ(D) ∂w (t) l</td><td>, p -</td><td>∂L D (i) l ∂w (t)</td><td>, p</td></tr><tr><td/><td/><td colspan="3">≥ -γ(p)v l ν j &gt; √ 2 n i min{∆, 2β} -∂L D (i) ∂w (t) l , p -2 √ 2n i</td><td colspan="2">∂L Ψ(S) ∂w (t) l min{∆, 2β} -, p -</td><td colspan="3">∂L Ψ(D) ∂w (t) l ∂L D (i) , p -∂w (t) l -∂L Ψ(D) ∂L Ψ(D) ∂w (t) l l ∂w (t) p</td><td>, p -</td><td>∂L D (i) (t) ∂w l</td><td>, p</td></tr><tr><td/><td/><td>≥</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr></table>

Peer review (iclr2020):
Thank the authors for their rebuttal. It resolves all my previous concerns. ############################## This paper proposes to use neural networks for learning binary tree structured boolean circuits. For the boolean circuits problem, the authors notice two importance factors influencing why the target circuit is easy to learn or not. The two factors include *local correlation* and *label bias*. On the one hand, *local correlation* requires every influential node in the circuit have strong correlations with the target label, which makes the network trainable to exploit this correlation for minimizing losses. On the other hand, *label bias* requires that there are not the same amount of positive and negative examples. The paper proves that the proposed algorithm can faithfully learn the target circuit and presents multiple examples for the scenario of learning binary tree structured boolean circuits. Strengths, 1, This paper points out the two key factors *local correlation* and *label bias* for the learnability of a boolean circuit. Empirically in Figure1, they also validates the finding by demonstrating problems with balanced labels are more difficult to train. 2, The paper puts their theoretical findings to the setup of k-parity problem, proving that their proposed algorithm can faithfully tackle the k-parity problem. Weakness, 1, The main theorem proves that the target networks can be approximated using O(n^logn) examples. However, it it apparent that binary tree boolean circuits cannot represent all 2^n n-ary boolean functions. Actually, I GUESS all functions a binary tree can represent MIGHT also be in the scale of O(n^logn). Then the result is not surprising, as the training set probably covers all training examples. I think it is necessary that the authors give some estimates on the total number of representable functions and compare it with their |S|. 2, It is not clear to me why the the *label bias* is important for learning a boolean circuit. Could the authors clarify to me ? 3, It is also helpful to empirically compare the cases when there are local correlations and there aren*t. 4, Sec 5.1 shows that the proposed algorithm can solve the k-parity problem, however they assumed that all parity nodes locates together. In practice, these parity nodes might scatter everywhere, which could incur big problems for a binary-tree to approximate.