Adapting Evidential Neural Networks to Test-Time Neighbor Fusion Improves Molecular Property Prediction

• URL: http://arxiv.org/abs/2607.11091v1
• Date: Mon, 13 Jul 2026 04:59:09 GMT
• Title: Adapting Evidential Neural Networks to Test-Time Neighbor Fusion Improves Molecular Property Prediction
• Abstract summary: A trained molecular property model can be refined at test time by correcting each prediction with the measured labels of the most similar training molecules.<n>This work demonstrates that evidential uncertainty decomposition is not merely a calibration objective but an actionable inference resource.
• Score: 28.11511793703245
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A trained molecular property model can be refined at test time by correcting each prediction with the measured labels of the most similar training molecules, a retraining-free procedure we call neighbor fusion; evidential neural networks make it principled by using their aleatoric and epistemic uncertainty to parameterize a Bayesian update. Our main contribution, PG-EVIKAL, learns a property-distance metric to re-rank structurally similar neighbors by their property relevance before fusion, building on EVIKAL (scalar Kalman filter) and GP-EVIKAL (Gaussian process variant handling correlated neighbors). Evaluated on 16 molecular datasets, PG-EVIKAL reduces RMSE relative to the evidential model baseline on 14 of them, with a median reduction of 19.4%, and improves calibration; in sequential-assay scenarios it further incorporates newly measured molecules, refining predictions as they arrive without retraining. This work demonstrates that evidential uncertainty decomposition is not merely a calibration objective but an actionable inference resource that enables test-time refinement of molecular property predictions.

Related papers

• CoMPASS: Collaborative Molecular Property Prediction via Adaptive Small-Large Model Synergy [8.012730274764019]
  Accurate molecular property prediction requires both statistical reliability and chemical reasoning.<n>CoMPASS is a retrieval-calibrated framework for small-large model collaboration.<n>Results suggest that generative reasoning should augment calibrated prediction through evidence-grounded, controlled corrections.
  arXiv  Detail & Related papers  (2026-08-31T12:14:01Z)
• ToxLens: A Reproducible Graph-Learning Framework for Leakage-Aware, Uncertainty-Calibrated Molecular Toxicity Prediction [0.0]
  ToxLens is a graph-learning framework for 11 toxicity endpoints spanning Ames mutagenicity, acute oral toxicity, hERG inhibition, and Tox21 nuclear-receptor and stress-response assays.<n>The workflow combines conservative chemical curation, sphere-exclusion filtering, a leakage-aware UMAP-HDBSCAN split, parallel graph and global-feature encoders joined by late concatenation.<n>On the leakage-controlled test fold, a five-seed soft-voting ensemble achieved a Matthews correlation coefficient score of 0.44, an area under the receiver operating characteristic curve score of 0.83, and an area under the
  arXiv  Detail & Related papers  (2026-08-31T08:58:51Z)
• Uncertainty-aware reinforcement learning for chemical language models [0.5156484100374058]
  Reinforcement Learning (RL) has become a powerful paradigm for de novo molecular design.<n>We show that uncertainty-aware RL enables CLMs to explore chemical space more robustly.<n>This leads to more reliable hit discovery without compromising molecular score.
  arXiv  Detail & Related papers  (2026-06-23T14:42:46Z)
• Robust Regression with Adaptive Contamination in Response: Optimal Rates and Computational Barriers [65.58071581164043]
  We study robust regression under a contamination model in which covariates are clean while the responses may be corrupted in an adaptive manner.<n>We show that the additional information can be carefully exploited to construct an estimator that a better estimation rate than achieves that attainable under Huber contamination.<n>Despite the improvement over the Huber model from an information-theoretic perspective, we provide formal evidence that the problem exhibits strong information-computation gaps.
  arXiv  Detail & Related papers  (2026-04-05T19:07:24Z)
