CORTEXA
← Browse
arxivcs.LGstat.ML2026-07-07

A Quiet Failure in Calibrated Virtual Screening: Marginal Conformal Prediction Under-Covers the Minority Class, and a Class-Conditional Fix Recovers It

Muhammadjon Tursunbadalov, Mustafojon Tursunbadalov

Conformal prediction is being adopted in drug discovery to put an honest number on model reliability: pick an error rate alpha, and the method returns prediction sets containing the true label with probability at least 1 - alpha. We show this guarantee can be dangerous on imbalanced datasets. Across four datasets, standard (marginal) conformal prediction hits its global 90% coverage target while leaving the minority class badly exposed: realized minority coverage falls to 64.8% on blood-brain-barrier penetration and to 4.2% on clinical-trial toxicity, where the rare class is nearly abandoned. The failure is not tied to one model: a random forest, a graph network, and a frozen chemical language model all reproduce it (p < 0.001 in every case), with severity tracking baseline calibration on rare labels rather than architecture. A conservation identity explains the effect: the minority's shortfall equals the majority's surplus amplified by the imbalance ratio, predicting the measured gap to within one point and ordering severity across datasets. The failure survives realistic scaffold splits and a second conformal score, while aggregate accuracy and overall coverage stay reassuringly high, which is exactly why it is easy to miss. Class-conditional (Mondrian) conformal prediction closes the gap on every dataset, restoring minority coverage to target for a modest increase in prediction-set size. We localize the failures to generic molecular scaffolds - plain benzene and pyridine cores occurring in both classes - propose a one-number diagnostic, and show with a cost model that abstaining on affected compounds flips a screening campaign from net-negative to net-positive utility. Our contribution is demonstrating on real chemistry how severe and invisible this known conformal-theory gap becomes under imbalance, and laying out a practical protocol restoring per-class reliability.

View free PDFSource page

Related papers

arxivstat.MLcs.LGstat.AP2026-07-24

General Value Functions for Remaining Useful Life and Failure-Mode Prediction

Hao Yan, Ali Sarabi, Qing Zou, Boyang Xu

Remaining useful life (RUL) prediction and failure-mode classification are central tasks in predictive maintenance. Many data-driven pipelines use fixed-window supervised learning with complete terminal labels; such routes do not naturally encode the temporal recursion linking su…

View free PDFSource page
arxivcs.LGcs.AIcs.CRcs.CVstat.ML2026-07-23

Self-Poisoning in Adaptive Out-of-Distribution Detection: A Sharp-Threshold Theory and Certified Label-Free Calibration

Vishnu Bindu Balachandran

Test-time adaptive out-of-distribution (OOD) detectors update a memory bank from the unlabelled stream. We show this adaptation obeys a provable dynamical law. Modelling bank impurity as a generalized Pólya urn, we prove almost-sure convergence to a mean-field equilibrium whose s…

View free PDFSource page
arxivstat.MLcs.LG2026-07-23

Transformer-based Diffusion models for Hydrological Time Series Probabilistic Imputation and Forecasting

Ferdinand Bhavsar, Lionel Benoit, Maxime Savatier, Edith Gabriel

The modeling of hydrometeorological time series with limited observations is a key challenge in the monitoring of hydro-systems and water resources, as well as for flood or drought risk assessment. Due to the high variability of the underlying processes and the sparsity of availa…

View free PDFSource page
arxivstat.MLcs.LGmath.NAstat.CO2026-07-24

Convergence analysis of a family of Zermelo-type iterations for the Bradley--Terry model

Ruijian Han, Ding Lu, Yiming Xu

Zermelo's algorithm is a classical method for computing the maximum likelihood estimator in the Bradley--Terry (BT) model, but its convergence can be slow in practice. To accelerate computation, Newman introduced a family of Zermelo-type fixed-point iterations parameterized by $α…

View free PDFSource page
arxivstat.MLcs.LG2026-07-24

Graph-Based Correlation Matrix Generation: A Convex Optimization Approach

Ali Fakhar, K{é}vin Polisano, Ir{è}ne Gannaz, Sophie Achard

This work addresses the generation of theoretical correlation matrices with prescribed sparsity patterns associated to graph structures. We propose a novel convex optimization framework in which an initial matrix is projected onto an elliptope under a positive semidefiniteness co…

View free PDFSource page