❌

Reading view

↗️

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
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.
  •  
  • ↗️
↗️

TDATR: Improving End-to-End Table Recognition via Table Detail-Aware Learning and Cell-Level Visual Alignment

✇cs.AI, q-bio.NC updates on arXiv.org
By: Chunxia Qin · Chenyu Liu · Pengcheng Xia · Jun Du · Baocai Yin · Bing Yin · Cong Liu
arXiv:2603.22819v1 Announce Type: cross Abstract: Tables are pervasive in diverse documents, making table recognition (TR) a fundamental task in document analysis. Existing modular TR pipelines separately model table structure and content, leading to suboptimal integration and complex workflows. End-to-end approaches rely heavily on large-scale TR data and struggle in data-constrained scenarios. To address these issues, we propose TDATR (Table Detail-Aware Table Recognition) improves end-to-end TR through table detail-aware learning and cell-level visual alignment. TDATR adopts a ``perceive-then-fuse'' strategy. The model first performs table detail-aware learning to jointly perceive table structure and content through multiple structure understanding and content recognition tasks designed under a language modeling paradigm. These tasks can naturally leverage document data from diverse scenarios to enhance model robustness. The model then integrates implicit table details to generate structured HTML outputs, enabling more efficient TR modeling when trained with limited data. Furthermore, we design a structure-guided cell localization module integrated into the end-to-end TR framework, which efficiently locates cell and strengthens vision-language alignment. It enhances the interpretability and accuracy of TR. We achieve state-of-the-art or highly competitive performance on seven benchmarks without dataset-specific fine-tuning.
  •  
  • ↗️
↗️

BIRD-INTERACT: Re-imagining Text-to-SQL Evaluation for Large Language Models via Lens of Dynamic Interactions

✇cs.AI, q-bio.NC updates on arXiv.org
By: Nan Huo · Xiaohan Xu · Jinyang Li · Per Jacobsson · Shipei Lin · Bowen Qin · Binyuan Hui · Xiaolong Li · Ge Qu · Shuzheng Si · Linheng Han · Edward Alexander · Xintong Zhu · Rui Qin · Ruihan Yu · Yiyao Jin · Feige Zhou · Weihao Zhong · Yun Chen · Hongyu Liu · Chenhao Ma · Fatma Ozcan · Yannis Papakonstantinou · Reynold Cheng
arXiv:2510.05318v3 Announce Type: replace Abstract: Large language models (LLMs) have demonstrated remarkable performance on single-turn text-to-SQL tasks, but real-world database applications predominantly require multi-turn interactions to handle ambiguous queries, execution errors, and evolving user requirements. Existing multi-turn benchmarks fall short by treating conversation histories as static context or limiting evaluation to read-only operations, failing to reflect production-grade database assistant challenges. We introduce BIRD-INTERACT, a benchmark that restores this realism through: (1) a comprehensive interaction environment coupling each database with a hierarchical knowledge base, metadata files, and a function-driven user simulator, enabling models to solicit clarifications, retrieve knowledge, and recover from errors without human supervision; (2) two evaluation settings consisting of a pre-defined conversational protocol (c-Interact) and an open-ended agentic setting (a-Interact) where models autonomously decide when to query the user simulator or explore the environment; (3) a challenging task suite covering the full CRUD spectrum for business-intelligence and operational use cases, guarded by executable test cases. Each task features ambiguous and follow-up sub-tasks requiring dynamic interaction. The suite comprises BIRD-INTERACT-FULL (600 tasks, up to 11,796 interactions) for comprehensive performance assessment, and BIRD-INTERACT-LITE (300 tasks with simplified databases) for detailed behavioral analysis and rapid method development. Our empirical results highlight BIRD-INTERACT's difficulty: GPT-5 completes only 8.67% of tasks in c-Interact and 17.00% in a-Interact. Analysis via memory grafting and Interaction Test-time Scaling validates the importance of effective interaction for complex, dynamic text-to-SQL tasks.
  •  
  • ↗️
↗️

UniCA: Unified Covariate Adaptation for Time Series Foundation Model

