❌

Normal view

Received — 15 September 2026 ⏭

SAEScientist-Bench: Can AI Agents Conduct Autonomous SAE Interpretability Research?

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yuqiao Tan · Shizhu He · Jun Zhao · Kang Liu
14 September 2026 at 12:00
arXiv:2609.09113v2 Announce Type: replace Abstract: While research on recursive self-improvement (RSI) has predominantly automated model training pipelines, reliable autonomous development demands a missing pillar: post-hoc monitoring and auditing to understand what models learn and ensure safe alignment. Mechanistic interpretability tools are essential to bridge this gap, among which Sparse Autoencoders (SAEs) serve as a cornerstone by isolating interpretable features for model inspection and steering. In this paper, we introduce SAEScientist-Bench to evaluate whether AI agents can act as scientists utilizing SAE tools for autonomous mechanistic discovery. Given a target concept, an agent designs contrastive probes and navigates a Gemma Scope dictionary of 131K+ features in Gemma-2-9B-IT to discover the optimal feature, evaluated against curated expert reference features anchored on Neuronpedia across activation rank, concept selectivity on contrastive texts, and causal steering. Across 10 agent configurations and 20 tasks, frontier agents demonstrate genuine discovery capabilities and lead different evaluation dimensions, but remain well behind the expert baseline, approaching expert levels on separating target concepts from contrastive controls while lagging substantially in causal generation steering. Further analysis reveals that although agents can design contrasts to rule out spurious candidates, they frequently misinterpret experimental measurements. These results establish experimental model understanding as a measurable capability for closed-loop autonomous AI R&D. Our code is available at https://github.com/Trae1ounG/SAEScientist.
Received — 10 September 2026 ⏭

Targeting the MNK1-MYH9 axis blocks YAP1 recruitment to prevent thrombosis and platelet activation-induced NETosis

✇Molecular Therapy
By: Kang Liu · Xinke Fang · Jingjun Sheng · Zhiming Wang · Ruijuan Yin · Qi Yuan · Tianyu Wang · Shaoyun Zhou · Qisheng Ling · Haidong Chen · Muhammad Awais · Tao Jiang · Chuanbin Shen
3 August 2026 at 08:00
MNK1 acts as a structural shield on MYH9, preventing YAP1-mediated platelet activation. Developing MD2 to lock this MNK1-MYH9 complex introduces a safe antithrombotic strategy, shifting the therapeutic paradigm from kinase inhibition to stabilizing protein-protein interactions against immunothrombosis.

RAU: Reference-based Anatomical Understanding with Vision Language Models

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yiwei Li · Yikang Liu · Jiaqi Guo · Lin Zhao · Zheyuan Zhang · Xiao Chen · Boris Mailhe · Ankush Mukherjee · Terrence Chen · Shanhui Sun
10 September 2026 at 12:00
arXiv:2509.22404v2 Announce Type: replace-cross Abstract: Anatomical understanding, which is the ability to identify, localize, or segment anatomical structures, is critical in medical image analysis; however, its progress is constrained by the scarcity of expert-labeled data. A promising remedy is to leverage an annotated reference image to guide the interpretation of an unlabeled target. Although recent vision-language models (VLMs) exhibit non-trivial visual reasoning, their reference-based understanding and fine-grained localization remain limited. We introduce RAU, a framework for reference-based anatomical understanding with VLMs. We first show that a VLM learns to identify anatomical regions through relative spatial reasoning between reference and target images, trained on a moderately sized dataset. We validate this capability through visual question answering (VQA) and bounding box prediction. Next, we demonstrate that the VLM-derived spatial cues can be seamlessly integrated with the fine-grained segmentation capability of SAM2, enabling localization and pixel-level segmentation of small anatomical regions, such as vessel segments. Across two in-distribution and two out-of-distribution datasets, RAU consistently outperforms a SAM2 fine-tuning baseline using the same memory setup, yielding more accurate segmentations and more reliable localization. More importantly, its generalization ability to unseen modalities makes it scalable to unseen datasets, a property crucial for medical image applications. To the best of our knowledge, RAU is the first to explore the capability of VLMs for reference-based identification, localization, and segmentation of anatomical structures in medical images. Its promising performance highlights the potential of VLM-driven approaches for anatomical understanding in automated clinical workflows.
Received — 27 May 2026 ⏭

