Original: Q UANTITATIVE P ERFORMANCE A SSESSMENT OF CNN U NITS VIA T OPOLOGICAL E NTROPY C ALCULATION
Revised: Q UANTITATIVE P ERFORMANCE A SSESSMENT OF CNN U NITS VIA T OPOLOGICAL E NTROPY C ALCULATION

Original: Anonymous authors

Original: Paper under double-blind review

Original: A BSTRACT
Revised: A BSTRACT

Original: Identifying the status of individual network units is critical for understanding the mechanism of convolutional neural networks (CNNs).
Revised: Identifying the status of individual network units is critical for understanding the mechanism of convolutional neural networks (CNNs).

Original: However, it is still challenging to reliably give a general indication of unit status, especially for units in different network models.
Revised: However, it is still challenging to reliably give a general indication of unit status, especially for units in different network models.

Original: To this end, we propose a novel method for quantitatively clarifying the status of single unit in CNN using algebraic topological tools.
Revised: To this end, we propose a novel method for quantitatively clarifying the status of single unit in CNN using algebraic topological tools.

Original: Unit status is indicated via the calculation of a deﬁned topological-based entropy, called feature entropy, which measures the degree of chaos of the global spatial pattern hidden in the unit for a category.
Revised: Unit status is indicated via the calculation of a deﬁned topological-based entropy, called feature entropy, which measures the degree of chaos of the global spatial pattern hidden in the unit for a category.

Original: In this way, feature entropy could provide an accurate indication of status for units in different networks with diverse situations like weight-rescaling operation.
Revised: In this way, feature entropy could provide an accurate indication of status for units in different networks with diverse situations like weight-rescaling operation.

Original: Further, we show that feature entropy decreases as the layer goes deeper and shares almost simultaneous trend with loss during training.
Revised: Further, we show that feature entropy decreases as the layer goes deeper and shares almost simultaneous trend with loss during training.

Original: We show that by investigating the feature entropy of units on only training data, it could give discrimination between networks with different generalization ability from the view of the effectiveness of feature representations.
Revised: We show that by investigating the feature entropy of units on only training data, it could give discrimination between networks with different generalization ability from the view of the effectiveness of feature representations.

Original:  I NTRODUCTION
Revised:  I NTRODUCTION

Original: Convolutional neural networks (CNNs) have achieved great success in various vision tasks Szegedy et al.
Revised: Convolutional neural networks (CNNs) have achieved great success in various vision tasks Szegedy et al.

Original: ; Redmon et al.
Revised: ; Redmon et al.

Original: ; He et al.
Revised: ; He et al.

Original: (2017a).
Revised: (2017a).

Original: The key to such success is the powerful ability of feature representations to input images, where network units 1 play a critical role.
Revised: The key to such success is the powerful ability of feature representations to input images, where network units 1 play a critical role.

Original: But impacted by the diverse training deployments and huge hypothesis space, networks even with the same architecture may converge to different minima on a given task.
Revised: But impacted by the diverse training deployments and huge hypothesis space, networks even with the same architecture may converge to different minima on a given task.

Original: Although units between these networks could present similar function for the same task, yet they may have completely different activation magnitudes.
Revised: Although units between these networks could present similar function for the same task, yet they may have completely different activation magnitudes.

Original: Consequently, this makes it fairly hard to give a general indication of the status for a given network unit with respect to how well features are represented by it from images in the same class.
Revised: Consequently, this makes it fairly hard to give a general indication of the status for a given network unit with respect to how well features are represented by it from images in the same class.

Original: Being rough indicators in practice, magnitude responses of units are usually chosen simply Zhang et al.
Revised: Being rough indicators in practice, magnitude responses of units are usually chosen simply Zhang et al.

Original: (2018) or processed statistically (such as average mean)
Revised: (2018) or processed statistically (such as average mean)

Original: Li et al.
Revised: Li et al.

Original: ; Luo et al.
Revised: ; Luo et al.

Original: based on the idea of matched ﬁltering.
Revised: based on the idea of matched ﬁltering.

Original: However, ﬁrstly these indicators are apparently sensitive to rescaling operations in magnitude.
Revised: However, ﬁrstly these indicators are apparently sensitive to rescaling operations in magnitude.

Original: If performing a simply rescaling operation to the weights such as the strategy introduced in Neyshabur et al. (2015), the results of the network and the function of each unit would all remain unchanged, but these indicators would vary along with the rescaling coefﬁcient.
Revised: If performing a simply rescaling operation to the weights such as the strategy introduced in Neyshabur et al. (2015), the results of the network and the function of each unit would all remain unchanged, but these indicators would vary along with the rescaling coefﬁcient.

Original: Secondly, as the spatial information in the unit is completely discarded, they could not give discrimination between units with and without random patterns, for example units separately outputted by a well-trained and random-initialized CNN ﬁlter.
Revised: Secondly, as the spatial information in the unit is completely discarded, they could not give discrimination between units with and without random patterns, for example units separately outputted by a well-trained and random-initialized CNN ﬁlter.

Original: Without a valid indication regarding the mentioned situations, these indicators fail to ensure the universal applicability for units in different network models.
Revised: Without a valid indication regarding the mentioned situations, these indicators fail to ensure the universal applicability for units in different network models.

Original: In this paper, we attempt to investigate the status of units from a new perspective.
Revised: In this paper, we attempt to investigate the status of units from a new perspective.

Original: Roughly speaking, natural images in the same class have common features, and meanwhile the locations of these features are spatially correlated in global.
Revised: Roughly speaking, natural images in the same class have common features, and meanwhile the locations of these features are spatially correlated in global.

Original: For effective units, features are picked out and representedby high activation values in the units.
Revised: For effective units, features are picked out and represented

Original: And due to the locality nature in feature extraction by convolution, this global spatial pattern between the common features would be preserved synchronously

Original: [Figure]
Revised: [Figure]

Revised: this

Revised: We topological- entropy indicate the unit status, giving reliable indication in various situations like rescaling the values.

Original:  of  of individual units
Revised: by high activation values in the units. And due to the locality nature in feature extraction by convolution, this global spatial pattern between the common features would be preserved synchronously in the counterpart representations in the effective units. In contrast, for ineffective units, being incapability of effectively representing these common features, representations would be in chaos and marks of this pattern is vague. This provides a valid road for performance assessment of individual units, and critically it is rescaling-invariant and universally applicable to any CNN architecture.

Original: The investigation of such pattern could naturally lead to topological approaches because knowledge of topological data analysis such as barcodes Ghrist (2008) provides valuable tools to resolve the intrinsic patterns in raw data.
Revised: The investigation of such pattern could naturally lead to topological approaches because knowledge of topological data analysis such as barcodes Ghrist (2008) provides valuable tools to resolve the intrinsic patterns in raw data.

Original: Along this line, ﬁrstly we introduce a method for characterizing the spatial pattern of feature representations in units for a single sample by incorporating with the topological tools, and then use information entropy to evaluate the stability of this spatial characterizations for various images sampled from the same class, where we call it feature entropy.
Revised: Along this line, ﬁrstly we introduce a method for characterizing the spatial pattern of feature representations in units for a single sample by incorporating with the topological tools, and then use information entropy to evaluate the stability of this spatial characterizations for various images sampled from the same class, where we call it feature entropy.

Original: In this way, a unit is judged to be effective if its feature entropy is high, otherwise ineffective.
Revised: In this way, a unit is judged to be effective if its feature entropy is high, otherwise ineffective.

Original: In our experiments, we ﬁnd that feature entropy would gradually decrease as the layer goes deeper and the evolution trends of feature entropy and losses are almost the same during network training.
Revised: In our experiments, we ﬁnd that feature entropy would gradually decrease as the layer goes deeper and the evolution trends of feature entropy and losses are almost the same during network training.

Original: We show that the feature entropy could provide reliable indication of unit status in situations like weight-rescaling and the emergence of random pattern.
Revised: We show that the feature entropy could provide reliable indication of unit status in situations like weight-rescaling and the emergence of random pattern.

Original: Finally, we show the value of feature entropy in giving discrimination between networks with different generalization ability by investigating only the training set.
Revised: Finally, we show the value of feature entropy in giving discrimination between networks with different generalization ability by investigating only the training set.

Original:  R ELATED W ORKS
Revised:  R ELATED W ORKS

Original: One line of research that attracts many researchers is seeking solutions in a way of visualizing what features have learned by the units Zeiler & Fergus (2014);
Revised: One line of research that attracts many researchers is seeking solutions in a way of visualizing what features have learned by the units Zeiler & Fergus (2014);

Original: Zhou et al.
Revised: Zhou et al.

Original: (2014); Mahendran & Vedaldi (2015);
Revised: (2014); Mahendran & Vedaldi (2015);

Original: Simonyan et al.
Revised: Simonyan et al.

Original: Status is generally identiﬁed depending on the degree of alignment between the visualized features and the human-visual concepts
Revised: Status is generally identiﬁed depending on the degree of alignment between the visualized features and the human-visual concepts

Original: Bau et al.
Revised: Bau et al.

Original: ; Zhou et al.
Revised: ; Zhou et al.

Original: (2018a);
Revised: (2018a);

Original: Bau et al.
Revised: Bau et al.

Original: On the one hand, they meanwhile give excellent visual interpretation of each unit; on the other hand, it hinders its universal application to arbitrary tasks and models in which units’ functionalities may be unrecognized to human Wang et al.
Revised: On the one hand, they meanwhile give excellent visual interpretation of each unit; on the other hand, it hinders its universal application to arbitrary tasks and models in which units’ functionalities may be unrecognized to human Wang et al.

Original: Another related research trace lies in the ﬁeld of network pruning, where they concentrate on using simple methods to roughly select less important units within a network.
Revised: Another related research trace lies in the ﬁeld of network pruning, where they concentrate on using simple methods to roughly select less important units within a network.

Original: Typical approaches include the L1-Norm of units Luo et al.
Revised: Typical approaches include the L1-Norm of units Luo et al.

Original: (2017), Average Percentage of Zeros (APoZ) in units
Revised: (2017), Average Percentage of Zeros (APoZ) in units

Original: Hu et al.
Revised: Hu et al.

Original: (2016), some sparse-based methods Li et al.
Revised: (2016), some sparse-based methods Li et al.

Original: ; Yoon & Hwang (2017), and so on.
Revised: ; Yoon & Hwang (2017), and so on.

Original: Despite commonly used in practice, since without a speciﬁc processing on units in diverse situations, they are unable to provide a general indication for units in different networks.
Revised: Despite commonly used in practice, since without a speciﬁc processing on units in diverse situations, they are unable to provide a general indication for units in different networks.

Original: Besides, Morcos et al.
Revised: Besides, Morcos et al.

Original: (2018) introduce the class selectivity from neuroscience to investigate the selectivity over classes for a speciﬁc unit, on the basis of calculating the mean units.
Revised: (2018) introduce the class selectivity from neuroscience to investigate the selectivity over classes for a speciﬁc unit, on the basis of calculating the mean units.

Original: Alain &
Revised: Alain &