✇cs.AI, q-bio.NC updates on arXiv.org
By: Lu Han · Yu Liu · Lan Li · Qiwen Deng · Jian Jiang · Yinbo Sun · Zhe Yu · Binfeng Wang · Xingyu Lu · Lintao Ma · Han-Jia Ye · De-Chuan Zhan
arXiv:2506.22039v2 Announce Type: replace-cross Abstract: Time Series Foundation Models (TSFMs) have achieved remarkable success through large-scale pretraining. However, their design primarily targets real-valued series, limiting their ability to handle general forecasting tasks involving diverse and often heterogeneous covariates -- such as categorical variables and multimodal data (e.g., images, text) -- which are typically task-specific and difficult to leverage during pretraining. To address this gap, we propose Unified Covariate Adaptation (UniCA), a framework to bridge TSFMs with general covariate-aware forecasting. UniCA first performs covariate homogenization to transform heterogeneous covariates into high-level homogeneous series representations and then fuses them via a unified attention-based fusion mechanism. UniCA is compatible and universal for adaptation with both homogeneous and heterogeneous covariates, incorporating extra covariate information while preserving the generalization ability of TSFMs.Extensive experiments on multiple unimodal and multimodal covariate-aware forecasting benchmarks demonstrate the superiority of UniCA, highlighting the promise of covariate-aware TSFM adaptation in real-world forecasting scenarios.Code: https://github.com/hanlu-nju/UniCA.
  •  
  • ↗️
↗️

From Editor to Dense Geometry Estimator