Break the Brake, Not the Wheel: Untargeted Jailbreak via Entropy Maximization

✇cs.AI, q-bio.NC updates on arXiv.org
By: Mengqi He · Xinyu Tian · Xin Shen · Shu Zou · Jinhong Ni · Zhaoyuan Yang · Weikang Li · Xuesong Li · Jing Zhang
26 May 2026 at 12:00
arXiv:2605.10764v2 Announce Type: replace-cross Abstract: Recent studies show that gradient-based universal image jailbreaks on vision-language models (VLMs) exhibit little or no cross-model transferability, casting doubt on the feasibility of transferable multimodal jailbreaks. We revisit this conclusion under a strictly untargeted threat model without enforcing a fixed prefix or response pattern. Our preliminary experiment reveals that refusal behavior concentrates at high-entropy tokens during autoregressive decoding, and non-refusal tokens already carry substantial probability mass among the top-ranked candidates before attack. Motivated by this finding, we propose Untargeted Jailbreak via Entropy Maximization(UJEM)-KL, a lightweight attack that maximizes entropy at these decision tokens to flip refusal outcomes, while stabilizing the remaining low-entropy positions to preserve output quality. Across three VLMs and two safety benchmarks, UJEM-KL achieves competitive white-box attack success rates and consistently improves transferability, while remaining effective under representative defenses. Our experimental results indicate that the limited transferability primarily stems from overly constrained optimization objectives.

FDX1 as a predictive biomarker and therapeutic target for lymph node metastasis in gastric cancer

✇Omics in Gastric
By: Tianhao Zhang · Jianqiu Liu · Peng Duan · Zikang Li · Zhixin Huang · Zeyu Zhao · Yang Cheng · Zhi Liang · Jianhui Chen · Meilan Cai · Jinping Ma
10 May 2026 at 18:00

Clin Exp Med. 2026 May 10. doi: 10.1007/s10238-026-02160-0. Online ahead of print.

ABSTRACT

The prognostic values of cuproptosis-related genes (CRGs) in gastric cancer with lymph node metastasis (GCLM), especially in the tumor immune microenvironment (TIME), remain unclear. We analyzed the expression, mutation, immunity, drug sensitivity, and prognostic value of CRGs in GCLM using TCGA and GEO cohorts. Consensus clustering was performed to identify CRG subtypes, with differences characterized by multi-omics analysis. A CRG-based prognostic risk score and immune score were constructed for individualized assessment, and the role of CRGs was validated through in vitro and in vivo experiments. Consensus clustering revealed that CRGs were significantly enriched in biological processes related to mitosis and energy metabolism, as well as in immune-related and cancer-associated pathways. Four distinct CRG subtypes were identified, showing marked differences in expression profiles, prognosis, genetic alterations, TIME, and chemotherapeutic drug sensitivity. We developed an exploratory CRG-based prognostic risk score for preliminary individualized assessment, and the functional relevance of CRGs in GCLM was further validated through in vitro experiments. Among these, FDX1, LIAS, DLAT, MTF1, and GLS were identified as key determinants of overall survival in patients with GCLM, with FDX1 emerging as a potential independent prognostic factor. Notably, upregulation of FDX1 significantly suppressed lymph node metastasis of gastric cancer cells in a mouse popliteal lymph node metastasis model. Our data uncovers FDX1 might be a potential favorable prognostic factors in GCLM patients. These findings may improve our understanding of CRGs in GCLM and provide new in-sights for assessing prognosis and developing more effective treatment strategies.

PMID:42107026 | DOI:10.1007/s10238-026-02160-0

Composable neural emulators accelerate thermoelectric generator design

✇Nature - Issue - nature.com science feeds
By: Airan Li · Xinzhi Wu · Longquan Wang · Gang Wu · Jiankang Li · Zhao Hu · Xinyuan Wang · Takao Mori
15 April 2026 at 08:00

Nature, Published online: 15 April 2026; doi:10.1038/s41586-026-10223-1

A composable neural network emulator is described for speeding up thermoelectric generator design, demonstrating the ability to predict generator performance with >99% accuracy while taking only 0.01% of the time compared with commercial finite-element solvers.
Received — 2 April 2026 ⏭

ResAdapt: Adaptive Resolution for Efficient Multimodal Reasoning

