Papers for

pharmaceutical development teams

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Bayesian method matches single cells across data types with confidence

BASILISC: Bayesian Alignment of Siamese-Integrated Latents for Inferring Single-cell Correspondence

Abstract: Single-cell assays study the genome one cell at a time. Unimodal assays measure one molecular layer, the newer multimodal assays measure several. Most data are single-modality, so integrating them relies on models trained on multimodal assays, where the cell correspondence across modalities is known. These models return a matching, but rarely a confidence measure. We present BASILISC (Bayesian Alignment of Siamese-Integrated Latents for Inferring Single-cell Correspondence), a framework for matching single-cell representations with uncertainty on the correspondence itself. A BASILISC model is a probabilistic siamese network over the two modalities with a predictive distribution over the correspondence for a cross-modal pair of cells. We instantiate it at two levels: at the cell-type level the question is whether two cells share a cell type, at the cell level which cell is the partner in the other modality. To our knowledge, this is the first uncertainty score on a learned cross-modal correspondence evaluated against a known ground-truth pairing. BASILISC learns a similarity across modalities that reflects cell lineage: an unseen cell type is matched to its lineage relative, matching still works on such held-out types (balanced accuracy 0.86 on unseen against 0.93 on seen types), and the predictive uncertainty rises on these out-of-distribution cells. The uncertainty score also selects high-quality matches for downstream analysis: discarding the least certain fifth of the pairs raises accuracy from 0.93 to 0.98. At the cell level, a deep ensemble of the deterministic matcher reaches 0.062 matching accuracy on the benchmark test set, above the competition winner; on the Bayesian matcher's assignment, the posterior flags the wrong matches that cross a cell-type boundary better than a deterministic read of the same scores (AUROC 0.68 against 0.64).

Wed 28 OctMachine Learning
The gist
When scientists study individual cells, they often measure different kinds of data about each cell, but linking those measurements across types is tricky. The authors introduce BASILISC, a new model that not only matches cells from different data types but also tells you how confident it is in each match. This helps identify uncertain matches and improves reliability. Their approach works well even with cell types the model hasn’t seen before.
Open → 2610.39050v1

Human gene data forms two main groups across clustering methods

Clustering of High-Dimensional Human Gene Score Data for Target Cell Classification

Abstract: The goal is to investigate whether the total human gene-score dataset and the selected human kinase-gene dataset exhibit the same number of clusters when analysed using the same set of 769 features. Two datasets were considered: the complete gene score dataset and a subset containing selected kinase genes. Two missing-data strategies were investigated. In Case I, rows containing missing gene-score values were removed. In Case II, rows with more than 20% missing values were excluded and the other missing values were replaced by the corresponding column mean. For each case, the data were scaled and principal component analysis (PCA) was performed before clustering. Four clustering approaches were considered: K-Means, Hierarchical Clustering, Fuzzy C-Means, and Graph-based Clustering. Across both datasets and both missing-data treatments, the optimal number of clusters was found to be two. In the absence of an optimal number of clusters, the quality of clustering was assessed using the Silhouette score. Relatively high Silhouette scores were obtained in all cases.

Sat 24 OctMachine Learning
The gist
Scientists looked at large sets of human gene activity scores to see if they could group cells into similar types. They tested both complete gene data and a smaller subset of important genes, using different ways to handle missing information. After analyzing the data with common clustering methods, they found that cells consistently grouped into two main clusters. This suggests a stable way to classify cells based on gene activity patterns.
Open → 2610.33531v1

Selective drug design models struggle to avoid off-target effects

On the Selectivity of Generative Models in Structure-Based Drug Design