Original: Bengio (2016) propose linear classiﬁer probe, where they report the degree of linear classiﬁcation of units in intermediate layers could somehow characterize the status of units.
Revised: Bengio (2016) propose linear classiﬁer probe, where they report the degree of linear classiﬁcation of units in intermediate layers could somehow characterize the status of units.

Original: Lastly, we would like to discuss some recent works related to topological approaches in deep learning.
Revised: Lastly, we would like to discuss some recent works related to topological approaches in deep learning.

Original: Naitzat et al.
Revised: Naitzat et al.

Original: (2020) demonstrates the superiority of using ReLu activation by studying the changes in Betti numbers of a two-class neural network.
Revised: (2020) demonstrates the superiority of using ReLu activation by studying the changes in Betti numbers of a two-class neural network.

Original: Mont´ufar et al.
Revised: Mont´ufar et al.

Original: (2020) use neural networks to predict the persistent homology features.
Revised: (2020) use neural networks to predict the persistent homology features.

Original: In Gabrielsson & Carlsson (2019), by using barcode, they show the topological structure changes during training which correlates to the generalization of networks.
Revised: In Gabrielsson & Carlsson (2019), by using barcode, they show the topological structure changes during training which correlates to the generalization of networks.

Original: Rieck et al.
Revised: Rieck et al.

Original: (2018) proposes neural persistence, a topological complexity measure of network structure that could give a criterion on early stopping.
Revised: (2018) proposes neural persistence, a topological complexity measure of network structure that could give a criterion on early stopping.

Original: Guss & Salakhutdinov (2018) empirically investigates the connection between neural network expressivity and the complexity of dataset in topology.
Revised: Guss & Salakhutdinov (2018) empirically investigates the connection between neural network expressivity and the complexity of dataset in topology.

Original: In Hofer et al.
Revised: In Hofer et al.

Original: (2017), topological signatures of data are evaluated and used to improve the classiﬁcation of shapes.
Revised: (2017), topological signatures of data are evaluated and used to improve the classiﬁcation of shapes.

Original:  M ETHOD
Revised:  M ETHOD

Original: In general, input images for a network model are commonly resized to be square for processing.
Revised: In general, input images for a network model are commonly resized to be square for processing.

Original: For input image sample I of a given class with size n × n to be represented by a unit U with size m × m via feature extraction processing f in CNN, we have,
Revised: For input image sample I of a given class with size n × n to be represented by a unit U with size m × m via feature extraction processing f in CNN, we have,

Original: [Equation]
Revised: [Equation]

Original: For image I , features are speciﬁcally arranged, where each feature has an associated spatial location in the image.
Revised: For image I , features are speciﬁcally arranged, where each feature has an associated spatial location in the image.

Original: After perceived by U , features are represented by high activation values at the corresponding locations in the unit.
Revised: After perceived by U , features are represented by high activation values at the corresponding locations in the unit.

Original: Basically, there are two steps in our assessment of unit performance: ﬁrstly, characterizing the spatial pattern hidden in these high activation values in a unit for a single image; secondly, evaluate the stability of this characterization when giving multiple image samples.
Revised: Basically, there are two steps in our assessment of unit performance: ﬁrstly, characterizing the spatial pattern hidden in these high activation values in a unit for a single image; secondly, evaluate the stability of this characterization when giving multiple image samples.

Original: 3. C HARACTERIZING THE SPATIAL PATTERN OF FEATURE REPRESENTATIONS IN A UNIT
Revised: 3. C HARACTERIZING THE SPATIAL PATTERN OF FEATURE REPRESENTATIONS IN A UNIT

Original: For U i,j with a grid structure, the location of an element generally refers to its coordinate index ( i, j ) .
Revised: For U i,j with a grid structure, the location of an element generally refers to its coordinate index ( i, j ) .

Original: And intuitively, the spatial pattern hidden in the elements denotes certain regular relationship among their coordinate indices.
Revised: And intuitively, the spatial pattern hidden in the elements denotes certain regular relationship among their coordinate indices.

Original: So, it is natural to model such relationship with graph structure and tackle it with topological tools in the following.
Revised: So, it is natural to model such relationship with graph structure and tackle it with topological tools in the following.

Original: Unit and graph We use the edge-weighted graphs Mehmet et al.
Revised: Unit and graph We use the edge-weighted graphs Mehmet et al.

Original: as our basic model and construct the weighted graph G
Revised: as our basic model and construct the weighted graph G

Original: =
Revised: =

Original: ( V, E ) from unit
Revised: ( V, E ) from unit

Original: U i,j , where V is the vertex set and E is the edge set.
Revised: U i,j , where V is the vertex set and E is the edge set.

Original: Deﬁne the adjacency matrix A of G as follows,
Revised: Deﬁne the adjacency matrix A of G as follows,

Original: [Equation]
Revised: [Equation]

Original: It should be noted that the individual element of A is the weight of edge in G , which conveys the intensity of corresponding point in the U .
Revised: It should be noted that the individual element of A is the weight of edge in G , which conveys the intensity of corresponding point in the U .

Original: A family of undirected graphs G ( v ) with adjacency matrices A ( v ) could be constructed by following the typical implementation of the sublevel set,
Revised: A family of undirected graphs G ( v ) with adjacency matrices A ( v ) could be constructed by following the typical implementation of the sublevel set,

Original: [Equation]
Revised: [Equation]

Original: where a ( v ) is the v th value in the descend ordering of elements of A and 1 ( · ) is indicator function.
Revised: where a ( v ) is the v th value in the descend ordering of elements of A and 1 ( · ) is indicator function.

Original: Here, we take the adjustment of A ( v ) =
Revised: Here, we take the adjustment of A ( v ) =

Original: max ( A ( v ) , ( A ( v ) ) T ) to ensure the adjacency matrices
Revised: max ( A ( v ) , ( A ( v ) ) T ) to ensure the adjacency matrices

Original: A ( v ) of undirected graphs to be symmetric.
Revised: A ( v ) of undirected graphs to be symmetric.

Original: So G ( v ) =
Revised: So G ( v ) =

Original: ( V ( v ) , E ( v ) ) is the subgraph of G where V ( v )
Revised: ( V ( v ) , E ( v ) ) is the subgraph of G where V ( v )

Original: =
Revised: =

Original: V and E ( v ) ⊂
Revised: V and E ( v ) ⊂

Original: E only includes the edges whose weights are greater than or equal to a ( v ) .
Revised: E only includes the edges whose weights are greater than or equal to a ( v ) .

Original: We have the following graph ﬁltration,
Revised: We have the following graph ﬁltration,

Original: [Equation]
Revised: [Equation]

Original: To be more speciﬁcally, in this sublevel set ﬁltration, it starts with the vertex set, then rank the edge weights from the maximum a max to minimum a min , and let the threshold parameters decrease from a max to a min .
Revised: To be more speciﬁcally, in this sublevel set ﬁltration, it starts with the vertex set, then rank the edge weights from the maximum a max to minimum a min , and let the threshold parameters decrease from a max to a min .

Original: At each step, we add the corresponding edges to obtain the threshold subgraph G ( v ) .
Revised: At each step, we add the corresponding edges to obtain the threshold subgraph G ( v ) .

Original: Fig.2 illustrates the construction of certain subgraph through a toy example.
Revised: Fig.2 illustrates the construction of certain subgraph through a toy example.

Original: Consider the unit U i,j .
Revised: Consider the unit U i,j .

Original: We circle the locations of the top 4 largest elements in U i,j (Fig.2A).
Revised: We circle the locations of the top 4 largest elements in U i,j (Fig.2A).

Original: Then the nonzero elements in adjacency matrix A (4) , { (1 , 2) , (4 , 3) , (2 , 4) , (3 , 1) } , is located (Fig.2B) and corresponding subgraph G (4) is constructed (Fig.2C).
Revised: Then the nonzero elements in adjacency matrix A (4) , { (1 , 2) , (4 , 3) , (2 , 4) , (3 , 1) } , is located (Fig.2B) and corresponding subgraph G (4) is constructed (Fig.2C).

Original: A 1 . 30 .3 .2 .
Revised: A 1 . 30 .3 .2 .

Original: 6 2 .
Revised: 6 2 .

Original:            unit 1th 2th 3th 4th adjacency matrix 4 column  4 row    (1,2) (2,4) (4,3) (3,1) clique 
Revised:            unit 1th 2th 3th 4th adjacency matrix 4 column  4 row    (1,2) (2,4) (4,3) (3,1) clique complex

Original: [Figure]
Revised: [Figure]

Revised: C

Original: [Figure]
Revised: [Figure]

