Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kumar Shubham

dblp:42/6555 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
5since 2021 · last 2024
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021Human-computer interaction and ubiquitous computing · 2 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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
2 papers
Learning paradigms · 32% Generative modeling · 32% Transfer learning and domain adaptation · 16%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 77% Medical and health informatics · 23%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 12 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › image generation › conditional image synthesis
class-conditional image synthesis
0.812024
Fusing Conditional Submodular GAN and Programmatic Weak Supervision · AAAI 2024
Machine learning › Generative modeling › generative adversarial network
conditional GAN
0.812024
Fusing Conditional Submodular GAN and Programmatic Weak Supervision · AAAI 2024
Machine learning › Transfer learning and domain adaptation
domain-invariant representation learning
0.812024
WISER: Weak Supervision and Supervised Representation Learning to Improve Drug Response Prediction in Cancer · ICML 2024
Machine learning › Learning paradigms › weakly supervised learning
programmatic weak supervision
0.812024
Fusing Conditional Submodular GAN and Programmatic Weak Supervision · AAAI 2024
Machine learning › Representation and self-supervised learning › representation learning
supervised representation learning
0.812024
WISER: Weak Supervision and Supervised Representation Learning to Improve Drug Response Prediction in Cancer · ICML 2024
Machine learning › Learning paradigms
weakly supervised learning
0.812024
Fusing Conditional Submodular GAN and Programmatic Weak Supervision · AAAI 2024
Bioinformatics and computational biology › genomics
computational genomics
0.812024
WISER: Weak Supervision and Supervised Representation Learning to Improve Drug Response Prediction in Cancer · ICML 2024
Bioinformatics and computational biology › drug discovery
drug response prediction
0.812024
WISER: Weak Supervision and Supervised Representation Learning to Improve Drug Response Prediction in Cancer · ICML 2024
Data mining › predictive modeling › classification
noisy label learning
0.812024
Fusing Conditional Submodular GAN and Programmatic Weak Supervision · AAAI 2024
Machine learning › Optimization for machine learning › combinatorial optimization
submodular maximization
0.212024
Fusing Conditional Submodular GAN and Programmatic Weak Supervision · AAAI 2024
Medical and health informatics › oncology
cancer therapy
0.212024
WISER: Weak Supervision and Supervised Representation Learning to Improve Drug Response Prediction in Cancer · ICML 2024
Medical and health informatics
precision medicine
0.212024
WISER: Weak Supervision and Supervised Representation Learning to Improve Drug Response Prediction in Cancer · ICML 2024

Methods — techniques the papers use, named apart from their topics