Abstract: Designing small-molecule drugs that selectively bind to a target protein while avoiding unintended interactions with other proteins is essential for reducing side effects that contribute substantially to clinical attrition. Although structure-based drug design (SBDD) has advanced rapidly with deep learning, most generative models still optimize binding to a single target and disregard selectivity due to limited training data and unknown off-target interactions. Motivated by this gap, we introduce SELECTBENCH, a comprehensive benchmark assessing the selectivity of generative SBDD models. SELECTBENCH provides three curated evaluation tasks reflecting different real-world drug discovery scenarios: literature-based case studies, safety screening panels used in pharmaceutical development, and large-scale structure-based evaluation sets. We further introduce a suite of metrics to quantify selectivity and conduct a systematic evaluation of nine representative SBDD models, including methods explicitly trained for selectivity and widely-used inference-time guidance techniques. Our results show that even selectivity-trained models achieve only modest off-target discrimination and inference-time guidance provides limited gains, underscoring the need for method improvement. SELECTBENCH provides both a characterization of where current generative SBDD stands on selectivity and an open, extensible platform to accelerate progress. The benchmark is available at https://github.com/lovetaro/selectbench.

Fri 16 OctMachine LearningArtificial Intelligence
The gist
Designing drugs that stick only to the intended proteins without bothering others is important to reduce side effects. The authors created SELECTBENCH, a new way to test how well computer programs can design such selective drugs by looking at multiple real-life situations. They tested several existing programs, including some designed to focus on selectivity, and found that these models still have a hard time avoiding unwanted interactions. This work highlights where current tools fall short and offers a shared platform to help improve future drug design programs.
Open → 2610.24124v1

BioPRM improves step-by-step checks of biological experiment protocols

BioPRM: Step-Level Consistency Verification of Biological Protocols

Abstract: Process reward models (PRMs) provide fine-grained supervision for assessing intermediate steps in language-model outputs, but their application to biological protocols presents distinct challenges. Protocol validity depends on both the appropriateness of individual operations and their consistency with the experimental objective and surrounding procedure, while experimental outcomes are typically unavailable during verification. We introduce BioPRM, a contextual process reward model for identifying procedural inconsistencies in structured biological protocols. We construct a supervision corpus from SciRecipe and protocols collected from protocols.io and Bio-protocol using LLM-assisted construction and source-specific review by personnel with biological expertise.

Wed 14 OctComputational Engineering, Finance, and Science
The gist
Biological experiments follow detailed instructions called protocols, but mistakes or inconsistencies in these steps can affect results. The authors created BioPRM, a model that looks at each step of a protocol to find errors or misalignments with the experiment's goal, even without seeing the final results. They trained this model using a carefully reviewed collection of existing protocols and recipes, making it better at spotting problems. This helps ensure that biological experiments are carried out correctly.
Open → 2610.19657v1

Molecular optimization improves with multi-turn feedback learning

MFG: Multi-turn Feedback Guided Molecular Optimization

Abstract: Multi-objective molecular optimization is a critical process in drug discovery that aims to modify a given molecule to simultaneously improve multiple properties while maintaining a similar overall structure. This process often requires iterative modifications guided by computational or experimental feedback. Recent large language model (LLM)-based methods have begun to explore this iterative approach; however, these methods are not explicitly trained to leverage such feedback, while existing approaches primarily focus on single-turn molecular optimization. To address this gap, we introduce Multi-turn Feedback Guided (MFG) molecular optimization, a reinforcement learning framework that trains an LLM to progressively optimize molecules using feedback from previous turns. MFG introduces a feedback vector capturing both property improvements and source molecule similarity, alongside a feedback-aligned reward function that promotes progressive improvement across turns. We apply MFG over $\text{GeLLM}^{3}\text{O}$, a state-of-the-art LLM model for multi-objective molecular optimization, evaluate $\text{GeLLM}^{3}\text{O-MFG}$ on ten multi-objective molecular optimization tasks. The results demonstrate that $\text{GeLLM}^{3}\text{O-MFG}$ achieves the highest average similarity-constrained success rate ($81.50%$), outperforming the base model $\text{GeLLM}^{3}\text{O}$ ($70.81%$).