Revised: undirect graph (4) {(1,2),(4,

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Revised: (4) (4) (4) ( , ) G

Original: V
Revised: V

Original: [Figure]
Revised: E  (4) 

Original: Complex ﬁltration To further reveal the correlation structure in the graphs, they are typically converted into certain kinds of topological objects, where topological invariants are calculated for capturing the high-level abstraction of correlation structure.
Revised: Complex ﬁltration To further reveal the correlation structure in the graphs, they are typically converted into certain kinds of topological objects, where topological invariants are calculated for capturing the high-level abstraction of correlation structure.

Original: Here, by following the common method in Horak et al.
Revised: Here, by following the common method in Horak et al.

Original: ; Giovanni et al.
Revised: ; Giovanni et al.

Original: (2013), each graph G ( v ) is converted to simplicial complex (also called clique complex) τ ( v ) , as shown in Fig.2D.
Revised: (2013), each graph G ( v ) is converted to simplicial complex (also called clique complex) τ ( v ) , as shown in Fig.2D.

Original: In this way, we have complex ﬁltration corresponding to graph ﬁltration (Eq.4).
Revised: In this way, we have complex ﬁltration corresponding to graph ﬁltration (Eq.4).

Original: [Equation]
Revised: [Equation]

Original: This ﬁltration describes the evolution of correlation structure in graph G along with the decreasing of threshold parameter.
Revised: This ﬁltration describes the evolution of correlation structure in graph G along with the decreasing of threshold parameter.

Original: Fig.3A shows the complex ﬁltration of the previous example (Fig.2).
Revised: Fig.3A shows the complex ﬁltration of the previous example (Fig.2).

Original: [Figure]
Revised: [Figure]

Original: Instance of complex ﬁltration (A) and Betti curve (B).

Original: So far, we have completed the characterization from unit to the topological objects.
Revised: So far, we have completed the characterization from unit to the topological objects.

Original: Other than our strategy, we also discuss other alternative method, which maps the unit to the cubical complex
Revised: Other than our strategy, we also discuss other alternative method, which maps the unit to the cubical complex

Original: Kaczynski et al.
Revised: Kaczynski et al.

Original: See Appendix for more details.
Revised: See Appendix for more details.

Original: Betti curve and its charaterization Next, k th Betti number Hatcher (2002) of each element in the complex ﬁltration could be calculated using the typical computational approach of persistent homology Ninna et al.
Revised: Betti curve and its charaterization Next, k th Betti number Hatcher (2002) of each element in the complex ﬁltration could be calculated using the typical computational approach of persistent homology Ninna et al.

Original: [Equation]
Revised: [Equation]

Original: Intuitively, k th Betti number β ( τ ( v ) ) could be regarded as the number of k -dimensional ’circle’s or ’hole’s or some higher order structures in complex τ ( v ) .
Revised: Intuitively, k th Betti number β ( τ ( v ) ) could be regarded as the number of k -dimensional ’circle’s or ’hole’s or some higher order structures in complex τ ( v ) .

Original: On the other hand, many meaningful patterns in the unit would lead to the ’circle’s or ’hole’s of complexes in the ﬁltration (Eq.5), see Fig.
Revised: On the other hand, many meaningful patterns in the unit would lead to the ’circle’s or ’hole’s of complexes in the ﬁltration (Eq.5), see Fig.

Original: for illustration.
Revised: for illustration.

Original: In particular, the number of ’hole’s is typically used as an important quantitative index for featuring such patterns.
Revised: In particular, the number of ’hole’s is typically used as an important quantitative index for featuring such patterns.

Original: Hence, the k th Betti numbers β ( τ ( v ) ) , v ∈ { 1 , · · · , n } could be arranged into so called k th Betti curves β
Revised: Hence, the k th Betti numbers β ( τ ( v ) ) , v ∈ { 1 , · · · , n } could be arranged into so called k th Betti curves β

Original: ( U , v, k ) for the unit U .
Revised: ( U , v, k ) for the unit U .

Original: Fig.3B shows the 1 th Betti curve of ﬁltration in Fig.3A.
Revised: Fig.3B shows the 1 th Betti curve of ﬁltration in Fig.3A.

Original: Once having obtained the Betti curve, one needs to interpret the Betti curve and extract its core characterization.
Revised: Once having obtained the Betti curve, one needs to interpret the Betti curve and extract its core characterization.

Original: Although there exists many choices of distance between two topological diagrams such as persistence images Adams et al.
Revised: Although there exists many choices of distance between two topological diagrams such as persistence images Adams et al.

Original: (2017), persistence landscape Bubenik et al.
Revised: (2017), persistence landscape Bubenik et al.

Original: and persistence entropyNinna et al.
Revised: and persistence entropyNinna et al.

Original: (2017), we ﬁnd that the simple birth time of the Betti curves β
Revised: (2017), we ﬁnd that the simple birth time of the Betti curves β

Original: ( U , v, k ) is sufﬁcient in this characterization,
Revised: ( U , v, k ) is sufﬁcient in this characterization,

Original: [Equation]
Revised: [Equation]

Original: We call b ( U , k ) the birth point.
Revised: We call b ( U , k ) the birth time.

Original: Birth point is the indication of the critical element in complex ﬁltration that begins to carry ”hole” structure (Betti number is nonzero).
Revised: Birth time is the indication of the critical element in complex ﬁltration that begins to carry ”hole” structure (Betti number is nonzero).

Original: It is an important sign that some essential change has occurred in complex ﬁltration, which implies the appearance of regularized spatial pattern of notable components in the unit.
Revised: It is an important sign that some essential change has occurred in complex ﬁltration, which implies the appearance of regularized spatial pattern of notable components in the unit.

Original: Meanwhile, in some cases, no spatial pattern appear in the components in the unit, so β ( U , v, k ) constantly equals to zero, meaning that birth point doesn’t exist.
Revised: Meanwhile, in some cases, no spatial pattern appear in the components in the unit, so β ( U , v, k ) constantly equals to zero, meaning that birth time doesn’t exist.

Original: In general, this would happen when the unit is unable to give representations for the image, where its values are almost all zeros.
Revised: In general, this would happen when the unit is unable to give representations for the image, where its values are almost all zeros.

Original: 3. A SSESSING THE UNIT PERFORMANCE USING FEATURE ENTROPY
Revised: 3. A SSESSING THE UNIT PERFORMANCE USING FEATURE ENTROPY

Original: For image samples in the same class C , an ideal unit U could perceive their common features.
Revised: For image samples in the same class C , an ideal unit U could perceive their common features.

Original: So, the spatial pattern of this unit should be similar between different image samples.
Revised: So, the spatial pattern of this unit should be similar between different image samples.

Original: In other words, the birth point obtained from each realization of units should be relatively close.
Revised: In other words, the birth time obtained from each realization of units should be relatively close.

Original: That is to say, the performance of good unit for certain target class should be stable over all the samples of this class.
Revised: That is to say, the performance of good unit for certain target class should be stable over all the samples of this class.

Original: It is the key idea for performance assessment of network unit.
Revised: It is the key idea for performance assessment of network unit.

Original: Birth distribution Essentially, birth point b C ( i, U , k ) is a random variable since sampling images from the speciﬁc class C could be regarded as statistical experiments.
Revised: Birth distribution Essentially, birth time b C ( i, U , k ) is a random variable since sampling images from the speciﬁc class C could be regarded as statistical experiments.

Original: In fact, the probability space (Ω , Σ , P ) could be constructed.
Revised: In fact, the probability space (Ω , Σ , P ) could be constructed.

Original: The elements in sample space Ω are the unit U resulted from the image samples in dataset of class C .
Revised: The elements in sample space Ω are the unit U resulted from the image samples in dataset of class C .

Original: Σ could be set as common discrete σ -ﬁeld and probability measure P is uniformly distributed on Ω .
Revised: Σ could be set as common discrete σ -ﬁeld and probability measure P is uniformly distributed on Ω .

Original: In other words, every image sample has an equal chance to be chosen as the input of network model.
Revised: In other words, every image sample has an equal chance to be chosen as the input of network model.

Original: Afterwards, b C ( i, U , k ) is deﬁned as a random variable on Ω (where the argument is i , and U and k are parameters),
Revised: Afterwards, b C ( i, U , k ) is deﬁned as a random variable on Ω (where the argument is i , and U and k are parameters),

Original: [Equation]
Revised: [Equation]

Original: with the probability distribution
Revised: with the probability distribution

Original: [Equation]
Revised: [Equation]

Original: where
Revised: where

Original: [Equation]
Revised: [Equation]

Original: Here the composite mapping b C ( i, U , k )( · ) from Ω to Z is composed of all the operation mentioned above, including construct weighted graphs, building complex ﬁltration, calculating Betti curve and extracting birth point.
Revised: Here the composite mapping b C ( i, U , k )( · ) from Ω to Z is composed of all the operation mentioned above, including construct weighted graphs, building complex ﬁltration, calculating Betti curve and extracting birth time.

Original: The degree of concentration of P C , U ,k ( x ) gives a direct view about the performance of unit U on class C , as illustrated in Fig.1.
Revised: The degree of concentration of P C , U ,k ( x ) gives a direct view about the performance of unit U on class C , as illustrated in Fig.1.

Original: More speciﬁcally, if the distribution presents close to a degeneratelike style, it means that the underlying common features of the class C could be stably perceived by the unit U .
Revised: More speciﬁcally, if the distribution presents close to a degeneratelike style, it means that the underlying common features of the class C could be stably perceived by the unit U .

Original: On the contrary, the distribution presents close to a uniform-like style when features are perceived almost blindly, indicating that unit U is invalid for C .
Revised: On the contrary, the distribution presents close to a uniform-like style when features are perceived almost blindly, indicating that unit U is invalid for C .

Original: In summary, the degree of concentration of P C, U ,k ( x ) is supposed to be an effective indicator of the performance of unit U .
Revised: In summary, the degree of concentration of P C, U ,k ( x ) is supposed to be an effective indicator of the performance of unit U .

Original: Feature entropy To further quantize the degree of concentration of birth distribution P C , U ,k ( x ) , we introduce its entropy H C , U ,k and call it feature entropy,
Revised: Feature entropy To further quantize the degree of concentration of birth distribution P C , U ,k ( x ) , we introduce its entropy H C , U ,k and call it feature entropy,

Original: [Equation]
Revised: [Equation]

Original: It should be noted that the birth point in Eq.7 may not exist for some input images in class C and unit U .
Revised: It should be noted that the birth time in Eq.7 may not exist for some input images in class C and unit U .

Original: For unit U , the percentage of images in class C having birth points, termed as selective rate (cid:15) C , U , is also a crucial factor to the effectiveness of U on C .
Revised: For unit U , the percentage of images in class C having birth times, termed as selective rate (cid:15) C , U , is also a crucial factor to the effectiveness of U on C .

Original: If the (cid:15) C , U is too low, it indicates that the unit could not perceive most of the image samples in this class.
Revised: If the (cid:15) C , U is too low, it indicates that the unit could not perceive most of the image samples in this class.

Original: In this situation, extremely low (cid:15) C , U would cause the feature entropy approach to zero, but the unit should be judged as completely invalid.
Revised: In this situation, extremely low (cid:15) C , U would cause the feature entropy approach to zero, but the unit should be judged as completely invalid.

Original: Therefore, we rule out this extreme case by setting a threshold p and for completeness, and assign the feature entropy associated with the maximum of feature entropy  for the set of samples,
Revised: Therefore, we rule out this extreme case by setting a threshold p and for completeness, and assign the feature entropy associated with the maximum of feature entropy Ω for the set of samples,

Original: [Equation]
Revised: [Equation]

Original: Here, p is prescribed as 0.1 in our computation.
Revised: Here, p is prescribed as 0.1 in our computation.

Original:  E XPERIMENTS
Revised:  E XPERIMENTS

Original: For experiments, we use the VGG16 network architecture to perform the image classiﬁcation task on the ImageNet dataset.
Revised: For experiments, we use the VGG16 network architecture to perform the image classiﬁcation task on the ImageNet dataset.

Original: Unless otherwise stated, the exampled VGG16 model is trained from scratch with the hyperparameters deployed in Simonyan & Zisserman (2014).
Revised: Unless otherwise stated, the exampled VGG16 model is trained from scratch with the hyperparameters deployed in Simonyan & Zisserman (2014).

Original: For clarity, we only calculate birth points b C ( i, U, 1) based on 1th betti curve for all the units.
Revised: For clarity, we only calculate birth times b C ( i, U, 1) based on 1th betti curve for all the units.

Original: Also, it should be noted that our method focuses on the behaviors of feature extraction operations and has not utilized any kind of particular nature of VGG network architecture, and all our investigation could be applicable to other network architectures effortlessly.
Revised: Also, it should be noted that our method focuses on the behaviors of feature extraction operations and has not utilized any kind of particular nature of VGG network architecture, and all our investigation could be applicable to other network architectures effortlessly.

Original: 4. C ALCULATION
Revised: 4. C ALCULATION

Original: [Figure]
Revised: [Figure]

Original: LOW

Original: [Figure] As an example, the class partridge (wnid n01807496) in ImageNet is chosen for illustration.
Revised: As an example, the class partridge (wnid n01807496) in ImageNet is chosen for illustration.

Original: Here, we sample 100 images from its training set as the image set for building the birth distribution.
Revised: Here, we sample 100 images from its training set as the image set for building the birth distribution.

Original: Fig.4 shows the calculation ﬂow.
Revised: Fig.4 shows the calculation ﬂow.

Original: It starts from extracting all the units for each image sample.
Revised: It starts from extracting all the units for each image sample.

Original: By characterizing the unit with graph model, each unit corresponds to a speciﬁc ﬁltration.
Revised: By characterizing the unit with graph model, each unit corresponds to a speciﬁc ﬁltration.

Original: Then, using formular 7, we can obtain the birth point of each unit.
Revised: Then, using formular 7, we can obtain the birth time of each unit.

Original: In this way, the distribution of birth point could be set up via Eq.9 over the sampled images.
Revised: In this way, the distribution of birth time could be set up via Eq.9 over the sampled images.

Original: Fig.4 shows the histogram of the birth point distribution for a speciﬁc unit in the the last convolution layer ”block5 conv3”.
Revised: Fig.4 shows the histogram of the birth time distribution for a speciﬁc unit in the the last convolution layer ”block5 conv3”.

Original: Likewise, the feature entropy can be calculated via Eq.11 for all other units.
Revised: Likewise, the feature entropy can be calculated via Eq.11 for all other units.

Original: 4. L AYER AND T RAINING A NALYSIS
Revised: 4. L AYER AND T RAINING A NALYSIS

Original: Layer analysis Here, we check the status of units in each convolutional layer, where we average the feature entropy across all the units within the layer to indicate the overall status of units in this layer.
Revised: Layer analysis Here, we check the status of units in each convolutional layer, where we average the feature entropy across all the units within the layer to indicate the overall status of units in this layer.

Original: Using the same image set in the previous section, Fig.5A(1-2) give comparisons of results between the convergence model and the random-initialized model.
Revised: Using the same image set in the previous section, Fig.5A(1-2) give comparisons of results between the convergence model and the random-initialized model.

Original: In Fig.5A(1), we could clearly see that for the convergence model, the feature entropy continually decrease as the layers go deeper.
Revised: In Fig.5A(1), we could clearly see that for the convergence model, the feature entropy continually decrease as the layers go deeper.

Original: This is as expected because as the layer goes deeper, units are considered to perceive more advanced features than previous layers, so the spatial pattern in these features would be more signiﬁcant.
Revised: This is as expected because as the layer goes deeper, units are considered to perceive more advanced features than previous layers, so the spatial pattern in these features would be more signiﬁcant.

Original: As for the random-initialized model, since units are incapable to perceive the common features, we could not observe a clear decrease of feature entropy, and meanwhile the feature entropy in every layer is higher than that in the convergence model.
Revised: As for the random-initialized model, since units are incapable to perceive the common features, we could not observe a clear decrease of feature entropy, and meanwhile the feature entropy in every layer is higher than that in the convergence model.

Original: In Fig.5A(2), we could also ﬁnd that each layer in the convergence model would present a higher selective rate than the corresponding layer in the random-initialized model, except for the last convolutional layer ”block5 conv3”.
Revised: In Fig.5A(2), we could also ﬁnd that each layer in the convergence model would present a higher selective rate than the corresponding layer in the random-initialized model, except for the last convolutional layer ”block5 conv3”.

Original: Also, the selective rate of the last convolutional layer is much more lower than other layers.
Revised: Also, the selective rate of the last convolutional layer is much more lower than other layers.

Original: The low feature entropy and fairly high selective rate indicate that comparing to units in other layers, units at the last convolutional layer in the convergence model would present strong specialization and exhibit the most effective representations of features to this class.
Revised: The low feature entropy and fairly high selective rate indicate that comparing to units in other layers, units at the last convolutional layer in the convergence model would present strong specialization and exhibit the most effective representations of features to this class.

Original: Then, we randomly choose 100 classes in ImageNet and average the feature entropy across all these classes on the convergence model.
Revised: Then, we randomly choose 100 classes in ImageNet and average the feature entropy across all these classes on the convergence model.

Original: Fig.5A(3) shows the results.
Revised: Fig.5A(3) shows the results.

Original: We could see that the results are very similar to Fig.5A(1-2), which conﬁrms the fact further.
Revised: We could see that the results are very similar to Fig.5A(1-2), which conﬁrms the fact further.

Original: [Table]
Revised: [Table]

Original: a i n i ng l o ss epoch training loss training accuracy 0.
Revised: i n i ng l o ss epoch training loss training accuracy 0.

Original: 1.0 A     2.
Revised: 1.0 A     2.

Original: f ea t u r e en t r op y epoch 0.
Revised: f ea t u r e en t r op y epoch 0.

Original: s e
Revised: s e

Original: l e c
Revised: l e c

Original: t
Revised: t

Original: i v e r a t e     2.
Revised: i v e r a t e     2.

Original: f ea t u r e en t r op y epoch 0.
Revised: f ea t u r e en t r op y epoch 0.

Original: s e
Revised: s e

Original: l e c
Revised: l e c

Original: t
Revised: t

Original: i v e r a t e (1) (2) (3) (1) (2) (3) (4)
Revised: i v e r a t e (1) (2) (3) (1) (2) (3) (4)

Original: Training analysis
Revised: Training analysis

Original: Then, we investigate the variation of feature entropy of the last convolutional layer during training.
Revised: Then, we investigate the variation of feature entropy of the last convolutional layer during training.

Original: Fig.5B(1-2) show the results on the same example class used previously, and
Revised: Fig.5B(1-2) show the results on the same example class used previously, and

Original: Fig.5B(3-4) show the results across 100 classes chosen previously.
Revised: Fig.5B(3-4) show the results across 100 classes chosen previously.

Original: In both situations, we could ﬁnd that the feature entropy would decrease during training, indicating that units are gradually learned to be able to perceive the common features in the class.
Revised: In both situations, we could ﬁnd that the feature entropy would decrease during training, indicating that units are gradually learned to be able to perceive the common features in the class.

Original: And remarkably, the decreasing pattern of feature entropy and that of training cross-entropy loss coincide approximately.
Revised: And remarkably, the decreasing pattern of feature entropy and that of training cross-entropy loss coincide approximately.

Original: Both of them experience a comparable big drop in the ﬁrst epoch and gradually down to the convergence level.
Revised: Both of them experience a comparable big drop in the ﬁrst epoch and gradually down to the convergence level.

Original: This means that feature entropy is a valid indicator of network performance.
Revised: This means that feature entropy is a valid indicator of network performance.

Original: 4. I NDICATOR OF STATUS OF NETWORK UNIT
Revised: 4. I NDICATOR OF STATUS OF NETWORK UNIT

Original: To investigate the ability of feature entropy as indicator of unit status, we make comparisons with some commonly-used analogous network indicators including L1-norm Li et al.
Revised: To investigate the ability of feature entropy as indicator of unit status, we make comparisons with some commonly-used analogous network indicators including L1-norm Li et al.

Original: , APoZ He et al. (2017b), and a more generalized form of class selectivity used in Zhou et al. (2018b).
Revised: , APoZ He et al. (2017b), and a more generalized form of class selectivity used in Zhou et al. (2018b).

Original: Here, the unit and the image set in the previous subsection are still used in the following demonstration.
Revised: Here, the unit and the image set in the previous subsection are still used in the following demonstration.

Original: Rescaling investigation The comparison is implemented by rescaling the magnitude of values to half for all the input images or all the CNN ﬁlters connecting to the layer.
Revised: Rescaling investigation The comparison is implemented by rescaling the magnitude of values to half for all the input images or all the CNN ﬁlters connecting to the layer.

Original: Both the two implementations could potentially cause the values in units within the layer vary with the same scale, but in general have no substantial impact on the network performance and the function of each unit.
Revised: Both the two implementations could potentially cause the values in units within the layer vary with the same scale, but in general have no substantial impact on the network performance and the function of each unit.

Original: In other words, units should be indicated as almost the same with or without such implementation
Revised: In other words, units should be indicated as almost the same with or without such implementation

Original: [Table] [Table]
Revised: [Table] [Table]

Original: Table 1 shows the results where (cid:53) denotes no rescaling operation for the item.
Revised: Table 1 shows the results where (cid:53) denotes no rescaling operation for the item.

Original: As half scaling the magnitude in input images or units, the performance of the model ﬂuctuates slightly.
Revised: As half scaling the magnitude in input images or units, the performance of the model ﬂuctuates slightly.

Original: We could ﬁnd that APoZ and feature entropy vary in the similar way with the performance [Table] but L1-norm and class selectivity vary terribly.
Revised: We could ﬁnd that APoZ and feature entropy vary in the similar way with the performance, but L1-norm and class selectivity vary terribly.

Original: Apparently, despite little effect for the network, rescaling operations would have a major impact on these magnitude-based indicators, like L1-norm and class selectivity.
Revised: Apparently, despite little effect for the network, rescaling operations would have a major impact on these magnitude-based indicators, like L1-norm and class selectivity.

Original: These indicators fail to give accurate and stable measure of unit status especially when facing images units with different value scales
Revised: These indicators fail to give accurate and stable measure of unit status especially when facing images units with different value scales

Original: [Table]
Revised: [Table]

Original: Detecting randomness in units Next, we compare the status of this unit with random units (units yielded by random-initialized models).
Revised: Detecting randomness in units Next, we compare the status of this unit with random units (units yielded by random-initialized models).

Original: Table 2 presents the results.
Revised: Table 2 presents the results.

Original: The random units are sampled 100 times and the presented results are averaged over the 100 samples where the value in the brackets denotes the standard deviation.
Revised: The random units are sampled 100 times and the presented results are averaged over the 100 samples where the value in the brackets denotes the standard deviation.

Original: Since random units are clearly incapable to perceive features well like those trained units, they are expected to be indicated as ineffective units.
Revised: Since random units are clearly incapable to perceive features well like those trained units, they are expected to be indicated as ineffective units.

Original: We could see that when using L1-norm and APoZ indicators, they are impossible to give a stable indication as the standard deviation is extremely large.
Revised: We could see that when using L1-norm and APoZ indicators, they are impossible to give a stable indication as the standard deviation is extremely large.

Original: In some samples, the random units are judged as much ”better” than the trained units, which is obviously incorrect.
Revised: In some samples, the random units are judged as much ”better” than the trained units, which is obviously incorrect.

Original: Accordingly, it could be also misleading using APoZ as the indicator of unit status.
Revised: Accordingly, it could be also misleading using APoZ as the indicator of unit status.

Original: In contrast, the feature entropy would consistently be very high when random pattern exists in the unit, providing a well discrimination between trained units and random ones.
Revised: In contrast, the feature entropy would consistently be very high when random pattern exists in the unit, providing a well discrimination between trained units and random ones.

Original: 4. U SING FEATURE ENTROPY TO INDICATE NETWORKS WITH DIFFERENT GENERALIZATION
Revised: 4. U SING FEATURE ENTROPY TO INDICATE NETWORKS WITH DIFFERENT GENERALIZATION

Original: In general, due to the large hypothesis space, CNNs could converge to a variety of minima on the dataset.
Revised: In general, due to the large hypothesis space, CNNs could converge to a variety of minima on the dataset.

Original: Since feature entropy could reliably indicate the status of network units, it is natural to use it to discriminate which minima could provide more effective feature representations.
Revised: Since feature entropy could reliably indicate the status of network units, it is natural to use it to discriminate which minima could provide more effective feature representations.

Original: Models In this subsection, we prepare two sets of VGG16 models.
Revised: Models In this subsection, we prepare two sets of VGG16 models.

Original: Model set A consists of four models trained from scratch with different hyperparameters on ImageNet dataset, and Model set B consists of ﬁve models trained from scratch to almost zero training error with the same hyperparameters but on ImageNet dataset with different fractions of randomly corrupted labels as introduced in
Revised: Model set A consists of four models trained from scratch with different hyperparameters on ImageNet dataset, and Model set B consists of ﬁve models trained from scratch to almost zero training error with the same hyperparameters but on ImageNet dataset with different fractions of randomly corrupted labels as introduced in

Original: Zhang et al.
Revised: Zhang et al.

Original: Table 3 and 4 separately show the performance of models in the two model sets.
Revised: Table 3 and 4 separately show the performance of models in the two model sets.

Original: In model set B, we use Model AD in Model set A as the ﬁrst model Model BA with no corruption rate.
Revised: In model set B, we use Model AD in Model set A as the ﬁrst model Model BA with no corruption rate.

Original: Besides, it should be noted that all the calculation in this section is based on the image sampled from the training dataset.
Revised: Besides, it should be noted that all the calculation in this section is based on the image sampled from the training dataset.

Original: [Table] [Table]
Revised: [Table] [Table]

Original: Model set A Using the same image set in previous section, we start by investigating the feature entropy of units at different layers in the four models.
Revised: Model set A Using the same image set in previous section, we start by investigating the feature entropy of units at different layers in the four models.

Original: Here, we still use the averaged feature entropy across all the units within a layer to indicate the overall level of how well the units in this layer could perceive the features.
Revised: Here, we still use the averaged feature entropy across all the units within a layer to indicate the overall level of how well the units in this layer could perceive the features.

Original: Fig.6A(1-2) shows the results of this class.
Revised: Fig.6A(1-2) shows the results of this class.

Original: We could see in the ﬁgure that there would not be signiﬁcant difference of feature entropy between these models in layers except for the last convolutional layer.
Revised: We could see in the ﬁgure that there would not be signiﬁcant difference of feature entropy between these models in layers except for the last convolutional layer.

Original: And in the last convolutional layer, for models with better generalization, their feature entropy would be lower than those with poor generalization, indicating that they would provide more effective feature representations.
Revised: And in the last convolutional layer, for models with better generalization, their feature entropy would be lower than those with poor generalization, indicating that they would provide more effective feature representations.

Original: Besides, as for the selective rate, the four models are quite close.
Revised: Besides, as for the selective rate, the four models are quite close.

Original: Then, we randomly choose 100 classes in the ImageNet dataset and calculate the feature entropy of the units in the last convolutional layer.
Revised: Then, we randomly choose 100 classes in the ImageNet dataset and calculate the feature entropy of the units in the last convolutional layer.

Original: Fig.6A(3) presents the scatter plot for the four models, where each point stands for the feature entropy and selective rate of a speciﬁc class.
Revised: Fig.6A(3) presents the scatter plot for the four models, where each point stands for the feature entropy and selective rate of a speciﬁc class.

Original: For each model, its points locate at an area separately from other models, giving a discrimination between models.
Revised: For each model, its points locate at an area separately from other models, giving a discrimination between models.

Original: Also similarly, models with better generalization have points with lower feature entropy.
Revised: Also similarly, models with better generalization have points with lower feature entropy.

Original: [Figure]
Revised: [Figure]

Original: 3) c on v 3_1 c on v 3_2 c on v 3_3 c on v 4_1 c on v 4_2 c on v 4_3 c on v 5_1 c on v 5_2 c on v 5_3 2.
Revised: ) c on v 3_1 c on v 3_2 c on v 3_3 c on v 4_1 c on v 4_2 c on v 4_3 c on v 5_1 c on v 5_2 c on v 5_3 2.

