ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Fusing Conditional Submodular GAN and Programmatic Weak Supervision

Shubham, K and Sastry, P and Prathosh, AP (2024) Fusing Conditional Submodular GAN and Programmatic Weak Supervision. In: UNSPECIFIED, pp. 15020-15028.

[img]
Preview
PDF
pro_aaa_con_art_int_38_13_2024.pdf - Published Version

Download (214kB) | Preview
Official URL: https://doi.org/10.1609/aaai.v38i13.29423

Abstract

Programmatic Weak Supervision (PWS) and generative models serve as crucial tools that enable researchers to maximize the utility of existing datasets without resorting to laborious data gathering and manual annotation processes. PWS uses various weak supervision techniques to estimate the underlying class labels of data, while generative models primarily concentrate on sampling from the underlying distribution of the given dataset. Although these methods have the potential to complement each other, they have mostly been studied independently. Recently, WSGAN proposed a mechanism to fuse these two models. Their approach utilizes the discrete latent factors of InfoGAN to train the label model and leverages the class-dependent information of the label model to generate images of specific classes. However, the disentangled latent factors learned by InfoGAN might not necessarily be class-specific and could potentially affect the label model�s accuracy. Moreover, prediction made by the label model is often noisy in nature and can have a detrimental impact on the quality of images generated by GAN. In our work, we address these challenges by (i) implementing a noise-aware classifier using the pseudo labels generated by the label model (ii) utilizing the noise-aware classifier�s prediction to train the label model and generate class-conditional images. Additionally, we also investigate the effect of training the classifier with a subset of the dataset within a defined uncertainty budget on pseudo labels. We accomplish this by formalizing the subset selection problem as a submodular maximization objective with a knapsack constraint on the entropy of pseudo labels. We conduct experiments on multiple datasets and demonstrate the efficacy of our methods on several tasks vis-a-vis the current state-of-the-art methods. Copyright © 2024, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Item Type: Conference Paper
Publication: Proceedings of the AAAI Conference on Artificial Intelligence
Publisher: Association for the Advancement of Artificial Intelligence
Additional Information: The copyright for this article belongs to authors.
Keywords: Artificial intelligence; Classification (of information); Combinatorial optimization, Class labels; Data gathering; Generative model; Latent factor; Manual annotation; Programmatics; Specific class; Submodular; Supervision models; Underlying distribution, Budget control
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Others
Date Deposited: 20 May 2024 11:42
Last Modified: 20 May 2024 11:42
URI: https://eprints.iisc.ac.in/id/eprint/84813

Actions (login required)

View Item View Item