I Introduction
Deep neural networks (DNNs) have met with success multiple tasks, and testified a constantly increasing popularity, being able to deal with the vast heterogeneity of data and to provide stateoftheart results across many fields and domains [1, 2]
. Convolutional Neural Networks (CNNs)
[3, 4] are one of the protagonists of this success. Starting from AlexNet [5], until the most recent convolutionalbased architectures [6, 7, 8]CNNs have proved to be especially useful in the field of computer vision, improving the classification accuracy in many datasets
[9, 10].However, a common caveat of large CNNs is that they require a lot of training data in order to work well. In the presence of classification tasks on small datasets, typically those networks are pretrained
in a very large dataset like ImageNet
[9], and then finetuned on the dataset the problem is set on. The idea is that the pretrained network has stored a decent amount of information regarding features which are common to the majority of images, and in many cases this knowledge can be transferred to different datasets or to solve different problems (image segmentation, localization, detection, etc.). This technique is referred as transfer learning [11] and has been an important ingredient in the success and popularization of CNNs. Another important technique – very often paired with the previous one – is data augmentation, through which small transformations are directly applied on the images. A nice characteristic of data augmentation is its agnosticism toward algorithms and datasets. [12] used this technique to achieve stateoftheart results in MNIST dataset [13], while [5] used the method almost without any changes to improve the accuracy of their CNN in the ImageNet dataset [9]. Since then, data augmentation has been used in virtually every implementation of CNNs in the field of computer vision.Despite the practicality of the abovementioned techniques, when the number of images per class is extremely small, the performances of CNNs rapidly degrade and leave much to be desired. The high availability of unlabeled data only solves half of the problem, since the manual labeling process is usually costly, tedious and prone to human error. Under these assumptions, we propose a new method to perform an automatic labeling, called transductive label augmentation. Starting from a very small labeled dataset, we set an automatic label propagation procedure, that relies on graph transduction techniques, to label a large unlabeled set of data. This method takes advantage of secondorder similarity information among the data objects, a source of information which is not directly exploited by traditional techniques. To assess our statements, we perform a series of experiments with different CNN architectures and datasets, comparing the results with a firstorder “label propagator”.
In summary, our contributions in this article are as follows: a) by using graph transductive approaches, we propose and develop the aforementioned label augmentation method and use it to improve the accuracy of stateoftheart CNNs in datasets where the number of labels is limited; b) by gradually increasing the number of labeled objects, we give detailed results in three standard computer vision datasets and compare the results with the results of CNNs; c) we replace our transductive algorithm with linear support vector machines (SVM)
[14] to perform label augmentation and compare the results; d) we give directions for future work and how the method can be used on other domains.Ia Related Work
Semisupervised label propagation has a long history of usage in the field of machine learning
[15]. Starting from an initial large dataset, with a small portion of labeled observations the traditional way of using semisupervised learning is to train a classifier only in the labeled part, and then use the classifier to predict labels for the unlabeled part. The labels predicted in this way are called
pseudolabels. The classifier is then trained in the entire dataset, considering the pseudolabels as if they were real labels.Different methods with the same intent have been previously proposed. In deep learning in particular, there have been devised algorithms to use data with a small number of labeled observations. [16]
trained the network jointly in both the labeled and unlabeled points. The final loss function is a weighted loss of both labeled and unlabeled points, where in the case of the unlabeled points, the pseudolabel is determined by the highest score proposed by the model.
[17] optimized a CNN on such a way as to produce embeddings that have high similarities for the observations that belong to the same class. [18] used a totally different approach, developing a generative model that allows for effective generalization from small labeled datasets to large unlabeled ones.In all the mentioned methods, the way how the unlabeled data has been used can be considered as an intrinsic property of their engineered neural networks. Our choice of CNNs as the algorithm used for the experiments was motivated because CNNs are stateoftheart models in computer vision, but the approach is more general than that. The method presented in this article does not even require a neural network and in principle, nonfeature based observations (i.e graphs) can be considered, as long as a similarity measure can be derived for them. At the same time, the method shows good results in relatively complex image datasets, improving over the results of stateoftheart CNNs.
Ii Graph Transduction Game
Graph Transduction (GT) is a subfamily of semisupervised learning that aims to classify unlabeled objects starting from a small set of labeled ones. In particular, in GT the data is modeled as a graph whose vertices are the objects in a dataset. The provided label information is then propagated all over the unlabeled objects through the edges, weighted according to the consistency of object pairs. The reader is encouraged to refer to [19] for a detailed description of algorithms and applications on graph transduction.
More formally, let be a graph. is the vertex set of the objects and can be partitioned in two sets: contains the labeled objects, where is a realvalued vector describing the object (features), and is its associated label, while is the set of unlabeled objects. is the set of edges connecting the vertices and is a weight function that assigns a nonnegative similarity measure to each edge in , and can be summarized in a weight matrix .
In [19], GT takes in input along with initial probability distributions for every objects – onehot labels for , soft labels for – and iteratively applies a function where is the standard simplex. At each iteration, if the distributions of labeled objects have changed, they are reset. Once the algorithm reaches the convergence, the resulting final probabilities give a labeling over the entire set of objects.
In this article, we follow the approach proposed in [20], where the authors interpret the graph transduction task as a noncooperative multiplayer game. The same methodology has been successfully applied in different context, e.g. bioinformatics [21] and matrix factorization [22].
In graph transduction game (GTG), objects of a dataset are represented as players and their labels as strategies. In synthesis, a noncooperative multiplayer game is played among the objects, until an equilibrium condition is reached, the Nash Equilibria [23]
. Here, we provide some basic knowledge on game theory in order to be selfcontained. Given a set of players
and a set of possible pure strategies :
mixed strategy: a mixed strategy is a probability distribution over the possible strategies for player . Then , where
is the standard dimensional simplex and is the probability of player choosing the pure strategy .