✇cs.AI, q-bio.NC updates on arXiv.org
By: Huanxuan Liao · Zhongtao Jiang · Yupu Hao · Yuqiao Tan · Shizhu He · Ben Wang · Jun Zhao · Kun Xu · Kang Liu
1 April 2026 at 12:00
arXiv:2603.28610v2 Announce Type: replace-cross Abstract: Multimodal Large Language Models (MLLMs) achieve stronger visual understanding by scaling input fidelity, yet the resulting visual token growth makes jointly sustaining high spatial resolution and long temporal context prohibitive. We argue that the bottleneck lies not in how post-encoding representations are compressed but in the volume of pixels the encoder receives, and address it with ResAdapt, an Input-side adaptation framework that learns how much visual budget each frame should receive before encoding. ResAdapt couples a lightweight Allocator with an unchanged MLLM backbone, so the backbone retains its native visual-token interface while receiving an operator-transformed input. We formulate allocation as a contextual bandit and train the Allocator with Cost-Aware Policy Optimization (CAPO), which converts sparse rollout feedback into a stable accuracy-cost learning signal. Across budget-controlled video QA, temporal grounding, and image reasoning tasks, ResAdapt improves low-budget operating points and often lies on or near the efficiency-accuracy frontier, with the clearest gains on reasoning-intensive benchmarks under aggressive compression. Notably, ResAdapt supports up to 16x more frames at the same visual budget while delivering over 15% performance gain. Code is available at https://github.com/Xnhyacinth/ResAdapt.
Received — 26 March 2026 ⏭

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
25 March 2026 at 12:00
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}.

Do Vision-Language Models Measure Up? Benchmarking Visual Measurement Reading with MeasureBench

✇cs.AI, q-bio.NC updates on arXiv.org
By: Fenfen Lin · Yesheng Liu · Haiyu Xu · Chen Yue · Zheqi He · Mingxuan Zhao · Miguel Hu Chen · Jiakang Liu · JG Yao · Xi Yang
25 March 2026 at 12:00
arXiv:2510.26865v2 Announce Type: replace-cross Abstract: Reading measurement instruments is effortless for humans and requires relatively little domain expertise, yet it remains surprisingly challenging for current vision-language models (VLMs) as we find in preliminary evaluation. In this work, we introduce MeasureBench, a benchmark on visual measurement reading covering both real-world and synthesized images of various types of measurements, along with an extensible pipeline for data synthesis. Our pipeline procedurally generates a specified type of gauge with controllable visual appearance, enabling scalable variation in key details such as pointers, scales, fonts, lighting, and clutter. Evaluation on popular proprietary and open-weight VLMs shows that even the strongest frontier VLMs struggle with measurement reading in general. We have also conducted preliminary experiments with reinforcement finetuning (RFT) over synthetic data, and find a significant improvement on both in-domain synthetic subset and real-world images. Our analysis highlights a fundamental limitation of current VLMs in fine-grained spatial grounding. We hope this resource and our code releases can help future advances on visually grounded numeracy and precise spatial perception of VLMs, bridging the gap between recognizing numbers and measuring the world.

Think Before You Drive: World Model-Inspired Multimodal Grounding for Autonomous Vehicles

✇cs.AI, q-bio.NC updates on arXiv.org
By: Haicheng Liao · Huanming Shen · Bonan Wang · Yongkang Li · Yihong Tang · Chengyue Wang · Dingyi Zhuang · Kehua Chen · Hai Yang · Chengzhong Xu · Zhenning Li
25 March 2026 at 12:00
arXiv:2512.03454v3 Announce Type: replace-cross Abstract: Interpreting natural-language commands to localize target objects is critical for autonomous driving (AD). Existing visual grounding (VG) methods for autonomous vehicles (AVs) typically struggle with ambiguous, context-dependent instructions, as they lack reasoning over 3D spatial relations and anticipated scene evolution. Grounded in the principles of world models, we propose ThinkDeeper, a framework that reasons about future spatial states before making grounding decisions. At its core is a Spatial-Aware World Model (SA-WM) that learns to reason ahead by distilling the current scene into a command-aware latent state and rolling out a sequence of future latent states, providing forward-looking cues for disambiguation. Complementing this, a hypergraph-guided decoder then hierarchically fuses these states with the multimodal input, capturing higher-order spatial dependencies for robust localization. In addition, we present DrivePilot, a multi-source VG dataset in AD, featuring semantic annotations generated by a Retrieval-Augmented Generation (RAG) and Chain-of-Thought (CoT)-prompted LLM pipeline. Extensive evaluations on six benchmarks, ThinkDeeper ranks #1 on the Talk2Car leaderboard and surpasses state-of-the-art baselines on DrivePilot, MoCAD, and RefCOCO/+/g benchmarks. Notably, it shows strong robustness and efficiency in challenging scenes (long-text, multi-agent, ambiguity) and retains superior performance even when trained on 50% of the data.
Received — 17 March 2026 ⏭

