Bahrad Ali Sokhansanj
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Bahrad Ali Sokhansanj has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
- Gail L. Rosen
Drexel University
22 shared publications - James R. Brown
Drexel University, Philadelphia, PA, USA
6 shared publications - Mohammad Saleh Refahi
Drexel University, Philadelphia, PA, USA
6 shared publications - Zhengqiao Zhao
School of Artificial Intelligence, Northwestern Polytechnical University, Xi’an 710072, China
5 shared publications - Hai-Feng Ji
Drexel University
4 shared publications - Hyunwoo Yoo
Drexel University
4 shared publications
Latest Publications
- 2 July 2026
- Published by Springer Nature
- p. 89-134
Evaluating Genomic Language Models: Experimental Validation, Multi-Omics Integration, and Ethical-Legal Challenges
- 2 July 2026
- Published by Springer Nature
- p. 89-134
Evaluating Genomic Language Models: Experimental Validation, Multi-Omics Integration, and Ethical-Legal Challenges
- Open Access
Nevermore: Target-Conditioned Protein–Ligand Representation Learning for Multi-Objective Lead Optimization with Database-Grounded Retrieval
Recently, there has been great interest in AI-based approaches for de novo design of novel drug candidates. However, the generation of useful lead drug candidate compounds requires more than predicting engagement with the desired protein target. Candidate molecules must also be anchored in the real world of medicinal chemistry for their synthesis and modification as well as satisfying multiple drug development-related criteria. Here, we present Nevermore, an AI target-conditioned, database-grounded workflow for prioritizing candidate ligands from large compound libraries. Nevermore uses a geometry-aware protein–ligand affinity oracle to score target-specific binding and perform sparse integer edits in count-based Morgan fingerprint space. Nevermore then retrieves the most structurally similar molecules from public chemical databases. This design enables multi-objective search over predicted affinity and absorption, distribution, metabolism, excretion, and toxicity (ADMET) proxies while keeping all candidates anchored to valid database compounds. We evaluated Nevermore’s performance across three biologically distinct targets: Menin, a protein-interaction target relevant to leukemia; SARS-CoV-2 Mpro, a viral cysteine protease relevant to antiviral discovery; and epidermal growth factor receptor (EGFR), a kinase-superfamily oncology target with extensive experimentally tested compounds. Nevermore retrieved candidate sets with favorable predicted affinity–property trade-offs. These results support database-grounded fingerprint steering as a practical computational strategy for lead prioritization and for generating testable molecular hypotheses, although the prioritized candidates remain predictions, requiring follow-up experimental validation.
Open AccessNevermore: Target-Conditioned Protein–Ligand Representation Learning for Multi-Objective Lead Optimization with Database-Grounded Retrieval
Recently, there has been great interest in AI-based approaches for de novo design of novel drug candidates. However, the generation of useful lead drug candidate compounds requires more than predicting engagement with the desired protein target. Candidate molecules must also be anchored in the real world of medicinal chemistry for their synthesis and modification as well as satisfying multiple drug development-related criteria. Here, we present Nevermore, an AI target-conditioned, database-grounded workflow for prioritizing candidate ligands from large compound libraries. Nevermore uses a geometry-aware protein–ligand affinity oracle to score target-specific binding and perform sparse integer edits in count-based Morgan fingerprint space. Nevermore then retrieves the most structurally similar molecules from public chemical databases. This design enables multi-objective search over predicted affinity and absorption, distribution, metabolism, excretion, and toxicity (ADMET) proxies while keeping all candidates anchored to valid database compounds. We evaluated Nevermore’s performance across three biologically distinct targets: Menin, a protein-interaction target relevant to leukemia; SARS-CoV-2 Mpro, a viral cysteine protease relevant to antiviral discovery; and epidermal growth factor receptor (EGFR), a kinase-superfamily oncology target with extensive experimentally tested compounds. Nevermore retrieved candidate sets with favorable predicted affinity–property trade-offs. These results support database-grounded fingerprint steering as a practical computational strategy for lead prioritization and for generating testable molecular hypotheses, although the prioritized candidates remain predictions, requiring follow-up experimental validation.
- Open Access
Nevermore: Target-Conditioned Protein–Ligand Representation Learning for Multi-Objective Lead Optimization with Database-Grounded Retrieval
Target-conditioned molecular design requires optimizing binding affinity to a proposed therapeutic protein target while balancing competing developability constraints (e.g., absorption, distribution, metabolism, excretion, and toxicity; ADMET). Yet many computational pipelines either optimize a single objective or rely on fully de novo generation that can be difficult to control and interpret. We present Nevermore, a target-conditioned, database-grounded framework that combines a geometry-aware protein–ligand affinity oracle with Pareto-aware multi-objective search over an explicit molecular feature space. A central design choice is to optimize in count-based Morgan fingerprint space, where each feature corresponds to a chemically meaningful substructure count, enabling discrete, interpretable “bucket-level” edits. Nevermore learns target-conditioned scores by aligning protein and ligand representations under contrastive objectives and using a similarity-based prediction head; the resulting affinity oracle improves over previously reported benchmark baselines, providing a stronger scoring signal for downstream optimization. Nevermore then steers candidate selection by proposing sparse fingerprint edits, re-ranking candidates under multiple objectives, and projecting edited fingerprints back to valid molecules via nearest-neighbor retrieval from a large compound library. This yields efficient screening without exhaustive enumeration and provides transparent attributions that connect optimization steps to concrete chemical motifs. We evaluate Nevermore on two target case studies (Menin and SARS-CoV-2 Mpro). Across targets, the closed-loop search consistently retrieves candidate sets with improved affinity–property trade-offs compared with random sampling and similarity-only retrieval baselines, while maintaining explicit control and interpretability through discrete feature-space edits. These results support database-grounded, feature-space steering as a practical route to target-conditioned multi-objective lead refinement without relying on fully de novo generation.
Open AccessNevermore: Target-Conditioned Protein–Ligand Representation Learning for Multi-Objective Lead Optimization with Database-Grounded Retrieval
Target-conditioned molecular design requires optimizing binding affinity to a proposed therapeutic protein target while balancing competing developability constraints (e.g., absorption, distribution, metabolism, excretion, and toxicity; ADMET). Yet many computational pipelines either optimize a single objective or rely on fully de novo generation that can be difficult to control and interpret. We present Nevermore, a target-conditioned, database-grounded framework that combines a geometry-aware protein–ligand affinity oracle with Pareto-aware multi-objective search over an explicit molecular feature space. A central design choice is to optimize in count-based Morgan fingerprint space, where each feature corresponds to a chemically meaningful substructure count, enabling discrete, interpretable “bucket-level” edits. Nevermore learns target-conditioned scores by aligning protein and ligand representations under contrastive objectives and using a similarity-based prediction head; the resulting affinity oracle improves over previously reported benchmark baselines, providing a stronger scoring signal for downstream optimization. Nevermore then steers candidate selection by proposing sparse fingerprint edits, re-ranking candidates under multiple objectives, and projecting edited fingerprints back to valid molecules via nearest-neighbor retrieval from a large compound library. This yields efficient screening without exhaustive enumeration and provides transparent attributions that connect optimization steps to concrete chemical motifs. We evaluate Nevermore on two target case studies (Menin and SARS-CoV-2 Mpro). Across targets, the closed-loop search consistently retrieves candidate sets with improved affinity–property trade-offs compared with random sampling and similarity-only retrieval baselines, while maintaining explicit control and interpretability through discrete feature-space edits. These results support database-grounded, feature-space steering as a practical route to target-conditioned multi-objective lead refinement without relying on fully de novo generation.
- Open Access
- 14 January 2026
- Published by MDPI AG in Future Internet
- Vol. 18 (1) , 49
Correction: Sokhansanj, B.A. Uncensored AI in the Wild: Tracking Publicly Available and Locally Deployable LLMs. Future Internet 2025, 17, 477
The author requested to add some new content and cite a new reference in Section 2 after the sentence “The empirical work presented in this paper is particularly needed now because, despite the rapid spread of open-weight models, empirical research on their safety remains limited
- 14 January 2026
- Published by MDPI AG in Future Internet
- Vol. 18 (1) , 49
Open AccessCorrection: Sokhansanj, B.A. Uncensored AI in the Wild: Tracking Publicly Available and Locally Deployable LLMs. Future Internet 2025, 17, 477
The author requested to add some new content and cite a new reference in Section 2 after the sentence “The empirical work presented in this paper is particularly needed now because, despite the rapid spread of open-weight models, empirical research on their safety remains limited
- Open Access
- 18 October 2025
- Published by MDPI AG in Future Internet
- Vol. 17 (10) , 477
Uncensored AI in the Wild: Tracking Publicly Available and Locally Deployable LLMs
Open-weight generative large language models (LLMs) can be freely downloaded and modified. Yet, little empirical evidence exists on how these models are systematically altered and redistributed. This study provides a large-scale empirical analysis of safety-modified open-weight LLMs, drawing on 8608 model repositories and evaluating 20 representative modified models on unsafe prompts designed to elicit, for example, election disinformation, criminal instruction, and regulatory evasion. This study demonstrates that modified models exhibit substantially higher compliance: while an average of unmodified models complied with only 19.2% of unsafe requests, modified variants complied at an average rate of 80.0%. Modification effectiveness was independent of model size, with smaller, 14-billion-parameter variants sometimes matching or exceeding the compliance levels of 70B parameter versions. The ecosystem is highly concentrated yet structurally decentralized; for example, the top 5% of providers account for over 60% of downloads and the top 20 for nearly 86%. Moreover, more than half of the identified models use GGUF packaging, optimized for consumer hardware, and 4-bit quantization methods proliferate widely, though full-precision and lossless 16-bit models remain the most downloaded. These findings demonstrate how locally deployable, modified LLMs represent a paradigm shift for Internet safety governance, calling for new regulatory approaches suited to decentralized AI.
- 18 October 2025
- Published by MDPI AG in Future Internet
- Vol. 17 (10) , 477
Open AccessUncensored AI in the Wild: Tracking Publicly Available and Locally Deployable LLMs
Open-weight generative large language models (LLMs) can be freely downloaded and modified. Yet, little empirical evidence exists on how these models are systematically altered and redistributed. This study provides a large-scale empirical analysis of safety-modified open-weight LLMs, drawing on 8608 model repositories and evaluating 20 representative modified models on unsafe prompts designed to elicit, for example, election disinformation, criminal instruction, and regulatory evasion. This study demonstrates that modified models exhibit substantially higher compliance: while an average of unmodified models complied with only 19.2% of unsafe requests, modified variants complied at an average rate of 80.0%. Modification effectiveness was independent of model size, with smaller, 14-billion-parameter variants sometimes matching or exceeding the compliance levels of 70B parameter versions. The ecosystem is highly concentrated yet structurally decentralized; for example, the top 5% of providers account for over 60% of downloads and the top 20 for nearly 86%. Moreover, more than half of the identified models use GGUF packaging, optimized for consumer hardware, and 4-bit quantization methods proliferate widely, though full-precision and lossless 16-bit models remain the most downloaded. These findings demonstrate how locally deployable, modified LLMs represent a paradigm shift for Internet safety governance, calling for new regulatory approaches suited to decentralized AI.
- Open Access
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-6
MicroTraitLLM: A RAG-based, Microbe-focused LLM for Researchers
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessMicroTraitLLM: A RAG-based, Microbe-focused LLM for Researchers
- Open Access
- 11 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1
Fast and Scalable Gene Embedding Search: A Comparative Study of FAISS and ScaNN
- 11 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1
Open AccessFast and Scalable Gene Embedding Search: A Comparative Study of FAISS and ScaNN
- Open Access
Learning to Align Molecules and Proteins: A Geometry-Aware Approach to Binding Affinity
Accurate prediction of drug-target binding affinity can accelerate drug discovery by prioritizing promising compounds before costly wet-lab screening. While deep learning has advanced this task, most models fuse ligand and protein representations via simple concatenation and lack explicit geometric regularization, resulting in poor generalization across chemical space and time. We introduce FIRM-DTI, a lightweight framework that conditions molecular embeddings on protein embeddings through a feature-wise linear modulation (FiLM) layer and enforces metric structure with a triplet loss. An RBF regression head operating on embedding distances yields smooth, interpretable affinity predictions. Despite its modest size, FIRM-DTI achieves state-of-the-art performance on the Therapeutics Data Commons DTI-DG benchmark, as demonstrated by an extensive ablation study and out-of-domain evaluation. Our results underscore the value of conditioning and metric learning for robust drug-target affinity prediction.
Open AccessLearning to Align Molecules and Proteins: A Geometry-Aware Approach to Binding Affinity
Accurate prediction of drug-target binding affinity can accelerate drug discovery by prioritizing promising compounds before costly wet-lab screening. While deep learning has advanced this task, most models fuse ligand and protein representations via simple concatenation and lack explicit geometric regularization, resulting in poor generalization across chemical space and time. We introduce FIRM-DTI, a lightweight framework that conditions molecular embeddings on protein embeddings through a feature-wise linear modulation (FiLM) layer and enforces metric structure with a triplet loss. An RBF regression head operating on embedding distances yields smooth, interpretable affinity predictions. Despite its modest size, FIRM-DTI achieves state-of-the-art performance on the Therapeutics Data Commons DTI-DG benchmark, as demonstrated by an extensive ablation study and out-of-domain evaluation. Our results underscore the value of conditioning and metric learning for robust drug-target affinity prediction.
- Open Access
- 16 September 2025
- Published by Springer Nature in Human Genetics
- Vol. 144 (9-10) , 1-22
Regulating genome language models: navigating policy challenges at the intersection of AI and genetics
Genome Language Models (GLMs) represent a transformative convergence of artificial intelligence (AI) and genomics, offering unprecedented capabilities for biological discovery, healthcare innovation, and therapeutic design applications. However, these powerful tools create novel regulatory challenges that existing frameworks—whether AI governance or genomic privacy protections—cannot adequately address alone. This paper examines the critical regulatory gaps emerging at this intersection, highlighting tensions between AI principles that favor broad data access and genomic governance that demands stringent privacy protections and informed consent. We analyze how GLMs challenge conventional regulatory approaches as they pertain to applications in disease risk prediction, international research collaboration, and open-source model distribution. We propose a multilayered governance framework that combines policy innovations such as regulatory sandboxes and certification frameworks with technical solutions for privacy preservation and model interpretability. By developing adaptive governance strategies that bridge AI and genomic regulation, we can enable responsible GLM innovation while safeguarding individual rights, promoting equity, and addressing emerging biosecurity concerns in this rapidly evolving field.
- 16 September 2025
- Published by Springer Nature in Human Genetics
- Vol. 144 (9-10) , 1-22
Open AccessRegulating genome language models: navigating policy challenges at the intersection of AI and genetics
Genome Language Models (GLMs) represent a transformative convergence of artificial intelligence (AI) and genomics, offering unprecedented capabilities for biological discovery, healthcare innovation, and therapeutic design applications. However, these powerful tools create novel regulatory challenges that existing frameworks—whether AI governance or genomic privacy protections—cannot adequately address alone. This paper examines the critical regulatory gaps emerging at this intersection, highlighting tensions between AI principles that favor broad data access and genomic governance that demands stringent privacy protections and informed consent. We analyze how GLMs challenge conventional regulatory approaches as they pertain to applications in disease risk prediction, international research collaboration, and open-source model distribution. We propose a multilayered governance framework that combines policy innovations such as regulatory sandboxes and certification frameworks with technical solutions for privacy preservation and model interpretability. By developing adaptive governance strategies that bridge AI and genomic regulation, we can enable responsible GLM innovation while safeguarding individual rights, promoting equity, and addressing emerging biosecurity concerns in this rapidly evolving field.
- Open Access
- 16 September 2025
- Published by MDPI AG in Preprints.org
Uncensored AI in the Wild: Tracking Publicly Available and Locally Deployable LLMs
Open-weight generative large language models (LLMs) can be freely downloaded and modified, yet little empirical evidence exists on how these models are systematically altered and redistributed. This study presents the first large-scale analysis of safety-modified open-weight LLMs, examining 8,608 model repositories scraped from Hugging Face to identify a growing population of uncensored models adapted to bypass alignment safeguards. Selected modified models are evaluated across unsafe prompts spanning election disinformation, criminal instruction, and regulatory evasion. The study demonstrates that modified models exhibit a complete safety inversion: while unmodified models complied with only 18.8% of unsafe requests, modified variants complied at a mean rate of 74.1%. Modification effectiveness was independent of model size, with smaller 14-billion parameter variants sometimes matching or exceeding the compliance levels of 70-billion parameter versions. The ecosystem is highly concentrated yet structurally decentralized; for example, the top 5% of providers account for over 60% of downloads, and the top 20 for nearly 86%. Moreover, more than half of the identified models use GGUF packaging, optimized for consumer hardware, and 4-bit quantization methods proliferate widely, though full- and 16-bit models remain the most downloaded. These findings demonstrate how locally deployable, modified LLMs represent a paradigm shift for Internet safety governance, calling for new regulatory approaches suited to decentralized AI.
- 16 September 2025
- Published by MDPI AG in Preprints.org
Open AccessUncensored AI in the Wild: Tracking Publicly Available and Locally Deployable LLMs
Open-weight generative large language models (LLMs) can be freely downloaded and modified, yet little empirical evidence exists on how these models are systematically altered and redistributed. This study presents the first large-scale analysis of safety-modified open-weight LLMs, examining 8,608 model repositories scraped from Hugging Face to identify a growing population of uncensored models adapted to bypass alignment safeguards. Selected modified models are evaluated across unsafe prompts spanning election disinformation, criminal instruction, and regulatory evasion. The study demonstrates that modified models exhibit a complete safety inversion: while unmodified models complied with only 18.8% of unsafe requests, modified variants complied at a mean rate of 74.1%. Modification effectiveness was independent of model size, with smaller 14-billion parameter variants sometimes matching or exceeding the compliance levels of 70-billion parameter versions. The ecosystem is highly concentrated yet structurally decentralized; for example, the top 5% of providers account for over 60% of downloads, and the top 20 for nearly 86%. Moreover, more than half of the identified models use GGUF packaging, optimized for consumer hardware, and 4-bit quantization methods proliferate widely, though full- and 16-bit models remain the most downloaded. These findings demonstrate how locally deployable, modified LLMs represent a paradigm shift for Internet safety governance, calling for new regulatory approaches suited to decentralized AI.