Revised: [Figure]

Original: f ea t ur e
Revised: ea t u

Original: [Figure]
Revised: [Figure]

Original:  Model set B For model set B, we use the same implementation as applied previously in the model set A, where the results are shown in Fig.6B. Comparing to the Model set A, since using the partially corrupted labels, units in the Model Set B are unable to perceive the common features between samples in the same class, which causes that the selective rate of most units are extremely low as shown in Fig.6B(2).
Revised: e [Figure] Model set B For model set B, we use the same implementation as applied previously in the model set A, where the results are shown in Fig.6B. Comparing to the Model set A, since using the partially corrupted labels, units in the Model Set B are unable to perceive the common features between samples in the same class, which causes that the selective rate of most units are extremely low as shown in Fig.6B(2).

Original: Due to such low selective rate, we could also ﬁnd in Fig.6B(1) that feature entropy of the units in the last convolutional layer may abruptly reach to a very high point.
Revised: Due to such low selective rate, we could also ﬁnd in Fig.6B(1) that feature entropy of the units in the last convolutional layer may abruptly reach to a very high point.

Original: The more fraction the labels are corrupted, the higher feature entropy the units are and in the meantime the lower the selective rate the units are.
Revised: The more fraction the labels are corrupted, the higher feature entropy the units are and in the meantime the lower the selective rate the units are.

