❌

Normal view

Received — 2 April 2026 ⏭

PSPA-Bench: A Personalized Benchmark for Smartphone GUI Agent

✇cs.AI, q-bio.NC updates on arXiv.org
By: Hongyi Nie · Xunyuan Liu · Yudong Bai · Yaqing Wang · Yang Liu · Quanming Yao · Zhen Wang
1 April 2026 at 12:00
arXiv:2603.29318v1 Announce Type: new Abstract: Smartphone GUI agents execute tasks by operating directly on app interfaces, offering a path to broad capability without deep system integration. However, real-world smartphone use is highly personalized: users adopt diverse workflows and preferences, challenging agents to deliver customized assistance rather than generic solutions. Existing GUI agent benchmarks cannot adequately capture this personalization dimension due to sparse user-specific data and the lack of fine-grained evaluation metrics. To address this gap, we present PSPA-Bench, the benchmark dedicated to evaluating personalization in smartphone GUI agents. PSPA-Bench comprises over 12,855 personalized instructions aligned with real-world user behaviors across 10 representative daily-use scenarios and 22 mobile apps, and introduces a structure-aware process evaluation method that measures agents' personalized capabilities at a fine-grained level. Through PSPA-Bench, we benchmark 11 state-of-the-art GUI agents. Results reveal that current methods perform poorly under personalized settings, with even the strongest agent achieving limited success. Our analysis further highlights three directions for advancing personalized GUI agents: (1) reasoning-oriented models consistently outperform general LLMs, (2) perception remains a simple yet critical capability, and (3) reflection and long-term memory mechanisms are key to improving adaptation. Together, these findings establish PSPA-Bench as a foundation for systematic study and future progress in personalized GUI agents.

FlowPIE: Test-Time Scientific Idea Evolution with Flow-Guided Literature Exploration

✇cs.AI, q-bio.NC updates on arXiv.org
By: Qiyao Wang · Hongbo Wang · Longze Chen · Zhihao Yang · Guhong Chen · Hamid Alinejad-Rokny · Hui Li · Yuan Lin · Min Yang
1 April 2026 at 12:00
arXiv:2603.29557v1 Announce Type: new Abstract: Scientific idea generation (SIG) is critical to AI-driven autonomous research, yet existing approaches are often constrained by a static retrieval-then-generation paradigm, leading to homogeneous and insufficiently divergent ideas. In this work, we propose FlowPIE, a tightly coupled retrieval-generation framework that treats literature exploration and idea generation as a co-evolving process. FlowPIE expands literature trajectories via a flow-guided Monte Carlo Tree Search (MCTS) inspired by GFlowNets, using the quality of current ideas assessed by an LLM-based generative reward model (GRM) as a supervised signal to guide adaptive retrieval and construct a diverse, high-quality initial population. Based on this population, FlowPIE models idea generation as a test-time idea evolution process, applying selection, crossover, and mutation with the isolation island paradigm and GRM-based fitness computation to incorporate cross-domain knowledge. It effectively mitigates the information cocoons arising from over-reliance on parametric knowledge and static literature. Extensive evaluations demonstrate that FlowPIE consistently produces ideas with higher novelty, feasibility and diversity compared to strong LLM-based and agent-based frameworks, while enabling reward scaling during test time.

iPoster: Content-Aware Layout Generation for Interactive Poster Design via Graph-Enhanced Diffusion Models

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xudong Zhou · Jinyuan Liang · Qiuyi Guo · Guozheng Li
1 April 2026 at 12:00
arXiv:2603.29469v1 Announce Type: cross Abstract: We present iPoster, an interactive layout generation framework that empowers users to guide content-aware poster layout design by specifying flexible constraints. iPoster enables users to specify partial intentions within the intention module, such as element categories, sizes, positions, or coarse initial drafts. Then, the generation module instantly generates refined, context-sensitive layouts that faithfully respect these constraints. iPoster employs a unified graph-enhanced diffusion architecture that supports various design tasks under user-specified constraints. These constraints are enforced through masking strategies that precisely preserve user input at every denoising step. A cross content-aware attention module aligns generated elements with salient regions of the canvas, ensuring visual coherence. Extensive experiments show that iPoster not only achieves state-of-the-art layout quality, but offers a responsive and controllable framework for poster layout design with constraints.