mixed strategy space: it corresponds to the set of all mixed strategies of the players

utility function: it represents the gain obtained by a player when it chooses a certain mixed strategy, in particular .
Here, it is assumed that the payoffs associated to each player are additively separable, thus the algorithm is a member of polymatrix games[24]. In GTG, the aforementioned definitions turns into the following:
Strategy space
The strategy space is the starting point of the game and contains all the mixed strategies. The space can be initialized in different ways based on the fact that some prior knowledge exists or not. Here, we distinguish the initialization based on the type of object, labeled or unlabeled. For the labeled object, since their class is known, a onehot vector is assigned:
(1) 
. For the unlabeled objects all the labels have the same probability of being associated to an object, thus:
(2) 
Payoff function
The utility function reflects the likelihood of choosing a particular label and considers the similarity between labeled and unlabeled players. Similar players influence each other more in picking one of the possible strategies (labels). Once the game reaches an equilibrium, every player play their best strategies which correspond to a consistent labeling [25] not only for the player itself but also for the others. Under equilibrium conditions the label of player is given by the strategy played with the highest probability. Formally, given a player and a strategy :
(3)  
(4) 
where is the utility received by player when it plays the mixed strategy and is the partial payoff matrix between players and . As in [20], where is the similarity between player and and
is the identity matrix of size
. The similarity function between players (objects) can be given or computed starting from the features. Given two objects and their features , , their similarity is computed following the method proposed by [26]:(5) 
where corresponds to the distance between and its nearest neighbors. Similarity values are stored in matrix .
Finding Nash Equilibria
The last component of our method is an algorithm for finding equilibrium conditions in this game. In [20] a result from Evolutionary Game Theory [27], named Replicator Dynamics (RD) [28] is used. The RD are a class of dynamical systems that perform a natural selection process on a multipopulation of strategies. The idea is to lead the fittest strategies to survive while the others to go extinct. More specifically the RD are defined as follow:
(6) 
where is the probability of strategy at time for player .
The RD are iterated until convergence, this means either the distance between two successive steps is zero (formally ) or a certain amount of iterations is reached (See [29] for a detailed analysis). In practical applications one could set the to a small number but typically 1020 iterations are sufficient.
Iii Label Generation
The previously explained framework can be applied to a dataset with many unlabeled objects to perform an automatic labeling and thus increase the availability of training objects. In this article we deal with datasets for image classification, but our approach can be applied in other domains too.
Preliminary step: both the labeled and unlabeled sets can be refined to obtain more informative feature vectors. In this article, we used fc7 features of CNNs trained on ImageNet, but in principle, any type of features can be considered. Our particular choice was motivated because fc7 features work significantly better than traditional computer vision features (SIFT [30] and its variations). While this might seem counterintuitive (using pretrained CNNs on ImageNet, while we are solving the problem of limited labeled data), we need to consider that our datasets are different from ImageNet (they come from different distributions), and by using some other dataset to pretrain our networks, we are not going against the spirit of the idea of the paper.
Step 1
: the objects are assigned to initial probability distributions, needed to start the GTG. The labeled ones use their respective onehot label representations, while the unlabeled ones can be set to a uniform distribution among all the labels. In presence of previous possessed information, some labels can be directly excluded in order to start from a multipeaked distribution, which if chosen wisely, can improve the final results.
Step 2: the extracted features are used to compute the similarity matrix . The literature [26] presents multiple methods to obtain a matrix and extra care should be taken when performing this step, since an incorrect choice in its computation can determine a failure in the transductive labeling.
Step 3: once is computed, graph transduction game can be played (up to convergence) among the objects to obtain the final probabilities which determine the label for the unlabeled objects.
The resulting labeled dataset can then be used to train a classification model. This is very convenient for several reasons: 1) CNNs are fully parametric models, so we do not need to store the training set in memory like in the case of graph transduction. In some aspect, the CNN is approximating in a parametric way the GTG algorithm; 2) the inference stage on CNNs is extremely fast (realtime); 3) CNN features can be used for other problems, like image segmentation, detection and classification, something that we cannot do with graphtransduction or with classical machine learning methods (like SVM). In the next section we will report the results obtained from stateoftheart CNNs, and compare those results with the same CNNs trained only on the labeled part of the dataset.
Iv Experiments
accuracy 2% labeled  caltech  indoors  scenenet  
RN18  DN121  RN18  DN121  RN18  DN121  
GTG + CNN  0.532  0.620  0.486  0.538  0.430  0.495 
SVM + CNN  0.473  0.539  0.434  0.468  0.370  0.417 
CNN  0.266  0.235  0.341  0.323  0.205  0.178 
F score 2% labeled  caltech  indoors  scenenet  
RN18  DN121  RN18  DN121  RN18  DN121  
GTG + CNN  0.468  0.559  0.357  0.396  0.399  0.457 
SVM + CNN  0.388  0.455  0.319  0.327  0.352  0.377 
CNN  0.181  0.151  0.187  0.172  0.191  0.167 
accuracy 5% labeled  caltech  indoors  scenenet  
RN18  DN121  RN18  DN121  RN18  DN121  
GTG + CNN  0.625  0.698  0.568  0.613  0.563  0.621 
SVM + CNN  0.605  0.675  0.516  0.580  0.511  0.601 
CNN  0.457  0.444  0.456  0.466  0.408  0.438 
F score 5% labeled  caltech  indoors  scenenet  
RN18  DN121  RN18  DN121  RN18  DN121  
GTG + CNN  0.571  0.653  0.454  0.508  0.536  0.608 
SVM + CNN  0.542  0.626  0.426  0.505  0.501  0.590 
CNN  0.372  0.358  0.345  0.306  0.394  0.419 
accuracy 10% labeled  caltech  indoors  scenenet  
RN18  DN121  RN18  DN121  RN18  DN121  
GTG + CNN  0.667  0.727  0.598  0.645  0.624  0.686 
SVM + CNN  0.658  0.724  0.576  0.635  0.622  0.660 
CNN  0.577  0.598  0.553  0.567  0.571  0.584 
F score 10% labeled  caltech  indoors  scenenet  
RN18  DN121  RN18  DN121  RN18  DN121  
GTG + CNN  0.622  0.694  0.509  0.574  0.609  0.700 
SVM + CNN  0.612  0.686  0.515  0.579  0.612  0.650 
CNN  0.519  0.533  0.478  0.471  0.565  0.570 
In order to assess the quality of the algorithm, we used it to automatically label three known realistic datasets, namely Caltech256 [31], Indoor Scene Recognition [32] and SceneNet100 [33]. Caltech256 contains images belonging to different categories and it is used for object recognition tasks. Indoor Scene Recognition is a dataset containing images of different common places (restaurants, bedrooms, etc.), divided in
categories and, as the name says, it is used for scene recognition.
SceneNet100 database is a publicly available online ontology for scene understanding that organizes scene categories according to their perceptual relationships. The dataset contains realworld images, separated into different classes.Each dataset was split in a training (70%) and a testing (30%) set. In addition, we further randomly split the training set in a small labeled part and a large unlabeled one, according to three different percentages for labeled objects (2%, 5%, 10%). For feature representation, we used two models belonging to stateoftheart CNN families of architectures, ResNet and DenseNet. In particular we used the smallest models offered in PyTorch library, the choice motivated by the fact that our datasets are relatively small, and so models with smaller number of parameters are expected to work better. The features were combined to generate the similarity matrix
, as described in Eq. 5. The matrix for GTG model was initialized as described in the previous section. We ran the GTG algorithm up to convergence, with the pseudolabels being computed by doing an over the final probability vectors.We then trained ResNet18 (RN18) and DenseNet121 (DN121) in the entire dataset, by not having a distinction between labels and pseudolabels, using Adam optimizer [34] with learning rate. We think that the results reported in this section are conservative, and can be improved with a more careful training of the networks, and by doing an exhaustive search over the space of hyperparameters.
For comparison, we performed an alternative approach, by replacing GTG with a firstorder information algorithm, namely linear SVM. While we experimented also with kernel SVM, we saw that its results are significantly worse than those of linear SVM, most likely because the features were generated from a CNN and so they are already quite good, having transformed the feature space in order to solve the classification problem linearly. No other transductive methods have been taken into consideration, since GTG has already been compared with them in [20, 21], showing that it performs better.
On Table I we give the results of the accuracy and F score on the testing set, in all three datasets, while the number of labels is only 2% for each of the datasets ( observations for Caltech256, observations for Indoor, and observations for Scenenet). In all three datasets, and both CNNs, our results are significantly better than those of CNNs trained only in the labeled data, or the results of the alternative approach when a linear SVM is used instead of GTG. Table II and Table III give the results of the accuracy and F score while the number of labeled images is 5%, respectively 10%. It can be seen that with the number of labeled points increasing, the performance boost of our model becomes smaller, but our performance still gives better (or equal) results to the alternative approach in all bar three cases, and it gives significantly better results than CNN in all cases.
Figure 3 shows the results of our approach compared with the other approach and with the results of CNN. We plotted the relative improvement of our model and the alternative approach over CNN. When the number of labels is very small (2%), in all three datasets we have significantly better improvements compared with the alternative approach. Increasing the number of labels to 5% and 10%, this trend persists. In all cases, our method gives significant improvements compared to CNN trained on only the labeled part of the dataset, with the most interesting case (only 2% of labeled observations), our model gives 36.24% relative improvement over CNN for ResNet18 and 50.29% relative improvement for DenseNet121.
V Conclusions and Future Work
In this paper, we proposed and developed a gametheoretic model which can be used as a semisupervised learning algorithm in order to label the unlabeled observations and so augment datasets. Different types of algorithms (including stateoftheart CNNs) can then be trained on the extended dataset, where the “pseudolabels” can be treated as normal labels.
Our method is not the only semisupervised learning model used to train deep learning methods, and at this stage, we do not claim that our method is the best one. However, to the best of our knowledge, the other methods are directed towards deep learning and incorporated within the learning algorithm itself. On the contrary, we offer a different perspective, developing a model which is algorithmagnostic, and which doesn’t even need the data to be on featurebased format.
Part of the future work will consist on tailoring our model specifically towards convolutional neural networks and to make comparisons with other semisupervised learning algorithms. In addition to this, we believe that the true potential of the model can be unleashed when the data is in some nontraditional format. In particular, we plan to use our model in the fields of bioinformatics and natural language processing, where nonconventional learning algorithms need to be developed. A direct extension of this work is to embed into the model the similarity between classes which has been proven to significantly boost the performances of learning algorithms.
Acknowledgements
This work was supported by Samsung Global Research Outreach Program. We thank the anonymous reviewers for their suggestions to improve the paper.
References
 [1] Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” Nature, vol. 521, no. 7553, p. 436, 2015.
 [2] J. Schmidhuber, “Deep learning in neural networks: An overview,” Neural Networks, vol. 61, pp. 85 – 117, 2015.