Tue 13 OctArtificial IntelligenceMachine Learning
The gist
Improving molecules to make better drugs is hard because several properties need to get better without changing the molecule too much. The authors created a system where a language model can improve molecules step-by-step, using feedback from past changes to guide each next step. This approach does better than previous methods that tried to optimize molecules in only one step. It helps computer programs suggest better drug candidates more reliably.
Open → 2610.18851v1

Multi-agent system accelerates drug discovery from start to finish

MADDIE: Multi-Agent Drug Discovery Engine

Abstract: Drug discovery remains a resource-intensive and time-consuming process, involving billions of dollars and a decade of development to advance a drug to market. While many in silico tools have accelerated this process, operating them still demands substantial time, effort, and expertise from medicinal chemists. Autonomous systems built on Large Language Models (LLMs) have emerged as a promising solution, yet current designs limit their performance. Existing single-agent systems scale poorly to long-horizon, multi-step, and realistic tasks, whereas multi-agent systems typically execute predefined workflows that cannot capture the iterative, non-linear nature of a real drug discovery campaign. Here, we present MADDIE, a multi-agent drug discovery engine. It comprises a central agent, Orchestrator, and four specialized worker agents: HitIdentifier, LeadOptimizer, Synthesizer, and Evaluator, each representing a critical step in a drug discovery campaign. Under Orchestrator's orchestration and coordination, these worker agents are composed into flexible workflows, enabling MADDIE to adapt its strategy and navigate the drug discovery pipeline end-to-end. Across 50 protein targets, MADDIE produces molecules satisfying key property requirements and their synthesis routes, outperforming existing agentic systems, generative models, and general-purpose LLMs by a wide margin. Our analysis reveals how these agents collaborate and that MADDIE can employ different strategies across targets to achieve the campaign's goal, while still being efficient in time and tokens. Together, they demonstrate MADDIE as a low-cost, effective, and efficient autonomous engine for accelerating drug discovery. Code and dataset is available via https://github.com/ninglab/MADDIE.

Mon 12 OctArtificial Intelligence
The gist
Finding new medicines usually takes a lot of time, money, and expert effort. The authors present MADDIE, a system with multiple AI agents, each responsible for a key step in drug discovery. These agents work together flexibly to design, optimize, synthesize, and test molecules. MADDIE performed well on 50 different protein targets, creating molecules that meet important criteria and outlining how to make them. It is more efficient and effective than previous single-agent or fixed-workflow approaches.
Open → 2610.16975v1

Motif augmented diffusion improves molecular structure identification from spectra

MAST: Motif-Augmented Diffusion with Search Tree for Spectroscopic Molecular Structure Elucidation

Abstract: Elucidating molecular structures from spectra is a foundational problem in chemical and materials characterization, yet remains challenging due to spectral ambiguity and the vast molecular space. Although recent diffusion-based generators show strong promise for spectra-conditioned elucidation, existing methods struggle to learn robust spectra-structure relationships from limited paired data when relying solely on global spectral representation. Moreover, the repeated full sampling inference strategy incurs substantial computation overhead. To address these limitations, we propose \textbf{MAST}, a \textbf{M}otif-\textbf{A}ugmented diffusion framework with \textbf{S}earch \textbf{T}ree, for joint 2D-3D spectroscopic molecular structure elucidation. MAST introduces explicit, interpretable \emph{motif priors} as intermediate evidences throughout denoising, reducing conditional ambiguity and facilitating spectra-conditioned optimization. We further cast diffusion sampling as \emph{reward-guided tree search} to prioritize high-reward denoising trajectories, yielding a compact set of spectra-consistent candidates under limited budgets. On the QM9S multi-spectra benchmark, MAST achieves \textbf{94.89\%} exact recovery and improves 3D fidelity, while preserving high chemical validity and stability. Code is available at https://github.com/Jia040223/MAST.