Accelerating Diffusion Large Language Models with SlowFast Sampling: The Three Golden Principles

✇cs.AI, q-bio.NC updates on arXiv.org
By: Qingyan Wei · Yaojie Zhang · Zhiyuan Liu · Puyu Zeng · Yuxuan Wang · Biqing Qi · Dongrui Liu · Linfeng Zhang
1 April 2026 at 12:00
arXiv:2506.10848v3 Announce Type: replace-cross Abstract: Diffusion-based language models (dLLMs) have emerged as a promising alternative to traditional autoregressive LLMs by enabling parallel token generation and significantly reducing inference latency. However, existing sampling strategies for dLLMs, such as confidence-based or semi-autoregressive decoding, often suffer from static behavior, leading to suboptimal efficiency and limited flexibility. In this paper, we propose SlowFast Sampling, a novel dynamic sampling strategy that adaptively alternates between exploratory and accelerated decoding stages. Our method is guided by three golden principles: certainty principle, convergence principle, and positional principle, which govern when and where tokens can be confidently and efficiently decoded. We further integrate our strategy with dLLM-Cache to reduce redundant computation. Extensive experiments across benchmarks and models show that SlowFast Sampling achieves up to 15.63$\times$ speedup on LLaDA with minimal accuracy drop, and up to 34.22$\times$ when combined with caching. Notably, our approach outperforms strong autoregressive baselines like LLaMA3 8B in throughput, demonstrating that well-designed sampling can unlock the full potential of dLLMs for fast and high-quality generation.

Gene regulatory landscape dissected by single-cell four-omics sequencing

✇Nature - Issue - nature.com science feeds
By: Yujie Chen · Zhiyuan Liu · Heming Xu · Jiayu Liu · Mengxuan Wang · Yi Chi · Boyuan Liang · Menghan Liu · Yongli Peng · Hao Ge · Dong Xing
1 April 2026 at 08:00

Nature, Published online: 01 April 2026; doi:10.1038/s41586-026-10322-z

Combining single-cell parallel profiling of genome conformation, histone modifications, chromatin accessibility and gene expression reveals dynamics and intranuclear spatial clustering of epigenome profiles, enabling sophisticated analysis of the regulatory landscape across cell types and tissues.

Cellular Senescence in Gastric Cancer: Molecular Mechanisms, Microenvironment Remodeling and Therapeutic Implications

✇Omics in Gastric
By: Zhiyuan Shi · Zhao Sun · Yuan Liu · Yuping Ge · Ning Jia · Yuwei Hua · Lin Zhao · Xiang Wang · Yi Ba
30 March 2026 at 18:00

Aging Dis. 2026 Mar 19. doi: 10.14336/AD.2025.1571. Online ahead of print.

ABSTRACT

Gastric cancer (GC) remains a leading cause of cancer-related morbidity and mortality worldwide, with poor prognosis for advanced-stage patients. Therefore, in-depth exploration of the mechanisms underlying GC initiation and progression, as well as the development of novel therapeutic strategies, is of crucial importance. Cellular senescence is a stable cell cycle arrest program that plays a dual role in GC. It exerts tumor-suppressive effects via growth arrest but also promotes tumor progression and immune evasion by remodeling the tumor microenvironment (TME) through senescence-associated secretory phenotype (SASP). This review comprehensively elucidates the molecular mechanisms of cellular senescence in GC and the core regulatory networks involving gene regulation, epigenetic modifications, metabolic reprogramming, and cell cycle arrest. Additionally, the review highlights how senescent cells foster an immunosuppressive microenvironment via SASP, forming a self-reinforcing feed-forward loop. Regarding therapeutic strategies, we summarize potential approaches targeting cellular senescence, including senescence induction, senescent cell clearance, SASP modulation, and multi-target synergistic therapy by integrating epigenetic regulation, metabolic intervention, and immune microenvironment modulation. Despite progress, numerous challenges remain. Future studies should leverage multi-omics technologies, novel models' development, and large-scale clinical trials to advance the clinical translation of GC cellular senescence research, providing new insights for improving prognosis.