✇cs.AI, q-bio.NC updates on arXiv.org
By: JiYuan Wang · Chunyu Lin · Lei Sun · Rongying Liu · Lang Nie · Mingxing Li · Kang Liao · Xiangxiang Chu
arXiv:2509.04338v2 Announce Type: replace-cross Abstract: Leveraging visual priors from pre-trained text-to-image (T2I) generative models has shown success in dense prediction. However, dense prediction is inherently an image-to-image task, suggesting that image editing models, rather than T2I generative models, may be a more suitable foundation for fine-tuning. Motivated by this, we conduct a systematic analysis of the fine-tuning behaviors of both editors and generators for dense geometry estimation. Our findings show that editing models possess inherent structural priors, which enable them to converge more stably by ``refining" their innate features, and ultimately achieve higher performance than their generative counterparts. Based on these findings, we introduce \textbf{FE2E}, a framework that pioneeringly adapts an advanced editing model based on Diffusion Transformer (DiT) architecture for dense geometry prediction. Specifically, to tailor the editor for this deterministic task, we reformulate the editor's original flow matching loss into the ``consistent velocity" training objective. And we use logarithmic quantization to resolve the precision conflict between the editor's native BFloat16 format and the high precision demand of our tasks. Additionally, we leverage the DiT's global attention for a cost-free joint estimation of depth and normals in a single forward pass, enabling their supervisory signals to mutually enhance each other. Without scaling up the training data, FE2E achieves impressive performance improvements in zero-shot monocular depth and normal estimation across multiple datasets. Notably, it achieves over 35\% performance gains on the ETH3D dataset and outperforms the DepthAnything series, which is trained on 100$\times$ data. The project page can be accessed \href{https://amap-ml.github.io/FE2E/}{here}.
  •  
  • ↗️
↗️

LoD-Loc v3: Generalized Aerial Localization in Dense Cities using Instance Silhouette Alignment

✇cs.AI, q-bio.NC updates on arXiv.org
By: Shuaibang Peng · Juelin Zhu · Xia Li · Kun Yang · Maojun Zhang · Yu Liu · Shen Yan
arXiv:2603.19609v2 Announce Type: replace-cross Abstract: We present LoD-Loc v3, a novel method for generalized aerial visual localization in dense urban environments. While prior work LoD-Loc v2 achieves localization through semantic building silhouette alignment with low-detail city models, it suffers from two key limitations: poor cross-scene generalization and frequent failure in dense building scenes. Our method addresses these challenges through two key innovations. First, we develop a new synthetic data generation pipeline that produces InsLoD-Loc - the largest instance segmentation dataset for aerial imagery to date, comprising 100k images with precise instance building annotations. This enables trained models to exhibit remarkable zero-shot generalization capability. Second, we reformulate the localization paradigm by shifting from semantic to instance silhouette alignment, which significantly reduces pose estimation ambiguity in dense scenes. Extensive experiments demonstrate that LoD-Loc v3 outperforms existing state-of-the-art (SOTA) baselines, achieving superior performance in both cross-scene and dense urban scenarios with a large margin. The project is available at https://nudt-sawlab.github.io/LoD-Locv3/.
  •  
  • ↗️
↗️

BadminSense: Enabling Fine-Grained Badminton Stroke Evaluation on a Single Smartwatch

✇cs.AI, q-bio.NC updates on arXiv.org
By: Taizhou Chen · Kai Chen · Xingyu Liu · Pingchuan Ke · Zhida Sun
arXiv:2603.21825v2 Announce Type: replace-cross Abstract: Evaluating badminton performance often requires expert coaching, which is rarely accessible for amateur players. We present BadminSense, a smartwatch-based system for fine-grained badminton performance analysis using wearable sensing. Through interviews with experienced badminton players, we identified four system design requirements with three implementation insights that guide the development of BadminSense. We then collected a badminton strokes dataset on 12 experienced badminton amateurs and annotated it with fine-grained labels, including stroke type, expert-assessed stroke rating, and shuttle impact location. Built on this dataset, BadminSense segments and classifies strokes, predicts stroke quality, and estimates shuttle impact location using vibration signal from an off-the-shelf smartwatch. Our evaluations show that BadminSense achieves a stroke classification accuracy of 91.43%, an average quality rating error of 0.438, and an average impact location estimation error of 12.9%. A real-world usability study further demonstrates BadminSense's potential to provide reliable and meaningful support for daily badminton practice.
  •  
  • ↗️
↗️

When Right Meets Wrong: Bilateral Context Conditioning with Reward-Confidence Correction for GRPO

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yu Li · Tian Lan · Zhengling Qi
arXiv:2603.13134v1 Announce Type: new Abstract: Group Relative Policy Optimization (GRPO) has emerged as an effective method for training reasoning models. While it computes advantages based on group mean, GRPO treats each output as an independent sample during the optimization and overlooks a vital structural signal: the natural contrast between correct and incorrect solutions within the same group, thus ignoring the rich, comparative data that could be leveraged by explicitly pitting successful reasoning traces against failed ones. To capitalize on this, we present a contrastive reformulation of GRPO, showing that the GRPO objective implicitly maximizes the margin between the policy ratios of correct and incorrect samples. Building on this insight, we propose Bilateral Context Conditioning (BICC), a mechanism that allows the model to cross-reference successful and failed reasoning traces during the optimization, enabling a direct information flow across samples. We further introduce Reward-Confidence Correction (RCC) to stabilize training by dynamically adjusts the advantage baseline in GRPO using reward-confidence covariance derived from the first-order approximation of the variance-minimizing estimator. Both mechanisms require no additional sampling or auxiliary models and can be adapted to all GRPO variants. Experiments on mathematical reasoning benchmarks demonstrate consistent improvements across comprehensive models and algorithms. Code is available at \href{https://github.com/Skylanding/BiCC}{https://github.com/Skylanding/BiCC}.
  •  
  • ↗️
↗️

Empowering Semantic-Sensitive Underwater Image Enhancement with VLM

✇cs.AI, q-bio.NC updates on arXiv.org
By: Guodong Fan · Shengning Zhou · Genji Yuan · Huiyu Li · Jingchun Zhou · Jinjiang Li
arXiv:2603.12773v1 Announce Type: cross Abstract: In recent years, learning-based underwater image enhancement (UIE) techniques have rapidly evolved. However, distribution shifts between high-quality enhanced outputs and natural images can hinder semantic cue extraction for downstream vision tasks, thereby limiting the adaptability of existing enhancement models. To address this challenge, this work proposes a new learning mechanism that leverages Vision-Language Models (VLMs) to empower UIE models with semantic-sensitive capabilities. To be concrete, our strategy first generates textual descriptions of key objects from a degraded image via VLMs. Subsequently, a text-image alignment model remaps these relevant descriptions back onto the image to produce a spatial semantic guidance map. This map then steers the UIE network through a dual-guidance mechanism, which combines cross-attention and an explicit alignment loss. This forces the network to focus its restorative power on semantic-sensitive regions during image reconstruction, rather than pursuing a globally uniform improvement, thereby ensuring the faithful restoration of key object features. Experiments confirm that when our strategy is applied to different UIE baselines, significantly boosts their performance on perceptual quality metrics as well as enhances their performance on detection and segmentation tasks, validating its effectiveness and adaptability.
  •  
  • ↗️
↗️

Visual-ERM: Reward Modeling for Visual Equivalence

✇cs.AI, q-bio.NC updates on arXiv.org
By: Ziyu Liu · Shengyuan Ding · Xinyu Fang · Xuanlang Dai · Penghui Yang · Jianze Liang · Jiaqi Wang · Kai Chen · Dahua Lin · Yuhang Zang
arXiv:2603.13224v1 Announce Type: cross Abstract: Vision-to-code tasks require models to reconstruct structured visual inputs, such as charts, tables, and SVGs, into executable or structured representations with high visual fidelity. While recent Large Vision Language Models (LVLMs) achieve strong results via supervised fine-tuning, reinforcement learning remains challenging due to misaligned reward signals. Existing rewards either rely on textual rules or coarse visual embedding similarity, both of which fail to capture fine-grained visual discrepancies and are vulnerable to reward hacking. We propose Visual Equivalence Reward Model (Visual-ERM), a multimodal generative reward model that provides fine-grained, interpretable, and task-agnostic feedback to evaluate vision-to-code quality directly in the rendered visual space. Integrated into RL, Visual-ERM improves Qwen3-VL-8B-Instruct by +8.4 on chart-to-code and yields consistent gains on table and SVG parsing (+2.7, +4.1 on average), and further strengthens test-time scaling via reflection and revision. We also introduce VisualCritic-RewardBench (VC-RewardBench), a benchmark for judging fine-grained image-to-image discrepancies on structured visual data, where Visual-ERM at 8B decisively outperforms Qwen3-VL-235B-Instruct and approaches leading closed-source models. Our results suggest that fine-grained visual reward supervision is both necessary and sufficient for vision-to-code RL, regardless of task specificity.
  •  
  • ↗️
↗️

How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits

✇cs.AI, q-bio.NC updates on arXiv.org
By: Masoud Mohseni · Artur Scherer · K. Grace Johnson · Oded Wertheim · Matthew Otten · Namit Anand · Navid Anjum Aadit · Yuri Alexeev · Gilad Ben-Shach · Kirk M. Bresniker · Kerem Y. Camsari · Barbara Chapman · Soumitra Chatterjee · Shuvro Chowdhury · Gebremedhin A. Dagnew · Tom Dvir · Aniello Esposito · Farah Fahim · Michael Ferguson · Marco Fiorentino · Archit Gajjar · Katerina Gratsea · Gaurav Gyawali · Christian Heiter · Ali H. Z. Kavaki · Abdullah Khalid · Xiangzhou Kong · Bohdan Kulchytskyy · Elica Kyoseva · Ruoyu Li · P. Aaron Lott · Igor L. Markov · Robert F. McDermott · Lucas Morais · Giacomo Pedretti · Pooja Rao · Eleanor Rieffel · Allyson Silva · John Sorebo · Panagiotis Spentzouris · Ziv Steiner · Boyan Torosov · Davide Venturelli · Robert J. Visser · Zak Webb · Xin Zhan · Yonatan Cohen · Pooya Ronagh · Alan Ho · Raymond G. Beausoleil · John M. Martinis
arXiv:2411.10406v3 Announce Type: replace-cross Abstract: In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of physical qubits. Nevertheless, there are significant outstanding challenges in quantum hardware, fabrication, software architecture, and algorithms on the path towards a full-stack scalable quantum computing technology. Here, we provide a comprehensive review of these scaling challenges. We show how to facilitate scaling by adopting existing semiconductor technology to build much higher-quality qubits, employing systems engineering approaches, and performing distributed heterogeneous quantum-classical computing. We provide a detailed resource and sensitivity analysis for quantum applications on surface-code error-corrected quantum computers given current, target, and desired hardware specifications based on superconducting qubits, accounting for a realistic distribution of errors. We provide comprehensive resource estimates for several utility-scale applications including quantum chemistry calculations, catalyst design, NMR spectroscopy, and Fermi-Hubbard simulation. We show that orders of magnitude enhancement in performance could be obtained by a combination of hardware improvements and tight quantum-HPC integration. Furthermore, we introduce high-performance architectures for quantum-probabilistic computing with custom-designed accelerators to tackle today's industry-scale classical optimization, machine learning, and quantum simulation tasks in a cost-effective manner.
  •  
  • ↗️
↗️

Integrated Network Toxicology and Metabolomics Elucidate Mechanisms of Carbosulfan-Induced Respiratory Toxicity in Rats

✇(Multiomics OR Omics) AND (Lung OR gastric OR Hepatocellular)
By: Xian Ju · Di Liang · Hongyu Su · Yachun Zhang · Zhenyu Liang · Yiheng Liu · Wenqi Zhao · Dan Zhang · Zhe Chen · Keming Yun

Int J Mol Sci. 2026 Feb 25;27(5):2170. doi: 10.3390/ijms27052170.

ABSTRACT

Carbosulfan is a widely used carbamate insecticide, yet its mechanisms of respiratory toxicity remain poorly understood. This study integrated network toxicology, untargeted metabolomics, and molecular docking to systematically investigate the potential mechanisms of carbosulfan-induced respiratory toxicity in male Sprague Dawley rats. Rats were administered a single oral dose of carbosulfan (125 or 250 mg/kg) and assessed after 12 h. Exposure resulted in significant pathological lung damage, characterized by disrupted alveolar architecture, inflammatory cell infiltration, and increased serum levels of the pro-inflammatory cytokines IL-6, IL-1β, and TNF-α. Network toxicology analysis identified 51 potential targets associated with respiratory toxicity, with core targets including SRC, EGFR, PTGS2, CXCL8, CYP3A4, and NR3C1. Enriched pathways were primarily related to neuroactive ligand-receptor interaction, VEGF signaling, and arachidonic acid metabolism. Untargeted metabolomics revealed significant metabolic perturbations in pathways central to antioxidant defense and energy homeostasis, including glutathione metabolism, the tricarboxylic acid cycle, and arginine biosynthesis. Molecular docking confirmed stable in silico binding affinities between carbosulfan and the predicted core targets. Integrative analysis suggests that carbosulfan exposure is associated with respiratory damage, potentially through interconnected mechanisms involving oxidative stress, inflammation, and disruption of cell signaling and metabolic enzyme systems. However, given the acute high-dose nature of the model and the interpretative integration of multi-omics data, these findings should be considered hypothesis-generating. This study provides a novel system-level perspective on carbosulfan-induced respiratory toxicity and highlights key pathways and targets for future validation in chronic exposure models.

PMID:41828400 | PMC:PMC12984169 | DOI:10.3390/ijms27052170

  •  
  • ↗️
↗️

Integrated Network Toxicology and Metabolomics Elucidate Mechanisms of Carbosulfan-Induced Respiratory Toxicity in Rats

✇Omics In Lung
By: Xian Ju · Di Liang · Hongyu Su · Yachun Zhang · Zhenyu Liang · Yiheng Liu · Wenqi Zhao · Dan Zhang · Zhe Chen · Keming Yun

Int J Mol Sci. 2026 Feb 25;27(5):2170. doi: 10.3390/ijms27052170.

ABSTRACT

Carbosulfan is a widely used carbamate insecticide, yet its mechanisms of respiratory toxicity remain poorly understood. This study integrated network toxicology, untargeted metabolomics, and molecular docking to systematically investigate the potential mechanisms of carbosulfan-induced respiratory toxicity in male Sprague Dawley rats. Rats were administered a single oral dose of carbosulfan (125 or 250 mg/kg) and assessed after 12 h. Exposure resulted in significant pathological lung damage, characterized by disrupted alveolar architecture, inflammatory cell infiltration, and increased serum levels of the pro-inflammatory cytokines IL-6, IL-1β, and TNF-α. Network toxicology analysis identified 51 potential targets associated with respiratory toxicity, with core targets including SRC, EGFR, PTGS2, CXCL8, CYP3A4, and NR3C1. Enriched pathways were primarily related to neuroactive ligand-receptor interaction, VEGF signaling, and arachidonic acid metabolism. Untargeted metabolomics revealed significant metabolic perturbations in pathways central to antioxidant defense and energy homeostasis, including glutathione metabolism, the tricarboxylic acid cycle, and arginine biosynthesis. Molecular docking confirmed stable in silico binding affinities between carbosulfan and the predicted core targets. Integrative analysis suggests that carbosulfan exposure is associated with respiratory damage, potentially through interconnected mechanisms involving oxidative stress, inflammation, and disruption of cell signaling and metabolic enzyme systems. However, given the acute high-dose nature of the model and the interpretative integration of multi-omics data, these findings should be considered hypothesis-generating. This study provides a novel system-level perspective on carbosulfan-induced respiratory toxicity and highlights key pathways and targets for future validation in chronic exposure models.

PMID:41828400 | PMC:PMC12984169 | DOI:10.3390/ijms27052170

  •  
  • ↗️
↗️

FNDC1 Competitively Binds Gbeta2 to Suppress the beta-Catenin-Destruction Complex and Promote Gastric Cancer Malignancy

✇Omics in Gastric
By: Wenyu Gao · Hao Chen · Fangyu Lin · Jialin Liu · Tingxuan Huang · Han Wang · Xiaojiao Weng · Xinli Wang · Xiaoyan Lin · Tao Jiang

FASEB J. 2026 Mar 31;40(6):e71634. doi: 10.1096/fj.202503587R.

ABSTRACT

Gastric cancer (GC) is a leading cause of cancer-related deaths and has high recurrence rate. Although fibronectin domain-containing protein 1 (FNDC1) is implicated in GC progression, its molecular mechanisms remain unclear. Multi-omics analyses (TCGA, GEO datasets) were used to assess FNDC1 expression and clinical correlation. In vitro (cell proliferation, invasion, EMT markers) and in vivo (xenograft) experiments, combined with molecular assays (Co-IP, WB, ChIP), explored FNDC1's function and mechanism. FNDC1 was significantly upregulated in GC, correlating with advanced clinicopathological features and poor prognosis. Knockdown of FNDC1 suppressed GC cell proliferation, invasion, and metastasis by inhibiting EMT and Wnt/β-catenin signaling. Mechanistically, FNDC1 competitively bound the WD5 domain (residues 224-254) of Gβ2, disrupting Gβγ-Dvl1 interaction. This prevented Dvl1 degradation, promoted Axin1 ubiquitination, and destabilized the β-catenin-destruction complex (GSK3 β-APC-Axin1), leading to β-catenin accumulation and Wnt pathway activation. FNDC1 drives GC malignancy by targeting the Gβ2-Dvl1 axis to activate Wnt/β-catenin signaling, suggesting FNDC1 as a novel prognostic biomarker and therapeutic target.

PMID:41808415 | PMC:PMC12976582 | DOI:10.1096/fj.202503587R

  •  
  • ↗️
↗️

A prior information informed learning architecture for flying trajectory prediction

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xianda Huang · Zidong Han · Ruibo Jin · Zhenyu Wang · Wenyu Li · Xiaoyang Li · Yi Gong
arXiv:2603.06863v1 Announce Type: cross Abstract: Trajectory prediction for flying objects is critical in domains ranging from sports analytics to aerospace. However, traditional methods struggle with complex physical modeling, computational inefficiencies, and high hardware demands, often neglecting critical trajectory events like landing points. This paper introduces a novel, hardware-efficient trajectory prediction framework that integrates environmental priors with a Dual-Transformer-Cascaded (DTC) architecture. We demonstrate this approach by predicting the landing points of tennis balls in real-world outdoor courts. Using a single industrial camera and YOLO-based detection, we extract high-speed flight coordinates. These coordinates, fused with structural environmental priors (e.g., court boundaries), form a comprehensive dataset fed into our proposed DTC model. A first-level Transformer classifies the trajectory, while a second-level Transformer synthesizes these features to precisely predict the landing point. Extensive ablation and comparative experiments demonstrate that integrating environmental priors within the DTC architecture significantly outperforms existing trajectory prediction frameworks
  •  
  • ↗️
↗️

GCGNet: Graph-Consistent Generative Network for Time Series Forecasting with Exogenous Variables

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhengyu Li · Xiangfei Qiu · Yuhan Zhu · Xingjian Wu · Jilin Hu · Chenjuan Guo · Bin Yang
arXiv:2603.08032v1 Announce Type: cross Abstract: Exogenous variables offer valuable supplementary information for predicting future endogenous variables. Forecasting with exogenous variables needs to consider both past-to-future dependencies (i.e., temporal correlations) and the influence of exogenous variables on endogenous variables (i.e., channel correlations). This is pivotal when future exogenous variables are available, because they may directly affect the future endogenous variables. Many methods have been proposed for time series forecasting with exogenous variables, focusing on modeling temporal and channel correlations. However, most of them use a two-step strategy, modeling temporal and channel correlations separately, which limits their ability to capture joint correlations across time and channels. Furthermore, in real-world scenarios, time series are frequently affected by various forms of noises, underscoring the critical importance of robustness in such correlations modeling. To address these limitations, we propose GCGNet, a Graph-Consistent Generative Network for time series forecasting with exogenous variables. Specifically, GCGNet first employs a Variational Generator to produce coarse predictions. A Graph Structure Aligner then further guides it by evaluating the consistency between the generated and true correlations, where the correlations are represented as graphs, and are robust to noises. Finally, a Graph Refiner is proposed to refine the predictions to prevent degeneration and improve accuracy. Extensive experiments on 12 real-world datasets demonstrate that GCGNet outperforms state-of-the-art baselines.
  •  
  • ↗️
↗️

Towards Effective and Efficient Graph Alignment without Supervision

✇cs.AI, q-bio.NC updates on arXiv.org
By: Songyang Chen · Youfang Lin · Yu Liu · Shuai Zheng · Lei Zou
arXiv:2603.08526v1 Announce Type: cross Abstract: Unsupervised graph alignment aims to find the node correspondence across different graphs without any anchor node pairs. Despite the recent efforts utilizing deep learning-based techniques, such as the embedding and optimal transport (OT)-based approaches, we observe their limitations in terms of model accuracy-efficiency tradeoff. By focusing on the exploitation of local and global graph information, we formalize them as the ``local representation, global alignment'' paradigm, and present a new ``global representation and alignment'' paradigm to resolve the mismatch between the two phases in the alignment process. We then propose \underline{Gl}obal representation and \underline{o}ptimal transport-\underline{b}ased \underline{Align}ment (\texttt{GlobAlign}), and its variant, \texttt{GlobAlign-E}, for better \underline{E}fficiency. Our methods are equipped with the global attention mechanism and a hierarchical cross-graph transport cost, able to capture long-range and implicit node dependencies beyond the local graph structure. Furthermore, \texttt{GlobAlign-E} successfully closes the time complexity gap between representative embedding and OT-based methods, reducing OT's cubic complexity to quadratic terms. Through extensive experiments, our methods demonstrate superior performance, with up to a 20\% accuracy improvement over the best competitor. Meanwhile, \texttt{GlobAlign-E} achieves the best efficiency, with an order of magnitude speedup against existing OT-based methods.
  •  
  • ↗️
↗️

Parallelized Planning-Acting for Efficient LLM-based Multi-Agent Systems in Minecraft

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yaoru Li · Shunyu Liu · Tongya Zheng · Li Sun · Mingli Song
arXiv:2503.03505v2 Announce Type: replace Abstract: Recent advancements in Large Language Model~(LLM)-based Multi-Agent Systems (MAS) have demonstrated remarkable potential for tackling complex decision-making tasks. However, existing frameworks inevitably rely on serialized execution paradigms, where agents must complete sequential LLM planning before taking action. This fundamental constraint severely limits real-time responsiveness and adaptation, which is crucial in dynamic environments with ever-changing scenarios like Minecraft. In this paper, we propose a novel parallelized planning-acting framework for LLM-based MAS, featuring a dual-thread architecture with interruptible execution to enable concurrent planning and acting. Specifically, our framework comprises two core threads: (1) a planning thread driven by a centralized memory system, maintaining synchronization of environmental states and agent communication to support dynamic decision-making; and (2) an acting thread equipped with a comprehensive skill library, enabling automated task execution through recursive decomposition. Extensive experiments on Minecraft demonstrate the effectiveness of the proposed framework.
  •  
  • ↗️
↗️

Improving Visual Object Tracking through Visual Prompting

✇cs.AI, q-bio.NC updates on arXiv.org
By: Shih-Fang Chen · Jun-Cheng Chen · I-Hong Jhuo · Yen-Yu Lin
arXiv:2409.18901v2 Announce Type: replace-cross Abstract: Learning a discriminative model that distinguishes the specified target from surrounding distractors across frames is essential for generic object tracking (GOT). Dynamic adaptation of target representation against distractors remains challenging because prevailing trackers exhibit limited discriminative capability. To address this issue, we present a new visual prompting mechanism for generic object tracking, termed PiVOT. PiVOT introduces mechanisms that leverage the pretrained foundation model (CLIP) to automatically generate and refine visual prompts online, thereby enabling the tracker to suppress distractors through contrastive guidance. To transfer contrastive knowledge from the foundation model to the tracker, PiVOT automatically propagates this knowledge online and dynamically generates and updates visual prompts. Specifically, it proposes a prompt initialization mechanism that produces an initial visual prompt highlighting potential target locations. The foundation model is then used to refine the prompt based on appearance similarities between candidate objects and reference templates across potential targets. After refinement, the visual prompt better highlights potential target locations and reduces irrelevant prompt information. With the proposed prompting mechanism, the tracker can generate instance-aware feature maps guided by the visual prompts, which are incrementally and automatically updated during tracking, thereby effectively suppressing distractors. Extensive experiments across multiple benchmarks indicate that PiVOT, with the proposed prompting mechanism, can suppress distracting objects and improve tracking performance.
  •  
  • ↗️
↗️

A Simple "Motivation" Can Enhance Reinforcement Finetuning of Large Reasoning Models

✇cs.AI, q-bio.NC updates on arXiv.org
By: Junjie Zhang · Guozheng Ma · Shunyu Liu · Haoyu Wang · Jiaxing Huang · Ting-En Lin · Fei Huang · Yongbin Li · Dacheng Tao
arXiv:2506.18485v3 Announce Type: replace-cross Abstract: Reinforcement Learning with Verifiable Rewards~(RLVR) has emerged as a powerful learn-to-reason paradigm for large reasoning models to tackle complex tasks. However, the current RLVR paradigm is still not efficient enough, as it works in a trial-and-error manner. To perform better, the model needs to explore the reward space by numerously generating responses and learn from fragmented reward signals, blind to the overall reward patterns. Fortunately, verifiable rewards make the natural language description of the reward function possible, and meanwhile, LLMs have demonstrated strong in-context learning ability. This motivates us to explore if large reasoning models can benefit from a \textbf{motivation} of the task, \textit{i.e.}, awareness of the reward function, during the reinforcement finetuning process, as we humans sometimes do when learning. In this paper, we introduce \textit{\textbf{M}otivation-\textbf{e}nhanced \textbf{R}einforcement \textbf{F}inetuning}~(\textbf{MeRF}), an intuitive yet effective method enhancing reinforcement finetuning of LLMs by involving \emph{``telling LLMs rules of the game''}. Specifically, \textbf{MeRF} directly injects the reward specification into the prompt, which serves as an in-context motivation for the model to be aware of the optimization objective. This simple modification leverages the in-context learning ability of LLMs, aligning generation with optimization, thereby incentivizing the model to generate desired outputs from both inner motivation and external reward. Empirical evaluations demonstrate that \textbf{MeRF} achieves substantial performance gains over the RLVR baseline. Moreover, ablation studies show that MeRF performs better with greater consistency between the in-context motivation and the external reward function, while the model also demonstrates an ability to adapt to misleading motivations through reinforcement finetuning.
  •  
  • ↗️
❌