Original: This could be observed as well in Fig.6B(3) where theclasses are used for calculation.
Revised: This could be observed as well in Fig.6B(3) where theclasses are used for calculation.

Original:  C ONCLUSION
Revised:  C ONCLUSION

Original: We propose a novel method that could give quantitative identiﬁcation of individual unit status, called feature entropy, for a speciﬁc class using algebraic topological tools.
Revised: We propose a novel method that could give quantitative identiﬁcation of individual unit status, called feature entropy, for a speciﬁc class using algebraic topological tools.

Original: We show that feature entropy is a reliable indicator of unit status that could well cope with various cases such as rescaling values or existence of randomness.
Revised: We show that feature entropy is a reliable indicator of unit status that could well cope with various cases such as rescaling values or existence of randomness.

Original: Also we show that feature entropy behaves in the similar way as loss during the training stage and presents a descending trend as convolutional layers go deeper.
Revised: Also we show that feature entropy behaves in the similar way as loss during the training stage and presents a descending trend as convolutional layers go deeper.

Original: Using feature entropy, we show that CNNs with different generalization could be discriminated by the effectiveness of feature representations of the units in the last convolutional layer.
Revised: Using feature entropy, we show that CNNs with different generalization could be discriminated by the effectiveness of feature representations of the units in the last convolutional layer.

Original: We suppose this would be helpful for further understanding the mechanism of convolutional neural networks
Revised: We suppose this would be helpful for further understanding the mechanism of convolutional neural networks.

Revised: A CKNOWLEDGMENTS

Revised: We would like to thank Brain-Inspired Research Team at Tsinghua University for the discussions.

Revised: We would like to thank the reviewers for their helpful comments.

Original: A A PPENDIX A. I MPLEMENTATION D ETAILS OF M ODELS
Revised: A A PPENDIX A. I MPLEMENTATION D ETAILS OF M ODELS

Original: In our experiments the networks we used are the standard VGG16 architecture.
Revised: In our experiments the networks we used are the standard VGG16 architecture.

Original: We simply resize all the mentioned sample images to 224 × 224 without implementing any data augment (like random crop) during all the experiments (including the feature entropy calculation and the reported performance).
Revised: We simply resize all the mentioned sample images to 224 × 224 without implementing any data augment (like random crop) during all the experiments (including the feature entropy calculation and the reported performance).

Original: The model used for demonstration in the experiment section (besides the last subsection) is
Revised: The model used for demonstration in the experiment section (besides the last subsection) is

Original: Model AA in model set A.
Revised: Model AA in model set A.

Original: For model set A, we use the following implementations,
Revised: For model set A, we use the following implementations,

Original: • Model AA.
Revised: • Model AA.

Original: The hyper-parameters are the same with them in the paper Simonyan & Zisserman (2014).
Revised: The hyper-parameters are the same with them in the paper Simonyan & Zisserman (2014).

Original: • Model AB.
Revised: • Model AB.

Original: The hyper-parameters are the same with them in Model AA, except for changing the momentum to 0 and without using the data augmentation strategy.
Revised: The hyper-parameters are the same with them in Model AA, except for changing the momentum to 0 and without using the data augmentation strategy.

Original: • Model AC.
Revised: • Model AC.

Original: The hyper-parameters are the same with them in Model AB, except for that only the ﬁrst fully connected layer use the dropout with the rate of 0.3.
Revised: The hyper-parameters are the same with them in Model AB, except for that only the ﬁrst fully connected layer use the dropout with the rate of 0.3.

Original: • Model AD.
Revised: • Model AD.

Original: None of the conventional training enhancement technique is applied.
Revised: None of the conventional training enhancement technique is applied.

Original: Basically, It is Model AC without using dropout and l2 regularization.
Revised: Basically, It is Model AC without using dropout and l2 regularization.

Original: For model set B, we use the following implementations,
Revised: For model set B, we use the following implementations,

Original: • Model BA.
Revised: • Model BA.

Original: It is actually the Model AD.
Revised: It is actually the Model AD.

Original: • Model BB.
Revised: • Model BB.

Original: The hyper-parameters are the same with them in Model BA, except for corrupting the labels with 0.2 fraction.
Revised: The hyper-parameters are the same with them in Model BA, except for corrupting the labels with 0.2 fraction.

Original: • Model BC.
Revised: • Model BC.

Original: The hyper-parameters are the same with them in Model BA, except for corrupting the labels with 0.4 fraction.
Revised: The hyper-parameters are the same with them in Model BA, except for corrupting the labels with 0.4 fraction.

Original: • Model BD.
Revised: • Model BD.

Original: The hyper-parameters are the same with them in Model BA, except for corrupting the labels with 0.6 fraction.
Revised: The hyper-parameters are the same with them in Model BA, except for corrupting the labels with 0.6 fraction.

Original: • Model BE.
Revised: • Model BE.

Original: The hyper-parameters are the same with them in Model BA, except for corrupting the labels with 0.8 fraction.
Revised: The hyper-parameters are the same with them in Model BA, except for corrupting the labels with 0.8 fraction.

Original: A. S PATIAL C HARACTERIZATION USING C UBICAL C OMPLEX
Revised: A. S PATIAL C HARACTERIZATION USING C UBICAL C OMPLEX

Original: In our method, a unit is ﬁrstly convert to a set of graphs and then each graph could be converted to the corresponding clique complex.
Revised: In our method, a unit is ﬁrstly convert to a set of graphs and then each graph could be converted to the corresponding clique complex.

Original: In this way, a unit is characterized by the ﬁltration of clique complexes.
Revised: In this way, a unit is characterized by the ﬁltration of clique complexes.

Original: Alternatively, the unit could be directly modeled as a cubical complex Kaczynski et al.
Revised: Alternatively, the unit could be directly modeled as a cubical complex Kaczynski et al.

Original: (2004), and then use the similar sublevel set implementation to acquire the ﬁltration of cubical complexes.
Revised: (2004), and then use the similar sublevel set implementation to acquire the ﬁltration of cubical complexes.

Original: So here, we use cubical complex instead of clique complex and meanwhile keep the rest of the methods unchanged.
Revised: So here, we use cubical complex instead of clique complex and meanwhile keep the rest of the methods unchanged.

Original: By investigating the birth distribution on the classes in the Imagenet with Model AA, we found that for every unit especially at relatively deeper layers, almost 95% images would have no birth point.
Revised: By investigating the birth distribution on the classes in the Imagenet with Model AA, we found that for every unit especially at relatively deeper layers, almost 95% images would have no birth time.