PMID:41910653 | DOI:10.14336/AD.2025.1571

Received — 26 March 2026 ⏭

WIST: Web-Grounded Iterative Self-Play Tree for Domain-Targeted Reasoning Improvement

✇cs.AI, q-bio.NC updates on arXiv.org
By: Fangyuan Li · Pengfei Li · Shijie Wang · Junqi Gao · Jianxing Liu · Biqing Qi · Yuqiang Li
25 March 2026 at 12:00
arXiv:2603.22352v1 Announce Type: cross Abstract: Recent progress in reinforcement learning with verifiable rewards (RLVR) offers a practical path to self-improvement of language models, but existing methods face a key trade-off: endogenous self-play can drift over iterations, while corpus-grounded approaches rely on curated data environments. We present \textbf{WIST}, a \textbf{W}eb-grounded \textbf{I}terative \textbf{S}elf-play \textbf{T}ree framework for domain-targeted reasoning improvement that learns directly from the open web without requiring any pre-arranged domain corpus. WIST incrementally expands a domain tree for exploration, and retrieves and cleans path-consistent web corpus to construct a controllable training environment. It then performs Challenger--Solver self-play with verifiable rewards, and feeds learnability signals back to update node posteriors and guide subsequent exploration through an adaptive curriculum. Across four backbones, WIST consistently improves over the base models and typically outperforms both purely endogenous self-evolution and corpus-grounded self-play baselines, with the Overall gains reaching \textbf{+9.8} (\textit{Qwen3-4B-Base}) and \textbf{+9.7} (\textit{OctoThinker-8B}). WIST is also domain-steerable, improving \textit{Qwen3-8B-Base} by \textbf{+14.79} in medicine and \textit{Qwen3-4B-Base} by \textbf{+5.28} on PhyBench. Ablations further confirm the importance of WIST's key components for stable open-web learning. Our Code is available at https://github.com/lfy-123/WIST.
Received — 17 March 2026 ⏭

Cheers: Decoupling Patch Details from Semantic Representations Enables Unified Multimodal Comprehension and Generation

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yichen Zhang · Da Peng · Zonghao Guo · Zijian Zhang · Xuesong Yang · Tong Sun · Shichu Sun · Yidan Zhang · Yanghao Li · Haiyan Zhao · Wang Xu · Qi Shi · Yangang Sun · Chi Chen · Shuo Wang · Yukun Yan · Xu Han · Qiang Ma · Wei Ke · Liang Wang · Zhiyuan Liu · Maosong Sun
16 March 2026 at 12:00
arXiv:2603.12793v1 Announce Type: cross Abstract: A recent cutting-edge topic in multimodal modeling is to unify visual comprehension and generation within a single model. However, the two tasks demand mismatched decoding regimes and visual representations, making it non-trivial to jointly optimize within a shared feature space. In this work, we present Cheers, a unified multimodal model that decouples patch-level details from semantic representations, thereby stabilizing semantics for multimodal understanding and improving fidelity for image generation via gated detail residuals. Cheers includes three key components: (i) a unified vision tokenizer that encodes and compresses image latent states into semantic tokens for efficient LLM conditioning, (ii) an LLM-based Transformer that unifies autoregressive decoding for text generation and diffusion decoding for image generation, and (iii) a cascaded flow matching head that decodes visual semantics first and then injects semantically gated detail residuals from the vision tokenizer to refine high-frequency content. Experiments on popular benchmarks demonstrate that Cheers matches or surpasses advanced UMMs in both visual understanding and generation. Cheers also achieves 4x token compression, enabling more efficient high-resolution image encoding and generation. Notably, Cheers outperforms the Tar-1.5B on the popular benchmarks GenEval and MMBench, while requiring only 20% of the training cost, indicating effective and efficient (i.e., 4x token compression) unified multimodal modeling. We will release all code and data for future research.

