❌

Normal view

Received — 15 September 2026 ⏭

Earth-Agent-Pro: Towards Real-World Full-Chain Earth Observation with Agents

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhutao Lv · Chenhao Dang · Yi Feng · Yanpei Gong · Xiaolei Wang · Junyan Ye · Conghui He · Weijia Li
14 September 2026 at 12:00
arXiv:2609.12533v1 Announce Type: cross Abstract: Real-world Earth observation (EO) agents must translate high-level scientific questions into executable workflows to acquire observations, prepare data, perform domain computations, and derive conclusions from runtime evidence. Existing EO agents typically start from supplied observations, while benchmarks typically provide prepared inputs or candidate answers, leaving full-chain open-world EO execution largely untested. We present Earth-Agent-Pro, an execution-adaptive Plan-and-Execute framework using expert-authored skills to constrain planning and runtime tool use. Workflow-centered structured memory records planned steps, accepted evidence, and their dependencies, enabling repair of only the affected workflow suffix when runtime evidence invalidates a step. Separate large language model adapters use sequence-level supervised fine-tuning for planner workflow composition and node-level group relative policy optimization with locally verifiable rewards for executor tool-argument grounding. Earth-Bench-Pro instantiates 248 expert-curated task cores as 744 questions under three matched regimes. Its 248 Open-World Execution questions span RGB imagery, spectral observations, and remote sensing products, pairing high-level requests with runtime data requirements, executable trajectories, and open-ended answers grounded in execution evidence. With a shared GPT-5 backbone, Earth-Agent-Pro achieves 66.13% LLM-as-Judge accuracy, exceeding ReAct by 20.95 points in this metric and 24.44 points in Tools-In-Order. Joint adapter tuning raises Qwen3.5-9B LLM-as-Judge accuracy from 38.31% to 50.00%, an 11.69-point gain over the untuned configuration. Planning-only evaluation and execution with the reference workflow show that the adapters improve workflow composition and argument grounding, respectively. Code and datasets will be released soon.
Received — 27 May 2026 ⏭

A Non-Canonical Role of SMAD4 in Regulating 3D Genome Architecture to Inhibit Lung Squamous Cell Carcinoma Development

✇(Multiomics OR Omics) AND (Lung OR gastric OR Hepatocellular)
By: Qian Tang · Chen Lian · Xinyan Han · Xuhan Zhang · Zihan Wang · Boyu Wang · Taoyu Zhu · Xinrui Lin · Xiaolei Wang · Yaping Xu · Manyu Xiao · Zijin Wang · Junming Li · Silin Chen · Yunze Wang · Yufei Liu · Songsong Li · Zuolin Shen · Xi Lu · Xueqi Han · Yilu Zhou · Mingyang Xiao · Jiayi Ran · Xiaoran Cao · Xinyi Xu · Hugo Sámano-Sánchez · Alfredo Rodríguez · Lian Wang · Shuifang Chen · Zhanyu Xu · Shirong Zhang · Nuo Yang · Yong Tang · Jian Liu
26 May 2026 at 18:00

Adv Sci (Weinh). 2026 May 26:e75839. doi: 10.1002/advs.75839. Online ahead of print.

ABSTRACT

Lung squamous cell carcinoma (LUSC) lacks clearly defined key drivers and effective targeted therapies, reflecting an incomplete understanding of its molecular pathogenesis. Here, we identify SMAD4 as a critical regulator of three-dimensional (3D) genome organization in LUSC and uncover a mechanistic link between tumor suppressor loss and oncogenic transcriptional activation. By integrating clinical datasets, genetically engineered mouse models, human and murine LUSC cell lines, and multi-omics analyses, we demonstrate that SMAD4 deficiency promotes LUSC progression by unleashing EP300-mediated enhancer-promoter looping at the SOX2 locus. Mechanistically, SMAD4 does not directly bind SOX2 regulatory elements but instead constrains chromatin looping by sequestering EP300 away from loop anchor regions. Loss of SMAD4 leads to enhanced H3K27ac deposition, aberrant SOX2 activation, and increased LUSC tumor cell proliferation. Together, these findings reveal a non-canonical role for a transcription factor (e.g., SMAD4) in regulating dysregulated 3D genome architecture to inhibit tumor development.

PMID:42189071 | DOI:10.1002/advs.75839

A Non-Canonical Role of SMAD4 in Regulating 3D Genome Architecture to Inhibit Lung Squamous Cell Carcinoma Development