Thinking in Streaming Video

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zikang Liu · Longteng Guo · Handong Li · Ru Zhen · Xingjian He · Ruyi Ji · Xiaoming Ren · Yanhao Zhang · Haonan Lu · Jing Liu
16 March 2026 at 12:00
arXiv:2603.12938v1 Announce Type: cross Abstract: Real-time understanding of continuous video streams is essential for interactive assistants and multimodal agents operating in dynamic environments. However, most existing video reasoning approaches follow a batch paradigm that defers reasoning until the full video context is observed, resulting in high latency and growing computational cost that are incompatible with streaming scenarios. In this paper, we introduce ThinkStream, a framework for streaming video reasoning based on a Watch--Think--Speak paradigm that enables models to incrementally update their understanding as new video observations arrive. At each step, the model performs a short reasoning update and decides whether sufficient evidence has accumulated to produce a response. To support long-horizon streaming, we propose Reasoning-Compressed Streaming Memory (RCSM), which treats intermediate reasoning traces as compact semantic memory that replaces outdated visual tokens while preserving essential context. We further train the model using a Streaming Reinforcement Learning with Verifiable Rewards scheme that aligns incremental reasoning and response timing with the requirements of streaming interaction. Experiments on multiple streaming video benchmarks show that ThinkStream significantly outperforms existing online video models while maintaining low latency and memory usage. Code, models and data will be released at https://github.com/johncaged/ThinkStream
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.

Multifaceted Scenario-Aware Hypergraph Learning for Next POI Recommendation

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yuxi Lin · Yongkang Li · Jie Xing · Zipei Fan
10 March 2026 at 12:00
arXiv:2601.11610v2 Announce Type: replace-cross Abstract: Among the diverse services provided by Location-Based Social Networks (LBSNs), Next Point-of-Interest (POI) recommendation plays a crucial role in inferring user preferences from historical check-in trajectories. However, existing sequential and graph-based methods frequently neglect significant mobility variations across distinct contextual scenarios (e.g., tourists versus locals). This oversight results in suboptimal performance due to two fundamental limitations: the inability to capture scenario-specific features and the failure to resolve inherent inter-scenario conflicts. To overcome these limitations, we propose the Multifaceted Scenario-Aware Hypergraph Learning method (MSAHG), a framework that adopts a scenario-splitting paradigm for next POI recommendation. Our main contributions are: (1) Construction of scenario-specific, multi-view disentangled sub-hypergraphs to capture distinct mobility patterns; (2) A parameter-splitting mechanism to adaptively resolve conflicting optimization directions across scenarios while preserving generalization capability. Extensive experiments on three real-world datasets demonstrate that MSAHG consistently outperforms five state-of-the-art methods across diverse scenarios, confirming its effectiveness in multi-scenario POI recommendation.
Received — 5 March 2026 ⏭

Geometry-Guided Reinforcement Learning for Multi-view Consistent 3D Scene Editing

✇cs.AI, q-bio.NC updates on arXiv.org
By: Jiyuan Wang · Chunyu Lin · Lei Sun · Zhi Cao · Yuyang Yin · Lang Nie · Zhenlong Yuan · Xiangxiang Chu · Yunchao Wei · Kang Liao · Guosheng Lin
4 March 2026 at 13:00
arXiv:2603.03143v1 Announce Type: cross Abstract: Leveraging the priors of 2D diffusion models for 3D editing has emerged as a promising paradigm. However, maintaining multi-view consistency in edited results remains challenging, and the extreme scarcity of 3D-consistent editing paired data renders supervised fine-tuning (SFT), the most effective training strategy for editing tasks, infeasible. In this paper, we observe that, while generating multi-view consistent 3D content is highly challenging, verifying 3D consistency is tractable, naturally positioning reinforcement learning (RL) as a feasible solution. Motivated by this, we propose \textbf{RL3DEdit}, a single-pass framework driven by RL optimization with novel rewards derived from the 3D foundation model, VGGT. Specifically, we leverage VGGT's robust priors learned from massive real-world data, feed the edited images, and utilize the output confidence maps and pose estimation errors as reward signals, effectively anchoring the 2D editing priors onto a 3D-consistent manifold via RL. Extensive experiments demonstrate that RL3DEdit achieves stable multi-view consistency and outperforms state-of-the-art methods in editing quality with high efficiency. To promote the development of 3D editing, we will release the code and model.
Received — 25 February 2026 ⏭