weak supervision · 1.5supervised representation learning · 1.5submodular maximization · 1.5noise-aware classifier · 1.5knapsack constraint · 1.5InfoGAN · 1.5
YearPublicationVenuePosition
2024 Fusing Conditional Submodular GAN and Programmatic Weak Supervision
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 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.
AAAI1
2024 WISER: Weak Supervision and Supervised Representation Learning to Improve Drug Response Prediction in Cancer
abstract
Cancer, a leading cause of death globally, occurs due to genomic changes and manifests heterogeneously across patients. To advance research on personalized treatment strategies, the effectiveness of various drugs on cells derived from cancers (’cell lines’) is experimentally determined in laboratory settings. Nevertheless, variations in the distribution of genomic data and drug responses between cell lines and humans arise due to biological and environmental differences. Moreover, while genomic profiles of many cancer patients are readily available, the scarcity of corresponding drug response data limits the ability to train machine learning models that can predict drug response in patients effectively. Recent cancer drug response prediction methods have largely followed the paradigm of unsupervised domain-invariant representation learning followed by a downstream drug response classification step. Introducing supervision in both stages is challenging due to heterogeneous patient response to drugs and limited drug response data. This paper addresses these challenges through a novel representation learning method in the first phase and weak supervision in the second. Experimental results on real patient data demonstrate the efficacy of our method WISER (Weak supervISion and supErvised Representation learning) over state-of-the-art alternatives on predicting personalized drug response. Our implementation is available at https://github.com/kyrs/WISER
Kumar Shubham, Aishwarya Jayagopal, Syed Mohammed Danish, Prathosh A. P., Vaibhav Rajan
ICML1
2024 Bayesian Pseudo-Coresets via Contrastive Divergence
abstract
Bayesian methods provide an elegant framework for estimating parameter posteriors and quantification of uncertainty associated with probabilistic models. However, they often suffer from slow inference times. To address this challenge, Bayesian Pseudo-Coresets (BPC) have emerged as a promising solution. BPC methods aim to create a small synthetic dataset, known as pseudo-coresets, that approximates the posterior inference achieved with the original dataset. This approximation is achieved by optimizing a divergence measure between the true posterior and the pseudo-coreset posterior. Various divergence measures have been proposed for constructing pseudo-coresets, with forward Kullback-Leibler (KL) divergence being the most successful. However, using forward KL divergence necessitates sampling from the pseudo-coreset posterior, often accomplished through approximate Gaussian variational distributions. Alternatively, one could employ Markov Chain Monte Carlo (MCMC) methods for sampling, but this becomes challenging in high-dimensional parameter spaces due to slow mixing. In this study, we introduce a novel approach for constructing pseudo-coresets by utilizing contrastive divergence. Importantly, optimizing contrastive divergence eliminates the need for approximations in the pseudo-coreset construction process. Furthermore, it enables the use of finite-step MCMC methods, alleviating the requirement for extensive mixing to reach a stationary distribution. To validate our method’s effectiveness, we conduct extensive experiments on multiple datasets, demonstrating its superiority over existing BPC techniques. Our implementation is available at https://github.com/backpropagator/BPC-CD .
Piyush Tiwary, Kumar Shubham, Vivek Kashyap, Prathosh A. P.
UAI2
2022 Review of realistic behavior and appearance generation in embodied conversational agents: A comparison between traditional and modern approaches
abstract
With recent technological advancements, many firms that formerly relied on traditional face-to-face conversations have switched to an online conversation mode. This has not only helped businesses to increase their revenues, but it has also enabled users and customers to access world-class services. Due to scalability concerns with these platforms, many of the online conversations have lost the personal touch associated with a face-to-face based communication. An embodied conversational agent (ECA) can address this void by creating suitable behavior as well as the required voice output via a realistic-looking avatar. However, in order to scale up to a large customer base, the behavior and appearance of agents must be adequately modeled. Traditionally, rule-based methods were used to generate the animations associated with the avatars, but because of their limitations modern approaches use deep learning models to create end-to-end systems. We present various conventional and current methodologies for behavior and appearance modeling in our work. We will discuss similarities between these systems as well as their limitations. We believe that our work will be useful in developing a hybrid system that uses both traditional and modern approach to handle these challenges in creating modern embodied conversational agents.
Kumar Shubham, Dinesh Babu Jayagopi
ICMI1
2021 Learning a Deep Reinforcement Learning Policy Over the Latent Space of a Pre-trained GAN for Semantic Age Manipulation
abstract
Learning a disentangled representation of the latent space has become one of the most fundamental problems studied in computer vision. Recently, many Generative Adversarial Networks (GANs) have shown promising results in generating high fidelity images. However, studies to understand the semantic layout of the latent space of pre-trained models are still limited. Several works train conditional GANs to generate faces with required semantic attributes. Unfortunately, in these attempts, the generated output is often not as photo-realistic as the unconditional state-of-the-art models. Besides, they also require large computational resources and specific datasets to generate high fidelity images. In our work, we have formulated a Markov Decision Process (MDP) over the latent space of a pre-trained GAN model to learn a conditional policy for semantic manipulation along specific attributes under defined identity bounds. Further, we have defined a semantic age manipulation scheme using a locally linear approximation over the latent space. Results show that our learned policy samples high fidelity images with required age alterations, while preserving the identity of the person.
Kumar Shubham, Gopalakrishnan Venkatesh, Reijul Sachdev, Akshi, Dinesh Babu Jayagopi, G. Srinivasaraghavan 0001
IJCNN1
2020 Conventional and Non-conventional Job Interviewing Methods: A Comparative Study in Two Countries
abstract
With recent advancements in technology, new platforms have come up to substitute face-to-face interviews. Of particular interest are asynchronous video interviewing (AVI) platforms, where candidates talk to a screen with questions, and virtual agent based interviewing platforms, where a human-like avatar interviews candidates. These anytime-anywhere interviewing systems scale up the overall reach of the interviewing process for firms, though they may not provide the best experience for the candidates. An important research question is how the candidates perceive such platforms and its impact on their performance and behavior. Also, is there an advantage of one setting vs. another i.e., Avatar vs. Platform? Finally, would such differences be consistent across cultures? In this paper, we present the results of a comparative study conducted in three different interview settings (i.e., Face-to-face, Avatar, and Platform), as well as two different cultural contexts (i.e., India and Switzerland), and analyze the differences in self-rated, others-rated performance, and automatic audiovisual behavioral cues.
Kumar Shubham, Emmanuelle Patricia Kleinlogel, Anaïs Butera, Marianne Schmid Mast, Dinesh Babu Jayagopi
ICMI1