Original: In other words, no persistence homology emerges for almost all the units when using cubical complex.
Revised: In other words, no persistence homology emerges for almost all the units when using cubical complex.

Original: Thus, it is impossible to give a further calculation of the stability for images in the same class.
Revised: Thus, it is impossible to give a further calculation of the stability for images in the same class.

Original: A. D ISCUSSIONS OF USING B IRTH P OINT
Revised: A. D ISCUSSIONS OF USING B IRTH T IME

Original: When characterizing the ﬁltration of topological complexes, we use the birth time of the ﬁltration.
Revised: When characterizing the ﬁltration of topological complexes, we use the birth time of the ﬁltration.

Original: Comparing to some other characterizations, we suppose that the advantages of using birth point may lie in,
Revised: Comparing to some other characterizations, we suppose that the advantages of using birth time may lie in,

Original: • Birth point is very easy to compute.
Revised: • Birth time is very easy to compute.

Original: In practice, when using birth point, it is not necessary to go through the whole ﬁltration process, where we could stop the calculation when the birth point emerges.
Revised: In practice, when using birth time, it is not necessary to go through the whole ﬁltration process, where we could stop the calculation when the birth time emerges.

Original: In this way, we could largely save the computation especially when the size of units is very high.
Revised: In this way, we could largely save the computation especially when the size of units is very high.

Original: This could be very helpful for calculating the large amount of units in neural networks.
Revised: This could be very helpful for calculating the large amount of units in neural networks.

Original: • Birth point is very convenient for the investigation of stability between samples because it is an integer essentially.
Revised: • Birth time is very convenient for the investigation of stability between samples because it is an integer essentially.

Original: So, the discrete distribution could be set up effortlessly.
Revised: So, the discrete distribution could be set up effortlessly.

Original: Besides, when using entropy to investigate the stability of birth points, the results are bounded strictly in the range from 0 to log N .
Revised: Besides, when using entropy to investigate the stability of birth times, the results are bounded strictly in the range from 0 to log N .

Original: • Birth point is suitable for the idea.
Revised: • Birth time is suitable for the idea.

Original: Since the signiﬁcant features are generally represented by the high activation values in the units, it is more expected that the regularized pattern could be formed by these values.
Revised: Since the signiﬁcant features are generally represented by the high activation values in the units, it is more expected that the regularized pattern could be formed by these values.

Original: So it is natural to focus on these high activation values, which leads to the use of birth point.
Revised: So it is natural to focus on these high activation values, which leads to the use of birth time.

Original: Then, considering the various topological features, we compare the effect of using birth point and two other characterizations of the Betti curves which are its maximum value and its integration.
Revised: Then, considering the various topological features, we compare the effect of using birth time and two other characterizations of the Betti curves which are its maximum value and its integration.

Original: During calculation, we would only change birth point to the use of given characterization, where all the other parts remain the same.
Revised: During calculation, we would only change birth time to the use of given characterization, where all the other parts remain the same.

Original: Table 5 shows the results.
Revised: Table 5 shows the results.

Revised: We ﬁnd that the difference between using birth time and using other characterization are acceptable.

Revised: But when using other characterizations, we need to calculate the whole Betti curve.

Revised: The computation cost may be hundreds times than using birth time.

Original: [Table]
Revised: [Table]

Original: A. S TUDY ON S AMPLE S IZE
Revised: A. S TUDY ON S AMPLE S IZE

Original: For an efﬁcient computation in practice, we could use part of the training set for calculating the feature entropy.
Revised: For an efﬁcient computation in practice, we could use part of the training set for calculating the feature entropy.

Original: In this section, we check the inﬂuence on the feature entropy when using different sample sizes.
Revised: In this section, we check the inﬂuence on the feature entropy when using different sample sizes.

Original: We test the sample size from the 50 to the full size of of the example class (about 1300 images) in the training set on the reference model (Model AA) used in the paper.
Revised: We test the sample size from the 50 to the full size of of the example class (about 1300 images) in the training set on the reference model (Model AA) used in the paper.

Original: We ﬁrst investigate the variation of feature entropy of a single unit when changing the sample size.
Revised: We ﬁrst investigate the variation of feature entropy of a single unit when changing the sample size.

Original: We performed 100 times of sampling to investigate the stability of feature entropy, and each time randomly sample 500,and 50 images from the training set.
Revised: We performed 100 times of sampling to investigate the stability of feature entropy, and each time randomly sample 500,and 50 images from the training set.

Original: Fig.7 shows the histogram of feature entropy of the unit used in Section 4.1 for the 100 times of sampling, where the x-axis is feature entropy and y-axis is the frequency.
Revised: Fig.7 shows the histogram of feature entropy of the unit used in Section 4.1 for the 100 times of sampling, where the x-axis is feature entropy and y-axis is the frequency.

Original: We could see that for 500 and 100 samples, their feature entropy distribute closely to the value of feature entropy for using the whole training set.
Revised: We could see that for 500 and 100 samples, their feature entropy distribute closely to the value of feature entropy for using the whole training set.

Original: However, as for 50 samples, the feature entropy distribute scatteredly. 
Revised: However, as for 50 samples, the feature entropy distribute scatteredly. Therefore

Original: Therefore, using 100 samples could give considerable feature entropy of the class and in the meantime largely reduce the computation cost 
Revised: [Figure] using 100 samples could give considerable feature entropy of the class and in the meantime largely reduce the computation cost [Figure] [Figure]

Revised: pe r c en t ange

Original: [Figure]
Revised: [Figure]

Revised: c

Original: [Figure]
Revised: [Figure]

Original: en t ange
Revised: t ange

Original: [Figure]
Revised: [Figure]

Revised: t

Original:  Next, we investigate the feature entropy of all the units at a layer when changing the sample size.
Revised: [Figure] r [Figure] Next, we investigate the feature entropy of all the units at a layer when changing the sample size.

Original: All the units at the layer ”block5 conv3” and ”block5 conv2” in the reference model are used, and
Revised: All the units at the layer ”block5 conv3” and ”block5 conv2” in the reference model are used [Figure] and

Original: Fig.2A presents the results.
Revised: Fig.2A presents the results.

Original: As we could see in Fig.8(1-3), for 1300, 500 and 100 samples, their distributions of feature entropy of the 512 units at the layer are very close.
Revised: As we could see in Fig.8(1-3), for 1300, 500 and 100 samples, their distributions of feature entropy of the 512 units at the layer are very close.

Original: And in Fig.8(4), we average the feature entropy across the 512 units, and we could see that the feature entropy vary slightly from using 100 samples to 1300 samples.
Revised: And in Fig.8(4), we average the feature entropy across the 512 units, and we could see that the feature entropy vary slightly from using 100 samples to 1300 samples.

Original: Besides, the error bar is acquired via performing the 100 times of sampling.
Revised: Besides, the error bar is acquired via performing the 100 times of sampling.

Original: And we could see the error bars decrease as the sample sizes increase, and even for 100 samples, its error bar is still very low.
Revised: And we could see the error bars decrease as the sample sizes increase, and even for 100 samples, its error bar is still very low.

Original: A. 
Revised: A. A DDITIONAL R ESULTS ON R ES N ET

Original: A DDITIONAL R ESULTS ON R ES N ET

Original: In this section, we perform the experiments on the ResNet34, which is trained from scratch with the hyperparameters deployed in He et al.
Revised: In this section, we perform the experiments on the ResNet34, which is trained from scratch with the hyperparameters deployed in He et al.

Original: Rescaling and randomness comparison For rescaling and randomness investigation, the experiment setups are the same as those in Section 4.3.
Revised: Rescaling and randomness comparison For rescaling and randomness investigation, the experiment setups are the same as those in Section 4.3.

Original: Here, the unit is chosen at the layer ”conv5 3 out”, which is the last layer before global pooling layer.
Revised: Here, the unit is chosen at the layer ”conv5 3 out”, which is the last layer before global pooling layer.

Original: The sufﬁx ”out” stands for the output of a residual convolutional block.
Revised: The sufﬁx ”out” stands for the output of a residual convolutional block.

Original: Table 6 shows the corresponding results when performing rescaling operation.
Revised: Table 6 shows the corresponding results when performing rescaling operation

Original: [Table]
Revised: [Table]

Original: Table 7 shows the corresponding results of trained units and random initialized units.

Original: [Table]
Revised: [Table]

Original: Just as the  results on VGG16 (shown in Table 1 and 2)
Revised: Table 7 shows the corresponding results of trained units and random initialized units.

Original: [Table]
Revised: [Table]

Original:  due to the advantages of using topology [Table] feature entropy could give stable indication of the status of units as expected, no matter with the scaling operation or in the randomness situation.
Revised: Just as the results on VGG16 (shown in Table 1 and 2), due to the advantages of using topology, feature entropy could give stable indication of the status of units as expected, no matter with the scaling operation or in the randomness situation.

Original: Layer and training analysis We follow the implementation in the VGG16 network (Section 4.2) and ﬁrst check the status of unit in each convolution layer in ResNet34.
Revised: Layer and training analysis We follow the implementation in the VGG16 network (Section 4.2) and ﬁrst check the status of unit in each convolution layer in ResNet34.

Original: Fig.9 gives the comparisons between the results of the convergence ResNet34 model and the random-initialized model.
Revised: Fig.9 gives the comparisons between the results of the convergence ResNet34 model and the random-initialized model.

Original: For
Revised: For

Original: Fig.9A, it shows the variation of feature entropy with respect to the output of each convolutional block in the ResNet34 model.
Revised: Fig.9A, it shows the variation of feature entropy with respect to the output of each convolutional block in the ResNet34 model.

Original: We could see that the feature entropy continually decrease as the layer goes deeper, similar to the results on VGG16.
Revised: We could see that the feature entropy continually decrease as the layer goes deeper, similar to the results on VGG16.

Original: Besides, the feature entropy of each layer in the random-initialized model are all larger than the corresponding layer in the convergence model.
Revised: Besides, the feature entropy of each layer in the random-initialized model are all larger than the corresponding layer in the convergence model.

Original: Then, we check the variation of feature entropy for layers in a convolutional block, where Fig.9B shows the results.
Revised: Then, we check the variation of feature entropy for layers in a convolutional block, where Fig.9B shows the results.

Original: Typically, for ResNet34 architecture, a convolutional block consists of two consecutive convocational layer and yields the output after the shortcut connection.
Revised: Typically, for ResNet34 architecture, a convolutional block consists of two consecutive convocational layer and yields the output after the shortcut connection.

Original: We could see in the ﬁgure that the feature entropy at the ﬁrst convolutional layer would increase at the second convolutional layer, which is because of the non-activation of units at the second convolutional layer.
Revised: We could see in the ﬁgure that the feature entropy at the ﬁrst convolutional layer would increase at the second convolutional layer, which is because of the non-activation of units at the second convolutional layer.

Original: After that, the shortcut connection would decrease the feature entropy even without being activated and ﬁnally reach at a lower value than that at the ﬁrst convolutional layer.
Revised: After that, the shortcut connection would decrease the feature entropy even without being activated and ﬁnally reach at a lower value than that at the ﬁrst convolutional layer.