VLANeXt: Recipes for Building Strong VLA Models

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xiao-Ming Wu · Bin Fan · Kang Liao · Jian-Jian Jiang · Runze Yang · Yihang Luo · Zhonghua Wu · Wei-Shi Zheng · Chen Change Loy
24 February 2026 at 13:00
arXiv:2602.18532v1 Announce Type: cross Abstract: Following the rise of large foundation models, Vision-Language-Action models (VLAs) emerged, leveraging strong visual and language understanding for general-purpose policy learning. Yet, the current VLA landscape remains fragmented and exploratory. Although many groups have proposed their own VLA models, inconsistencies in training protocols and evaluation settings make it difficult to identify which design choices truly matter. To bring structure to this evolving space, we reexamine the VLA design space under a unified framework and evaluation setup. Starting from a simple VLA baseline similar to RT-2 and OpenVLA, we systematically dissect design choices along three dimensions: foundational components, perception essentials, and action modelling perspectives. From this study, we distill 12 key findings that together form a practical recipe for building strong VLA models. The outcome of this exploration is a simple yet effective model, VLANeXt. VLANeXt outperforms prior state-of-the-art methods on the LIBERO and LIBERO-plus benchmarks and demonstrates strong generalization in real-world experiments. We will release a unified, easy-to-use codebase that serves as a common platform for the community to reproduce our findings, explore the design space, and build new VLA variants on top of a shared foundation.

HONEST-CAV: Hierarchical Optimization of Network Signals and Trajectories for Connected and Automated Vehicles with Multi-Agent Reinforcement Learning

✇cs.AI, q-bio.NC updates on arXiv.org
By: Ziyan Zhang · Changxin Wan · Peng Hao · Kanok Boriboonsomsin · Matthew J. Barth · Yongkang Liu · Seyhan Ucar · Guoyuan Wu
24 February 2026 at 13:00
arXiv:2602.18740v1 Announce Type: cross Abstract: This study presents a hierarchical, network-level traffic flow control framework for mixed traffic consisting of Human-driven Vehicles (HVs), Connected and Automated Vehicles (CAVs). The framework jointly optimizes vehicle-level eco-driving behaviors and intersection-level traffic signal control to enhance overall network efficiency and decrease energy consumption. A decentralized Multi-Agent Reinforcement Learning (MARL) approach by Value Decomposition Network (VDN) manages cycle-based traffic signal control (TSC) at intersections, while an innovative Signal Phase and Timing (SPaT) prediction method integrates a Machine Learning-based Trajectory Planning Algorithm (MLTPA) to guide CAVs in executing Eco-Approach and Departure (EAD) maneuvers. The framework is evaluated across varying CAV proportions and powertrain types to assess its effects on mobility and energy performance. Experimental results conducted in a 4*4 real-world network demonstrate that the MARL-based TSC method outperforms the baseline model (i.e., Webster method) in speed, fuel consumption, and idling time. In addition, with MLTPA, HONEST-CAV benefits the traffic system further in energy consumption and idling time. With a 60% CAV proportion, vehicle average speed, fuel consumption, and idling time can be improved/saved by 7.67%, 10.23%, and 45.83% compared with the baseline. Furthermore, discussions on CAV proportions and powertrain types are conducted to quantify the performance of the proposed method with the impact of automation and electrification.

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.

Rethinking LoRA for Privacy-Preserving Federated Learning in Large Models