LatentChem: From Textual CoT to Latent Thinking in Chemical Reasoning

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xinwu Ye · Yicheng Mao · Jia Zhang · Yimeng Liu · Li Hao · Fang Wu · Zhiwei Li · Yuxuan Liao · Zehong Wang · Yingcheng Wu · Zhiyuan Liu · Zhenfei Yin · Li Yuan · Philip Torr · Huan Sun · Xiangxiang Zeng · Mengdi Wang · Le Cong · Shenghua Gao · Xiangru Tang
16 March 2026 at 12:00
arXiv:2602.07075v4 Announce Type: replace-cross Abstract: Chemical large language models (LLMs) predominantly rely on explicit Chain-of-Thought (CoT) in natural language to perform complex reasoning. However, chemical reasoning is inherently continuous and structural, and forcing it into discrete linguistic tokens introduces a fundamental representation mismatch that constrains both efficiency and performance. We introduce LatentChem, a latent reasoning interface that decouples chemical computation from textual generation, enabling models to perform multi-step reasoning directly in continuous latent space while emitting language only for final outputs. Remarkably, we observe a consistent emergent behavior: when optimized solely for task success, models spontaneously internalize reasoning, progressively abandoning verbose textual derivations in favor of implicit latent computation. This shift is not merely stylistic but computationally advantageous. Across diverse chemical reasoning benchmarks, LatentChem achieves a 59.88\% non-tie win rate over strong CoT-based baselines on ChemCoTBench, while delivering a 10.84$\times$ average reduction in reasoning overhead. Our results provide empirical evidence that chemical reasoning is more naturally and effectively realized as continuous latent dynamics rather than discretized linguistic trajectories.
Received — 11 March 2026 ⏭

Evo: Autoregressive-Diffusion Large Language Models with Evolving Balance

✇cs.AI, q-bio.NC updates on arXiv.org
By: Junde Wu · Minhao Hu · Jiayuan Zhu · Yuyuan Liu · Tianyi Zhang · Kang Li · Jingkun Chen · Jiazhen Pan · Min Xu · Yueming Jin
10 March 2026 at 12:00
arXiv:2603.06617v1 Announce Type: cross Abstract: We introduce \textbf{Evo}, a duality latent trajectory model that bridges autoregressive (AR) and diffusion-based language generation within a continuous evolutionary generative framework. Rather than treating AR decoding and diffusion generation as separate paradigms, Evo reconceptualizes text generation as a latent flow: each token is associated with a vector-valued embedding that evolves over a progression variable $t_i \in [0, 1]$, indicating its semantic maturity. Low $t_i$ values correspond to confident AR-like refinement, while high values invoke diffusion-style planning, allowing the model to adaptively balance AR and diffusion based on uncertainty. Theoretically, we show that both AR and diffusion models emerge as discretizations of a shared probability flow, and we derive Evo's training objective from a unified variational ELBO. The model is implemented as a time-conditioned Transformer governed by a shared vector field, trained end-to-end to jointly infer latent codes and their progression times. During decoding, Evo performs efficient, semantics-aware refinement, achieving high-quality outputs without sacrificing speed. Empirically, Evo 8B achieves state-of-the-art or highly competitive results on 15 diverse benchmarks, including reasoning (GSM8K, ARC-C), code generation (HumanEval, MBPP), and general language understanding, while maintaining fast inference speed. Our results demonstrate that Evo delivers a new paradigm for LLM design with strong generation quality, robust symbolic reasoning, and decoding efficiency.