Thu 8 OctArtificial Intelligence
The gist
Figuring out the exact shape of molecules from their spectra is hard because many different molecules can produce similar signals. The authors introduce MAST, a method that uses known small molecule parts called motifs to guide the process, helping reduce confusion. They also use a smart search strategy to focus on the best guesses without wasting time. Their method greatly improves the accuracy and 3D detail of the predicted molecules compared to previous approaches.
Open → 2610.12067v1

Agent coordinates molecule design tools but real projects limited by model accuracy

From Benchmark to Bench: Can Agents Survive Real-World Drug Discovery?

Abstract: Agentic systems increasingly coordinate molecular-design tools, but it is unclear which layer of the stack limits outcomes on real projects. We developed MAGI, an open modular agent that authors objectives, launches and monitors optimization, interprets structure--activity relationships, and revises its strategy accordingly. MAGI generates molecules either directly through the LLM or by delegating to REINVENT 4, with scoring services interchangeable behind a common contract. We tested it across nine retrospective lead-optimization campaigns from three pharmaceutical companies, replayed under fixed temporal cutoffs. Both routes produced valid structures: LLM proposals stayed closer to local chemistry and reached comparable or higher primary activity in fewer operations, whereas REINVENT explored broader chemical space. Whether a campaign met its objective depended on the predictive models, not on the generation route: attainment followed model accuracy on the chemistry proposed, dropping once that chemistry moved outside the model's applicability domain. Separately, a blinded evaluation asked whether the MAGI's output could pass as expert work: chemists were not able to discriminate agentic proposals from held-out compounds, and judged the SAR reasoning broadly plausible yet incomplete. Together, these results position MAGI as a coordination layer pluggable into existing computational chemistry workflows. The ceiling on real projects, however, remains currently set by scorer applicability rather than by tool orchestration.

Mon 5 OctArtificial Intelligence
The gist
Discovering new medicines involves designing molecules that work well and are safe. The authors created MAGI, a computer agent that uses language models and a molecule generator to suggest new drug candidates and improve its strategy based on results. They tested MAGI on past drug development projects from companies and found it can propose useful molecules that experts can’t easily distinguish from human-made ones. However, the success of these suggestions depends on how accurate the computer models are at predicting molecule properties, not the molecule generation methods themselves.
Open → 2610.06411v1

Diffusion models and language AI improve molecular structure identification

Explainable Molecular Structure Inference from GC--MS with Diffusion Models and LLM Reranking

Abstract: GC--EI--MS is an important technique for analyzing volatile and semivolatile compounds in complex samples. However, conventional methods rely heavily on reference spectral library matching, limiting their ability to identify compounds absent from these libraries and to infer complete molecular structures directly from fragmentation information. Here, we present DiffGCMS, a spectrum-conditioned discrete graph diffusion model for de novo structure elucidation from GC--EI--MS, and further develop a framework that integrates DiffGCMS with second-stage reasoning by a large language model (LLM). In the first stage, DiffGCMS generates candidate molecular structures from input spectra; in the second stage, the LLM uses mass spectral information to validate, repair, and rerank the candidates and provides interpretable analysis of fragment-ion peaks. This framework can generate plausible molecular structures for compounds absent from reference spectral libraries and provide traceable evidence supporting its decisions. On a test set comprising 13,696 spectra from NIST 20, the generative model achieved Acc@1 and Acc@10 of 6.01\% and 15.76\%, respectively. On the test subset containing molecules with no more than 10 heavy atoms, LLM-assisted molecular graph repair and reranking increased Acc@1 from 21.28\% to 21.95\%, Acc@10 from 46.91\% to 47.99\%, and candidate validity from 91.04\% to 100\%. These results demonstrate that spectrum-aware postprocessing can correct errors produced by the generative model while providing auditable and traceable explanations for the final ranking.

Fri 2 OctMachine Learning
The gist
Analyzing chemicals by their mass patterns is hard, especially if the chemical isn’t in known databases. The authors developed a two-step method: first, a model guesses possible molecular shapes from data patterns; then, a language AI checks and fixes these guesses, also explaining how it made decisions. This approach helps find new molecules and provides clear reasons for its results. It tested well on a large set of chemical data.
Open → 2610.03066v1