✇cs.AI, q-bio.NC updates on arXiv.org
By: Jin Liu · Yinbin Miao · Ning Xi · Junkang Liu
24 February 2026 at 13:00
arXiv:2602.19926v1 Announce Type: cross Abstract: Fine-tuning large vision models (LVMs) and large language models (LLMs) under differentially private federated learning (DPFL) is hindered by a fundamental privacy-utility trade-off. Low-Rank Adaptation (LoRA), a promising parameter-efficient fine-tuning (PEFT) method, reduces computational and communication costs by introducing two trainable low-rank matrices while freezing pre-trained weights. However, directly applying LoRA in DPFL settings leads to performance degradation, especially in LVMs. Our analysis reveals three previously underexplored challenges: (1) gradient coupling caused by the simultaneous update of two asymmetric low-rank matrices, (2) compounded noise amplification under differential privacy, and (3) sharpness of the global aggregated model in the parameter space. To address these issues, we propose LA-LoRA (\textbf{L}ocal \textbf{A}lternating \textbf{LoRA}), a novel approach that decouples gradient interactions and aligns update directions across clients to enhance robustness under stringent privacy constraints. Theoretically, LA-LoRA strengthens convergence guarantees in noisy federated environments. Extensive experiments demonstrate that LA-LoRA achieves state-of-the-art (SOTA) performance on Swin Transformer and RoBERTa models, showcasing robustness to DP noise and broad applicability across both LVMs and LLMs. For example, when fine-tuning the Swin-B model on the Tiny-ImageNet dataset under a strict privacy budget ($\epsilon = 1$), LA-LoRA outperforms the best baseline, RoLoRA, by 16.83\% in test accuracy. Code is provided in \repolink.

DP-FedAdamW: An Efficient Optimizer for Differentially Private Federated Large Models

✇cs.AI, q-bio.NC updates on arXiv.org
By: Jin Liu · Yinbin Miao · Ning Xi · Junkang Liu
24 February 2026 at 13:00
arXiv:2602.19945v1 Announce Type: cross Abstract: Balancing convergence efficiency and robustness under Differential Privacy (DP) is a central challenge in Federated Learning (FL). While AdamW accelerates training and fine-tuning in large-scale models, we find that directly applying it to Differentially Private FL (DPFL) suffers from three major issues: (i) data heterogeneity and privacy noise jointly amplify the variance of second-moment estimator, (ii) DP perturbations bias the second-moment estimator, and (iii) DP amplify AdamW sensitivity to local overfitting, worsening client drift. We propose DP-FedAdamW, the first AdamW-based optimizer for DPFL. It restores AdamW under DP by stabilizing second-moment variance, removing DP-induced bias, and aligning local updates to the global descent to curb client drift. Theoretically, we establish an unbiased second-moment estimator and prove a linearly accelerated convergence rate without any heterogeneity assumption, while providing tighter $(\varepsilon,\delta)$-DP guarantees. Our empirical results demonstrate the effectiveness of DP-FedAdamW across language and vision Transformers and ResNet-18. On Tiny-ImageNet (Swin-Base, $\varepsilon=1$), DP-FedAdamW outperforms the state-of-the-art (SOTA) by 5.83\%. The code is available in Appendix.

Shuffle-R1: Efficient RL framework for Multimodal Large Language Models via Data-centric Dynamic Shuffle

✇cs.AI, q-bio.NC updates on arXiv.org
By: Linghao Zhu · Yiran Guan · Dingkang Liang · Jianzhong Ju · Zhenbo Luo · Bin Qin · Jian Luan · Yuliang Liu · Xiang Bai
24 February 2026 at 13:00
arXiv:2508.05612v5 Announce Type: replace-cross Abstract: Reinforcement learning (RL) has emerged as an effective post-training paradigm for enhancing the reasoning capabilities of multimodal large language model (MLLM). However, current RL pipelines often suffer from training inefficiencies caused by two underexplored issues: Advantage Collapsing, where most advantages in a batch concentrate near zero, and Rollout Silencing, where the proportion of rollouts contributing non-zero gradients diminishes over time. These issues lead to suboptimal gradient updates and hinder long-term learning efficiency. To address these issues, we propose Shuffle-R1, a simple yet principled framework that improves RL fine-tuning efficiency by dynamically restructuring trajectory sampling and batch composition. It introduces (1) Pairwise Trajectory Sampling, which selects high-contrast trajectories with large advantages to improve gradient signal quality, and (2) Advantage-based Trajectory Shuffle, which increases exposure of valuable rollouts through informed batch reshuffling. Experiments across multiple reasoning benchmarks show that our framework consistently outperforms strong RL baselines with minimal overhead. These results highlight the importance of data-centric adaptations for more efficient RL training in MLLM.
❌