[3]
K. Fukushima and S. Miyake, “Neocognitron: A new algorithm for pattern recognition tolerant of deformations and shifts in position,”
Pattern Recognition, vol. 15, no. 6, pp. 455–469, 1982. 
[4]
Y. LeCun, B. E. Boser, J. S. Denker, D. Henderson, R. E. Howard, W. E. Hubbard, and L. D. Jackel, “Backpropagation applied to handwritten zip code recognition,”
Neural Computation, vol. 1, no. 4, pp. 541–551, 1989.  [5] A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” in Advances in Neural Information Processing Systems (NIPS), 2012, pp. 1097–1105.
 [6] C. Szegedy, W. Liu, Y. Jia, P. Sermanet, S. Reed, D. Anguelov, D. Erhan, V. Vanhoucke, and A. Rabinovich, “Going deeper with convolutions,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015, pp. 1–9.
 [7] K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2016, pp. 770–778.
 [8] G. Huang, Z. Liu, L. van der Maaten, and K. Q. Weinberger, “Densely connected convolutional networks,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017, pp. 2261–2269.
 [9] J. Deng, W. Dong, R. Socher, L. Li, K. Li, and F. Li, “Imagenet: A largescale hierarchical image database,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2009, pp. 248–255.
 [10] G. H. Alex Krizhevsky, “Learning multiple layers of features from tiny images,” University of Toronto, Tech. Rep., 2009.
 [11] J. Yosinski, J. Clune, Y. Bengio, and H. Lipson, “How transferable are features in deep neural networks?” in Advances in Neural Information Processing Systems (NIPS), 2014, pp. 3320–3328.
 [12] D. C. Ciresan, U. Meier, and J. Schmidhuber, “Multicolumn deep neural networks for image classification,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2012, pp. 3642–3649.
 [13] Y. Lecun, L. Bottou, Y. Bengio, and P. Haffner, “Gradientbased learning applied to document recognition,” Proceedings of the IEEE, vol. 86, no. 11, pp. 2278–2324, 1998.
 [14] C. Cortes and V. Vapnik, “Supportvector networks,” Machine Learning, vol. 20, pp. 273–297, 1995.
 [15] V. Vapnik, Statistical Learning Theory. New York: Wiley, 1998.
 [16] D. hyun Lee, “Pseudolabel: The simple and efficient semisupervised learning method for deep neural networks,” in Workshop on Challenges in Representation Learning (ICML), vol. 2, 2013, p. 3.
 [17] P. Häusser, A. Mordvintsev, and D. Cremers, “Learning by association  A versatile semisupervised training method for neural networks,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2017, pp. 626–635.
 [18] D. P. Kingma, S. Mohamed, D. J. Rezende, and M. Welling, “Semisupervised learning with deep generative models,” in Advances in Neural Information Processing Systems (NIPS), 2014, pp. 3581–3589.
 [19] X. Zhu, “Semisupervised learning with graphs,” Ph.D. dissertation, Pittsburgh, PA, USA, 2005.
 [20] A. Erdem and M. Pelillo, “Graph transduction as a noncooperative game,” Neural Computation, vol. 24, no. 3, pp. 700–723, 2012.
 [21] S. Vascon, M. Frasca, R. Tripodi, G. Valentini, and M. Pelillo, “Protein function prediction as a graphtransduction game,” Pattern Recognition Letters, 2018 (in press).
 [22] R. Tripodi, S. Vascon, and M. Pelillo, “Context aware nonnegative matrix factorization clustering,” in International Conference on Pattern Recognition, (ICPR), 2016, pp. 1719–1724.
 [23] J. Nash, “Noncooperative games,” Annals of Mathematics, pp. 286–295, 1951.
 [24] J. T. Howson Jr, “Equilibria of polymatrix games,” Management Science, vol. 18, no. 5part1, pp. 312–318, 1972.
 [25] D. A. Miller and S. W. Zucker, “Copositiveplus Lemke algorithm solves polymatrix games,” Operations Research Letters, vol. 10, no. 5, pp. 285–290, 1991.