✇Omics In Lung
By: Qian Tang · Chen Lian · Xinyan Han · Xuhan Zhang · Zihan Wang · Boyu Wang · Taoyu Zhu · Xinrui Lin · Xiaolei Wang · Yaping Xu · Manyu Xiao · Zijin Wang · Junming Li · Silin Chen · Yunze Wang · Yufei Liu · Songsong Li · Zuolin Shen · Xi Lu · Xueqi Han · Yilu Zhou · Mingyang Xiao · Jiayi Ran · Xiaoran Cao · Xinyi Xu · Hugo Sámano-Sánchez · Alfredo Rodríguez · Lian Wang · Shuifang Chen · Zhanyu Xu · Shirong Zhang · Nuo Yang · Yong Tang · Jian Liu
26 May 2026 at 18:00

Adv Sci (Weinh). 2026 May 26:e75839. doi: 10.1002/advs.75839. Online ahead of print.

ABSTRACT

Lung squamous cell carcinoma (LUSC) lacks clearly defined key drivers and effective targeted therapies, reflecting an incomplete understanding of its molecular pathogenesis. Here, we identify SMAD4 as a critical regulator of three-dimensional (3D) genome organization in LUSC and uncover a mechanistic link between tumor suppressor loss and oncogenic transcriptional activation. By integrating clinical datasets, genetically engineered mouse models, human and murine LUSC cell lines, and multi-omics analyses, we demonstrate that SMAD4 deficiency promotes LUSC progression by unleashing EP300-mediated enhancer-promoter looping at the SOX2 locus. Mechanistically, SMAD4 does not directly bind SOX2 regulatory elements but instead constrains chromatin looping by sequestering EP300 away from loop anchor regions. Loss of SMAD4 leads to enhanced H3K27ac deposition, aberrant SOX2 activation, and increased LUSC tumor cell proliferation. Together, these findings reveal a non-canonical role for a transcription factor (e.g., SMAD4) in regulating dysregulated 3D genome architecture to inhibit tumor development.

PMID:42189071 | DOI:10.1002/advs.75839

CITYREP: A Unified Benchmark for Urban Representations Across Cities, Tasks, and Modalities

✇cs.AI, q-bio.NC updates on arXiv.org
By: Junyuan Liu · Xinglei Wang · Zichao Zeng · Jiazhuang Feng · Quan Qin · Ilya Ilyankou · Guangsheng Dong · Tao Cheng
26 May 2026 at 12:00
arXiv:2605.26036v1 Announce Type: new Abstract: Urban representation learning encodes complex urban environments into general-purpose embeddings for diverse downstream tasks and emerging urban foundation models. However, current evaluations are limited, typically focusing on one or two cities and tasks and relying on random splits that introduce spatial leakage, leading to inflated performance and weak support for cross-location generalization and fair comparison. To address this, we propose CityRep, a unified benchmark that evaluates urban representations across data modalities, cities, and tasks using spatially structured splits. CityRep consists of three key components: (1) a spatial unit-agnostic evaluation framework that supports heterogeneous urban representations through a standardized alignment module; (2) a unified evaluation protocol using block-based spatial splits to mitigate spatial leakage and enable rigorous model comparison; and (3) an extensible multi-city, multi-task benchmark suite spanning 8 cities and 8 tasks across regression, classification, and distribution prediction. We evaluate 11 representative urban representation models. Results show that performance is highly sensitive to the split protocol, with random splits inflating scores and altering model rankings. We also observe substantial variability across cities and tasks, underscoring the need for generalization-aware evaluation. CityRep is released as a reproducible benchmark with datasets, evaluation pipelines, and diagnostic tools to facilitate fair comparison and support future research in urban representation learning towards urban foundation models.

Uncertainty-DTW for Sequences and Visual Tokens

✇cs.AI, q-bio.NC updates on arXiv.org
By: Lei Wang · Syuan-Hao Li · Yongsheng Gao · Piotr Koniusz
26 May 2026 at 12:00
arXiv:2605.25110v1 Announce Type: cross Abstract: Aligning structured data is a fundamental problem in computer vision and machine learning, underlying tasks such as time series analysis, human action recognition, and visual representation learning. Existing alignment methods, including Dynamic Time Warping (DTW) and its differentiable variants, rely on deterministic similarity measures and are therefore sensitive to heterogeneous and noisy features. In this work, we introduce uncertainty-aware alignment, a probabilistic framework that models pairwise correspondences with heteroscedastic uncertainty and performs structured matching along alignment paths. Our formulation, uncertainty-DTW (uDTW), assigns each correspondence a Normal distribution and parametrizes each alignment path by a Maximum Likelihood Estimate objective consisting of (i) a precision-weighted matching term that suppresses unreliable features, and (ii) a log-variance regularization that prevents degenerate solutions. This yields a probabilistic alignment mechanism that is robust to noise and interpretable, as uncertainty directly reflects the reliability of matches. We further generalize this framework from temporal sequences to tokenized visual representations, enabling structured matching over sets of visual tokens. The learned uncertainty can be interpreted as a reverse-attention: semantically relevant regions exhibit low uncertainty and dominate the alignment, while ambiguous/noisy regions have high uncertainty. This provides a connection between alignment, attention, and uncertainty modeling. We evaluate the proposed framework across diverse domains. The results demonstrate consistent improvements over state-of-the-art methods and show that learned uncertainty correlates with semantic importance. These findings establish uncertainty-aware alignment as a general, robust, and interpretable framework for learning from structured data.

