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

Karush Suri

dblp:252/3260 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 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
4 papers
Graph learning · 37% Representation and self-supervised learning · 18% Reinforcement learning · 14%
Interdisciplinary, comprehensive, and emerging computing
3 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › model compression › knowledge distillation
cross-modal distillation
0.912025
A Cross Modal Knowledge Distillation & Data Augmentation Recipe for Improving Transcriptomics Representations through Morphological Features · ICML 2025
Machine learning › Deep learning architectures and training
data augmentation
0.912025
A Cross Modal Knowledge Distillation & Data Augmentation Recipe for Improving Transcriptomics Representations through Morphological Features · ICML 2025
Bioinformatics and computational biology
transcriptomics
0.912025
A Cross Modal Knowledge Distillation & Data Augmentation Recipe for Improving Transcriptomics Representations through Morphological Features · ICML 2025
Machine learning › Representation and self-supervised learning
contrastive learning
0.812024
How Molecules Impact Cells: Unlocking Contrastive PhenoMolecular Retrieval · NeurIPS 2024
Machine learning › Graph learning
graph foundation model
0.812024
On the Scalability of GNNs for Molecular Graphs · NeurIPS 2024
Machine learning › Graph learning
graph neural network
0.812024
On the Scalability of GNNs for Molecular Graphs · NeurIPS 2024
Machine learning › Graph learning
molecular graph
0.812024
On the Scalability of GNNs for Molecular Graphs · NeurIPS 2024
Machine learning › Graph learning › molecular representation learning › molecular graph learning
molecular property prediction
0.812024
On the Scalability of GNNs for Molecular Graphs · NeurIPS 2024
Machine learning › Representation and self-supervised learning
multimodal representation learning
0.812024
How Molecules Impact Cells: Unlocking Contrastive PhenoMolecular Retrieval · NeurIPS 2024
Natural language and speech › Language models and text generation › language modeling
scaling behavior
0.812024
On the Scalability of GNNs for Molecular Graphs · NeurIPS 2024
Bioinformatics and computational biology › drug discovery
computational drug discovery
0.812024
How Molecules Impact Cells: Unlocking Contrastive PhenoMolecular Retrieval · NeurIPS 2024
Bioinformatics and computational biology
drug discovery
0.812024
On the Scalability of GNNs for Molecular Graphs · NeurIPS 2024
Bioinformatics and computational biology › molecular informatics
molecular representation learning
0.812024
On the Scalability of GNNs for Molecular Graphs · NeurIPS 2024
Machine learning › Reinforcement learning
multi-agent reinforcement learning
0.612022
Surprise Minimizing Multi-Agent Learning with Energy-based Models · NeurIPS 2022
Information retrieval
cross-modal retrieval
0.212024
How Molecules Impact Cells: Unlocking Contrastive PhenoMolecular Retrieval · NeurIPS 2024

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

