Demo Data from EDBT 2026 / reviewers in the wild / expert
Pranav Sastry
dblp:365/4867
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Learning paradigms · 46% Generative modeling · 46% Optimization for machine learning · 7% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling › image generation › conditional image synthesis
class-conditional image synthesis |
0.8 | 1 | 2024 | Fusing Conditional Submodular GAN and Programmatic Weak Supervision · AAAI 2024 |
Machine learning › Generative modeling › generative adversarial network
conditional GAN |
0.8 | 1 | 2024 | Fusing Conditional Submodular GAN and Programmatic Weak Supervision · AAAI 2024 |
Machine learning › Learning paradigms › weakly supervised learning
programmatic weak supervision |
0.8 | 1 | 2024 | Fusing Conditional Submodular GAN and Programmatic Weak Supervision · AAAI 2024 |
Machine learning › Learning paradigms
weakly supervised learning |
0.8 | 1 | 2024 | Fusing Conditional Submodular GAN and Programmatic Weak Supervision · AAAI 2024 |
Data mining › predictive modeling › classification
noisy label learning |
0.8 | 1 | 2024 | Fusing Conditional Submodular GAN and Programmatic Weak Supervision · AAAI 2024 |
Machine learning › Optimization for machine learning › combinatorial optimization
submodular maximization |
0.2 | 1 | 2024 | Fusing Conditional Submodular GAN and Programmatic Weak Supervision · AAAI 2024 |
Methods — techniques the papers use, named apart from their topics
submodular maximization · 1.5noise-aware classifier · 1.5knapsack constraint · 1.5InfoGAN · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Fusing Conditional Submodular GAN and Programmatic Weak SupervisionabstractProgrammatic 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 for the training of the label models and leverages the class-dependent information of the label models to generate images of specific classes. However, the disentangled latent factor learned by the InfoGAN may not necessarily be class specific and hence could potentially affect the label model's accuracy. Moreover, the prediction of 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 prediction of the noise-aware classifier for training the label model as well as generation of class-conditioned 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 submodular maximization 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. Our implementation is available at https://github.com/kyrs/subpws-gan Kumar Shubham, Pranav Sastry, Prathosh A. P. |
AAAI | 2 |