Original: The shortcut connection plays an important role in making the features more signiﬁcant, which leads to the decrease in the feature entropy.
Revised: The shortcut connection plays an important role in making the features more signiﬁcant, which leads to the decrease in the feature entropy.

Original: [Figure]
Revised: [Figure]

Revised: conv5_3 block conv5_2 block conv4_6 block conv 1 (activated) conv 2 (deactivated) output (deactivated) output(activated) 1.

Original: y
Revised: f

Original: [Figure]

Original: f ea t u r e en t r op y
Revised: ea t u r e en t r op y

Original: Convergence model Random-initialized model conv 1 (activated) conv 2 (deactivated) output (deactivated) output(activated) 2.
Revised: Convergence model Random-initialized model conv 1 (activated) conv 2 (deactivated) output (deactivated) output(activated) 2.

Original: f
Revised: f

Original: ea t u r e en t r op y
Revised: ea t u r e en t r op y

Original: Convergence model Random-initialized model
Revised: Convergence model Random-initialized model

Original: Next, Fig.10 shows the variation of feature entropy during training.
Revised: Next, Fig.10 shows the variation of feature entropy during training.

Original: Similarly to those on the VGG model, the feature entropy decrease during training and behaves close to the training loss as well.
Revised: Similarly to those on the VGG model, the feature entropy decrease during training and behaves close to the training loss as well.

Original: A
Revised: A

Original: B
Revised: B

Original: C
Revised: C

Original: D   40      t r a i n i ng l o ss epoch training loss training accuracy 0.
Revised: D   40      t r a i n i ng l o ss epoch training loss training accuracy 0.

Original: 1.0 A    40      t r a i n i ng l o ss epoch training loss training accuracy 0.
Revised: 1.0 A    40      t r a i n i ng l o ss epoch training loss training accuracy 0.

Original: 1.0 A    40 1.
Revised: 1.0 A    40 1.

Original: f ea t u r e en t r op y epoch 0.
Revised: f ea t u r e en t r op y epoch 0.

Original: s e
Revised: s e

Original: l e c
Revised: l e c

Original: t
Revised: t

Original: i v e r a t e    40 1.
Revised: i v e r a t e    40 1.

Original: f ea t u r e en t r op y epoch 0.
Revised: f ea t u r e en t r op y epoch 0.

Original: s e
Revised: s e

Original: l e c
Revised: l e c

Original: t
Revised: t

Original: i v e r a t e
Revised: i v e r a t e

Original: Indicating models with differnt generalization Further, a set of ResNet34 models with different generalization is trained via the same partially corrupted strategy as in Section 4.4.
Revised: Indicating models with differnt generalization Further, a set of ResNet34 models with different generalization is trained via the same partially corrupted strategy as in Section 4.4.

Original: Table A.5 shows the corresponding performance and Fig.11 gives the results of feature entropy.
Revised: Table A.5 shows the corresponding performance and Fig.11 gives the results of feature entropy.

Original: As we could see in the ﬁgure, results on ResNet model are quite similar to those on VGG16 (Fig.4.4).
Revised: As we could see in the ﬁgure, results on ResNet model are quite similar to those on VGG16 (Fig.4.4).

Original: The feature entropy of models would gradually increase as the generalization become worse.
Revised: The feature entropy of models would gradually increase as the generalization become worse.

Original: [Table]
Revised: [Table]

Original: [Figure]
Revised: [Figure]

Original: A. C OMPARISONS WITH O THER R ELATED M ETHODS U SED IN P RUNING
Revised: A. C OMPARISONS WITH O THER R ELATED M ETHODS U SED IN P RUNING

Original: In this section, we compare feature entropy with two other related strategies used in pruning.
Revised: In this section, we compare feature entropy with two other related strategies used in pruning.

Original: One is ﬁlter pruning via geometric median (FPGM)
Revised: One is ﬁlter pruning via geometric median (FPGM)

Original: He et al.
Revised: He et al.