MARCO improves iterative molecule editing with multi-round reinforcement

MARCO: Multi-Round Agentic Reinforcement for Conditional Molecular Optimization

Abstract: Molecular optimization is inherently iterative: a candidate is proposed, evaluated against several objectives, and revised while preserving a relationship to the source molecule. Most instruction-following models instead emit one edited molecule, forcing validity, property improvement, and similarity control into a single response. We introduce MARCO, an evaluator-grounded reinforcement-learning framework that trains molecular editors on bounded proposal--feedback--revision trajectories. MARCO aggregates shaped turn rewards into an undiscounted trajectory return for group-relative policy optimization. We evaluate two consequences of this training: Same-1 tests the trained policy under a one-response budget, while Same-5 tests whether the same policy can use verifier feedback when up to five responses are available. Across the three-objective MuMOInstruct benchmark, three Qwen backbones, and seen/unseen instruction splits, SFT-initialized MARCO obtains the highest product of property success rate and similarity in every reported primary setting. Same-5 further improves the observed score under the tested budget, while four-objective and public-checkpoint experiments test transfer across constraint sets and initialization regimes.

Tue 29 SeptMachine LearningComputation and Language
The gist
Designing better molecules often involves making step-by-step changes and checking if they meet certain goals, like being similar to the original molecule while improving its properties. The authors propose MARCO, a new method that trains AI models to improve molecules over multiple rounds by using feedback after each edit. This approach better balances creating valid, improved, and similar molecules compared to methods that try to do everything in one step. Tests show MARCO’s method works well across different instructions and molecule goals.
Open → 2609.36683v1

Cell Painting predictions improve by weighing and reasoning on evidence

From Retrieval to Reasoning: Agentic Mechanism Prediction from Cell Painting Profiles

Abstract: Cell Painting is a high-content morphological profiling assay widely used for phenotype-based biological inference, with mechanism of action (MOA) prediction as a central application. Existing approaches largely formulate Cell Painting-based inference as representation matching, assigning predictions from nearby reference perturbations in morphological feature space. However, retrieved neighbors are often noisy and partially misleading evidence due to batch effects, non-specific cytotoxicity, phenotypic convergence, and source-dependent variability. We reformulate Cell Painting-based MOA prediction as a calibrated evidence reasoning problem, where retrieved neighbors are treated as uncertain observations that must be evaluated, compared, and sometimes rejected before supporting a mechanistic conclusion. We propose PhenoAIR, a reliability-aware multi-agent framework that maintains a candidate-centric evidence memory and performs controller-guided refinement over phenotype- and mechanism-side evidence. PhenoAIR uses offline reference-set calibration to weight evidence by source reliability, phenotype stability, and mechanism-level confusion. We evaluate PhenoAIR on a benchmark constructed from JUMP Cell Painting profiles and annotations, covering controlled, realistic, and discovery-oriented open-world MOA prediction settings. PhenoAIR outperforms representation-matching and LLM-based baselines across all settings.

Tue 29 SeptArtificial Intelligence
The gist
Predicting how drugs work using cell images can be tricky because similar-looking cells don’t always mean the same drug effect. The authors show that instead of just matching similar profiles, it’s better to carefully consider and weigh different pieces of evidence before deciding. They built a system called PhenoAIR that judges how reliable each piece of evidence is and uses that to make better predictions. This approach worked better than methods that only compare cell profiles or use language models.
Open → 2609.36406v1

NeuronSifter improves planning of CNS interventions by modeling microenvironment dynamics

NeuronSifter: Intervention Planning in CNS Microenvironments