SketchGraphNet: A Memory-Efficient Hybrid Graph Transformer for Large-Scale Sketch Corpora Recognition

✇cs.AI, q-bio.NC updates on arXiv.org
By: Shilong Chen · Mingyuan Li · Zhaoyang Wang · Zhonglin Ye · Haixing Zhao
10 March 2026 at 12:00
arXiv:2603.07521v1 Announce Type: cross Abstract: This work investigates large-scale sketch recognition from a graph-native perspective, where free-hand sketches are directly modeled as structured graphs rather than raster images or stroke sequences. We propose SketchGraphNet, a hybrid graph neural architecture that integrates local message passing with a memory-efficient global attention mechanism, without relying on auxiliary positional or structural encodings. To support systematic evaluation, we construct SketchGraph, a large-scale benchmark comprising 3.44 million graph-structured sketches across 344 categories, with two variants (A and R) to reflect different noise conditions. Each sketch is represented as a spatiotemporal graph with normalized stroke-order attributes. On SketchGraph-A and SketchGraph-R, SketchGraphNet achieves Top-1 accuracies of 83.62% and 87.61%, respectively, under a unified training configuration. MemEffAttn further reduces peak GPU memory by over 40% and training time by more than 30% compared with Performer-based global attention, while maintaining comparable accuracy.

ELLMob: Event-Driven Human Mobility Generation with Self-Aligned LLM Framework

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yusong Wang · Chuang Yang · Jiawei Wang · Xiaohang Xu · Jiayi Xu · Dongyuan Li · Chuan Xiao · Renhe Jiang
10 March 2026 at 12:00
arXiv:2603.07946v1 Announce Type: cross Abstract: Human mobility generation aims to synthesize plausible trajectory data, which is widely used in urban system research. While Large Language Model-based methods excel at generating routine trajectories, they struggle to capture deviated mobility during large-scale societal events. This limitation stems from two critical gaps: (1) the absence of event-annotated mobility datasets for design and evaluation, and (2) the inability of current frameworks to reconcile competitions between users' habitual patterns and event-imposed constraints when making trajectory decisions. This work addresses these gaps with a twofold contribution. First, we construct the first event-annotated mobility dataset covering three major events: Typhoon Hagibis, COVID-19, and the Tokyo 2021 Olympics. Second, we propose ELLMob, a self-aligned LLM framework that first extracts competing rationales between habitual patterns and event constraints, based on Fuzzy-Trace Theory, and then iteratively aligns them to generate trajectories that are both habitually grounded and event-responsive. Extensive experiments show that ELLMob wins state-of-the-art baselines across all events, demonstrating its effectiveness. Our codes and datasets are available at https://github.com/deepkashiwa20/ELLMob.

Adaptation of Agentic AI: A Survey of Post-Training, Memory, and Skills