Original: (2019), which uses the norm distance to the geometric median of the set of ﬁlters as the indicator of the importance of a ﬁlter F i at a layer (Eq.
Revised: (2019), which uses the norm distance to the geometric median of the set of ﬁlters as the indicator of the importance of a ﬁlter F i at a layer (Eq.

Original: in He et al.
Revised: in He et al.

Original: [Equation]
Revised: [Equation]

Original: where N denotes the total number of ﬁlters at the layer.
Revised: where N denotes the total number of ﬁlters at the layer.

Original: A ﬁlter is considered as useless if its g ( F i ) is small.
Revised: A ﬁlter is considered as useless if its g ( F i ) is small.

Original: The other one is called neuron importance score propagation (NISP) Yu et al.
Revised: The other one is called neuron importance score propagation (NISP) Yu et al.

Original: (2018), which measures the importance of a unit by propagating the ﬁnal feature selection score backwards based on coefﬁcients of network weights at a speciﬁc layer (Eq.19 in Yu et al., s k,i = [Equation] j
Revised: (2018), which measures the importance of a unit by propagating the ﬁnal feature selection score backwards based on coefﬁcients of network weights at a speciﬁc layer (Eq.19 in Yu et al.

Original: [Equation]
Revised: [Equation]

Original: | [Equation] (14) where | · | is the element-wise absolute value, s k,i denotes the importance score for unit i at layer k and W ( k +1)
Revised: where | · | is the element-wise absolute value, s k,i denotes the importance score for unit i at layer k and W ( k +1)

Original: i,j denotes the weight matrix at layer ( k +1) .
Revised: i,j denotes the weight matrix at layer ( k +1) .

Original: The method needs a base metric to score the ﬁnal feature selection and use it to calculate units in other layers backwards via this formula.
Revised: The method needs a base metric to score the ﬁnal feature selection and use it to calculate units in other layers backwards via this formula.

Original: Here, we follow the metric used in the original paper called inﬁnite feature selection Roffo et al.
Revised: Here, we follow the metric used in the original paper called inﬁnite feature selection Roffo et al.

Original: We follow the same investigations of rescaling operations and randomness detection as deployed previously in Section 4.3.
Revised: We follow the same investigations of rescaling operations and randomness detection as deployed previously in Section 4.3.

Original: Table 9 and Table 10 show the corresponding results.
Revised: Table 9 and Table 10 show the corresponding results.

Original: We could see in the Table 9 that just as the other methods in Section 4.3, rescaling operations would have a major impact on the two indicators.
Revised: We could see in the Table 9 that just as the other methods in Section 4.3, rescaling operations would have a major impact on the two indicators.

Original: Apparently, from the above formulas of the two methods, we could easily ﬁnd that they are still essentially based on the magnitude of weights.
Revised: Apparently, from the above formulas of the two methods, we could easily ﬁnd that they are still essentially based on the magnitude of weights.

Original: Therefore, it is nature that they fail to give valid indication in these complicated situations.
Revised: Therefore, it is nature that they fail to give valid indication in these complicated situations.

Original: [Table]
Revised: [Table]

Original: In addition to the rescaling operation, as we could see in Table 10, the FPGM method is also unable to give correct discrimination between the well-trained units and the random-initialized units.
Revised: In addition to the rescaling operation, as we could see in Table 10, the FPGM method is also unable to give correct discrimination between the well-trained units and the random-initialized units.

Original: [Table]
Revised: [Table]

Original: A. S TUDY OF P RUNING
Revised: A. S TUDY OF P RUNING

Original: In Section 4.4, feature entropy has shown the ability to reliably indicate the status of units between different models in various situations, which is the core motivation of the paper.
Revised: In Section 4.4, feature entropy has shown the ability to reliably indicate the status of units between different models in various situations, which is the core motivation of the paper.

Original: In addition, we also show the effectiveness of feature entropy to give comparisons between different units in the single model in a ﬁxed situation.
Revised: In addition, we also show the effectiveness of feature entropy to give comparisons between different units in the single model in a ﬁxed situation.

Original: In this situation, since units are generally in the comparable scale (unless use some speciﬁc implementations on networks like Neyshabur et al.
Revised: In this situation, since units are generally in the comparable scale (unless use some speciﬁc implementations on networks like Neyshabur et al.

Original: (2015) 2 ), the mentioned problems may be largely alleviated, so units would be compared directly via the typical methods like
Revised: (2015) 2 ), the mentioned problems may be largely alleviated, so units would be compared directly via the typical methods like

Original: L1-Norm, etc.
Revised: L1-Norm, etc.

Revised: Besides, we would consider feature entropy and selective rate both to represent its effectiveness of units for an accurate estimation.

Revised: Here, we would like to fuse these two factors by using H/(cid:15) in the following calculations

Original: Here, we are going to investigate the units in the single model in two parts.
Revised: Here we are going to investigate the units in the single model in two parts.

Original: The ﬁrst part is the cumulative unit ablation and the second part is an example of the implementation of network pruning.
Revised: The ﬁrst part is the cumulative unit ablation and the second part is an example of the implementation of network pruning

Original:  A.7. C UMULATIVE U NIT A BLATION
Revised: . A.7. C UMULATIVE U NIT A BLATION

Original: Ablation test setting For a given class, cumulative unit ablation tests check the evolution of the network performance by progressively removing each unit within a layer according to the order of certain kind of sorted attribute of units.
Revised: Ablation test setting For a given class, cumulative unit ablation tests check the evolution of the network performance by progressively removing each unit within a layer according to the order of certain kind of sorted attribute of units.

Original: Typically, removing a unit refers to forcing the outputs of the unit to all zeros.
Revised: Typically, removing a unit refers to forcing the outputs of the unit to all zeros.

Original: Here, the unit’s feature entropy is chosen as the attribute, and descending and ascending orders are considered simultaneously.
Revised: Here, the unit’s feature entropy is chosen as the attribute, and descending and ascending orders are considered simultaneously.

Original: According to our idea, the unit with lower feature entropy is more effective than that with higher feature entropy.
Revised: According to our idea, the unit with lower feature entropy is more effective than that with higher feature entropy.

Original: The cumulative ablation tests reveal the relation between feature entropy of unit’s output and its effectiveness on network performance, where training sets are generally used for calculating the feature entropy of the units and testing sets are used for checking their impact on the network performance.
Revised: The cumulative ablation tests reveal the relation between feature entropy of unit’s output and its effectiveness on network performance, where training sets are generally used for calculating the feature entropy of the units and testing sets are used for checking their impact on the network performance.

Original: Besides, the investigations are still using the last convolutional layer on the same image set in the previous section.
Revised: Besides, the investigations are still using the last convolutional layer on the same image set in the previous section.

Original: In particular, for each image in the set, it would be randomly rescaled within the ratio from 0.5 to 1.5. 
Revised: In particular, for each image in the set, it would be randomly rescaled within the ratio from 0.5 to 1.5. [Figure] [Figure] [Figure]

Revised: [Figure]

Revised: [Figure]

Original: [Figure]
Revised: [Figure]

Original: Results
Revised: Results

Original: The cumulative ablation is performed via ascending order of feature entropy ﬁrst.
Revised: The cumulative ablation is performed via ascending order of feature entropy ﬁrst.

Original: Fig.12A shows the variation of the testing accuracy (1) and loss (2) during ablation.
Revised: Fig.12A shows the variation of the testing accuracy (1) and loss (2) during ablation.

Original: We can see the accuracy drops rapidly in the beginning and arrives at zero after ablating about 38 units.
Revised: We can see the accuracy drops rapidly in the beginning and arrives at zero after ablating about 38 units.

Original: On the other side, the loss sharply increases in the beginning just like accuracy, afterwards slowly climbing and reaching its peak value (12.32) during ablation.
Revised: On the other side, the loss sharply increases in the beginning just like accuracy, afterwards slowly climbing and reaching its peak value (12.32) during ablation.

Original: It should be mentioned that the peak value even exceeds that of removing all the units (8.71).
Revised: It should be mentioned that the peak value even exceeds that of removing all the units (8.71).

Original: Being somehow counterintuitive, the ablation has generated a layer even worse than the all-zero layer.
Revised: Being somehow counterintuitive, the ablation has generated a layer even worse than the all-zero layer.

Original: We have also compared with the performance evolutions resulted from APoZ, class selectivity, L1norm, FPGM, NISP.
Revised: We have also compared with the performance evolutions resulted from APoZ, class selectivity, L1norm, FPGM, NISP.

Original: We can see in Fig.12(3-4) that the accuracy drops (or the loss increases) more rapidly using feature entropy (red line) than others during the ablation process.
Revised: We can see in Fig.12(3-4) that the accuracy drops (or the loss increases) more rapidly using feature entropy (red line) than others during the ablation process.

Original: This implies that those most effective units picked by feature entropy would be more impactful to the network performance.
Revised: This implies that those most effective units picked by feature entropy would be more impactful to the network performance.

Original: Then, the cumulative ablation is performed via descending order of feature entropy.
Revised: Then, the cumulative ablation is performed via descending order of feature entropy.

Original: From Fig.12B, instead of decreasing, the testing accuracy features a slow increase from 0.54 to surprising 1.0 when 96% of the units are removed.
Revised: From Fig.12B, instead of decreasing, the testing accuracy features a slow increase from 0.54 to surprising 1.0 when 96% of the units are removed.

Original: These units do not lie in the head part of feature entropy rank and are considered as the less effective units.
Revised: These units do not lie in the head part of feature entropy rank and are considered as the less effective units.

Original: So removing them will promote the accuracy and enhance the network performance.
Revised: So removing them will promote the accuracy and enhance the network performance.

Original: Remarkably, starting with removing a certain unit, the accuracy dramatically drops to zero within only 30 units.
Revised: Remarkably, starting with removing a certain unit, the accuracy dramatically drops to zero within only 30 units.

Original: It means that these units are critical and removing them will lead to breakdown of network.
Revised: It means that these units are critical and removing them will lead to breakdown of network.

Original: Likewise, the comparisons are also implemented with other attributes in
Revised: Likewise, the comparisons are also implemented with other attributes in

Original: Fig.12A. We could also ﬁnd that curve of feature entropy could reach much higher peak point in accuracy, which shows the advantage of feature entropy.
Revised: Fig.12A. We could also ﬁnd that curve of feature entropy could reach much higher peak point in accuracy, which shows the advantage of feature entropy.

Original: Interestingly, we could see that the testing performance could be largely enhanced via the cumulative unit ablation for a single class.
Revised: Interestingly, we could see that the testing performance could be largely enhanced via the cumulative unit ablation for a single class.

Original: Then, all the 1000 classes in ImageNet are investigated in the same way.
Revised: Then, all the 1000 classes in ImageNet are investigated in the same way.

Original: On the one hand, we would check whether the testing performance could be enhancedin this way for the majority of the classes, on the other hand, we use this to give comparisons be-
Revised: On the one hand, we would check whether the testing performance could be enhanced

Original: [Table]
Revised: [Table]

Original: tween different methods under this circumstance.
Revised: in this way for the majority of the classes, on the other hand, we use this to give comparisons between different methods under this circumstance.

Original: Table 11 shows the corresponding results, which is reported by averaging across all the classes.
Revised: Table 11 shows the corresponding results, which is reported by averaging across all the classes.

Original: Note that all the results in the table are reported as the balanced accuracy, which is commonly used for assessing the performance where the task is imbalanced.
Revised: Note that all the results in the table are reported as the balanced accuracy, which is commonly used for assessing the performance where the task is imbalanced.

Original: We could see that after performing ablation on a single class, the network could generally acquire performance enhancement to some extent.
Revised: We could see that after performing ablation on a single class, the network could generally acquire performance enhancement to some extent.

Original: And compared to other methods, feature entropy shows a larger performance enhancement, which again demonstrates the superiority of our method.
Revised: And compared to other methods, feature entropy shows a larger performance enhancement, which again demonstrates the superiority of our method.

Original: A.7. I MPLEMENTATION OF NETWORK PRUNING
Revised: A.7. I MPLEMENTATION OF NETWORK PRUNING

Original: In the previous paragraph [Table] we perform the ablation test on a single class to show the effectiveness of feature entropy.
Revised: In the previous paragraph, we perform the ablation test on a single class to show the effectiveness of feature entropy.

Original: Here, we are going to give implementation of channel-level network pruning for the whole dataset via feature entropy.
Revised: Here, we are going to give implementation of channel-level network pruning for the whole dataset via feature entropy.

Original: Network pruning setting The network is pruned by following the layer-by-layer strategy, which prunes the channels from the shallow to the deep layers progressively in two stages.
Revised: Network pruning setting The network is pruned by following the layer-by-layer strategy, which prunes the channels from the shallow to the deep layers progressively in two stages.

Original: In the ﬁrst stage, unimportant units at a layer are selected to be pruned based on a given pruning ratio via feature entropy.
Revised: In the ﬁrst stage, unimportant units at a layer are selected to be pruned based on a given pruning ratio via feature entropy.

Original: For units at the layer, they are selected by averaging the feature entropy across numbers of classes,
Revised: For units at the layer, they are selected by averaging the feature entropy across numbers of classes,

Original: [Equation]
Revised: [Equation]

Original: (15) where K is the total number of chosen classes.
Revised: (15) where K is the total number of chosen classes.

Original: In this way, we would prune the corresponding ﬁlters whose outputted units have higher feature entropy.
Revised: In this way, we would prune the corresponding ﬁlters whose outputted units have higher feature entropy.

Original: In the meantime, since the unit is removed, channels of the ﬁlters that connect this unit and units at next layer would also be pruned.
Revised: In the meantime, since the unit is removed, channels of the ﬁlters that connect this unit and units at next layer would also be pruned.

Original: Then in the second stage, we would ﬁne-tune the pruned model.
Revised: Then in the second stage, we would ﬁne-tune the pruned model.

Original: Here, we still use the reference VGG16 model in the paper as our target network.
Revised: Here, we still use the reference VGG16 model in the paper as our target network.

Original: In the conventional VGG architecture, after the convolutional backbone, two fully connected layers are used as the classiﬁer for the following decision making.
Revised: In the conventional VGG architecture, after the convolutional backbone, two fully connected layers are used as the classiﬁer for the following decision making.

Original: Although parameters in the fully connected layers could account for over 80%, yet the majority of computation cost lie on the convolutional operation.
Revised: Although parameters in the fully connected layers could account for over 80%, yet the majority of computation cost lie on the convolutional operation.

Original: So here, we remain this classiﬁer and target to prune all the convolutional layers for computation reduction.
Revised: So here, we remain this classiﬁer and target to prune all the convolutional layers for computation reduction.

Original: Additionally, during ﬁne-tuning stage, we use the SGD optimizer with a learning rate which is initially set to 1e-3, decay 10 times after one epoch ﬁne-tuning and ﬁnally stop after 1e-5.
Revised: Additionally, during ﬁne-tuning stage, we use the SGD optimizer with a learning rate which is initially set to 1e-3, decay 10 times after one epoch ﬁne-tuning and ﬁnally stop after 1e-5.

Original: All implementations are deployed on the Nvidia-A100 station with a batch size of 512.
Revised: All implementations are deployed on the Nvidia-A100 station with a batch size of 512.

Original: Also, similar to the setting in the paper, all the images are simply resized to 224 × 224 .
Revised: Also, similar to the setting in the paper, all the images are simply resized to 224 × 224 .

Original: We use the FLOPs of convolutional operation as the metric of computation cost and parameter counts as the metric of storage cost.
Revised: We use the FLOPs of convolutional operation as the metric of computation cost and parameter counts as the metric of storage cost.

Original: Results We ﬁrst investigate the impact of the number of classes K to the pruning effect, where the pruning ratio is set to 50%.
Revised: Results We ﬁrst investigate the impact of the number of classes K to the pruning effect, where the pruning ratio is set to 50%.

Original: Fig.13A shows the pruning results of VGG16 with remaining fully connected layers.
Revised: Fig.13A shows the pruning results of VGG16 with remaining fully connected layers.

Original: We could see that as we choose more amount of classes for the calculation of feature entropy, the accuracy of the ﬁne-tuned model gradually increase.
Revised: We could see that as we choose more amount of classes for the calculation of feature entropy, the accuracy of the ﬁne-tuned model gradually increase.

Original: And compared to using 100 classes, using 150 and 200 classes would increase the accuracy slightly.
Revised: And compared to using 100 classes, using 150 and 200 classes would increase the accuracy slightly.

Original: Thus, for an efﬁcient computation of feature entropy, we would use 100 classes for the following pruning implementation.
Revised: Thus, for an efﬁcient computation of feature entropy, we would use 100 classes for the following pruning implementation.

Original: [Figure]
Revised: [Figure]

Original: Then, we give the results of ﬁne-tuned networks via the implementations of separately 40%, 50%, 60% pruning ratios, as shown in Fig.13B. We could see that as we keep more channels, the ﬁnetuned network could reach a higher accuracy and when the pruning ratio is 60%, the accuracy is comparable to that of unchanged network.
Revised: Then, we give the results of ﬁne-tuned networks via the implementations of separately 40%, 50%, 60% pruning ratios, as shown in Fig.13B. We could see that as we keep more channels, the ﬁnetuned network could reach a higher accuracy and when the pruning ratio is 60%, the accuracy is comparable to that of unchanged network.

Original: Finally, we make comparisons when using different methods with the pruning ratio of 50%.
Revised: Finally, we make comparisons when using different methods with the pruning ratio of 50%.

Original: For other methods, we use the same pruning implementation as feature entropy.
Revised: For other methods, we use the same pruning implementation as feature entropy.

Original: Table 12 gives the ﬁnal results.
Revised: Table 12 gives the ﬁnal results.

Original: As we could see in the table, the model pruned via feature entropy could reach competitive results compared to other methods.
Revised: As we could see in the table, the model pruned via feature entropy could reach competitive results compared to other methods.

Original: In conclusion, feature entropy shows the advantage of being an effective indicator for not only network units between different models but units in a single model.
Revised: In conclusion, feature entropy shows the advantage of being an effective indicator for not only network units between different models but units in a single model.

Original: [Table]
Revised: [Table]

Revised: [Table]

Revised: [Table]

Revised: [Table]