Abstract: Prioritizing central nervous system (CNS) interventions requires predicting how a dose, route, and schedule act on a partially observed microenvironment, then choosing the measurement that would change the decision. Action-conditioned predictors reduce a regimen to an identity token or a scalar exposure, discarding where and when the target is engaged; handing a point estimate to a separate planner then discards the joint uncertainty that makes a measurement worth running. We therefore treat decision quality as a property of the intervention interface, not of controller placement. NeuronSifter compiles regimens into state-conditional target-occupancy fields with support masks, propagates them through microenvironment dynamics with an occupancy-conditioned diffusion operator, and selects measurements by their expected reduction in intervention loss, assimilating typed outcomes into the same posterior. In a declared synthetic Alzheimer's disease (AD) evaluation over 64 paired scenario blocks, occupancy conditioning lowers trajectory continuous ranked probability score from 0.165 to 0.110 and raises intervention ordering accuracy from 0.760 to 0.880, and every paired benchmark contrast remains separated after Holm correction. Decision-directed acquisition attains terminal risk 0.160 against 0.166 for a matched numerical Bayesian experimental design planner, and reaches the target risk at 0.796 $[0.732,0.873]$ of an earlier design control's cost, while the corresponding ratio against the matched planner, 0.963 $[0.907,1.025]$, is not separated from equality; point-state and dependence-ablated interfaces instead raise risk to 0.220 and 0.199, and a full-posterior external controller ties exactly. Published AD trials supply a separate retrospective endpoint bridge.

Mon 28 SeptMachine Learning
The gist
Treating brain treatments as simple numbers hides important details about where and when drugs work in brain tissue. The authors created NeuronSifter, a method that models how treatments affect specific brain microenvironments over time and uses this to better plan interventions. By predicting how a treatment impacts brain cells and deciding the best measurements to improve decisions, NeuronSifter more accurately ranks treatment options. Tests in a simulated Alzheimer's disease setting show it improves prediction accuracy and lowers treatment risk compared to earlier methods.
Open → 2609.35445v1

Protein design improves stability across shape changes

Robust Biomolecular Complex Design Across Protein Conformational Landscapes

Abstract: Proteins populate conformational ensembles, yet structure-based biomolecular design typically optimizes candidates against a single target conformation. Consequently, a candidate that fits one state can lose favorable interactions or develop steric clashes when the target adopts another. We introduce FlexEvo, a model-agnostic evolutionary framework that adapts candidates once at inference time from a single target conformation to improve compatibility with alternative natural conformations unseen during adaptation, without retraining the source model or requiring a conformational ensemble. FlexEvo casts cross-state adaptation as geometry-constrained bi-objective optimization, balancing preservation of input-state interactions against robustness to plausible conformational perturbations. To limit the search space and reduce invalid structural edits, geometry-derived FlexBoxes define protected anchor regions, adaptable regions for local exploration, and forbidden regions for clash avoidance. A unified all-atom representation supports topology-preserving adaptation across diverse binder categories, while Pareto selection preserves nondominated candidates across the two objectives. We evaluate FlexEvo across multiple generation baselines and nine representative binder categories spanning diverse molecular sizes and structural topologies. FlexEvo reduces the category-balanced mean relative performance degradation from 47.8% to 4.4%, while adding only 1.4--3.1 minutes of adaptation per sample. These results establish single-state inference-time adaptation as a practical route toward robust biomolecular complex design across protein conformational landscapes.

Sun 27 SeptArtificial Intelligence
The gist
Proteins can change their shapes, but designing molecules to fit them usually focuses on just one shape. This causes problems when the protein shifts and the designed molecule no longer fits well. The authors created FlexEvo, a way to tweak protein designs quickly so they work well across different shapes without needing to redesign from scratch. It balances keeping the original good features and avoiding clashes when the protein moves. Testing shows this method greatly reduces loss of performance while adding only a little bit of extra design time.
Open → 2609.33726v1

Medical code based model improves drug candidate screening for Alzheimer's

Pretrained Medical Representations for the Practical Screening of Drug Repositioning Candidates

