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

Divyam Madaan

dblp:239/4899 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
6since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 7 · 5 first-author · 6 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
7 papers
Efficient and distributed learning · 33% Learning paradigms · 30% Trustworthy machine learning · 15%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computing education · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
continual learning
1.832023
Heterogeneous Continual Learning · CVPR 2023
Online Coreset Selection for Rehearsal-based Continual Learning · ICLR 2022
Representational Continuity for Unsupervised Continual Learning · ICLR 2022
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.922021
Learning to Generate Noise for Multi-Attack Robustness · ICML 2021
Adversarial Neural Pruning with Latent Vulnerability Suppression · ICML 2020
Machine learning › Efficient and distributed learning › model compression › knowledge distillation
data-free knowledge distillation
0.712023
Heterogeneous Continual Learning · CVPR 2023
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.712023
Heterogeneous Continual Learning · CVPR 2023
Machine learning › Efficient and distributed learning › data selection
coreset selection
0.612022
Online Coreset Selection for Rehearsal-based Continual Learning · ICLR 2022
Machine learning › Learning paradigms › continual learning
rehearsal-based continual learning
0.612022
Online Coreset Selection for Rehearsal-based Continual Learning · ICLR 2022
Machine learning › Learning paradigms › continual learning
unsupervised continual learning
0.612022
Representational Continuity for Unsupervised Continual Learning · ICLR 2022
Machine learning › Trustworthy machine learning › robustness evaluation
multi-attack robustness
0.512021
Learning to Generate Noise for Multi-Attack Robustness · ICML 2021
Machine learning › Efficient and distributed learning › model compression › pruning › DNN pruning
adversarial pruning
0.412020
Adversarial Neural Pruning with Latent Vulnerability Suppression · ICML 2020
Machine learning › Efficient and distributed learning
model compression
0.412020
Adversarial Neural Pruning with Latent Vulnerability Suppression · ICML 2020
Machine learning › Efficient and distributed learning › model compression
pruning
0.412020
Adversarial Neural Pruning with Latent Vulnerability Suppression · ICML 2020
Machine learning › Generative modeling › multimodal generation
multimodal generative model
0.212024
Jointly Modeling Inter- & Intra-Modality Dependencies for Multi-modal Learning · NeurIPS 2024
Machine learning › Generative modeling
diffusion model
0.212023
Heterogeneous Continual Learning · CVPR 2023

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