Trust-Aware Joint Feature-Prediction Discrepancy for Robust Domain Adaptation

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xi Ding · Lei Wang · Syuan-Hao Li · Yongsheng Gao
26 May 2026 at 12:00
arXiv:2605.25119v1 Announce Type: cross Abstract: Domain adaptation aims to mitigate performance degradation caused by distribution shifts between a labeled source domain and an unlabeled or sparsely labeled target domain. Most existing approaches estimate domain discrepancy either in feature space or in prediction space. However, these single-perspective strategies overlook a critical problem under domain shift: the reliability of the signals used for alignment. In practice, both learned representations and semantic predictions may become unreliable, and treating all target samples equally can lead to misleading alignment and suboptimal transfer. We introduce trust-aware domain adaptation, a principled framework that models domain discrepancy through the reliability of feature and prediction signals. Central to our approach is the Joint Feature-Prediction Discrepancy (JFPD), a unified formulation that jointly captures representation divergence and prediction divergence while weighting their contributions by sample-specific trust. Trust is quantified via two complementary mechanisms: uncertainty-aware trust, derived from prediction entropy to suppress unreliable predictions, and semantic-alignment trust, computed from prototype similarity in feature space to emphasize well-aligned representations. By prioritizing confident and semantically consistent samples while down-weighting noisy or ambiguous ones, JFPD provides a reliability-aware estimate of domain discrepancy. We further integrate JFPD into a training objective that guides adaptation toward trustworthy regions of the target domain. Experiments on standard benchmarks demonstrate that the proposed framework consistently achieves superior adaptation performance and yields discrepancy estimates that correlate with target-domain error. This work addresses, for the first time, the importance of modeling trust in the interaction between features and predictions for domain adaptation.

Test-Time Self-Adaptive Conditioning for Stable Audio-Driven Talking-Head Generation

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhicheng Zhang · Lei Wang · Yu Zhang · Yongsheng Gao
26 May 2026 at 12:00
arXiv:2605.25488v1 Announce Type: cross Abstract: Audio-driven talking-head generation has achieved remarkable progress with recent models such as AniTalker, FLOAT, and Sonic. Despite their success, most existing approaches rely on a single static reference image to condition the entire video generation process at inference stage. This static conditioning paradigm often creates a mismatch between fixed identity features and dynamically evolving facial motion, leading to identity drift, temporal inconsistency, and degraded perceptual quality. We introduce Test-Time Self-Adaptive Conditioning (TT-SAC), a parameter-free inference framework that enables pretrained talking-head generators to adapt their conditioning representations during inference without retraining, gradient updates, or additional supervision. Instead of treating the reference portrait as immutable, TT-SAC composes the generator with its encoder in a feedback loop: the generator's own outputs are re-encoded to construct a refined conditioning representation that better aligns with the temporal dynamics of the synthesized sequence. A single adaptation step approximates a self-consistent equilibrium of the generative process, stabilizing identity and motion across time. We further provide theoretical analysis showing that test-time conditioning adaptation reduces feature variance and improves generative stability under mild Lipschitz assumptions, while exhibiting a principled bias-variance tradeoff that governs the optimal strength of adaptation. Extensive experiments on state-of-the-art talking-head generators and benchmark datasets demonstrate consistent improvements in lip-sync accuracy, temporal coherence, identity preservation, and perceptual fidelity. TT-SAC offers a model-agnostic and training-free strategy for enhancing generative video models, establishing test-time conditioning adaptation as an effective mechanism for stabilizing audio-driven portrait animation.
Received — 4 April 2026 ⏭

LLM Agents as Social Scientists: A Human-AI Collaborative Platform for Social Science Automation

