Demo Data from EDBT 2026 / reviewers in the wild / expert
Dipesh Tamboli
dblp:260/0079
· DBLP profile ↗
6ranked-venue papers
1as first author
4since 2021 · last 2024
0000-0003-2765-5763ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 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
3 papers |
Transfer learning and domain adaptation · 48% Reinforcement learning · 40% Trustworthy machine learning · 11% |
Topics — the 12 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › imitation learning › inverse reinforcement learning
adversarial inverse reinforcement learning |
0.7 | 1 | 2023 | Multi-task Hierarchical Adversarial Inverse Reinforcement Learning · ICML 2023 |
Machine learning › Transfer learning and domain adaptation
domain adaptation |
0.7 | 1 | 2023 | Domain Adaptive Few-Shot Open-Set Learning · ICCV 2023 |
Machine learning › Transfer learning and domain adaptation › domain adaptation › low-resource domain adaptation
few-shot domain adaptation |
0.7 | 1 | 2023 | Domain Adaptive Few-Shot Open-Set Learning · ICCV 2023 |
Machine learning › Reinforcement learning
hierarchical reinforcement learning |
0.7 | 1 | 2023 | Multi-task Hierarchical Adversarial Inverse Reinforcement Learning · ICML 2023 |
Machine learning › Reinforcement learning › imitation learning
inverse reinforcement learning |
0.7 | 1 | 2023 | Multi-task Hierarchical Adversarial Inverse Reinforcement Learning · ICML 2023 |
Machine learning › Trustworthy machine learning › open-world recognition
open-set recognition |
0.7 | 1 | 2023 | Domain Adaptive Few-Shot Open-Set Learning · ICCV 2023 |
Machine learning › Transfer learning and domain adaptation › domain adaptation
multi-source domain adaptation |
0.4 | 1 | 2020 | Multi-source Open-Set Deep Adversarial Domain Adaptation · ECCV (26) 2020 |
Machine learning › Transfer learning and domain adaptation › domain adaptation
open-set domain adaptation |
0.4 | 1 | 2020 | Multi-source Open-Set Deep Adversarial Domain Adaptation · ECCV (26) 2020 |
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation |
0.4 | 1 | 2020 | Multi-source Open-Set Deep Adversarial Domain Adaptation · ECCV (26) 2020 |
Machine learning › Transfer learning and domain adaptation
few-shot learning |
0.2 | 1 | 2023 | Domain Adaptive Few-Shot Open-Set Learning · ICCV 2023 |
Machine learning › Reinforcement learning
imitation learning |
0.2 | 1 | 2023 | Multi-task Hierarchical Adversarial Inverse Reinforcement Learning · ICML 2023 |
Machine learning › Reinforcement learning › imitation learning › transfer imitation learning
multi-task imitation learning |
0.2 | 1 | 2023 | Multi-task Hierarchical Adversarial Inverse Reinforcement Learning · ICML 2023 |
Methods — techniques the papers use, named apart from their topics
meta-learning · 0.7hierarchical policy learning · 0.7context-based multi-task learning · 0.7conditional adversarial network · 0.7batch normalization · 0.7adversarial inverse reinforcement learning · 0.7contrastive learning · 0.4adversarial training · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Reinforced Sequential Decision-Making for Sepsis Treatment: The PosNegDM Framework With Mortality Classifier and TransformerabstractSepsis, a life-threatening condition triggered by the body's exaggerated response to infection, demands urgent intervention to prevent severe complications. Existing machine learning methods for managing sepsis struggle in offline scenarios, exhibiting suboptimal performance with survival rates below 50%. This paper introduces thePosNegDM— “Reinforcement Learning with Positive and Negative Demonstrations for Sequential Decision-Making” framework utilizing an innovative transformer-based model and a feedback reinforcer to replicate expert actions while considering individual patient characteristics. A mortality classifier with 96.7% accuracy guides treatment decisions towards positive outcomes. ThePosNegDMframework significantly improves patient survival, saving 97.39% of patients, outperforming established machine learning algorithms (Decision Transformer and Behavioral Cloning) with survival rates of 33.4% and 43.5%, respectively. Additionally, ablation studies underscore the critical role of the transformer-based decision maker and the integration of a mortality classifier in enhancing overall survival rates. In summary, our proposed approach presents a promising avenue for enhancing sepsis treatment outcomes, contributing to improved patient care and reduced healthcare costs. Dipesh Tamboli, Jiayu Chen 0006, Kiran Pranesh Jotheeswaran, Denny Yu, Vaneet Aggarwal |
IEEE J. Biomed. Health Informatics | 1 |
| 2023 | Domain Adaptive Few-Shot Open-Set LearningabstractFew-shot learning has made impressive strides in addressing the crucial challenges of recognizing unknown samples from novel classes in target query sets and managing visual shifts between domains. However, existing techniques fall short when it comes to identifying target outliers under domain shifts by learning to reject pseudo-outliers from the source domain, resulting in an incomplete solution to both problems. To address these challenges comprehensively, we propose a novel approach called Domain Adaptive Few-Shot Open Set Recognition (DA-FSOS) and introduce a meta-learning-based architecture named DAFOS-Net. During training, our model learns a shared and discriminative embedding space while creating a pseudo-open-space decision boundary, given a fully-supervised source domain and a label-disjoint few-shot target domain. To enhance data density, we use a pair of conditional adversarial networks with tunable noise variances to augment both domains’ closed and pseudo-open spaces. Furthermore, we propose a domain-specific batch-normalized class prototypes alignment strategy to align both domains globally while ensuring class-discriminativeness through novel metric objectives. Our training approach ensures that DAFOS-Net can generalize well to new scenarios in the target domain. We present three benchmarks for DA-FSOS based on the Office-Home, mini-ImageNet/CUB, and DomainNet datasets and demonstrate the efficacy of DAFOS-Net through extensive experimentation. Debabrata Pal, Deeptej More, Sai Bhargav, Dipesh Tamboli, Vaneet Aggarwal, Biplab Banerjee |
ICCV | 4 |
| 2023 | Multi-task Hierarchical Adversarial Inverse Reinforcement LearningabstractMulti-task Imitation Learning (MIL) aims to train a policy capable of performing a distribution of tasks based on multi-task expert demonstrations, which is essential for general-purpose robots. Existing MIL algorithms suffer from low data efficiency and poor performance on complex long-horizontal tasks. We develop Multi-task Hierarchical Adversarial Inverse Reinforcement Learning (MH-AIRL) to learn hierarchically-structured multi-task policies, which is more beneficial for compositional tasks with long horizons and has higher expert data efficiency through identifying and transferring reusable basic skills across tasks. To realize this, MH-AIRL effectively synthesizes context-based multi-task learning, AIRL (an IL approach), and hierarchical policy learning. Further, MH-AIRL can be adopted to demonstrations without the task or skill annotations (i.e., state-action pairs only) which are more accessible in practice. Theoretical justifications are provided for each module of MH-AIRL, and evaluations on challenging multi-task settings demonstrate superior performance and transferability of the multi-task policies learned with MH-AIRL as compared to SOTA MIL baselines. Jiayu Chen 0006, Dipesh Tamboli, Tian Lan 0001, Vaneet Aggarwal |
ICML | 2 |
| 2022 | RSINet: Inpainting Remotely Sensed Images Using Triple GAN FrameworkabstractWe tackle the problem of image inpainting in the remote sensing domain. Remote sensing images possess high resolution and geographical variations, that render the conventional inpainting methods less effective. This further entails the requirement of models with high complexity to sufficiently capture the spectral, spatial and textural nuances within an image, emerging from its high spatial variability. To this end, we propose a novel inpainting method that individually focuses on each aspect of an image such as edges, colour and texture using a task specific GAN. Moreover, each individual GAN also incorporates the attention mechanism that explicitly extracts the spectral and spatial features. To ensure consistent gradient flow, the model uses residual learning paradigm, thus simultaneously working with high and low level features. We evaluate our model, alongwith previous state of the art models, on the two well known remote sensing datasets, Open Cities AI and Earth on Canvas, and achieve competitive performance. The code can be referred here: https://github.com/advaitkumar3107/RSINet. Advait Kumar, Dipesh Tamboli, Shivam Pande, Biplab Banerjee |
IGARSS | 2 |
| 2020 | Multi-source Open-Set Deep Adversarial Domain Adaptation
Sayan Rakshit, Dipesh Tamboli, Pragati Shuddhodhan Meshram, Biplab Banerjee, Gemma Roig, Subhasis Chaudhuri |
ECCV (26) | 2 |
| 2020 | Saliency-Driven Class Impressions For Feature Visualization Of Deep Neural NetworksabstractIn this paper, we propose a data-free method of extracting Impressions of each class from the classifier's memory. The Deep Learning regime empowers classifiers to extract distinct patterns (or features) of a given class from training data, which is the basis on which they generalize to unseen data. Before deploying these models on critical applications, it is very useful to visualize the features considered to be important for classification. Existing visualization methods develop high confidence images consisting of both background and foreground features. This makes it hard to judge what the important features of a given class are. In this work, we propose a saliency-driven approach to visualize discriminative features that are considered most important for a given task. Another drawback of existing methods is that, confidence of the generated visualizations is increased by creating multiple instances of the given class. We restrict the algorithm to develop a single object per image, which helps further in extracting features of high confidence, and also results in better visualizations. We further demonstrate the generation of negative images as naturally fused images of two or more classes. Our code is available at: https://giChub.com/val-iisc/Saliency-driven-Class-Impressions. Sravanti Addepalli, Dipesh Tamboli, Venkatesh Babu Radhakrishnan, Biplab Banerjee |
ICIP | 2 |