survey · 1.3generative modeling · 0.8markov chain monte carlo · 0.7knowledge distillation · 0.7deep inversion · 0.7online coreset selection · 0.6meta-learning · 0.5label consistency training · 0.5bayesian pruning · 0.4adversarial training · 0.4
YearPublicationVenuePosition
2024 Jointly Modeling Inter- & Intra-Modality Dependencies for Multi-modal Learning
abstract
Supervised multi-modal learning involves mapping multiple modalities to a target label. Previous studies in this field have concentrated on capturing in isolation either the inter-modality dependencies (the relationships between different modalities and the label) or the intra-modality dependencies (the relationships within a single modality and the label). We argue that these conventional approaches that rely solely on either inter- or intra-modality dependencies may not be optimal in general. We view the multi-modal learning problem from the lens of generative models where we consider the target as a source of multiple modalities and the interaction between them. Towards that end, we propose inter- \& intra-modality modeling (I2M2) framework, which captures and integrates both the inter- and intra-modality dependencies, leading to more accurate predictions. We evaluate our approach using real-world healthcare and vision-and-language datasets with state-of-the-art models, demonstrating superior performance over traditional methods focusing only on one type of modality dependency. The code is available at https://github.com/divyam3897/I2M2.
Divyam Madaan, Taro Makino, Sumit Chopra, Kyunghyun Cho
NeurIPS1
2023 What Do NLP Researchers Believe? Results of the NLP Community Metasurvey
abstract
Julian Michael, Ari Holtzman, Alicia Parrish, Aaron Mueller, Alex Wang, Angelica Chen, Divyam Madaan, Nikita Nangia, Richard Yuanzhe Pang, Jason Phang, Samuel R. Bowman. Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2023.
Julian Michael, Ari Holtzman, Alicia Parrish, Aaron Mueller, Angelica Chen, Divyam Madaan, Nikita Nangia, Richard Yuanzhe Pang, Jason Phang, Samuel R. Bowman
ACL (1)7
2023 Heterogeneous Continual Learning
abstract
We propose a novel framework and a solution to tackle the continual learning (CL) problem with changing network architectures. Most CL methods focus on adapting a single architecture to a new task/class by modifying its weights. However, with rapid progress in architecture design, the problem of adapting existing solutions to novel architectures becomes relevant. To address this limitation, we propose Heterogeneous Continual Learning (HCL), where a wide range of evolving network architectures emerge continually together with novel data/tasks. As a solution, we build on top of the distillation family of techniques and modify it to a new setting where a weaker model takes the role of a teacher; meanwhile, a new stronger architecture acts as a student. Furthermore, we consider a setup of limited access to previous data and propose Quick Deep Inversion (QDI) to recover prior task visual features to support knowledge transfer. QDI significantly reduces computational costs compared to previous solutions and improves overall performance. In summary, we propose a new setup for CL with a modified knowledge distillation paradigm and design a quick data inversion method to enhance distillation. Our evaluation of various benchmarks shows a significant improvement on accuracy in comparison to state-of-the-art methods over various networks architectures.
Divyam Madaan, Hongxu Yin, Wonmin Byeon, Jan Kautz, Pavlo Molchanov 0001
CVPR1
2022 Representational Continuity for Unsupervised Continual Learning
Divyam Madaan, Jaehong Yoon, Yuanchun Li 0003, Yunxin Liu 0001, Sung Ju Hwang
ICLR1
2022 Online Coreset Selection for Rehearsal-based Continual Learning
Jaehong Yoon, Divyam Madaan, Eunho Yang, Sung Ju Hwang
ICLR2
2021 Learning to Generate Noise for Multi-Attack Robustness
abstract
Adversarial learning has emerged as one of the successful techniques to circumvent the susceptibility of existing methods against adversarial perturbations. However, the majority of existing defense methods are tailored to defend against a single category of adversarial perturbation (e.g. $\ell_\infty$-attack). In safety-critical applications, this makes these methods extraneous as the attacker can adopt diverse adversaries to deceive the system. Moreover, training on multiple perturbations simultaneously significantly increases the computational overhead during training. To address these challenges, we propose a novel meta-learning framework that explicitly learns to generate noise to improve the model’s robustness against multiple types of attacks. Its key component is \emph{Meta Noise Generator (MNG)} that outputs optimal noise to stochastically perturb a given sample, such that it helps lower the error on diverse adversarial perturbations. By utilizing samples generated by MNG, we train a model by enforcing the label consistency across multiple perturbations. We validate the robustness of models trained by our scheme on various datasets and against a wide variety of perturbations, demonstrating that it significantly outperforms the baselines across multiple perturbations with a marginal computational cost.
Divyam Madaan, Jinwoo Shin, Sung Ju Hwang
ICML1
2020 Adversarial Neural Pruning with Latent Vulnerability Suppression
abstract
Despite the remarkable performance of deep neural networks on various computer vision tasks, they are known to be susceptible to adversarial perturbations, which makes it challenging to deploy them in real-world safety-critical applications. In this paper, we conjecture that the leading cause of adversarial vulnerability is the distortion in the latent feature space, and provide methods to suppress them effectively. Explicitly, we define \emph{vulnerability} for each latent feature and then propose a new loss for adversarial learning, \emph{Vulnerability Suppression (VS)} loss, that aims to minimize the feature-level vulnerability during training. We further propose a Bayesian framework to prune features with high vulnerability to reduce both vulnerability and loss on adversarial samples. We validate our \emph{Adversarial Neural Pruning with Vulnerability Suppression (ANP-VS)} method on multiple benchmark datasets, on which it not only obtains state-of-the-art adversarial robustness but also improves the performance on clean examples, using only a fraction of the parameters used by the full network. Further qualitative analysis suggests that the improvements come from the suppression of feature-level vulnerability.
Divyam Madaan, Jinwoo Shin, Sung Ju Hwang
ICML1