Predicting Activity Cliffs for Autonomous Medicinal Chemistry

• URL: http://arxiv.org/abs/2604.07560v1
• Date: Wed, 08 Apr 2026 20:02:17 GMT
• Title: Predicting Activity Cliffs for Autonomous Medicinal Chemistry
• Abstract summary: Activity cliff prediction has been a persistent challenge in computational medicinal chemistry.<n>This work focuses on a parsimonious definition: which small modifications, at which positions, confer the highest probability of an outcome change.<n> Position-level sensitivity is calculated using 25 million matched molecular pairs from 50 ChEMBL targets across six protein families.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Activity cliff prediction - identifying positions where small structural changes cause large potency shifts - has been a persistent challenge in computational medicinal chemistry. This work focuses on a parsimonious definition: which small modifications, at which positions, confer the highest probability of an outcome change. Position-level sensitivity is calculated using 25 million matched molecular pairs from 50 ChEMBL targets across six protein families, revealing that two questions have fundamentally different answers. "Which positions vary most?" is answered by scaffold size alone (NDCG@3 = 0.966), requiring no machine learning. "Which are true activity cliffs?" - where small modifications cause disproportionately large effects, as captured by SALI normalization - requires an 11-feature model with 3D pharmacophore context (NDCG@3 = 0.910 vs. 0.839 random), generalizing across all six protein families, novel scaffolds (0.913), and temporal splits (0.878). The model identifies the cliff-prone position first 53% of the time (vs. 27% random - 2x lift), reducing positions a chemist must explore from 3.1 to 2.1 - a 31% reduction in first-round experiments. Predicting which modification to make is not tractable from structure alone (Spearman 0.268, collapsing to -0.31 on novel scaffolds). The system is released as open-source code and an interactive webapp.

Related papers

• EnTrust: Modeling Inter-Modal Conflict for Trustworthy Multimodal Medical Image Analysis [41.67522319355107]
  EnTrust is a framework that treats inter-modal conflict as the primary source of predictive uncertainty.<n>It achieves state-of-the-art segmentation accuracy while reducing calibration error by 40% compared to the strongest baseline.
  arXiv  Detail & Related papers  (2026-06-19T12:43:50Z)
• Measuring and Improving Behavioral Consistency in Large Language Models through Fact-Heuristic-Emotion State Enforcement [4.226475360842309]
  Large language models (LLMs) can give different answers to the same decision problem across runs, and reverse a decision when their own prior answer returns as context.<n>We ask whether this instability can be measured and partially reduced without changing model weights.<n>We test the Cognitive Kernel Model (CKM), a prompt-level state-enforcement layer.
  arXiv  Detail & Related papers  (2026-06-05T12:36:36Z)
• SpliceBind: Isoform-Aware Prediction of Binding Pocket Druggability [0.0]
  We introduce a graph neural network framework for bridging-aware druggability prediction.<n> Systematic analysis of six clinically validated variants spanning five mechanism classes reveals a two-tier resistance taxonomy.<n>On 229 kinase pockets spanning 25 families, SpliceBind achieves AUROC 0.703 with robust to held-out families.
  arXiv  Detail & Related papers  (2026-06-01T09:21:24Z)
• Amplifying, Not Learning: Fine-Tuned AI Text Detectors Amplify a Pretrained Direction [51.56484100374058]
  Text detectors amplify a pretrained typicality axis; they do not construct an AI-vs-human boundary.<n>On raw encoders before any task supervision, projecting onto centroid(AI)-centroid(HC3) achieves NYT-vs-HC3 AUROC 0.806/0.944/0.834 across three architectures.<n>On RoBERTa-base, raw projection exceeds fine-tuning; on RoBERTa-base, full fine-tuning reduces discrimination below raw on both fluent-formal populations tested.
  arXiv  Detail & Related papers  (2026-05-20T19:08:38Z)
• Decomposing the Generalization Gap in PROTAC Activity Prediction: Variance Attribution and the Inter-Laboratory Ceiling [11.472625518731173]
  We frame this as an evaluation-science question and use targeted protein degradation as the empirical test bed.<n>We release PROTAC-Bench (10,748 measurements, 173 targets, 65 LOTO folds), the variance-deduplication framework, the per-target calibration protocol, and the evaluation code.
  arXiv  Detail & Related papers  (2026-05-12T08:35:02Z)
• Greedy Is a Strong Default: Agents as Iterative Optimizers [0.22843885788439797]
  We replace the random proposal generator with an LLM agent that reasons about evaluation diagnostics to propose informed candidates.<n>We evaluate on four tasks spanning discrete, mixed, and continuous search spaces.
  arXiv  Detail & Related papers  (2026-03-28T21:26:40Z)
