Unmasking FCGR2B as a high-grade serous ovarian cancer specific marker of immune suppression and tumor progression through multi-omics mining

By: Jialu Zhou · Tao Zeng · Mingxia Ye · Mingxia Li · Liang Wen · Xinyi Liu · Zhe Zhang · Yuanguang Meng

4 April 2026 at 18:00

Transl Oncol. 2026 Apr 3;67:102748. doi: 10.1016/j.tranon.2026.102748. Online ahead of print.

ABSTRACT

BACKGROUND: Epithelial ovarian cancer (EOC) encompasses five major histological subtypes with marked genetic, immunological, and clinical heterogeneity. While genome-wide association studies (GWAS) have identified subtype-specific risk loci, a critical gap remains in understanding how plasma proteins influence immune-cell traits and contribute to EOC pathogenesis.

METHODS: We integrated subtype-stratified GWAS data from two EOC cohorts with plasma proteomics and immune-cell traits to construct protein-immune-EOC regulatory landscapes using a three-stage Mendelian randomization framework. Single-cell RNA-seq and multiplex immunofluorescence were employed to delineate the cellular distribution and spatial context of causal proteins. Subsequent analyses characterized immune infiltration, macrophage polarization, and clinicopathological associations. Drug-gene correlations were used to identify potential therapeutic targets, and transcriptomic analyses were applied to delineate the underlying transcriptional landscape.

RESULTS: We identified 20 subtype-specific protein-immune-EOC regulatory axes, with FCGR2B emerging as a causal plasma protein in immune regulation and high-grade serous ovarian cancer (HGSOC) progression. FCGR2B was highly expressed in tumor-associated macrophages and was associated with an M2-like polarization phenotype. Functional characterization revealed that FCGR2B was associated with shorter progression-free survival and an immunosuppressive tumor microenvironment. Transcriptomic analyses revealed altered NF-κB signaling upon FCGR2B knockdown, and drug-response data suggested a potential association between high FCGR2B expression and sensitivity to NF-κB inhibitors.

CONCLUSIONS: These findings delineate subtype-specific genetically informed protein-immune regulatory landscapes in EOC and identify FCGR2B as a key immunoregulatory and prognostic biomarker in HGSOC, suggesting FCGR2B as a potential therapeutic vulnerability that warrants further investigation.

PMID:41934917 | DOI:10.1016/j.tranon.2026.102748

LLM-Meta-SR: In-Context Learning for Evolving Selection Operators in Symbolic Regression

cs.AI, q-bio.NC updates on arXiv.org

By: Hengzhe Zhang · Qi Chen · Bing Xue · Wolfgang Banzhaf · Mengjie Zhang

1 April 2026 at 12:00

arXiv:2505.18602v3 Announce Type: replace-cross Abstract: Large language models (LLMs) have revolutionized algorithm development, yet their application in symbolic regression, where algorithms automatically discover symbolic expressions from data, remains limited. In this paper, we propose a meta-learning framework that enables LLMs to automatically design selection operators for evolutionary symbolic regression algorithms. We first identify two key limitations in existing LLM-based algorithm evolution techniques: lack of semantic guidance and code bloat. The absence of semantic awareness can lead to ineffective exchange of useful code components, while bloat results in unnecessarily complex components; both can hinder evolutionary learning progress or reduce the interpretability of the designed algorithm. To address these issues, we enhance the LLM-based evolution framework for meta-symbolic regression with two key innovations: a complementary, semantics-aware selection operator and bloat control. Additionally, we embed domain knowledge into the prompt, enabling the LLM to generate more effective and contextually relevant selection operators. Our experimental results on symbolic regression benchmarks show that LLMs can devise selection operators that outperform nine expert-designed baselines, achieving state-of-the-art performance. Moreover, the evolved operator can further improve a state-of-the-art symbolic regression algorithm, achieving the best performance among 28 symbolic regression and other machine learning algorithms across 116 regression datasets. This demonstrates that LLMs can exceed expert-level algorithm design for symbolic regression.

Generalizing Dynamics Modeling More Easily from Representation Perspective

cs.AI, q-bio.NC updates on arXiv.org

By: Yiming Wang · Zhengnan Zhang · Genghe Zhang · Jiawen Dan · Changchun Li · Chenlong Hu · Chris Nugent · Jun Liu · Ximing Li · Bo Yang