similarity-aware loss · 2.3pretrained phenomics model · 2.3contrastive learning · 2.3knowledge distillation · 1.7foundation model · 1.7CLIP · 1.7supervised pretraining · 1.5message passing · 1.5graph transformer · 1.5fine-tuning · 1.5
YearPublicationVenuePosition
2025 A Cross Modal Knowledge Distillation & Data Augmentation Recipe for Improving Transcriptomics Representations through Morphological Features
abstract
Understanding cellular responses to stimuli is crucial for biological discovery and drug development. Transcriptomics provides interpretable, gene-level insights, while microscopy imaging offers rich predictive features but is harder to interpret. Weakly paired datasets, where samples share biological states, enable multimodal learning but are scarce, limiting their utility for training and multimodal inference. We propose a framework to enhance transcriptomics by distilling knowledge from microscopy images. Using weakly paired data, our method aligns and binds modalities, enriching gene expression representations with morphological information. To address data scarcity, we introduce (1) Semi-Clipped, an adaptation of CLIP for cross-modal distillation using pretrained foundation models, achieving state-of-the-art results, and (2) PEA (Perturbation Embedding Augmentation), a novel augmentation technique that enhances transcriptomics data while preserving inherent biological information. These strategies improve the predictive power and retain the interpretability of transcriptomics, enabling rich unimodal representations for complex biological tasks.
Ihab Bendidi, Yassir El Mesbahi, Alisandra Kaye Denton, Karush Suri, Kian Kenyon-Dean, Auguste Genovesio, Emmanuel Noutahi
ICML4
2024 How Molecules Impact Cells: Unlocking Contrastive PhenoMolecular Retrieval
abstract
Predicting molecular impact on cellular function is a core challenge in therapeutic design. Phenomic experiments, designed to capture cellular morphology, utilize microscopy based techniques and demonstrate a high throughput solution for uncovering molecular impact on the cell. In this work, we learn a joint latent space between molecular structures and microscopy phenomic experiments, aligning paired samples with contrastive learning. Specifically, we study the problem of Contrastive PhenoMolecular Retrieval, which consists of zero-shot molecular structure identification conditioned on phenomic experiments. We assess challenges in multi-modal learning of phenomics and molecular modalities such as experimental batch effect, inactive molecule perturbations, and encoding perturbation concentration. We demonstrate improved multi-modal learner retrieval through (1) a uni-modal pre-trained phenomics model, (2) a novel inter sample similarity aware loss, and (3) models conditioned on a representation of molecular concentration. Following this recipe, we propose MolPhenix, a molecular phenomics model. MolPhenix leverages a pre-trained phenomics model to demonstrate significant performance gains across perturbation concentrations, molecular scaffolds, and activity thresholds. In particular, we demonstrate an 8.1 times improvement in zero shot molecular retrieval of active molecules over the previous state-of-the-art, reaching 77.33% in top-1% accuracy. These results open the door for machine learning to be applied in virtual phenomics screening, which can significantly benefit drug discovery applications.
Philip Fradkin, Puria Azadi Moghadam, Karush Suri, Frederik Wenkel, Ali Bashashati, Maciej Sypetkowski, Dominique Beaini
NeurIPS3
2024 On the Scalability of GNNs for Molecular Graphs
abstract
Scaling deep learning models has been at the heart of recent revolutions in language modelling and image generation. Practitioners have observed a strong relationship between model size, dataset size, and performance. However, structure-based architectures such as Graph Neural Networks (GNNs) are yet to show the benefits of scale mainly due to lower efficiency of sparse operations, large data requirements, and lack of clarity about the effectiveness of various architectures. We address this drawback of GNNs by studying their scaling behavior. Specifically, we analyze message-passing networks, graph Transformers, and hybrid architectures on the largest public collection of 2D molecular graphs for supervised pretraining. For the first time, we observe that GNNs benefit tremendously from the increasing scale of depth, width, number of molecules and associated labels. A major factor is the diversity of the pretraining data that comprises thousands of labels per molecule derived from bio-assays, quantum simulations, transcriptomics and phenomic imaging. We further demonstrate strong finetuning scaling behavior on 38 highly competitive downstream tasks, outclassing previous large models. This gives rise to MolGPS, a new graph foundation model that allows to navigate the chemical space, outperforming the previous state-of-the-arts on 26 out the 38 downstream tasks. We hope that our work paves the way for an era where foundational GNNs drive pharmaceutical drug discovery.
Maciej Sypetkowski, Frederik Wenkel, Farimah Poursafaei, Nia Dickson, Karush Suri, Philip Fradkin, Dominique Beaini
NeurIPS5
2022 Surprise Minimizing Multi-Agent Learning with Energy-based Models
abstract
Multi-Agent Reinforcement Learning (MARL) has demonstrated significant suc2 cess by virtue of collaboration across agents. Recent work, on the other hand, introduces surprise which quantifies the degree of change in an agent’s environ4 ment. Surprise-based learning has received significant attention in the case of single-agent entropic settings but remains an open problem for fast-paced dynamics in multi-agent scenarios. A potential alternative to address surprise may be realized through the lens of free-energy minimization. We explore surprise minimization in multi-agent learning by utilizing the free energy across all agents in a multi-agent system. A temporal Energy-Based Model (EBM) represents an estimate of surprise which is minimized over the joint agent distribution. Our formulation of the EBM is theoretically akin to the minimum conjugate entropy objective and highlights suitable convergence towards minimum surprising states. We further validate our theoretical claims in an empirical study of multi-agent tasks demanding collabora14 tion in the presence of fast-paced dynamics. Our implementation and agent videos are available at the Project Webpage.
Karush Suri, Xiao Qi Shi, Konstantinos N. Plataniotis, Yuri A. Lawryshyn
NeurIPS1