Abstract: Representation learning from medical code sequences in electronic health records and medical claims data has been successful in various clinical applications, such as those regarding disease prediction. However, significant challenges remain in extending this approach to the discovery of scientific hypotheses. One reason is that many existing BERT-based models fail to adequately capture the hierarchical structure of medical codes and the complex interactions between diagnoses and treatments. To address these limitations, we propose a new unified pre-training framework that explicitly integrates hierarchical sub-token aggregation, partial masking, and cross-reference mechanisms. The proposed model consistently outperformed existing methods on both pre-training objectives and downstream clinical event prediction tasks, including the onset of dementia and hospitalization. We also conducted an in silico drug repositioning case study targeting Alzheimer's disease. In the hypothesis generation step, our approach successfully rediscovered known promising drugs in a data-driven manner without relying on such external knowledge sources as the literature. Subsequently, in the hypothesis prioritization step, we introduced a Task-Adaptive Representation Approach to alleviate the over-encoding of historical prescription information within diagnostic vectors, enabling the robust prioritization of generated hypotheses. This study establishes an exploratory screening workflow for hypothesis generation and prioritization based on observational associations. Importantly, this framework is not intended to provide causal evidence, but rather to identify promising candidates for subsequent rigorous causal inference. Overall, this study demonstrates that domain-informed representation learning combined with task-adaptive representation control can enable a practical hypothesis discovery workflow.

Thu 17 SeptMachine Learning
The gist
Finding new uses for existing drugs is hard because medical data is complex. The authors designed a new computer model that better understands medical codes and their relationships. This model helped predict health events like dementia and hospital visits more accurately. They also used it to spot promising drugs for Alzheimer's without relying on previous research papers. Their approach helps create and rank new ideas for drug use, but doesn’t prove cause and effect yet.
Open → 2609.19865v1

Multimodal training boosts small-molecule identification from diverse spectra

Multimodal deep learning from spectra for small-molecule structure identification: enhancing robustness with mixed-condition training

Abstract: In practical molecular characterization, small-molecule structure identification benefits from complementary spectroscopic evidence, but missing, degraded, or mismatched spectra challenge multimodal models. Herein, we incorporate domain knowledge from spectroscopy and chemistry into mixed-condition training for candidate structure reranking, using a reproducible evaluation protocol and mixture-of-experts (MoE) fusion. The protocol incorporates perturbations tailored to each spectroscopic modality and chemically informed spectrum replacements to cover variations in spectral availability, quality, and consistency. A total of 79,462 test samples were evaluated across 30 predefined conditions using simulated spectra from the Multimodal Spectroscopic Dataset (MSSD) for mass spectrometry (MS), infrared (IR) spectroscopy, and 1H and 13C nuclear magnetic resonance (NMR), with up to 128 hard candidate structures per sample. A controlled two-by-two factorial comparison of complete-input training versus mixed-condition training and vanilla concatenation versus MoE fusion, with matched evaluation conditions, showed that mixed-condition training provided the main gains in both architectures. For MoE, mean reciprocal rank (MRR), averaged equally across conditions, increased from 0.9203 to 0.9763, a relative increase of 6.08%. Recall at rank 1 (R@1), averaged over the same conditions, increased from 89.50% to 96.36%, an increase of 6.86 percentage points and a relative increase of 7.67%. IR-only and MS/MS-only MRR increased from 0.4337 to 0.9307 and from 0.3711 to 0.8575, reaching 2.15 and 2.31 times their respective baseline values, while complete-input performance remained high. These results support integrating domain knowledge into training-condition design to improve robustness, with further gains from MoE under mixed-condition training.

Sun 13 SeptMachine Learning
The gist
Identifying the structure of small molecules using different types of spectra can be tricky when some data is missing or poor quality. The authors improved computer models by training them on mixed and varied spectral data, including simulated errors and missing parts. This approach made the models better at ranking correct molecular structures even with incomplete or noisy inputs. They combined specialist methods and chemical knowledge to help the models stay accurate across different conditions.
Open → 2609.14360v1