• Improving Minimax Estimation Rates for Contaminated Mixture of Multinomial Logistic Experts via Expert Heterogeneity [49.809923981964715]
  Contaminated mixture of experts (MoE) is motivated by transfer learning methods where a pre-trained model, acting as a frozen expert, is integrated with an adapter model, functioning as a trainable expert, in order to learn a new task.<n>In this work, we characterize uniform convergence rates for estimating parameters under challenging settings where ground-truth parameters vary with the sample size.<n>We also establish corresponding minimax lower bounds to ensure that these rates are minimax optimal.
  arXiv  Detail & Related papers  (2026-01-31T23:45:50Z)
• Composable Score-based Graph Diffusion Model for Multi-Conditional Molecular Generation [85.58520120011269]
  We propose Composable Score-based Graph Diffusion model (CSGD), which extends score matching to discrete graphs via concrete scores.<n>We show that CSGD achieves state-of-the-art performance with a 15.3% average improvement in controllability over prior methods.<n>Our findings highlight the practical advantages of score-based modeling for discrete graph generation and its capacity for flexible, multi-property molecular design.
  arXiv  Detail & Related papers  (2025-09-11T13:37:56Z)
• Amortized In-Context Mixed Effect Transformer Models: A Zero-Shot Approach for Pharmacokinetics [0.0]
  We present the Amortized In-Context Mixed-Effect Transformer (AICMET) model.<n>It unifies mechanistic compartmental priors with amortized in-context Bayesian inference.<n>Experiments show that AICMET attains state-of-the-art predictive accuracy and faithfully quantifies inter-patient variability.
  arXiv  Detail & Related papers  (2025-08-21T15:45:17Z)
• SE(3)-Invariant Multiparameter Persistent Homology for Chiral-Sensitive Molecular Property Prediction [1.534667887016089]
  We present a novel method for generating molecular fingerprints using multi parameter persistent homology (MPPH) This technique holds considerable significance for drug discovery and materials science, where precise molecular property prediction is vital. We demonstrate its superior performance over existing state-of-the-art methods in predicting molecular properties through extensive evaluations on the MoleculeNet benchmark.
  arXiv  Detail & Related papers  (2023-12-12T09:33:54Z)
• Uncertainty quantification for predictions of atomistic neural networks [0.0]
  This paper explores the value of uncertainty quantification on predictions for trained neural networks (NNs) on quantum chemical reference data. The architecture of the PhysNet NN was suitably modified and the resulting model was evaluated with different metrics to quantify calibration, quality of predictions, and whether prediction error and the predicted uncertainty can be correlated.
  arXiv  Detail & Related papers  (2022-07-14T13:39:43Z)
• Training on Test Data with Bayesian Adaptation for Covariate Shift [96.3250517412545]
  Deep neural networks often make inaccurate predictions with unreliable uncertainty estimates. We derive a Bayesian model that provides for a well-defined relationship between unlabeled inputs under distributional shift and model parameters. We show that our method improves both accuracy and uncertainty estimation.
  arXiv  Detail & Related papers  (2021-09-27T01:09:08Z)
• Bayesian Graph Neural Networks for Molecular Property Prediction [15.160090982544867]
  This study benchmarks a set of Bayesian methods applied to a directed MPNN, using the QM9 regression dataset. We find that capturing uncertainty in both readout and message passing parameters yields enhanced predictive accuracy, calibration, and performance on a downstream molecular search task.
  arXiv  Detail & Related papers  (2020-11-25T22:32:54Z)
• Unlabelled Data Improves Bayesian Uncertainty Calibration under Covariate Shift [100.52588638477862]
  We develop an approximate Bayesian inference scheme based on posterior regularisation. We demonstrate the utility of our method in the context of transferring prognostic models of prostate cancer across globally diverse populations.
  arXiv  Detail & Related papers  (2020-06-26T13:50:19Z)
• Nonparametric Score Estimators [49.42469547970041]
  Estimating the score from a set of samples generated by an unknown distribution is a fundamental task in inference and learning of probabilistic models. We provide a unifying view of these estimators under the framework of regularized nonparametric regression. We propose score estimators based on iterative regularization that enjoy computational benefits from curl-free kernels and fast convergence.
  arXiv  Detail & Related papers  (2020-05-20T15:01:03Z)

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.