25 March 2026 at 12:00

arXiv:2603.22655v1 Announce Type: cross Abstract: Learning system dynamics from observations is a critical problem in many applications over various real-world complex systems, e.g., climate, ecology, and fluid systems. Recently, neural dynamics modeling method have become a prevalent solution that embeds the object's observations into a latent space before learning dynamics using neural methods such as neural Ordinary Differential Equations (ODE). Existing dynamics modeling methods induce a specific model for each observation of different complex systems, resulting in poor generalization across systems. Inspired by the great success of pre-trained models, we conduct a generalized Pre-trained Dynamics EncoDER (PDEDER) which can embed the original state observations into a latent space where the dynamics can be captured more easily. To conduct the generalized PDEDER, we pre-train any Pre-trained Language Model (PLM) by minimizing the Lyapunov exponent objective, which constrains the chaotic behavior of governing dynamics learned in the latent space. By penalizing the divergence of embedded observations, our PDEDER promotes locally stable and well-structured latent dynamics, thereby facilitating more effective dynamics modeling than in the original observation space. In addition, we incorporate reconstruction and forecasting objectives to mitigate the risk of obtaining an over-smoothed latent space. Specifically, we collect 152 sets of real-world and synthetic observations from 23 complex systems as pre-training corpora and employ them to pre-train PDEDER. Given any future dynamic observation, we can fine-tune PDEDER with any specific dynamics modeling method. We evaluate PDEDER on 12 dynamic systems by short/long-term forecasting under both in-domain and cross-domain settings, and the empirical results indicate the effectiveness and generalizability of PDEDER.

How Long Can Unified Multimodal Models Generate Images Reliably? Taming Long-Horizon Interleaved Image Generation via Context Curation

cs.AI, q-bio.NC updates on arXiv.org

By: Haoyu Chen · Qing Liu · Yuqian Zhou · He Zhang · Zhaowen Wang · Mengwei Ren · Jingjing Ren · Xiang Wang · Zhe Lin · Lei Zhu

10 March 2026 at 12:00

arXiv:2603.07540v1 Announce Type: cross Abstract: Unified multimodal models hold the promise of generating extensive, interleaved narratives, weaving text and imagery into coherent long-form stories. However, current systems suffer from a critical reliability gap: as sequences grow, generation quality rapidly collapses. In this work, we investigate the mechanism behind this failure and argue that it is distinct from standard long-context challenges. We reveal that in generation, accumulated visual history acts as a source of active pollution, a decay governed specifically by the number of image events rather than raw token count. We identify a structural vulnerability where dense visual tokens overwhelm the attention mechanism, creating noise that distorts future synthesis. Guided by these mechanistic insights, we propose UniLongGen, a training-free inference strategy that prioritizes safe conditioning over total recall. Instead of retaining all history, UniLongGen dynamically curates the model's memory, identifying and discarding interfering visual signals based on the model's own internal relevance rankings. Extensive experiments demonstrate that this active forgetting approach is essential for stability: UniLongGen significantly outperforms baselines in long-horizon fidelity and consistency, while simultaneously reducing memory footprint and inference time.

FOR-Prompting: From Objection to Revision via an Asymmetric Prompting Protocol

cs.AI, q-bio.NC updates on arXiv.org

By: He Zhang · Anzhou Zhang · Jian Dai

10 March 2026 at 12:00

arXiv:2510.01674v2 Announce Type: replace-cross Abstract: Reasoning protocols such as Chain of Thought (CoT) and Tree of Thought (ToT) organize internal deliberation but lack an explicit mechanism for external questioning that elicits self-revision. We present FOR-Prompting (From Objection to Revision Prompting), an asymmetric protocol where a Defender proposes an answer, an Debater (Questioner) raises question-style objections with no direct fixes, and a Host optionally synthesizes the final output. Across GSM8K, FOR-Prompting matches the accuracy of CoT and consistently improves over single-prompting when evaluated under identical model backbones. On small-scale open-source models (e.g., LLaMA-3.2-1B), FOR-Prompting yields substantial gains over direct prompting and performs comparably to lightweight reasoning baselines, highlighting its promise for low-resource and on-device settings. Cross-model role-swapping further shows that performance is primarily determined by the Defender, enabling small models to act effectively as Questioners. Beyond structured math tasks, FOR-Prompting supports refinement in open-ended and multi-stage tasks: qualitative analysis shows improved exploration, coverage, and specificity, and a blind study of human preferences found that participants preferred FOR-Prompting outputs over strong LLM baselines in an itinerary-planning scenario. The protocol is model-agnostic and operates purely through role-structured prompting, requiring no training, access to model internals, or symmetrically strong agents. FOR-Prompting therefore enables scalable study of objection-driven reasoning and offers a practical mechanism for automated iterative refinement across both hosted and local LLMs.