✇cs.AI, q-bio.NC updates on arXiv.org
By: Pengcheng Jiang · Jiacheng Lin · Zhiyi Shi · Zifeng Wang · Luxi He · Yichen Wu · Ming Zhong · Peiyang Song · Qizheng Zhang · Heng Wang · Xueqiang Xu · Hanwen Xu · Pengrui Han · Dylan Zhang · Jiashuo Sun · Chaoqi Yang · Kun Qian · Tian Wang · Changran Hu · Manling Li · Quanzheng Li · Hao Peng · Sheng Wang · Jingbo Shang · Chao Zhang · Jiaxuan You · Liyuan Liu · Pan Lu · Yu Zhang · Heng Ji · Yejin Choi · Dawn Song · Jimeng Sun · Jiawei Han
10 March 2026 at 12:00
arXiv:2512.16301v3 Announce Type: replace Abstract: Large language model (LLM) agents are moving beyond prompting alone. ChatGPT marked the rise of general-purpose LLM assistants, DeepSeek showed that on-policy reinforcement learning with verifiable rewards can improve reasoning and tool use, and OpenClaw highlights a newer direction in which agents accumulate persistent memory and reusable skills. Yet the research landscape remains fragmented across post-training, retrieval, memory, and skill systems. This survey studies these developments under a single notion of \emph{adaptation}: improving an agent, its tools, or their interaction after pretraining. We organize the field with a four-paradigm framework spanning agent adaptation and tool adaptation. On the agent side, A1 (tool-execution-signaled) and A2 (agent-output-signaled) improve the agent itself through supervised fine-tuning, preference optimization, and reinforcement learning with verifiable rewards. On the tool side, T1 (agent-agnostic) provides reusable pre-trained modules any agent can call, while T2 (agent-supervised) uses the agent's outputs to train memory systems, skill libraries, or lightweight subagents. Using this framework, we review post-training methods, adaptive memory architectures, and agent skills; compare their trade-offs in cost, flexibility, and generalization; and summarize evaluation practices across deep research, software development, computer use, and drug discovery. We conclude by outlining open problems in agent-tool co-adaptation, continual learning, safety, and efficient deployment.

LMMRec: LLM-driven Motivation-aware Multimodal Recommendation

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yicheng Di · Zhanjie Zhang · Yun Wang · Jinren Liu · Jiaqi Yan · Jiyu Wei · Xiangyu Chen · Yuan Liu
10 March 2026 at 12:00
arXiv:2602.05474v3 Announce Type: replace-cross Abstract: Motivation-based recommendation systems uncover user behavior drivers. Motivation modeling, crucial for decision-making and content preference, explains recommendation generation. Existing methods often treat motivation as latent variables from interaction data, neglecting heterogeneous information like review text. In multimodal motivation fusion, two challenges arise: 1) achieving stable cross-modal alignment amid noise, and 2) identifying features reflecting the same underlying motivation across modalities. To address these, we propose LLM-driven Motivation-aware Multimodal Recommendation (LMMRec), a model-agnostic framework leveraging large language models for deep semantic priors and motivation understanding. LMMRec uses chain-of-thought prompting to extract fine-grained user and item motivations from text. A dual-encoder architecture models textual and interaction-based motivations for cross-modal alignment, while Motivation Coordination Strategy and Interaction-Text Correspondence Method mitigate noise and semantic drift through contrastive learning and momentum updates. Experiments on three datasets show LMMRec achieves up to a 4.98\% performance improvement.
Received — 5 March 2026 ⏭

PlaneCycle: Training-Free 2D-to-3D Lifting of Foundation Models Without Adapters

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yinghong Yu · Guangyuan Li · Jiancheng Yang
5 March 2026 at 13:00
arXiv:2603.04165v1 Announce Type: cross Abstract: Large-scale 2D foundation models exhibit strong transferable representations, yet extending them to 3D volumetric data typically requires retraining, adapters, or architectural redesign. We introduce PlaneCycle, a training-free, adapter-free operator for architecture-agnostic 2D-to-3D lifting of foundation models. PlaneCycle reuses the original pretrained 2D backbone by cyclically distributing spatial aggregation across orthogonal HW, DW, and DH planes throughout network depth, enabling progressive 3D fusion while preserving pretrained inductive biases. The method introduces no additional parameters and is applicable to arbitrary 2D networks. Using pretrained DINOv3 models, we evaluate PlaneCycle on six 3D classification and three 3D segmentation benchmarks. Without any training, the lifted models exhibit intrinsic 3D fusion capability and, under linear probing, outperform slice-wise 2D baselines and strong 3D counterparts, approaching the performance of fully trained models. With full fine-tuning, PlaneCycle matches standard 3D architectures, highlighting its potential as a seamless and practical 2D-to-3D lifting operator. These results demonstrate that 3D capability can be unlocked from pretrained 2D foundation models without structural modification or retraining. Code is available at https://github.com/HINTLab/PlaneCycle.