✇cs.AI, q-bio.NC updates on arXiv.org
By: Lei Wang · Yuanzi Li · Jinchao Wu · Heyang Gao · Xiaohe Bo · Xu Chen · Ji-Rong Wen
3 April 2026 at 12:00
arXiv:2604.01520v1 Announce Type: new Abstract: Traditional social science research often requires designing complex experiments across vast methodological spaces and depends on real human participants, making it labor-intensive, costly, and difficult to scale. Here we present S-Researcher, an LLM-agent-based platform that assists researchers in conducting social science research more efficiently and at greater scale by "siliconizing" both the research process and the participant pool. To build S-Researcher, we first develop YuLan-OneSim, a large-scale social simulation system designed around three core requirements: generality via auto-programming from natural language to executable scenarios, scalability via a distributed architecture supporting up to 100,000 concurrent agents, and reliability via feedback-driven LLM fine-tuning. Leveraging this system, S-Researcher supports researchers in designing social experiments, simulating human behavior with LLM agents, analyzing results, and generating reports, forming a complete human-AI collaborative research loop in which researchers retain oversight and intervention at every stage. We operationalize LLM simulation research paradigms into three canonical reasoning modes (induction, deduction, and abduction) and validate S-Researcher through systematic case studies: inductive reproduction of cultural dynamics consistent with Axelrod's theory, deductive testing of competing hypotheses on teacher attention validated against survey data, and abductive identification of a cooperation mechanism in public goods games confirmed by human experiments. S-Researcher establishes a new human--AI collaborative paradigm for social science, in which computational simulation augments human researchers to accelerate discovery across the full spectrum of social inquiry.
  • ✇cs.AI, q-bio.NC updates on arXiv.org
  • The Overlooked Repetitive Lengthening Form in Sentiment Analysis Lei Wang · Eduard Dragut
    arXiv:2604.01268v1 Announce Type: cross Abstract: Individuals engaging in online communication frequently express personal opinions with informal styles (e.g., memes and emojis). While Language Models (LMs) with informal communications have been widely discussed, a unique and emphatic style, the Repetitive Lengthening Form (RLF), has been overlooked for years. In this paper, we explore answers to two research questions: 1) Is RLF important for sentiment analysis (SA)? 2) Can LMs understand RLF?
     
  • 🏷️
  • ↗️

The Overlooked Repetitive Lengthening Form in Sentiment Analysis

✇cs.AI, q-bio.NC updates on arXiv.org
By: Lei Wang · Eduard Dragut
3 April 2026 at 12:00
arXiv:2604.01268v1 Announce Type: cross Abstract: Individuals engaging in online communication frequently express personal opinions with informal styles (e.g., memes and emojis). While Language Models (LMs) with informal communications have been widely discussed, a unique and emphatic style, the Repetitive Lengthening Form (RLF), has been overlooked for years. In this paper, we explore answers to two research questions: 1) Is RLF important for sentiment analysis (SA)? 2) Can LMs understand RLF? Inspired by previous linguistic research, we curate \textbf{Lengthening}, the first multi-domain dataset with 850k samples focused on RLF for SA. Moreover, we introduce \textbf{Exp}lainable \textbf{Instruct}ion Tuning (\textbf{ExpInstruct}), a two-stage instruction tuning framework aimed to improve both performance and explainability of LLMs for RLF. We further propose a novel unified approach to quantify LMs' understanding of informal expressions. We show that RLF sentences are expressive expressions and can serve as signatures of document-level sentiment. Additionally, RLF has potential value for online content analysis. Our results show that fine-tuned Pre-trained Language Models (PLMs) can surpass zero-shot GPT-4 in performance but not in explanation for RLF. Finally, we show ExpInstruct can improve the open-sourced LLMs to match zero-shot GPT-4 in performance and explainability for RLF with limited samples. Code and sample data are available at https://github.com/Tom-Owl/OverlookedRLF
Received — 5 March 2026 ⏭

When Relevance Meets Novelty: Dual-Stable Periodic Optimization for Serendipitous Recommendation

✇cs.AI, q-bio.NC updates on arXiv.org
By: Hongxiang Lin · Hao Guo · Zeshun Li · Erpeng Xue · Yongqian He · Zhaoyu Hu · Lei Wang · Sheng Chen · Long Zeng
5 March 2026 at 13:00
arXiv:2508.00450v3 Announce Type: replace-cross Abstract: Traditional recommendation systems tend to trap users in strong feedback loops by excessively pushing content aligned with their historical preferences, thereby limiting exploration opportunities and causing content fatigue. Although large language models (LLMs) demonstrate potential with their diverse content generation capabilities, existing LLM-enhanced dual-model frameworks face two major limitations: first, they overlook long-term preferences driven by group identity, leading to biased interest modeling; second, they suffer from static optimization flaws, as a one-time alignment process fails to leverage incremental user data for closed-loop optimization. To address these challenges, we propose the Co-Evolutionary Alignment (CoEA) method. For interest modeling bias, we introduce Dual-Stable Interest Exploration (DSIE) module, jointly modeling long-term group identity and short-term individual interests through parallel processing of behavioral sequences. For static optimization limitations, we design a Periodic Collaborative Optimization (PCO) mechanism. This mechanism regularly conducts preference verification on incremental data using the Relevance LLM, then guides the Novelty LLM to perform fine-tuning based on the verification results, and subsequently feeds back the output of the continually fine-tuned Novelty LLM to the Relevance LLM for re-evaluation, thereby achieving a dynamic closed-loop optimization. Extensive online and offline experiments verify the effectiveness of the CoEA model in serendipitous recommendation.
There are no more articles
❌