ProteinReasoner is developed, a multimodal generative protein foundation model that sequentially connects amino acid sequence, evolutionary constraints and three-dimensional structure within a shared autoregressive architecture and suggests a general route towards reasoning across interdependent representations in other scientific domains.
Abstract
Reasoning has emerged as a central capability of large language models, yet how it should be formulated for scientific foundation models remains unclear because scientific knowledge is distributed across interdependent, domain-specific representations. Here we introduce modality-chain reasoning, which organizes representations into ordered computational chains, each conditioning prediction or generation of the next. Based on this principle, we develop ProteinReasoner, a multimodal generative protein foundation model that sequentially connects amino acid sequence, evolutionary constraints and three-dimensional structure within a shared autoregressive architecture. Across zero-shot structure prediction, inverse folding and fitness prediction, ProteinReasoner outperformed two multimodal protein foundation models, while controlled comparisons supported the functional contribution of the modality chain. We further extended this principle beyond pretraining: reorganizing the chain across successive structural states enabled multiple-conformation prediction, while introducing experimental feedback as an additional modality enabled an in-context learning paradigm for protein optimization without target-specific parameter updates. In particular, across thermostability and affinity-maturation evaluations, this paradigm improved over matched fine-tuned models and showed stronger mean performance than target-specific active-learning baselines. These results establish modality-chain reasoning as a unified and effective foundation-modelling strategy in protein science. More broadly, they suggest a general route towards reasoning across interdependent representations in other scientific domains.
A task-adaptive large reasoning model that integrates chemical knowledge through a synergistic multispecialist architecture, chain-of-thought supervision, and molecule-informed reinforcement learning is presented, demonstrating a versatile multitask framework for knowledge-guided molecular reasoning and design.
Pengfei Liu, Shuang Ge, Xiaobo Wang et al.· Journal of Physical Chemistr...· 0 citations
Experiments show that MKB achieves competitive scientific understanding across biological and molecular benchmarks, produces high-fidelity native outputs for weather forecasting, biological generation, and medical-image segmentation, and largely retains the general capabilities of its Qwen3-VL backbone.
Hesen Chen, Xinyue Su, Xiaomeng Yang et al.· 0 citations
Results validate that KG-guided reasoning serves as a critical mechanism to compensate for parameter disparity, particularly in tasks requiring deep traversal of biological mechanisms.
Tianwen Lyu, Zhuang Xiang, Keyan Ding et al.· Proceedings of the 32nd ACM...· 0 citations
This paper introduces Caduceus, a family of MoE-enhanced foundation models built with a hierarchical pre-training paradigm to jointly integrate biological and natural language, and incorporates a multi-task instruction tuning phase, enabling robust protein parsing and natural language question answering.
Mingze Yin, Yiheng Zhu, Jialu Wu et al.· Proceedings of the 32nd ACM...· 0 citations
Recent advances in multimodal large reasoning models (MLRMs) have demonstrated impressive capabilities on complex multimodal tasks, yet their reliance on long Chain-of-Thoughts (CoTs) often leads to redundant reasoning and high computational cost. Existing chain-based distillation and refinement approaches alleviate redundancy to some extent but remain limited when handling ultra-long reasoning chains, suffering from weakened dependency modeling, accumulated redundancy, and the omission of critical reasoning steps. To this end, in this paper, we propose GRACE, a Graph-based Rationalized CoT Compression framework that transforms long CoTs into reasoning graphs to enable efficient CoT compression, where reasoning steps are represented as nodes and semantic dependencies as edges. Specifically, after constructing the reasoning graph, GRACE applies a graph rationale learning approach with a selector–predictor architecture. Among them, the selector estimates node-level rationale scores to sample a compact rationale subgraph, while the predictor leverages this subgraph for final prediction. The resulting subgraph serves as the distilled core rationale, retaining essential reasoning while removing irrelevant steps. Finally, the compressed CoTs are then used to build supervised fine-tuning datasets for further MLRMs tuning. Experiments on multiple multimodal benchmarks show that GRACE substantially improves inference efficiency and interpretability without sacrificing accuracy.
Yizhi Wang, Linan Yue, Deng-Bao Wang et al.· Proceedings of the 32nd ACM...· 0 citations