Towards Personalized Deep Research: Benchmarks and Evaluations

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yuan Liang · Jiaxian Li · Yuqing Wang · Piaohong Wang · Motong Tian · Pai Liu · Shuofei Qiao · Runnan Fang · He Zhu · Ge Zhang · Minghao Liu · Yuchen Eleanor Jiang · Ningyu Zhang · Wangchunshu Zhou
5 March 2026 at 13:00
arXiv:2509.25106v3 Announce Type: replace-cross Abstract: Deep Research Agents (DRAs) can autonomously conduct complex investigations and generate comprehensive reports, demonstrating strong real-world potential. However, existing evaluations mostly rely on close-ended benchmarks, while open-ended deep research benchmarks remain scarce and typically neglect personalized scenarios. To bridge this gap, we introduce Personalized Deep Research Bench (PDR-Bench), the first benchmark for evaluating personalization in DRAs. It pairs 50 diverse research tasks across 10 domains with 25 authentic user profiles that combine structured persona attributes with dynamic real-world contexts, yielding 250 realistic user-task queries. To assess system performance, we propose the PQR Evaluation Framework, which jointly measures Personalization Alignment, Content Quality, and Factual Reliability. Our experiments on a range of systems highlight current capabilities and limitations in handling personalized deep research. This work establishes a rigorous foundation for developing and evaluating the next generation of truly personalized AI research assistants.

Forecasting as Rendering: A 2D Gaussian Splatting Framework for Time Series Forecasting

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yixin Wang · Yifan Hu · Peiyuan Liu · Naiqi Li · Dai Tao · Shu-Tao Xia
4 March 2026 at 13:00
arXiv:2603.02220v1 Announce Type: cross Abstract: Time series forecasting (TSF) remains a challenging problem due to the intricate entanglement of intraperiod-fluctuations and interperiod-trends. While recent advances have attempted to reshape 1D sequences into 2D period-phase representations, they suffer from two principal limitations.Firstly, treating reshaped tensors as static images results in a topological mismatch, as standard spatial operators sever chronological continuity at grid boundaries. Secondly, relying on uniform fixed-size representations allocates modeling capacity inefficiently and fails to provide the adaptive resolution required for compressible, non-stationary temporal patterns. To address these limitations, we introduce TimeGS, a novel framework that fundamentally shifts the forecasting paradigm from regression to 2D generative rendering. By reconceptualizing the future sequence as a continuous latent surface, TimeGS utilizes the inherent anisotropy of Gaussian kernels to adaptively model complex variations with flexible geometric alignment. To realize this, we introduce a Multi-Basis Gaussian Kernel Generation (MB-GKG) block that synthesizes kernels from a fixed dictionary to stabilize optimization, and a Multi-Period Chronologically Continuous Rasterization (MP-CCR) block that enforces strict temporal continuity across periodic boundaries. Comprehensive experiments on standard benchmark datasets demonstrate that TimeGS attains state-of-the-art performance.
Received — 25 February 2026 ⏭

BiMotion: B-spline Motion for Text-guided Dynamic 3D Character Generation