• PinPoint: Monocular Needle Pose Estimation for Robotic Suturing via Stein Variational Newton and Geometric Residuals [3.1332682125418074]
  PinPoint is a probabilistic variational inference framework for estimation of surgical needle 3D position and orientation.<n>On real needle-tracking sequences, PinPoint reduces mean translational error by 80% (down to 1.00 mm) and rotational error by 78% (down to 13.80)<n>On induced-rotation sequences, where monocular ambiguity is most severe, PinPoint maintains a bimodal posterior 84% of the time.
  arXiv  Detail & Related papers  (2026-03-24T15:59:28Z)
• Fundamental Limits of Neural Network Sparsification: Evidence from Catastrophic Interpretability Collapse [7.167095059974211]
  This work investigates feature survival under severe capacity constraints in Variational Autoencoder--Sparse Autoencoder architectures.<n>We introduce an adaptive sparsity scheduling framework that progressively reduces active neurons from 500 to 50 over 50 training epochs.<n>Our key finding reveals a pervasive paradox: while global representation quality remains stable, local feature interpretability collapses systematically.
  arXiv  Detail & Related papers  (2026-03-18T00:16:38Z)
• Telogenesis: Goal Is All U Need [8.585574846949628]
  We propose a priority function that generates observation targets from three gaps: ignorance, surprise, and staleness.<n>We validate this in two systems: a minimal attention-allocation environment (2,000 runs) and a modular, partially observable world (500 runs.<n>A key finding is metric-dependent reversal: under global prediction error, coverage-based rotation wins; under change detection latency, priority-guided allocation wins, with advantage growing monotonically with dimensionality.
  arXiv  Detail & Related papers  (2026-03-10T10:28:45Z)
• Towards a Science of Scaling Agent Systems [79.64446272302287]
  We formalize a definition for agent evaluation and characterize scaling laws as the interplay between agent quantity, coordination structure, modelic, and task properties.<n>We derive a predictive model using coordination metrics, that cross-validated R2=0, enabling prediction on unseen task domains.<n>We identify three effects: (1) a tool-coordination trade-off: under fixed computational budgets, tool-heavy tasks suffer disproportionately from multi-agent overhead, and (2) a capability saturation: coordination yields diminishing or negative returns once single-agent baselines exceed 45%.
  arXiv  Detail & Related papers  (2025-12-09T06:52:21Z)
• IPENS:Interactive Unsupervised Framework for Rapid Plant Phenotyping Extraction via NeRF-SAM2 Fusion [7.103482669612749]
  IPENS is an unsupervised multi-target point cloud extraction method.<n>It achieves a grain-level segmentation accuracy (mIoU) of 63.72% on a rice dataset.<n>It also improves segmentation accuracy to 89.68% (mIoU) on a wheat dataset.
  arXiv  Detail & Related papers  (2025-05-19T18:13:09Z)
• Learning Equivariant Non-Local Electron Density Functionals [51.721844709174206]
  We introduce Equivariant Graph Exchange Correlation (EG-XC), a novel non-local XC functional based on equivariant graph neural networks (GNNs)<n>By applying an equivariant GNN on this point cloud, we capture molecular-range interactions in a scalable and accurate manner.<n> EG-XC excels in data efficiency and molecular size extrapolation on QM9, matching force fields trained on 5 times more and larger molecules.
  arXiv  Detail & Related papers  (2024-10-10T14:31:45Z)
• RULSurv: A probabilistic survival-based method for early censoring-aware prediction of remaining useful life in ball bearings [39.58317527488534]
  We introduce a novel and flexible method for early fault detection using Kullback-Leibler divergence and RUL estimation.<n>We demonstrate our approach in the XJTU-SY dataset using a 5-fold cross-validation strategy across three different operating conditions.<n>Our approach achieves a mean cumulative relative accuracy (CRA) of 0.7586 over 5 bearings under the highest load, which improves over several state-of-the-art baselines.
  arXiv  Detail & Related papers  (2024-05-02T16:17:29Z)
• Confidence-Based Model Selection: When to Take Shortcuts for Subpopulation Shifts [119.22672589020394]
  We propose COnfidence-baSed MOdel Selection (CosMoS), where model confidence can effectively guide model selection. We evaluate CosMoS on four datasets with spurious correlations, each with multiple test sets with varying levels of data distribution shift.
  arXiv  Detail & Related papers  (2023-06-19T18:48:15Z)
• Characterizing and addressing the issue of oversmoothing in neural autoregressive sequence modeling [49.06391831200667]
  We study the effect of the proposed regularization on both model distribution and decoding performance. We conclude that the high degree of oversmoothing is the main reason behind the case of overly probable short sequences in a neural autoregressive model.
  arXiv  Detail & Related papers  (2021-12-16T14:33:12Z)
• An Analysis of the Adaptation Speed of Causal Models [80.77896315374747]
  Recently, Bengio et al. conjectured that among all candidate models, $G$ is the fastest to adapt from one dataset to another. We investigate the adaptation speed of cause-effect SCMs using convergence rates from optimization. Surprisingly, we find situations where the anticausal model is advantaged, falsifying the initial hypothesis.
  arXiv  Detail & Related papers  (2020-05-18T23:48:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.