[26]
L. ZelnikManor and P. Perona, “Selftuning spectral clustering,” in
Advances in Neural Information Processing Systems (NIPS), 2005, pp. 1601–1608.  [27] J. Weibull, Evolutionary Game Theory. MIT Press, 1997.
 [28] J. Maynard Smith, Evolution and the Theory of Games. Cambridge University Press, 1982.
 [29] M. Pelillo, “The dynamics of nonlinear relaxation labeling processes,” Journal of Mathematical Imaging and Vision, vol. 7, no. 4, pp. 309–323, 1997.
 [30] D. G. Lowe, “Distinctive image features from scaleinvariant keypoints,” International Journal of Computer Vision, vol. 60, no. 2, pp. 91–110, 2004.
 [31] G. Griffin, A. Holub, and P. Perona, “Caltech256 object category dataset,” California Institute of Technology, Tech. Rep., 2007.
 [32] A. Quattoni and A. Torralba, “Recognizing indoor scenes,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2009, pp. 413–420.
 [33] I. Kadar and O. BenShahar, “Scenenet: A perceptual ontology for scene understanding,” in European Conference on Computer Vision (ECCV). Springer, 2014, pp. 385–400.
 [34] D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” International Conference on Learning Representations (ICLR), 2014.
Comments
There are no comments yet.