✇cs.AI, q-bio.NC updates on arXiv.org
By: Miaowei Wang · Qingxuan Yan · Zhi Cao · Yayuan Li · Oisin Mac Aodha · Jason J. Corso · Amir Vaxman
24 February 2026 at 13:00
arXiv:2602.18873v1 Announce Type: cross Abstract: Text-guided dynamic 3D character generation has advanced rapidly, yet producing high-quality motion that faithfully reflects rich textual descriptions remains challenging. Existing methods tend to generate limited sub-actions or incoherent motion due to fixed-length temporal inputs and discrete frame-wise representations that fail to capture rich motion semantics. We address these limitations by representing motion with continuous differentiable B-spline curves, enabling more effective motion generation without modifying the capabilities of the underlying generative model. Specifically, our closed-form, Laplacian-regularized B-spline solver efficiently compresses variable-length motion sequences into compact representations with a fixed number of control points. Further, we introduce a normal-fusion strategy for input shape adherence along with correspondence-aware and local-rigidity losses for motion-restoration quality. To train our model, we collate BIMO, a new dataset containing diverse variable-length 3D motion sequences with rich, high-quality text annotations. Extensive evaluations show that our feed-forward framework BiMotion generates more expressive, higher-quality, and better prompt-aligned motions than existing state-of-the-art methods, while also achieving faster generation. Our project page is at: https://wangmiaowei.github.io/BiMotion.github.io/.

Taming Preconditioner Drift: Unlocking the Potential of Second-Order Optimizers for Federated Learning on Non-IID Data

✇cs.AI, q-bio.NC updates on arXiv.org
By: Junkang Liu · Fanhua Shang · Hongying Liu · Jin Liu · Weixin An · Yuanyuan Liu
24 February 2026 at 13:00
arXiv:2602.19271v1 Announce Type: cross Abstract: Second-order optimizers can significantly accelerate large-scale training, yet their naive federated variants are often unstable or even diverge on non-IID data. We show that a key culprit is \emph{preconditioner drift}: client-side second-order training induces heterogeneous \emph{curvature-defined geometries} (i.e., preconditioner coordinate systems), and server-side model averaging updates computed under incompatible metrics, corrupting the global descent direction. To address this geometric mismatch, we propose \texttt{FedPAC}, a \emph{preconditioner alignment and correction} framework for reliable federated second-order optimization. \texttt{FedPAC} explicitly decouples parameter aggregation from geometry synchronization by: (i) \textbf{Alignment} (i.e.,aggregating local preconditioners into a global reference and warm-starting clients via global preconditioner); and (ii) \textbf{Correction} (i.e., steering local preconditioned updates using a global preconditioned direction to suppress long-term drift). We provide drift-coupled non-convex convergence guarantees with linear speedup under partial participation. Empirically, \texttt{FedPAC} consistently improves stability and accuracy across vision and language tasks, achieving up to $5.8\%$ absolute accuracy gain on CIFAR-100 with ViTs. Code is available at https://anonymous.4open.science/r/FedPAC-8B24.

VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention

✇cs.AI, q-bio.NC updates on arXiv.org
By: Jingbo Zhou · Jun Xia · Siyuan Li · Yunfan Liu · Wenjun Wang · Yufei Huang · Changxi Chi · Mutian Hong · Zhuoli Ouyang · Shu Wang · Zhongqi Wang · Xingyu Wu · Chang Yu · Stan Z. Li
24 February 2026 at 13:00
arXiv:2602.19622v1 Announce Type: cross Abstract: Graph Transformer has demonstrated impressive capabilities in the field of graph representation learning. However, existing approaches face two critical challenges: (1) most models suffer from exponentially increasing computational complexity, making it difficult to scale to large graphs; (2) attention mechanisms based on node-level operations limit the flexibility of the model and result in poor generalization performance in out-of-distribution (OOD) scenarios. To address these issues, we propose \textbf{VecFormer} (the \textbf{Vec}tor Quantized Graph Trans\textbf{former}), an efficient and highly generalizable model for node classification, particularly under OOD settings. VecFormer adopts a two-stage training paradigm. In the first stage, two codebooks are used to reconstruct the node features and the graph structure, aiming to learn the rich semantic \texttt{Graph Codes}. In the second stage, attention mechanisms are performed at the \texttt{Graph Token} level based on the transformed cross codebook, reducing computational complexity while enhancing the model's generalization capability. Extensive experiments on datasets of various sizes demonstrate that VecFormer outperforms the existing Graph Transformer in both performance and speed.
❌