❌

Normal view

Received — 26 March 2026 ⏭

PERMA: Benchmarking Personalized Memory Agents via Event-Driven Preference and Realistic Task Environments

✇cs.AI, q-bio.NC updates on arXiv.org
By: Shuochen Liu · Junyi Zhu · Long Shu · Junda Lin · Yuhao Chen · Haotian Zhang · Chao Zhang · Derong Xu · Jia Li · Bo Tang · Zhiyu Li · Feiyu Xiong · Enhong Chen · Tong Xu
25 March 2026 at 12:00
arXiv:2603.23231v1 Announce Type: new Abstract: Empowering large language models with long-term memory is crucial for building agents that adapt to users' evolving needs. However, prior evaluations typically interleave preference-related dialogues with irrelevant conversations, reducing the task to needle-in-a-haystack retrieval while ignoring relationships between events that drive the evolution of user preferences. Such settings overlook a fundamental characteristic of real-world personalization: preferences emerge gradually and accumulate across interactions within noisy contexts. To bridge this gap, we introduce PERMA, a benchmark designed to evaluate persona consistency over time beyond static preference recall. Additionally, we incorporate (1) text variability and (2) linguistic alignment to simulate erratic user inputs and individual idiolects in real-world data. PERMA consists of temporally ordered interaction events spanning multiple sessions and domains, with preference-related queries inserted over time. We design both multiple-choice and interactive tasks to probe the model's understanding of persona along the interaction timeline. Experiments demonstrate that by linking related interactions, advanced memory systems can extract more precise preferences and reduce token consumption, outperforming traditional semantic retrieval of raw dialogues. Nevertheless, they still struggle to maintain a coherent persona across temporal depth and cross-domain interference, highlighting the need for more robust personalized memory management in agents. Our code and data are open-sourced at https://github.com/PolarisLiu1/PERMA.

ImplicitRM: Unbiased Reward Modeling from Implicit Preference Data for LLM alignment

✇cs.AI, q-bio.NC updates on arXiv.org
By: Hao Wang · Haocheng Yang · Licheng Pan · Lei Shen · Xiaoxi Li · Yinuo Wang · Zhichao Chen · Yuan Lu · Haoxuan Li · Zhouchen Lin
25 March 2026 at 12:00
arXiv:2603.23184v1 Announce Type: cross Abstract: Reward modeling represents a long-standing challenge in reinforcement learning from human feedback (RLHF) for aligning language models. Current reward modeling is heavily contingent upon experimental feedback data with high collection costs. In this work, we study \textit{implicit reward modeling} -- learning reward models from implicit human feedback (e.g., clicks and copies) -- as a cost-effective alternative. We identify two fundamental challenges in implicit reward modeling: (1) Implicit preference data lacks definitive negative samples, which makes standard positive-negative classification methods inapplicable; (2) Implicit preference data suffers from user preference bias, where different responses have different propensities to elicit user feedback actions, which exacerbates the difficulty of distinguishing definitive negative samples. To address these challenges, we propose ImplicitRM, which aims to learn unbiased reward models from implicit preference data. ImplicitRM stratifies training samples into four latent groups via a stratification model. Building on this, it derives a learning objective through likelihood maximization, which we prove is theoretically unbiased, effectively resolving both challenges. Experiments demonstrate that ImplicitRM learns accurate reward models across implicit preference datasets. Code is available on our project website.

TRACE: A Multi-Agent System for Autonomous Physical Reasoning in Seismological

✇cs.AI, q-bio.NC updates on arXiv.org
By: Feng Liu · Jian Xu · Xin Cui · Xinghao Wang · Zijie Guo · Jiong Wang · S. Mostafa Mousavi · Xinyu Gu · Hao Chen · Ben Fei · Lihua Fang · Fenghua Ling · Zefeng Li · Lei Bai
25 March 2026 at 12:00
arXiv:2603.21152v2 Announce Type: replace-cross Abstract: Inferring the physical mechanisms that govern earthquake sequences from indirect geophysical observations remains difficult, particularly across tectonically distinct environments where similar seismic patterns can reflect different underlying processes. Current interpretations rely heavily on the expert synthesis of catalogs, spatiotemporal statistics, and candidate physical models, limiting reproducibility and the systematic transfer of insight across settings. Here we present TRACE (Trans-perspective Reasoning and Automated Comprehensive Evaluator), a multi-agent system that combines large language model planning with formal seismological constraints to derive auditable, physically grounded mechanistic inference from raw observations. Applied to the 2019 Ridgecrest sequence, TRACE autonomously identifies stress-perturbation-induced delayed triggering, resolving the cascading interaction between the Mw 6.4 and Mw 7.1 mainshocks; in the Santorini-Kolumbo case, the system identifies a structurally guided intrusion model, distinguishing fault-channeled episodic migration from the continuous propagation expected in homogeneous crustal failure. By providing a generalizable logical infrastructure for interpreting heterogeneous seismic phenomena, TRACE advances the field from expert-dependent analysis toward knowledge-guided autonomous discovery in Earth sciences.

Deciphering lung adenocarcinoma heterogeneity: a multi-omics approach reveals nuclear division fibroblasts as prognosticators and therapeutic targets

✇Omics In Lung
By: Peng Cao · Yongxia Qin · Dingtao Hu · Tengfei Ge · Peng Zhang · Chao Cheng · Shun Wang · Shuhui Hu · Zhen Zhang · Ling Xu
21 March 2026 at 18:00

J Transl Med. 2026 Mar 20. doi: 10.1186/s12967-026-08022-3. Online ahead of print.

ABSTRACT

BACKGROUND: Lung adenocarcinoma (LUAD) is a predominant contributor to cancer‑related mortality globally. Lung‑associated fibroblasts (LAFs) are intricately linked to tumorigenesis and the tumor microenvironment (TME), but their heterogeneity and prognostic relevance in LUAD remain incompletely understood. This study aimed to systematically characterize LAF subsets across the spectrum of pulmonary disease, identify LAF subpopulations associated with LUAD prognosis, and construct a robust LAF‑based prognostic signature.

METHODS: We employed a multi-omics approach, leveraging bulk RNA data of 2719 patients from 19 LUAD cohorts, single-cell RNA (scRNA) sequencing data of 368,904 cells from 93 samples, and spatial transcriptomics data of 15,673 spots from 6 samples to characterize the landscape of LAFs across various stages of pulmonary disease. We employed multiple advanced machine learning algorithms to construct and validate a robust nuclear division LAFs (nLAFs) risk score (nLRS) prediction model.

RESULTS: We observed a dynamic and gradual increase in the proportion of LAFs during the progression of LUAD. Throughout this process, we identified nine LAFs subtypes and found nLAFs are significantly associated with the prognosis of LUAD. Utilizing 100 machine learning algorithm combinations and integrating nLAFs marker genes, we developed a five gene based nLRS model, which demonstrated superior performance than other 49 published models in predicting clinical outcomes for LUAD. Additionally, we observed distinct biological functions and immune cell infiltration in the TME between high and low nLRS groups. Exploratory analysis of pan-cancer immunotherapy cohorts suggested that patients with high nLRS scores may exhibit resistance to immunotherapy in some cancer types, but prospective validation in LUAD-specific cohorts is required. Conversely, high nLRS patients displayed increased sensitivity to chemotherapeutic and targeted therapies in preclinical models.

CONCLUSION: Our study introduces a candidate five-gene signature derived from nLAFs that may serve as a robust prognostic biomarker pending prospective validation, offering insights into personalized therapeutic strategies for LUAD patients.

PMID:41862916 | DOI:10.1186/s12967-026-08022-3

There are no more articles
❌