L EARNING FROM B ETWEEN - CLASS E XAMPLES FOR D EEP S OUND R ECOGNITION
Anonymous authors
Paper under double-blind review
A BSTRACT
Deep learning methods have achieved high performance in sound recognition tasks.
Deciding how to feed the training data is important for further performance improvement.
We propose a novel learning method for deep sound recognition: learning from between-class examples ( BC learning ).
Our strategy is to learn a discriminative feature space by recognizing the between-class sounds as betweenclass sounds.
We generate between-class sounds by mixing two sounds belonging to different classes with a random ratio.
We then input the mixed sound to the model and train the model to output the mixing ratio.
The advantages of BC learning are not limited only to the increase in variation of the training data; BC learning leads to an enlargement of Fisher’s criterion in the feature space and a regularization of the positional relationship among the feature distributions of the classes.
The experimental results show that BC learning improves the performance on various sound recognition networks, datasets, and data augmentation schemes, in which BC learning proves to be always beneﬁcial.
Furthermore, we construct a new deep sound recognition network ( DSRNet ) and train it with BC learning.
As a result, the performance of DSRNet surpasses the human level.
I NTRODUCTION
Sound recognition has been conventionally conducted by applying classiﬁers, such as SVM or
GMM, to local features, such as MFCC or log-mel features (Logan et al., 2000; Vacher et al., 2007; Łopatka et al., 2010).
Convolutional neural networks (CNNs) (LeCun et al., 1998), which have achieved success in image recognition tasks (Krizhevsky et al., 2012; Simonyan & Zisserman, 2015; He et al., 2016), have recently proven to be effective in tasks related to series data, such as speech recognition ( Abdel-Hamid et al., 2014;
Sainath et al., 2015a;b) and natural language processing (Kim, 2014; Zhang et al., 2015).
Some researchers applied CNNs to sound recognition tasks and achieved high performance: applying a CNN to local features (Piczak, 2015a) and learning directly from raw waveforms ( Aytar et al., 2016; Dai et al., 2017; Tokozume & Harada, 2017).
The amount and quality of training data and how to feed it are important for machine learning, particularly for deep learning.
Various approaches have been proposed to improve the sound recognition performance.
The ﬁrst approach is to efﬁciently use limited training data with data augmentation.
Researchers proposed increasing the training data variation by altering the shape or property of sounds or adding a background noise (Tokozume & Harada, 2017; Salamon & Bello, 2017).
Researchers also proposed using additional training data created by mixing multiple training examples (Parascandolo et al., 2016; Takahashi et al., 2016).
The second approach is to use external data or knowledge.
Aytar et al.
(Aytar et al., 2016) proposed learning rich sound representations using a large amount of unlabeled video datasets and pre-trained image recognition networks.
The sound dataset expansion was also conducted (Salamon et al., 2014; Piczak, 2015b; Gemmeke et al., 2017).
In this paper, as a novel third approach we propose a learning method for deep sound recognition: learning from between-class examples ( BC learning ).
Our strategy is to learn a discriminative feature space by recognizing the between-class sounds as between-class sounds.
We generate betweenclass sounds by mixing two sounds belonging to different classes with a random ratio.
We then input the mixed sound to the model and train the network to output the mixing ratio.
Our method focuses on the characteristic of the sound, from which we can generate a new sound simply by adding the waveform data of two sounds.
The advantages of BC learning are not limited only to the increase in variation of the training data; BC learning leads to an enlargement of Fisher’s criterion (Fisher, 1936) ( i.e. , the ratio of the between-class distance to the within-class variance) in the feature space, and a regularization of the positional relationship among the feature distributions of the classes.
The experimental results show that BC learning improves the performance on various sound recognition networks, datasets, and data augmentation schemes, in which BC learning proves to be always beneﬁcial.
Furthermore, we constructed a new deep sound recognition network ( DSRNet ) and trained it with BC learning.
As a result, we achieved a 15 : 10% error rate on a benchmark dataset
ESC-50 (Piczak, 2015b), which surpasses the human level.
We argue that our approach is different from the so-called data augmentation methods we introduced above.
In general, the problem to be solved is the same in both training and testing phase.
Data augmentation methods aim to improve the generalization ability by generating additional training data which is likely to appear in testing phase.
Thus, the most important thing is the training data variation.
On the other hand, our BC learning aims to learn a classiﬁcation problem by solving the problem of predicting the mixing ratio between to different classes.
Our method only uses mixed data and labels for training, without using the original pure data and labels, while the model solves a single-label classiﬁcation problem in the testing phase.
We believe that the key point of BC learning is not the increase in data variation but the learning method itself.
To the best of our knowledge, this is the ﬁrst time a learning method that employs a mixing ratio between different classes has been proposed.
Hence, our BC learning is a novel learning method.
R ELATED W ORK 2. S OUND R ECOGNITION N ETWORKS
We introduce recent deep learning methods for sound recognition.
Piczak (2015a) proposed the extraction of log-mel features from raw waveforms and the application of CNNs to them.
The log-mel feature is calculated for each frame of sound and represents the magnitude of each frequency area, considering human auditory perception ( Davis & Mermelstein, 1980).
Piczak created a 2 -D featuremap by arranging the log-mel features of each frame along the time axis and calculated the delta log-mel feature, which was the ﬁrst temporal derivative of the static log-mel feature.
Piczak then classiﬁed these static and delta feature-maps with 2 -D CNN, treating them as a two-channel input in a manner quite similar to the RGB inputs of the image.
The log-mel feature-map exhibits locality in both time and frequency domains (Abdel-Hamid et al., 2014).
Therefore, we can accurately classify this feature-map with CNN.
We refer to this method as Logmel-CNN .
Some researchers also proposed methods to learn the sounds directly from 1 -D raw waveforms, including feature extraction.
Aytar et al.
(2016) proposed a sound recognition network using 1D convolutional and pooling layers named SoundNet and learned the sound feature using a large amount of unlabeled videos (we describe the details of it in the next section).
Dai et al.
(2017) also proposed a network using 1 -D convolutional and pooling layers, but they stacked more layers.
They reported that the network with 18 layers performed the best.
Tokozume & Harada (2017) proposed a network using both 1 -D and 2 -D convolutional and pooling layers named EnvNet.
First, EnvNet extracts a frequency feature of each short duration of section with 1 -D convolutional and pooling layers and obtain a 2 -D feature-map.
Next, it classiﬁes this feature-map with 2 -D convolutional and pooling layers in a similar manner to Logmel-CNN.
Learning from the raw waveform is still a challenging problem because it is difﬁcult to learn raw waveform features from limited training data.
However, the performance of these systems is close to that of Logmel-CNN.
2. A PPROACHES TO A CHIEVE H IGH P ERFORMANCE
We describe the approaches to achieve high sound recognition performance from two views: approaches involving efﬁcient use of limited training data and those involving external data/knowledge.
First, we describe data augmentation as an approach of efﬁciently using limited training data.
One of the most standard and important data augmentation methods is cropping (Piczak, 2015a; Aytar et al., 2016; Tokozume & Harada, 2017).
The training data variation increases, and we are able to more efﬁciently train the network when the short section (approximately 1 – 2 s) of the training sound cropped from the original data to the network, and not the whole section, is inputted.
A similar method is generally used in the test phase.
Multiple sections of test data are input with a stride,
[Figure]
Label
[Figure]
xxmix r ( x 1 , x 2 ) r ⇠ U (0 , 1)
Input
Model
Output
KL
Dog 0.
Cat 0.
Birdmix r ( x 1 , x 2 ) =
p x 1 +(1  p ) xp
p 2 +(1  p ) 2 where p = 1 + 10 G 1  G 2 20 · 1  r r r t 1 +(1  r ) t and the average of the output predictions is used to classify the test sound.
Salamon & Bello (2017) proposed the usage of additional training data created by time stretching (slow down or speed up the sounds), pitch shifting (raise or lower the pitch of sounds), dynamic range compression (compress the dynamic range of sounds), and adding background noise chosen from an external dataset.
Researchers also proposed using additional training data created by mixing multiple training examples.
Parascandolo et al.
(2016) applied this method to polyphonic sound event detection.
Takahashi et al.
(2016) applied this method to single-label sound event classiﬁcation, but only the sounds belonging to the same class were mixed.
Both of them treated the mixed data as additional training data, and only focused on the increase in data variation.
To the best of our knowledge, there has been no method that employs a mixing ratio between different classes for training.
Next, we describe the approaches of utilizing external data/knowledge.
Aytar et al.
(2016) proposed to learn rich sound representations using pairs of image and sound included in a large amount of unlabeled video dataset.
They transferred the knowledge of pre-trained large-scale image recognition networks into sound recognition network by minimizing the KL-divergence between the output predictions of the image recognition networks and that of the sound network.
They used the output of the hidden layer of the sound recognition network as the feature when applying to the target sound classiﬁcation problem.
They then classiﬁed it with linear SVM.
They could train a deep sound recognition network (SoundNet8) and achieve a 74 : 2% accuracy on a benchmark dataset, ESC- ( Piczak, 2015b), with this method.
BC L EARNING : L EARNING FROM B ETWEEN - CLASS E XAMPLES 3. O VERVIEW
In this section, we propose a novel learning method for deep sound recognition BC learning .
Fig.shows the pipeline of the BC learning.
In standard learning, we select a single training example from the dataset and input it to the model.
We then train the model to output 0 or 1 .
By contrast, in BC learning, we select two training examples from different classes and mix these two examples using a random ratio.
We then input the mixed data to the model and train the model to output the mixing ratio.
BC learning uses only mixed data and labels, and thus never uses pure data and labels.
First, we provide the details of BC learning in Section 3.2.
We mainly explain the method of mixing two sounds, which should be carefully designed to achieve a good performance.
Then, in Section 3.3, we explain why BC learning leads to a discriminative feature space.
3. M ETHOD D ETAILS 3.2. M IXING M ETHOD
BC learning optimizes a model using mini-batch stochastic gradient descent the same way the standard learning does.
Each data and label of a mini-batch is generated by mixing two training examples belonging to different classes.
Here, we describe how to mix two training examples.
Let x 1 and x 2 be two sounds belonging to different classes randomly selected from the training dataset, and t 1 and t 2 be their one-hot labels.
Note that x 1 and x 2 may have already been preprocessed or applied data augmentation, and they have the same length as that of the input of the network.
We generate a random ratio r from U (0 ; 1) , and mix two sets of data and labels with this ratio.
We mix two labels simply by r t 1 + (1 (cid:0) r ) t 2 , because we aim to train the model to output the mixing ratio.
We then explain how to mix x 1 and x 2 .
The simplest method is r x 1 + (1 (cid:0) r ) x 2 .
However, the following mixing formula is slightly better, considering that sound energy is proportional to the square of the amplitude:
[Equation]
However, auditory perception of a sound mixed with Eqn.
(1) would not be x
[Equation]
x 2 = r : (
[Equation]
r ) if the difference of the sound pressure level of x 1 and x 2 is large.
For example, if the amplitude of x 1 is 10 times as large as that of x 2 and we mix them with 0 : 2 : 0 : 8 , the sound of x 1 would still be dominant in the mixed sound.
In this case, training the model with a label of f 0 : 2 ; 0 : 8 g is inappropriate.
We then consider using a new coefﬁcient p ( r; G 1 ; G 2 ) instead of r , and mix two sounds by p x 1 +(1 (cid:0) p ) x 2 p p
+(1 (cid:0) p ) 2 , where G 1 and G 2 is the sound pressure level of x 1 and x 2 [dB] , respectively.
We deﬁne p so that the auditory perception of the mixed sound becomes r : (1 (cid:0) r ) .
We hypothesize that the ratio of auditory perception for the network is the same as the ratio of amplitude and then solve p (cid:1) 10 G 120 : (1 (cid:0) p ) (cid:1) 10 G
= r :
[Equation]
1 (cid:0) r ) .
Finally, we obtain the proposed mixing method:
[Equation]
where p = 1 +
[Equation]
r
[Equation]
We show this mixing method performs better than Eqn.
(1) in the experiments.
We calculate the sound pressure level G 1 and G 2 using A-weighting, considering that human auditory perception is not sensitive to low and high frequency areas.
We can also use simpler sound pressure metrics such as root mean square (RMS) energy instead of an A-weighting sound pressure level.
However, the performance worsens, as we show in the experiments.
We create short windows ( (cid:24) 0 :s) on the sound and calculate a time series of A-weighted sound pressure levels f g 1 ; g 2 ; : : : ; g t g .
Then, we deﬁne G as the maximum of those time series ( G = max f g 1 ; g 2 ; : : : ; g t g ).
3.2. O PTIMIZATION
We deﬁne the f and (cid:18) as the model function and the model parameters, respectively.
We input the generated mini-batch data f x i g ni =1 and obtain the output f f (cid:18) ( x i ) g ni =1 .
Some distance metrics can be found between f f (cid:18) ( x i ) g ni
=1 and mini-batch label f t
i g ni
=1 .
We expect that our ratio labels represent the expected class probability distribution.
Therefore, we use the KL-divergence between the labels and the model outputs as the loss function.
We optimize KL-divergence with back-propagation and stochastic gradient descent because it is differentiable:
[Equation]
where m is the number of classes, and (cid:17) is the learning rate.
3. H OW BC L EARNING W ORKS 3.3. E NLARGEMENT OF F ISHER ’ S C RITERION
BC leaning leads to an enlargement of the Fisher’s criterion ( i.e. , the ratio of the between-class distance to the within-class variance).
We explain the reason in Fig.
In deep neural networks, linearly-separable features are learned in a hidden layer close to the output layer (An et al., 2015).
[Figure]
BC learning (ours)
A
B
[Figure]
A
[Figure]
Standard learning
A
B f ( mix r ( x 1 , x 2 ))
f ( x 1 ) f
( x 2 ) f mix r (A , B) mix r (A , B) f
( mix r ( x 1 , x 2 ))
f ( x 1 ) f
( x 2 ) xmix r ( x 1 , x 2 )
x
[Figure]
Besides, we can generate a new sound simply by adding the waveform data of two sounds, and humans can recognize both of two sounds and perceive which of two sounds is louder or softer from the mixed sound.
Therefore, it is expected that an internally dividing point of the input space almost corresponds to that of the semantic feature space, at least for sounds.
Then, the feature distribution of the mixed sounds of class A and class B with a certain ratio would be located near the internally dividing point of the original feature distribution of class A and B, and the variance of the feature distribution of the mixed sounds is proportional to the original feature distribution of class A and B. To investigate whether this hypothesis is correct or not, we visualized the feature distributions of the standard-learned model using PCA.
The results are shown in Fig.
The magenta circles represent the feature distribution of the mixed sounds of dogbark and rain with a ratio of 0 : 8 : 0 : 2 , and the black dotted line represents the trajectory of the feature when we input a mixture of two particular sounds to the model changing the mixing ratio from 0 to 1 .
This ﬁgure shows that the mixture of two sounds is projected into the point near the internally dividing point of two features, and the features of the mixed sounds are distributed between two classes, as we expected.
If the Fisher’s criterion is small, the feature distribution of the mixed sounds becomes large, and would have a large overlap with one or both of the feature distribution of class A and B (Fig. 2(middle)).
In this case, some mixed sounds are projected into one of the classes as shown in this ﬁgure, and the model cannot output the mixing ratio.
BC learning gives a penalty to this situation because BC learning trains a model to output the mixing ratio.
If the Fisher’s criterion is large, on the other hand, the overlap becomes small (Fig. 2(right)).
The model becomes able to output the mixing ratio, and BC learning gives a small penalty.
Therefore, BC learning enlarges the
Fisher’s criterion between any two classes in the feature space.
3.3. R EGULARIZATION OF P OSITIONAL R ELATIONSHIP A MONG F EATURE D ISTRIBUTIONS
We expect that BC learning also has the effect of regularizing the positional relationship among the class feature distributions.
In standard learning, there is no constraint on the positional relationship among the classes, as long as the features of each two classes are linearly separable.
We found that a standard-learned model sometimes misclassiﬁes a mixed sound of class A and class B as a class other than A or B. Fig.
4(lower left) shows an example of transition of output probability of standard-learned model when we input a mixture of two particular training sounds ( dog bark and rain ) to the model changing the mixing ratio from 0 to 1 .
The output probability of dog bark
1 mixing ratio0.2 0.
p r e d i c ti on
A: dog bark B: rainC: baby cry 0.
1 mixing ratio0.2 0.
p r e d i c ti on
A: dog bark B: rain
Standard learning
A
B
C
BC learning (ours)
A
B
C r = r = r = r = monotonically increases and that of rain monotonically decreases as we expected, but the model classiﬁes the mixed sound as baby cry when the mixing ratio is within the range of 0 : 45 – 0 : 8 .
This is an undesirable state because there is little possibility that a mixed sound of two classes becomes a sound of other classes.
In this case, we assume that the features of each class are distributed as in
Fig.
4(upper left).
The decision boundary of class
C appears between class A and class B, and the trajectory of the features of the mixed sounds crosses the decision boundary of class C.
BC learning can avoid the situation in which the decision boundary of other class appears between two classes, because BC learning trains a model to output the mixing ratio instead of misclassifying the mixed sound as different classes.
We show the transition of the output probability in Fig.
4(lower right), when using the same two examples as that used in Fig.
4(lower left).
We assume that the features of each class are distributed as in Fig.
4(upper right).
The feature distributions of the three classes make an acute-angled triangle, and the decision boundary of class C does not appear between class A and class
B.
In this way, BC learning enlarges the Fisher’s criterion, and at the same time, regularizes the positional relationship among the classes in the feature space.
Hence, BC learning improves the generalization ability.
E XPERIMENTS 4. C OMPARISON B ETWEEN S TANDARD L EARNING AND BC L EARNING
In this section, we train various types of sound recognition networks with both standard and BC learning, and demonstrate the effectiveness of BC learning.
Datasets We used ESC-50, ESC-10 (Piczak, 2015b), and UrbanSound8K (Salamon et al., 2014) to train and evaluate the models.
ESC-50, ESC-10, and UrbanSound8K contain a total of 2 ; 000 , 400 , and 8 ; 732 examples consisting of 50 , 10 , and 10 classes, respectively.
We removed completely silent sections in which the value was equal to 0 at the beginning or end of examples in the ESCand ESC-10 datasets.
We converted all sound ﬁles to monaural 16 -bit WAV ﬁles.
We evaluated the performance of the methods using a K -fold cross-validation ( K = 5 for ESC-50 and ESC-10, and K = 10 for UrbanSound8K), using the original fold settings.
We performed cross-validationtimes for ESC-50 and ESC-10, and showed the standard error.
Preprocessing and data augmentation We used a simple preprocessing and data augmentation scheme.
Let T be the input length of a network [ s ] .
In the training phase, we padded T= 2 s of zeros on each side of a training sound and randomly cropped a T -s section from the padded sound.
We mixed two cropped sounds with a random ratio when using BC learning.
In the testing phase, we also padded T= 2 s of zeros on each side of a test sound and cropped 10 T -s sections from the padded sound at regular intervals.
We then input these 10 crops to the network and averaged all softmax outputs.
Each input data was regularized into a range of from (cid:0) 1 to +1 by dividing it by 32 ; 768 , that is, the full range of 16-bit recordings.
Learning settings All models were trained with Nesterov’s accelerated gradient using a momentum of 0 : 9 , weight decay of 0 : 0005 , and mini-batch size of 64.
The only difference in the learning settings between standard and BC learning is the number of training epochs.
BC learning tends to require more training epochs than does standard learning, while standard learning tends to overﬁt with many training epochs.
To validate the comparison, we ﬁrst identiﬁed an appropriate standard learning setting for each network and dataset (details are provided in the appendix A), and we dou-
[Table]
DSRNet (ours) + strong augment
[Figure]
21 : 17 (cid:6) 0 :10 : 9 (cid:6) 0 :24 :
BC (ours) 15 : 10 (cid:6) 0 :8 : 6 (cid:6) 0 :21 :
SoundNet8 + Linear SVM
(Aytar et al., 2016)
[Figure] [Figure]
Human (Piczak, 2015b) 18 :
[Figure] [Figure]
[Figure]
bled the number of training epochs when using BC learning.
Later in this section, we examine the relationship between the number of training epochs and the performance.
4.1. E XPERIMENT ON E XISTING N ETWORKS
First, we trained various types of existing networks.
We selected EnvNet (Tokozume & Harada, 2017) as a network using both 1 -D and 2 -D convolutions, SoundNet5 (Aytar et al., 2016) and M (Dai et al., 2017) as networks using only 1 -D convolution, and Logmel-CNN (Piczak, 2015a)
+
BN as a network using log-mel features.
Logmel-CNN + BN is an improved version of LogmelCNN that we designed in which, to convolutional layers, we apply batch normalization to the output and remove the dropout.
Note that all networks and training codes are our implementation.
We implemented them using Chainer v1.24 (Tokui et al., 2015).
The results are summarized in the upper half of Table 1.
Our BC learning improves the performance of all networks on all datasets.
The performance on ESC-50, ESC-10, and UrbanSound8K is improved by 4 : 47 – 6 : 33% , 1 : 5 – 4 : 0% , and 1 : 81 – 4 : 77% , respectively.
We show the training curves of
EnvNet on ESC-50 in Fig. 5(left).
Note that the curves show the average of all trials.
4.1. E XPERIMENT ON A D EEPER N ETWORK
To investigate the effectiveness of BC learning on deeper networks, we constructed a deep sound recognition network based on EnvNet, which we refer to as DSRNet , and trained it with both standard and BC learning.
The main differences between EnvNet and DSRNet are as follows: 1) EnvNet uses a sampling rate of 16 kHz for the input waveforms, whereas DSRNet uses 44 : 1 kHz; and 2) EnvNet consists of 7 layers, whereas DSRNet consists of 13 layers.
A detailed conﬁguration is provided in the appendix B.
The results are also shown in the upper half of Table 1, and the training curves on ESC-50 are given in
Fig.
5(right).
The performance also improves with BC learning, and the degree of the improvement is greater than other networks ( 7 : 37% , 3 : 6% , and 7 : 54% on ESC-50, ESC-10, and UrbanSound8K, respectively).
The error rate of DSRNet trained with BC learning is the lowest on ESC-50 and
UrbanSound8K among all the models including Logmel-CNN + BN, which uses powerful handcrafted features.
Moreover, the error rate on ESC-50 ( 18 : 19% ) is comparable to human performance reported by Piczak (2015b) ( 18 : 7% ).
The point is not that our DSRNet is well designed, but that our
BC learning successfully elicits the true value of a deep sound recognition network.
4.1. E XPERIMENT WITH S TRONG D ATA A UGMENTATION
We compared the performances of standard and BC learning when using a stronger data augmentation scheme.
In addition to zero padding and random cropping, we used scale augmentation with a factor randomly selected from [0 : 8 ; 1 : 25] and gain augmentation with a factor randomly selected from [ (cid:0) 6 dB ; +6 dB] .
Scale augmentation was performed before zero padding (thus, before mixing when employing BC learning) using linear interpolation, and gain augmentation was performed just before inputting to the network (thus, after mixing when using BC learning).
The results for DSRNet are shown in the lower half of Table 1, and the training curves on ESC-50 are given in Fig.
5(right).
With BC learning, the performance signiﬁcantly improves even when we use a strong data augmentation scheme.
Furthermore, the performance on ESC-50 ( 15 : 10% ) surpasses the human performance ( 18 : 7% ).
BC learning performs well on various networks, datasets, and data augmentation schemes, and using BC learning is always beneﬁcial.
4.1. R ELATIONSHIP B ETWEEN # OF T RAINING E POCHS
We investigated the relationship between the performance and the number of training epochs, because the previously described experiments were conducted using different numbers of training epochs (we used 2 x training epochs for BC learning).
Fig.
6 shows the error rate of EnvNet on
ESC-50 with various numbers of training epochs.
This ﬁgure shows that for standard learning, approximately 600 training epochs are sufﬁcient.
However, this number is insufﬁcient for BC learning.
Although BC learning performs signiﬁcantly better than standard learning with 600 epochs, improved performance is achieved when using more training epochs.
However, if the number of training epochs is small, the performance of BC learning is lower than that of standard learning.
We can say that BC learning always improves the performance as long as we use a sufﬁciently large number of training epochs.
Empirically, BC learning requires at least the same number of training epochs sufﬁcient for standard learning, and the performance would further improve when using more training epochs.
4. A BLATION A NALYSIS
To understand the part that is important for BC learning, we conducted an ablation analysis.
We trained EnvNet on ESC-50 using various settings.
All results are shown in Table 2.
We also performed 5 -fold cross-validation ﬁve times and show the standard error.
Mixing methods We compared the mixing formula (Eqn. 1 vs .
Eqn. 2, which consider the sound pressure levels of two sounds) and the calculation method for sound pressure levels (RMS vs .
Aweighting).
As shown in Table 2, the proposed mixing method using Eqn.
2 and A-weighting performs the best.
Considering the difference of the sound pressure levels of two sounds is important for BC learning, and the method used to deﬁne the sound pressure levels also has an effect on the performance.
[Table]
Where to mix
[Table]
Label We compared the different labels that we applied to the mixed sound.
As shown in Table 2, the proposed ratio label of t =
r t 1 + (1 (cid:0) r ) t 2 performs the best.
When we apply a single label of the dominant sound ( i.e. , t = t 1 if r > 0 : 5 , otherwise t = t 2 ) and train the model using softmax cross entropy loss, the performance also improves compared to that of standard learning.
However, the degree of improvement is small.
When we apply a multi-label ( i
[Table]
e. , t = t 1 + t 2 ) and train the model using sigmoid cross entropy loss, the performance is better than when using a single label.
However, the performance is worse than when using our ratio label.
The model can learn the between-class examples more efﬁciently when using our ratio label.
Number of mixed classes We investigated the relationship between the performance and the number of classes of sounds that we mixed.
N = 1 in Table 2 means that we mixed two sounds belonging to the same class, which is similar to Takahashi et al.
N = 1 or 2 means that we completely randomly selected two sounds to be mixed; sometimes these two sounds were the same class.
N =means that we mixed two sounds belonging to different classes (proposed).
N = 2 or 3 means that we mixed two and three sounds belonging to different classes with probabilities of 0 : 5 and 0 : 5 , respectively.
N = 3 means that we mixed three sounds belonging to different classes.
When we mixed three sounds, we used a mixing method that is an extended version of Eqn.
2 for three classes, and we generated the mixing ratio from Dir(1 ; 1 ; 1) .
As shown in Table 2, the proposed N =performes well.
Although N = 2 or 3 is marginally better than N = 2 , it does not represent a signiﬁcant difference.
It is interesting to note that the performance of N = 3 is worse than that of
N = 2 despite the larger variation in training data.
We believe that the most important factor is not the training data variation but rather the enlargement of Fisher’s criterion and the regularization of the positional relationship among the feature distributions.
Mixing more than two sounds leads to increased training data variation, but we expect that cannot efﬁciently achieve them.
Where to mix Finally, we investigated what occurs when we mix two examples within the network.
We input two sounds to be mixed into the model and performed the forward calculation to the mixing point.
We then mixed the activations of two sounds at the mixing point and performed the rest of the forward calculation.
We mixed two activations h 1 and h 2 simply by r h 1 + (1 (cid:0) r )
h 2 .
As shown in Table 2, the performance tends to improve when we mix two examples at the layer near the input layer.
The performance is the best when we mix in the input space.
Mixing in the input space is the best choice, not only because it performs the best, but also because it does not require additional forward/backward computation.
It is also easier to implement than when mixing within the network.
C ONCLUSION
We proposed a novel learning method for deep sound recognition, called BC learning.
Our method improved the performance on various networks, datasets and data augmentation schemes.
Moreover, we achieved a performance surpasses the human level by constructing a new deep sound recognition network named DSRNet and training it with BC learning.
BC learning is a simple and powerful method that improves various sound recognition methods and elicits the true value of large-scale networks.
Furthermore, BC learning is innovative in that a discriminative feature space can be learned from between-class examples, without inputting pure examples.
We assume that the core idea of BC learning is generic and could contribute to the improvement of the performance of tasks of other modalities
A L EARNING S ETTINGS
Table 3 shows the detailed learning settings of standard learning.
We trained the model by beginning with a learning rate of Initial LR , and then divided the learning rate by 10 at the epoch listed in LR schedule .
To improve convergence, we used a 0 : 1 x smaller learning rate for the ﬁrst Warmup epochs.
We then terminated training after # of epochs epochs.
We doubled # of epochs and LR schedule when using BC learning, as we mentioned in the paper.
[Table]
B DSRN ET : D EEP S OUND R ECOGNITION N ETWORK
Table 4 shows the conﬁguration of our DSRNet used in the experiments.
DSRNet consists ofconvolutional layers, 3 fully connected layers, and 5 max-pooling layers.
We use a sampling rate of 44 : 1 kHz, which is the standard recording setting, and a higher resolution than existing networks ( Piczak, 2015a; Aytar et al., 2016; Dai et al., 2017; Tokozume & Harada, 2017), in order to use rich high-frequency information.
The basic idea is motivated by EnvNet ( Tokozume & Harada, 2017), but the advantages of other successful networks are incorporated.
First, we extract short-time frequency features with the ﬁrst two temporal convolutional layers and a pooling layer (conv1–pool2).
Second, we swap the axes and convolve in time and frequency domains with the later layers (conv3– pool10).
In this part, we hierarchically extract the temporal features by stacking the convolutional and pooling layers with decreasing their kernel size in a similar manner to SoundNet ( Aytar et al., 2016).
Furthermore, we stack multiple convolutional layers with a small kernel size in a similar manner to M18 (Dai et al., 2017) and VGG (Simonyan & Zisserman, 2015), to extract more rich features.
Finally, we produce output predictions with fc11–fc13 and the following softmax activation.
Single output prediction is calculated from 66 ; 650 input samples (approximately 1 : 5 s at 44 :kHz).
We do not use padding in convolutional layers.
We apply ReLU activation for all the hidden layers and batch normalization (Ioffe & Szegedy, 2015) to the output of conv1–conv10.
We also apply dropout (Srivastava et al., 2014) to the output of fc11 and fc12.
[Table]