Maximizing carrier extraction in hybrid back-contact silicon solar cells

Nature - Issue - nature.com science feeds

By: Zilong Zheng · Xiqi Yang · Jiaxing Wang · Qinghua Zeng · Chaohua Zhang · Hong Zhang · Jiarong Huang · Yuhua Wang · Zeguo Tang · Rongkun Zhou · Hongbo Cai · Xiaofei Xu · Shenghou Zhou · Wanyu Lu · Qian Kang · Xiaoqing Chen · Kun Zheng · Yongzhe Zhang · Zhiyong Wang · Yusheng Yang · Jinyan Zhang · Hui Yan

10 March 2026 at 08:00

Nature, Published online: 10 March 2026; doi:10.1038/s41586-026-10351-8

Maximizing carrier extraction in hybrid back-contact silicon solar cells

Contextualized Privacy Defense for LLM Agents

cs.AI, q-bio.NC updates on arXiv.org

By: Yule Wen · Yanzhe Zhang · Jianxun Lian · Xiaoyuan Yi · Xing Xie · Diyi Yang

4 March 2026 at 13:00

arXiv:2603.02983v1 Announce Type: cross Abstract: LLM agents increasingly act on users' personal information, yet existing privacy defenses remain limited in both design and adaptability. Most prior approaches rely on static or passive defenses, such as prompting and guarding. These paradigms are insufficient for supporting contextual, proactive privacy decisions in multi-step agent execution. We propose Contextualized Defense Instructing (CDI), a new privacy defense paradigm in which an instructor model generates step-specific, context-aware privacy guidance during execution, proactively shaping actions rather than merely constraining or vetoing them. Crucially, CDI is paired with an experience-driven optimization framework that trains the instructor via reinforcement learning (RL), where we convert failure trajectories with privacy violations into learning environments. We formalize baseline defenses and CDI as distinct intervention points in a canonical agent loop, and compare their privacy-helpfulness trade-offs within a unified simulation framework. Results show that our CDI consistently achieves a better balance between privacy preservation (94.2%) and helpfulness (80.6%) than baselines, with superior robustness to adversarial conditions and generalization.

LaDiR: Latent Diffusion Enhances LLMs for Text Reasoning

cs.AI, q-bio.NC updates on arXiv.org

By: Haoqiang Kang · Yizhe Zhang · Nikki Lijing Kuang · Nicklas Majamaki · Navdeep Jaitly · Yi-An Ma · Lianhui Qin

4 March 2026 at 13:00

arXiv:2510.04573v5 Announce Type: replace-cross Abstract: Large Language Models (LLMs) demonstrate their reasoning ability through chain-of-thought (CoT) generation. However, LLM's autoregressive decoding may limit the ability to revisit and refine earlier tokens in a holistic manner, which can also lead to inefficient exploration for diverse solutions. In this paper, we propose LaDiR (Latent Diffusion Reasoner), a novel reasoning framework that unifies the expressiveness of continuous latent representation with the iterative refinement capabilities of latent diffusion models for an existing LLM. We first construct a structured latent reasoning space using a Variational Autoencoder (VAE) that encodes text reasoning steps into blocks of thought tokens, preserving semantic information and interpretability while offering compact but expressive representations. Subsequently, we utilize a latent diffusion model that learns to denoise a block of latent thought tokens with a blockwise bidirectional attention mask, enabling longer horizon and iterative refinement with adaptive test-time compute. This design allows efficient parallel generation of diverse reasoning trajectories, allowing the model to plan and revise the reasoning process holistically. We conduct evaluations on a suite of mathematical reasoning and planning benchmarks. Empirical results show that LaDiR consistently improves accuracy, diversity, and interpretability over existing autoregressive, diffusion-based, and latent reasoning methods, revealing a new paradigm for text reasoning with latent diffusion.

Reading view