Demo Data from EDBT 2026 / reviewers in the wild / expert
Vishal Rana
dblp:195/5450
· DBLP profile ↗
6ranked-venue papers
2as first author
5since 2021 · last 2025
0000-0003-3817-3161ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3 · 2 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1
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 |
Generative modeling · 57% Efficient and distributed learning · 29% Trustworthy machine learning · 14% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
0.9 | 1 | 2025 | DMol: A Highly Efficient and Chemical Motif-Preserving Molecule Generation Platform · NeurIPS 2025 |
Machine learning › Generative modeling › diffusion model
graph diffusion model |
0.9 | 1 | 2025 | DMol: A Highly Efficient and Chemical Motif-Preserving Molecule Generation Platform · NeurIPS 2025 |
Machine learning › Generative modeling
molecular generation |
0.9 | 1 | 2025 | DMol: A Highly Efficient and Chemical Motif-Preserving Molecule Generation Platform · NeurIPS 2025 |
Machine learning › Efficient and distributed learning › federated learning › unsupervised federated learning
federated clustering |
0.7 | 1 | 2023 | Machine Unlearning of Federated Clusters · ICLR 2023 |
Machine learning › Efficient and distributed learning
federated learning |
0.7 | 1 | 2023 | Machine Unlearning of Federated Clusters · ICLR 2023 |
Machine learning › Trustworthy machine learning
machine unlearning |
0.7 | 1 | 2023 | Machine Unlearning of Federated Clusters · ICLR 2023 |
Bioinformatics and computational biology
drug discovery |
0.3 | 1 | 2025 | DMol: A Highly Efficient and Chemical Motif-Preserving Molecule Generation Platform · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
motif compression · 1.7graph diffusion · 1.7deterministic and random subgraph perturbations · 1.7machine unlearning · 0.7federated clustering · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | DMol: A Highly Efficient and Chemical Motif-Preserving Molecule Generation PlatformabstractWe introduce a new graph diffusion model for small drug molecule generation which simultaneously offers a 10-fold reduction in the number of diffusion steps when compared to existing methods, preservation of small molecule graph motifs via motif compression, and an average 3\% improvement in SMILES validity over the DiGress model across all real-world molecule benchmarking datasets. Furthermore, our approach outperforms the state-of-the-art DeFoG method with respect to motif-conservation by roughly 4\%, as evidenced by high ChEMBL-likeness, QED and newly introduced shingles distance scores. The key ideas behind the approach are to use a combination of deterministic and random subgraph perturbations, so that the node and edge noise schedules are codependent; to modify the loss function of the training process in order to exploit the deterministic component of the schedule; and, to ''compress'' a collection of highly relevant carbon ring and other motif structures into supernodes in a way that allows for simple subsequent integration into the molecular scaffold. Peizhi Niu, Yu-Hsiang Wang, Vishal Rana, Chetan Rupakheti, Olgica Milenkovic |
NeurIPS | 3 |
| 2024 | Semi-quantitative group testing for efficient and accurate qPCR screening of pathogens with a wide range of loadsabstractBACKGROUND: Pathogenic infections pose a significant threat to global health, affecting millions of people every year and presenting substantial challenges to healthcare systems worldwide. Efficient and timely testing plays a critical role in disease control and transmission prevention. Group testing is a well-established method for reducing the number of tests needed to screen large populations when the disease prevalence is low. However, it does not fully utilize the quantitative information provided by qPCR methods, nor is it able to accommodate a wide range of pathogen loads. RESULTS: To address these issues, we introduce a novel adaptive semi-quantitative group testing (SQGT) scheme to efficiently screen populations via two-stage qPCR testing. The SQGT method quantizes cycle threshold (Ct) values into multiple bins, leveraging the information from the first stage of screening to improve the detection sensitivity. Dynamic Ct threshold adjustments mitigate dilution effects and enhance test accuracy. Comparisons with traditional binary outcome GT methods show that SQGT reduces the number of tests by 24% on the only complete real-world qPCR group testing dataset from Israel, while maintaining a negligible false negative rate. CONCLUSION: In conclusion, our adaptive SQGT approach, utilizing qPCR data and dynamic threshold adjustments, offers a promising solution for efficient population screening. With a reduction in the number of tests and minimal false negatives, SQGT holds potential to enhance disease control and testing strategies on a global scale. Ananthan Nambiar, Chao Pan 0003, Vishal Rana, Mahdi Cheraghchi, João Ribeiro 0002, Sergei Maslov, Olgica Milenkovic |
BMC Bioinform. | 3 |
| 2024 | Interpretable online network dictionary learning for inferring long-range chromatin interactionsabstractDictionary learning (DL), implemented via matrix factorization (MF), is commonly used in computational biology to tackle ubiquitous clustering problems. The method is favored due to its conceptual simplicity and relatively low computational complexity. However, DL algorithms produce results that lack interpretability in terms of real biological data. Additionally, they are not optimized for graph-structured data and hence often fail to handle them in a scalable manner. In order to address these limitations, we propose a novel DL algorithm called online convex network dictionary learning (online cvxNDL). Unlike classical DL algorithms, online cvxNDL is implemented via MF and designed to handle extremely large datasets by virtue of its online nature. Importantly, it enables the interpretation of dictionary elements, which serve as cluster representatives, through convex combinations of real measurements. Moreover, the algorithm can be applied to data with a network structure by incorporating specialized subnetwork sampling techniques. To demonstrate the utility of our approach, we apply cvxNDL on 3D-genome RNAPII ChIA-Drop data with the goal of identifying important long-range interaction patterns (long-range dictionary elements). ChIA-Drop probes higher-order interactions, and produces data in the form of hypergraphs whose nodes represent genomic fragments. The hyperedges represent observed physical contacts. Our hypergraph model analysis has the objective of creating an interpretable dictionary of long-range interaction patterns that accurately represent global chromatin physical contact maps. Through the use of dictionary information, one can also associate the contact maps with RNA transcripts and infer cellular functions. To accomplish the task at hand, we focus on RNAPII-enriched ChIA-Drop data from Drosophila Melanogaster S2 cell lines. Our results offer two key insights. First, we demonstrate that online cvxNDL retains the accuracy of classical DL (MF) methods while simultaneously ensuring unique interpretability and scalability. Second, we identify distinct collections of proximal and distal interaction patterns involving chromatin elements shared by related processes across different chromosomes, as well as patterns unique to specific chromosomes. To associate the dictionary elements with biological properties of the corresponding chromatin regions, we employ Gene Ontology (GO) enrichment analysis and perform multiple RNA coexpression studies. Vishal Rana, Jianhao Peng, Chao Pan 0003, Hanbaek Lyu, Albert Cheng, Olgica Milenkovic |
PLoS Comput. Biol. | 1 |
| 2023 | Machine Unlearning of Federated Clusters
Chao Pan 0003, Jin Sima, Saurav Prakash, Vishal Rana, Olgica Milenkovic |
ICLR | 4 |
| 2023 | Small-Sample Estimation of the Mutational Support and Distribution of SARS-CoV-2abstractWe consider the problem of determining the mutational support and distribution of the SARS-CoV-2 viral genome in the small-sample regime. The mutational support refers to the unknown number of sites that may eventually mutate in the SARS-CoV-2 genome while mutational distribution refers to the distribution of point mutations in the viral genome across a population. The mutational support may be used to assess the virulence of the virus and guide primer selection for real-time RT-PCR testing. Estimating the distribution of mutations in the genome of different subpopulations while accounting for the unseen may also aid in discovering new variants. To estimate the mutational support in the small-sample regime, we use GISAID sequencing data and our state-of-the-art polynomial estimation techniques based on new weighted and regularized Chebyshev approximation methods. For distribution estimation, we adapt the well-known Good-Turing estimator. Our analysis reveals several findings: First, the mutational supports exhibit significant differences in the ORF6 and ORF7a regions (older versus younger patients), ORF1b and ORF10 regions (females versus males) and in almost all ORFs (Asia/Europe/North America). Second, even though the N region of SARS-CoV-2 has a predicted 10% mutational support, mutations fall outside of the primer regions recommended by the CDC. Vishal Rana, Eli Chien, Jianhao Peng, Olgica Milenkovic |
IEEE ACM Trans. Comput. Biol. Bioinform. | 1 |
| 2017 | Queuing Analysis for Multiple-Antenna Cognitive Radio Wireless Networks With BeamformingabstractThis letter presents an analysis of the queuing performance of a multiple-antenna cognitive radio system employing downlink beamforming. The paradigm of multiantenna zero-forcing beamforming is employed to null the interference at the primary users. A closed-form expression is derived for the probability density of successful packet transmission time followed by results for the average waiting and transmission times in an M/G/1 secondary user queuing system. Furthermore, this framework and the results are also extended to scenarios with ARQ and partial channel state information at the secondary transmitter. Numerical simulation results are presented to validate the theoretical performance analysis. Shivani Agrawal, Vishal Rana, Aditya K. Jagannatham |
IEEE Signal Process. Lett. | 2 |