On Leveraging Variational Graph Embeddings for Open World Compositional Zero-Shot Learning
Muhammad Umer Anwaar, Zhihui Pan, Martin Kleinsteuber

TL;DR
This paper introduces CVGAE, a scalable variational graph autoencoder for open-world compositional zero-shot learning, enabling better generalization to novel concept compositions in real-world scenarios.
Contribution
The paper proposes CVGAE, a scalable and efficient variational graph autoencoder that models concept feasibility and improves compositional zero-shot learning performance.
Findings
CVGAE outperforms SOTA methods in scalability and accuracy.
CVGAE achieves better compositional generalization in image retrieval.
Significantly reduces computational complexity compared to existing approaches.
Abstract
Humans are able to identify and categorize novel compositions of known concepts. The task in Compositional Zero-Shot learning (CZSL) is to learn composition of primitive concepts, i.e. objects and states, in such a way that even their novel compositions can be zero-shot classified. In this work, we do not assume any prior knowledge on the feasibility of novel compositions i.e.open-world setting, where infeasible compositions dominate the search space. We propose a Compositional Variational Graph Autoencoder (CVGAE) approach for learning the variational embeddings of the primitive concepts (nodes) as well as feasibility of their compositions (via edges). Such modelling makes CVGAE scalable to real-world application scenarios. This is in contrast to SOTA method, CGE, which is computationally very expensive. e.g.for benchmark C-GQA dataset, CGE requires 3.94 x 10^5 nodes, whereas CVGAE…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning
