Practical settings require recognition models to have the ability to learn from few labeled samples and be extended to novel classes where data annotation is infeasible or data of new object classes are included with time. However, deep learning models are not suited directly for such settings due to their reliance on labeled data during training. On the other hand, humans perform well under such conditions due to their capability to transfer semantics and recast information from high-level descriptions to visual space, enabling them to recognize objects that they have never seen before. Zero-shot learning (ZSL) aims to bridge this gap by providing recognition models with the capability to classify images of novel classes that have not been seen during the training phase. The model is given access to semantic description of the novel unseen classes during training (such as embeddings of attributes of the classes) and is expected to recognize unseen class images by knowledge transfer between visual and semantic domains.
Based on the classes that a model sees in the test phase, the ZSL problem is generally categorized into two settings: conventional and generalized zero-shot. In conventional ZSL, the image features to be recognized at test time belong only to unseen classes. In the generalized ZSL (GZSL) setting, the images at test time may belong to both seen or unseen classes. The GSZL setting is practically more useful and challenging when we compare to the conventional setting, since the assumption that images at test time come only from unseen classes need not hold. We aim to address the generalized zero-shot learning problem in this work.
A potential approach to address generalized zero-shot learning is to utilize generative models to generate features for unseen classes and reduce the zero-shot problem to a supervised learning problem[thirteen, fourteen, fifteen, sixteen, eighteen]. Most existing methods in this direction simply use a unidirectional mapping by generating visual features conditioned on semantic attributes. However, it has been shown that such methods that rely on unidirectional mapping lose out a tight visual-semantic coupling which is crucial for zero-shot recognition [gdan, dascn]. To address this issue, more recent approaches such as [gdan, dascn] have proposed to use bidirectional mapping between visual and semantic domains to enhance zero-shot recognition performance.
In this work, we propose a holistic unified approach for bidirectional mapping that provides a tight coupling between the semantic and visual spaces, and is also expressive enough to capture the complex distributions of the underlying data. Our key contributions are as follows (Figure 1 summarizes our overall framework):
(1) Unlike most existing methods that use only a generative module, we augment the generative network with an inference network, and train them together to maximize the joint likelihood of visual and semantic features. Learning the inference network jointly with the generative model helps us capture the underlying modes of the data distribution better [ali].
(2) We provide a two-level adversarial training strategy, where we train both generative and inference modules through respective discriminators. We also use an adversarial joint-maximization loss as an additional supervisory signal to enhance the visual-semantic coupling and facilitate better cross-domain information transfer. This helps our model outperform other dual learning based methods which lack such a mechanism.
(3) We use a novel Wasserstein semantic alignment loss that helps us model the joint distribution of visual and semantic features better, and ensures that the generated semantic features are distributionally aligned with real semantic features, which in turn helps lower loss in the semantic space.
(4) Furthermore, we use the discriminative information in latent layers of the inference network to train our final recognition model. This helps provide the final recognition module with representations from both generative and inference modules, and thus enhances performance when compared to earlier approaches that use only the synthesized image features in the final recognition model.
(5) We perform detailed experimental studies and analysis on Caltech-UCSD Birds (CUB), Oxford Flowers (FLO) and Animals and Attributes (AWA1 and AWA2) datasets. We demonstrate that the proposed method helps in better visual-semantic coupling, and thus obtains state-of-the art performance, outperforming other methods on both fine-grained as well as coarse-grained datasets.
To the best of our knowledge, this is the first effort to employ a joint maximization step in adversarial training to provide deeper visual-semantic coupling for solving generalized zero-shot learning. In addition, the new idea of using an adversarially learned discriminative representation from the latent layers of inference network, along with the generated features from the generator to train the final zero-shot recognition model, significantly improves GZSL performance. The use of a Wasserstein alignment loss to preserve semantics is also the first of its kind to be used in a generative approach to GZSL.
2 Related Work
As stated in Section 1, existing work in ZSL can be broadly divided into work on conventional ZSL and work on generalized ZSL (GZSL). This work focuses on the more challenging GZSL setting, and we focus on presenting related literature in GZSL in this section.
There has been a recent increase in efforts in the field of zero-shot learning with the aim of boosting GZSL performance. The methods proposed so far can be broadly categorised into approaches that learn a projection function based on seen class image features [four, five, seven, sync, nine, six, dem, zskl, dcn, twelve] or generative network based methods which aim to synthesize unseen class features reducing GZSL to a standard supervised problem [fourteen, thirteen, gdan, dascn, se, gzlocd, sgal, sixteen, eighteen, zsml, gmn]. We focus on recent related methods in the rest of this section. The authors in [twelve] first proposed to leverage multi-modal learning by learning a joint embedding of image and textual features for GZSL. They utilized a common representation learning along with cross-domain alignment to map and align visual and semantic features in a common latent space. To alleviate the bias problem, generative methods for GZSL have been proposed. These methods generally combine adversarial loss and classification loss to generate discriminative features for unseen classes conditioned on semantic attributes. Methods like f-clsWGAN [fourteen], CVAE [fifteen], [sixteen]
used conditional Generative Adversarial Networks (GANs) or Variational Autoencoders (VAE) for generation of unseen class features.[thirteen] tried combining multi-modal learning with generative GZSL approaches and learned a cross-aligned multi-modal VAE to generate latent features for unseen classes and later trained a softmax classifier on latents from all classes. More recently, [eighteen] proposed to combine the strengths of VAEs and GANs by using the decoder of VAE as a generator. On the other hand, GDAN [gdan] and DASCN [dascn] formulates a dual learning framework that uses bidirectional mapping between visual and semantic spaces, and trained the model with adversarial loss and cyclic consistency. All of these efforts showed the need to enforce stronger coupling between the visual domain (images) and the semantic domain (image attributes provided for seen and unseen classes) in different ways. Our work is closest to GDAN [gdan] and DASCN [dascn] in this regard, and also comes in the category of methods that learn a bidirectional mapping. However, there many differences as described below. Importantly, our approach unifies ideas from existing approaches.
In DASCN [dascn], in the formulation of dual GAN, the visual to semantic mapping network never sees real image features and only has access to the features generated by the primal generator. As pointed out in [twentytwo], since the generated image features are practically not as good as actual features, this inhibits the ability of the network to make full use of the dual learning paradigm since the flow of information from visual to semantic domains is partial. On the other hand, GDAN [gdan] uses a regressor to implement dual learning which maps the generated features back to the attribute space. As pointed out in [dascn], minimizing L2-norm between generated semantic embeddings and real semantic attributes is weak and unreliable to preserve high-level semantics when using Euclidean distance. Furthermore, in the objective of GDAN, the only way the generative network and regressor interact with each other is via an L2-norm based cyclic loss which does not provide a strong coupling between the visual and semantic domains.
In contrast, in our formulation, adversarial learning is introduced in a two-level fashion, where both generative and inference modules are first adversarially learned (see Figure 1
). We subsequently then introduce a new adversarial joint maximization loss which specifically aims to maximize the joint probability of visual and semantic features. This is achieved through a joint discriminator, which has a slightly different formulation from a traditional discriminator (as used in GDAN[gdan] and DASCN [dascn]). As pointed in [twentytwo], learning a regressor by minimizing reconstruction loss performs poorly when compared to learning an inference network jointly. This helps our model generates features that better represent the underlying distribution of unseen classes. Besides, our design provides our inference network with access to real image features, which facilitates stronger cross-domain coupling with improved representations. Also, our Wasserstein semantic alignment loss enables us to preserve semantics and alleviate semantic loss better than L2 loss. To show the benefits of our method over GDAN and DASCN, we directly compare with them (as well as many other recent methods) on four different GZSL learning benchmark datasets, and show that our method provides the new state-of-the-art for GZSL.
3 Proposed Methodology
We begin our description of the proposed methodology by defining the problem setting and notations, followed by descriptions of each module of our framework.
Problem Setting: Given the dataset , the aim of generalized zero-shot learning is to correctly classify images from both seen and unseen classes during the test phase. Here, is the training set, where x is an image feature, is the feature space of seen classes, is the label corresponding to x, is the set of labels for seen classes, is the semantic attribute vector for class . Similarly, is the test set, where represents the set of image features from unseen classes, represents the set of labels of unseen classes such that . Note that image features are typically extracted using a feature extractor backbone as shown in Figure 1. The GZSL task can be formally seen as learning the optimal parameters of a classifier where x denote the image features and , denote the set of labels of seen and unseen classes respectively.
Mathematical Framework: GZSL can be formulated as a problem of modeling joint probability where x, h and y are as described above. The joint probability can be factored in two ways:
While most existing work consider one of these factorizations in their approach, we use both the factorizations, and model each of them using separate modules, viz. the generative module and inference module as shown in Figure 1.
For modeling F1, we have the marginal since we have access to the visual features x of seen classes. The second term , the conditional probability of h given the input x, is modeled by an inference network. Thus, Eqn 1 can be written as:
where is the output of the inference module. Now, the term can be factorized as:
Here, the factor can be taken as unity, since a known h has a direct map to the label. We attempt to use a Wasserstein alignment to ensures that the is close to the original h in this work. Hence, the joint distribution in factorization F1 can now be written as:
For modeling F2, we are provided with the marginal , since we have access to the attributes h of seen classes. The second term , the conditional probability of x given h, is modeled by a generative network. refers to the extra classification constraint that is present in the loss formulation of our generative network (see Eqn 9). Thus, Eqn 2 reduces to:
To provide strong coupling between the generative and inference modules, we also train the generative and inference networks by maximizing the joint probability and matching Eqns 5 and 6, which we describe later in this section. To this end, we introduce a joint discriminator (see Figure 1 top), whose goal is to match the joint probability by discriminating between a combination of generated and real features i.e real image feature, generated semantic feature and generated image feature, real semantic feature (as shown in Figure 1). This is different from a vanilla discriminator (such as , in the figure) which only discriminate between generated and real features.
3.1 Generative Module
Given the training data , the objective of the generative module is to learn a feature generating model conditioned on the semantic attribute vectors, i.e., it should be able to generate discriminative image features that represent the underlying data distribution well. We follow the formulation in [fourteen] for our baseline generative network. The input to generator and the discriminator are semantic attributes h and image features x of seen classes. The generator learns a mapping by taking a random Gaussian noise vector z concatenated with the attribute vector h as input and generating image features . We use a Wasserstein GAN [thirty] for this purpose with the loss given by:
where is the generated feature, with , and is a weighting coefficient. In order to ensure that the features generated from the network are discriminative, in addition to the adversarial loss, the generated features are required to minimize the classification loss evaluated over a softmax classifier pretrained on seen class features as in [fourteen]:
The final loss for the generative module is then given by:
is a hyperparameter weighting the classifier.
3.2 Inference Module
It has been shown [ali] that augmenting a generative model with an inference network enhances the ability of the model to capture different modes of the data distribution well and generate samples which better represent the underlying distribution. Since the performance of GZSL depends greatly on the quality of synthesized features, we hypothesize that learning an inference network jointly with the generative model will help our model to express the actual data distribution well and generalize to unseen classes better.
The inference network and the discriminator together form the Inference Module as shown in Figure 1. The goal of the inference network is to learn a mapping from image/visual space to semantic space. The module learns a network that maps input image features to corresponding semantic attributes i.e. it attempts to infer the semantic attributes that generated the image in the generation module. The discriminator
outputs a real value. This is also learned through a WGAN, and the loss function is given by:
where is the generated semantic attribute, with , and is a weighting coefficient.
In addition, we use a Wasserstein metric-based alignment loss at the output of the inference network. This aims to ensures that the distribution of class centres of output semantic attributes aligns with the distribution of ground truth h, enabling us to preserve semantic information better. The overall loss function for this module is then given by:
where is computed using the sinkhorn distance as in [tdsl], and is a weighting coefficient. More details of this alignment loss term is provided in the Supplementary Section.
3.3 Adversarial Joint Maximization
Existing zero-shot approaches have hitherto not considered the use of a third joint maximization step to improve visual-semantic coupling and cross-domain knowledge transfer. We introduce the use of a joint maximization loss as an additional supervisory signal to enhance visual-semantic interaction. We match the joint probability of visual-semantic features using a joint discriminator as shown in Figure 1. The joint discriminator is formulated as follows:
where , are the generated semantic attributes and image features respectively. and with , as before, and is a weighting coefficient. Note that the joint discriminator is formulated differently form vanilla discriminators , as mentioned earlier. aims to discriminate between the pairs and which enables it to match () and () (also shown in Figure 1 top).
On the other hand, while aims to optimizes Eqn 12, the generator and inference networks jointly maximize:
Note that the difference between Eqns 13 and 12 is only a regularizer term which is added to improve . In summary, the generative and inference modules are jointly trained to optimize the final objective, given as:
3.4 Recognition module
In previously proposed zero-shot methods, once the generative model is trained, it is used to generated images features for the unseen classes. However, the synthesized image features by themselves might not be discriminative enough to get best GZSL performance. In order to address this issue and obtain highly discriminative features for training the classifier in the recognition module, we train the final classifier using the adversarially learned representation in the intermediate layers and the output of the inference network.
To this end, we combine seen class image features from and synthesized features for unseen classes from the trained generator into a set, . We then pass the image features in through the pre-trained inference network and get the output , as well as internal intermediate features from the inference network. These are concatenated and used to train the final classifier. For fair comparison with other methods, we use a single layered softmax classifier (as used in most earlier efforts).
At test time, for an input image feature , we pass it through the inference network and get the internal feature vectors f and output . We concatenate these with the test image vector (output of generator module), and pass it to the softmax classifier, given by:
where for GZSL, and are the parameters of our overall architecture.
|DEM(CVPR’17)[dem]||19. 6||57. 9||29. 2||-||-||-||32. 8||84. 7||47. 3||30. 5||86. 4||45. 1|
|ZSKL(CVPR’18)[zskl]||21. 6||52. 8||30. 6||-||-||-||18. 3||79. 3||29. 8||18. 9||82. 7||30. 8|
|DCN(CVPR’18)[dcn]||28. 4||60. 7||38. 7||-||-||-||-||-||-||25. 5||84. 2||39. 1|
|ALE(CVPR’13)[four]||23. 7||62. 8||34. 4||13. 3||61. 6||21. 9||16. 8||76. 1||27. 5||81. 8||14. 0||23. 9|
|DEVISE(CVPR’13)[five]||23. 8||53. 0||32. 8||9. 9||44. 2||16. 2||13. 4||68. 7||22. 4||74. 7||17. 1||27. 8|
|ESZSL(CVPR’15)[seven]||12. 6||63. 8||21. 0||11. 4||56. 8||19. 0||6. 6||75. 6||12. 1||77. 8||5. 9||11. 0|
|SYNC(CVPR’16)[sync]||11. 5||70. 9||19. 8||-||-||-||8. 9||87. 3||16. 2||90. 5||10. 0||18. 0|
|LATEM(CVPR’16)[nine]||15. 2||57. 3||24. 0||-||-||-||7. 3||71. 7||13. 3||77. 3||11. 5||20. 0|
|SJE(CVPR’15)[six]||23. 5||59. 2||33. 6||13. 9||47. 6||21. 5||74. 6||11. 3||19. 6||73. 9||8. 0||14. 4|
|CLSWGAN(CVPR’18)[fourteen]||43. 7*||57. 7*||49. 7*||59. 0||73. 8||65. 6||-||-||-||57. 9||61. 4||59. 6|
|CADA-VAE(CVPR’19)[thirteen]||53. 5||51. 6||52. 4*||-||-||-||72. 8||57. 3||64. 1||75. 0||55. 8||63. 9|
|GZLOCD(CVPR’20)[gzlocd]||44. 8*||59. 9*||51. 3*||-||-||-||-||-||-||59.5||73.4||65.7|
|GDAN(NIPS’19)[gdan]||39. 3*||66. 7*||49. 5*||-||-||-||-||-||-||32. 1||67. 5||43. 5|
|DASCN(NIPS’19)[dascn]||45. 9*||59. 0*||51. 6*||-||-||-||59. 3||68. 0||63. 4||-||-||-|
|SGAL(NIPS’19)[sgal]||40. 9*||55. 3*||47. 0*||-||-||-||52. 7||75. 7||62. 2||55. 1||81. 2||65. 6|
|SE-GZSL(CVPR’18)[se]||41. 5||53. 3||46. 7||-||-||-||56. 3||67. 8||61. 5||58. 3||68. 1||62. 8|
|CycWGAN(ECCV’18)[sixteen]||47. 9||59. 3||53. 0||61. 6||69. 2||65. 2||59. 6||63. 4||59. 8||59. 6||63. 4||59. 8|
|f-VAEGAN(CVPR’19)[eighteen]||48. 4||60. 1||53. 6||56. 8||74. 9||64. 6||-||-||-||57. 6||70. 6||63. 5|
|ZSML(AAAI’20)[zsml]||60. 0||52. 1||55. 7||-||-||-||57.4||71.1||63.5||58.9||74.6||65.8|
|Ours||61.2||57.7||59.4||60. 6||81. 1||69. 4||60.5||71.9,||65.7||59.4,||74.2,||66.0|
|Ours-312||51.8*||60. 0*||55. 6*||60. 6||81. 1||69. 4||60.5||71.9,||65.7||59.4,||74.2,||66.0|
the backbone ResNet101 feature extractor. We measure Top-1 accuracy on Unseen(U), Seen(S) classes and their Harmonic mean(H). Best results are highlighted in bold. * indicates result on CUB dataset with only 312 dim attributes (included for fair comparison with other work that use this setting)
4 Experiments and Results
In this section, we conduct extensive experiments on four public benchmark datasets under the generalized zero-shot learning setting. We compare our model with several baselines and state-of-the-art methods on four benchmark datasets: CUB [cub], FLO [flo], AWA1 [awa] and AWA2 [awa]. Among these datasets, AWA1 and AWA2 are coarse-grained, while FLO and CUB are fine-grained datasets. We follow the standard training/validation/testing splits and evaluation protocols, as in [twentysix]. Following the protocol in [twentysix], we use ResNet101 as the feature extractor backbone network for fair comparison. We denote this backbone by henceforth, for convenience. Recently, [sabr] proposed to transform the ResNet-101 image features and use an 1024-dimensional intermediate representation as input features to overcome hubness and preserve semantic relations. To show the generalizability of our approach, we also evaluate our model on features provided by [sabr]. The feature extractor network corresponding to these 1024-dimensional features is denoted as , henceforth. We use the class attributes/embeddings provided in [twentysix] for each dataset, which represents the h(.) in our approach (Fig 1). For CUB and FLO datasets, we use additional 1024-dimensional character-based CNN-RNN features as in [eighteen][gmn], unless explicitly stated otherwise. We use the average-per-class top 1 accuracy metric to evaluate our model on a set of classes, as generally followed [twentysix]. In order to evaluate and compare our model in the GZSL setting, we report the harmonic mean of our model performance on both seen and unseen classes[twentysix]. For fair comparison, we follow the architecture used in [eighteen] for all our components. Due to space constraints, we provide the details of each component in the supplementary material.
Training error trajectory over epochs for proposed method
t-SNE visualisations of unseen class features on FLO dataset, which are input to softmax layer of zero-shot classifier (recognition module):(Left) f-VAEGAN; (Right) Ours
Table 1 shows the performance comparison of our model with multiple baselines and state-of-the-art methods in GZSL. The table is divided into two sections, which show the performance of non-generative (top) and generative GZSL approaches (bottom) respectively.For fair comparison,all results reported are without fine-tuning the backbone ResNet-101 network. It can be clearly seen that our methodology consistently outperforms other approaches across all four datasets. Note that GZSL is a challenging problem and most existing methods have not been able to maintain consistently high performance on both fine-grained and coarse-grained datasets. Thanks to the joint-maximization loss and Wasserstein alignment which enables our model to facilitate better cross-domain coupling and learn a useful discriminative representation, our method is able to outperform even other approaches which utilize bidirectional mapping i.e [gdan, dascn] across all datasets with varying granularity. We also note that our method consistently outperforms approaches like [sixteen, gdan, dascn] which use a cyclic consistency to model visual-semantic interaction.
In Table 1, we also show the results for our method using as the feature extractor backbone for CUB (fine-grained) and AWA2 (coarse-grained) datasets. We see that GZSL performance increases from 59.4 to 65.35 in CUB, and 66.0 to 68.5 in AWA2. This shows that our model generalizes well to different feature extractor backbones and is not specific to learning from only ResNet-101 features.
Visualizing Generated Features:
To visualize the unseen class image features generated by our method, we sample 200 synthesized feature vectors for each unseen class for the FLO dataset and plot them using t-SNE as shown in Fig 3. In addition, we also show the mean of all synthesized features (represented by ) and the mean of real unseen classes features (represented by ). It is evident that for most classes, the center/mean of generated synthetic features coincides or is very close to the center of actual unseen class image features. This verifies that our model captures the modes of the underlying distribution well. Furthermore, it can be seen that the features of unseen classes form distinct clusters for most cases which shows the discriminative ability of the generated features.
We note that both at training and test times, our method has time complexity comparable to any other recent GZSL method, and no additional overheads.
5 Ablation Studies and Analysis
We show several ablation studies to show the usefulness of different components as well as the sensitivity of our method to hyperparameter choices in this section. Similar to [thirteen, gdan, sgal, gzlocd], we use 312-dimensional semantic attributes for our ablation studies on CUB in these studies.
Relevance of Each Component in our Approach: Table 2 shows the performance enhancement that each module of our overall architecture brings to GZSL performance.
corresponds to using only the baseline generative module as explained in Section 3.1.
corresponds to the use of baseline generative module, along with the inference module trained using joint maximization loss. Both and have the final recognition module trained solely on synthesized image features (i.e ) without any latent representations from the inference module.
denotes the use of , along with the use of output of inference network and latent representations from the intermediate layers of the inference module in the recognition module.
Lastly, denotes our complete model, with the Wasserstein alignment loss added to .
|= Baseline Generative Module||51.9||61.1|
|= + Inference module + Joint maximization||52.7||62.5|
|= + Additional features for recognition module||54.4||65.4|
|= + Wasserstein alignment||55.6||65.7|
We draw the following conclusions from Table 2. Training the generative module along with the inference network and joint maximization improves performance for both fine-grained and coarse-grained datasets. The improvement is higher for the coarse-grained dataset, since visual-semantic knowledge transfer becomes more important when classes are farther apart. Utilizing features from inference network gives a strong boost in GZSL performance for both datasets, showing the importance of good features at final recognition time. Lastly, the Wasserstein alignment also adds improvement for both datasets, although more significantly in fine-grained datasets (CUB). We hypothesize that this is because the classes are close in such datasets, and aligning the distribution of semantic attributes appropriately leads to clearer decision boundary between classes.
Hyperparameter Choices: In Figures 1(a), 1(b), and 1(c), we plot the variation in seen class, unseen class and harmonic mean performance with change in hyperparameters , , and respectively - for both coarse-grained and fine-grained datasets. In Figure 1(b), the best performance is obtained at for the coarse-grained dataset AWA1, and at for the fine-grained dataset CUB. For more careful analysis, the variation of harmonic mean accuracy is also shown in Figure 1(d)(left) where we plot the GZSL performance on a smaller scale for the sake of clarity. It can be seen that the performance increases with increase in for AWA1 (coarse-grained), while it decreases after a certain point for CUB (fine-grained). This behavior is expected since a higher value of is required in case of coarse-grained datasets, when compared with fine-grained datasets, as it is more difficult to learn from seen classes and generalize to unseen classes for coarse-grained datasets due to classes being more different. In case of Figures 1(a) and 1(c), we note that higher values of and provides the best performance for both CUB and AWA1, showing the importance of the proposed terms. The improvement of higher values of and is greater in AWA1, which we ascribe to the same reason described above for .
Stability and Generalization: Training Generative Adversarial Networks is in general known to be difficult due to an inherently unstable training procedure. In Figure 1(d)(right), we show the training error trajectories over epochs for CUB and AWA1 datasets. We see that the training error smoothly decreases with a stable trend, and reaches convergence within 100 epochs for both fine-grained as well as coarse-grained datasets.
Usefulness of Latent Features in Recognition Module: In order to study the usefulness of using latent feature representations from intermediate layers of the inference network, we plot the representation before the softmax activation layer of the zero-shot classifier (recognition module) of our method and f-VAEGAN-D2, a recent state-of-the-art method, for the FLO dataset in Fig 1(e). We visualize the representations for unseen classes (20 classes), since visualizing the seen classes (82 classes) can be cluttered due to their high number. Notice that the clusters for our method (right subfigure) are more compact than those of f-VAEGAN-D2 (left subfigure) for almost all classes. The clusters in f-VAEGAN-D2 show features from one class potentially leaking into other classes, which can result in misclassification. This is however improved in our approach.
Variation with Number of Synthesized Features: Fig 1(f) shows the performance of our model with varying number of synthesized examples for unseen classes. Note that the trend for harmonic mean is stable with variation in number of synthesized features for both fine and coarse-grained datasets.
In this work, we propose a unified approach for the generalized zero-shot learning problem that uses a two-level adversarial learning strategy for tight visual-semantic coupling. We use adversarial learning at the level of individual generative and inference modules, as well as use a separate joint maximization constraint across the two modules. In addition, we also show that using the latent representation of intermediate layers of the inference network improves recognition performance. This helps our model unify existing latent representation and generative approaches in a single pipeline. Our contributions in this framework enable us to capture the several modes of the data distribution better and improve GZSL performance by providing stronger visual-semantic coupling. We conduct extensive experiments on four benchmark datasets and demonstrate the value of the proposed method across these fine-grained and coarse-grained datasets. Our future work will include coming up with other ways of performing the joint maximization, as well as considering alignments beyond Wasserstein alignment to improve GZSL performance.
We are grateful to the Department of Science and Technology, India; Ministry of Electronics and Information Technology, India; as well as Intel India for the financial support of this project. We also thank the Japan International Cooperation Agency and IIT-Hyderabad for the provision of GPU servers used for this work. We thank Joseph KJ and Sai Srinivas for all the insightful discussions, that improved the presentation of this work.