❌

Normal view

Received — 26 March 2026 ⏭

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

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

Hierarchical Long Video Understanding with Audiovisual Entity Cohesion and Agentic Search

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xinlei Yin · Xiulian Peng · Xiao Li · Zhiwei Xiong · Yan Lu
25 March 2026 at 12:00
arXiv:2601.13719v2 Announce Type: replace-cross Abstract: Long video understanding presents significant challenges for vision-language models due to extremely long context windows. Existing solutions relying on naive chunking strategies with retrieval-augmented generation, typically suffer from information fragmentation and a loss of global coherence. We present HAVEN, a unified framework for long-video understanding that enables coherent and comprehensive reasoning by integrating audiovisual entity cohesion and hierarchical video indexing with agentic search. First, we preserve semantic consistency by integrating entity-level representations across visual and auditory streams, while organizing content into a structured hierarchy spanning global summary, scene, segment, and entity levels. Then we employ an agentic search mechanism to enable dynamic retrieval and reasoning across these layers, facilitating coherent narrative reconstruction and fine-grained entity tracking. Extensive experiments demonstrate that our method achieves good temporal coherence, entity consistency, and retrieval efficiency, establishing a new state-of-the-art with an overall accuracy of 84.1% on LVBench. Notably, it achieves outstanding performance in the challenging reasoning category, reaching 80.1%. These results highlight the effectiveness of structured, multimodal reasoning for comprehensive and context-consistent understanding of long-form videos.

When Models Judge Themselves: Unsupervised Self-Evolution for Multimodal Reasoning

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhengxian Wu · Kai Shi · Chuanrui Zhang · Zirui Liao · Jun Yang · Ni Yang · Qiuying Peng · Luyuan Zhang · Hangrui Xu · Tianhuang Su · Zhenyu Yang · Haonan Lu · Haoqian Wang
25 March 2026 at 12:00
arXiv:2603.21289v2 Announce Type: replace-cross Abstract: Recent progress in multimodal large language models has led to strong performance on reasoning tasks, but these improvements largely rely on high-quality annotated data or teacher-model distillation, both of which are costly and difficult to scale. To address this, we propose an unsupervised self-evolution training framework for multimodal reasoning that achieves stable performance improvements without using human-annotated answers or external reward models. For each input, we sample multiple reasoning trajectories and jointly model their within group structure. We use the Actor's self-consistency signal as a training prior, and introduce a bounded Judge based modulation to continuously reweight trajectories of different quality. We further model the modulated scores as a group level distribution and convert absolute scores into relative advantages within each group, enabling more robust policy updates. Trained with Group Relative Policy Optimization (GRPO) on unlabeled data, our method consistently improves reasoning performance and generalization on five mathematical reasoning benchmarks, offering a scalable path toward self-evolving multimodal models. The code are available at https://github.com/OPPO-Mente-Lab/LLM-Self-Judge.

SIRT3 deacetylates STEAP4 to modulate cuproptosis sensitivity via mitochondrial metabolic reprogramming in HBV-related HCC

✇Omics in Hepatocellular
By: Ze-Bang Du · Xin-Mou Wu · Jia-Ming Lei · Yu-Xin Cai · Jie He · Bo Qian · Xin-Xin He · Wen-Hao Han · Yuan Lu · Xiao-Gang Xia · Han-Ying Zheng · Dong-Bei Guo · You-Liang Yao · Wen-Gang Li · Yu-Chun Lin · Zhong-Ning Lin
17 March 2026 at 18:00

Cell Death Differ. 2026 Mar 16. doi: 10.1038/s41418-026-01713-w. Online ahead of print.

ABSTRACT

Hepatitis B virus (HBV) infection remains a leading etiological driver of hepatocellular carcinoma (HCC). Cuproptosis is a recently defined copper-dependent form of regulated cell death that selectively eliminates mitochondria-dependent cells; whether HBV rewires this vulnerability remains unknown. Here we unveil a novel HBV X protein (HBx)-driven mechanism of cuproptosis evasion. Integrative analysis of clinical specimens, HBx-transgenic (HBx-Tg) mice, and multi-omics datasets revealed marked downregulation of STEAP4 (six-transmembrane epithelial antigen of prostate 4), a metalloreductase essential for cuproptosis sensitivity, in HBV-positive HCC. Mechanistically, HBx attenuates sirtuin 3 (SIRT3), impairing deacetylation of STEAP4 at lysine 404 and abolishing its mitochondrial targeting. Consequently, cells switch from the tricarboxylic acid (TCA) cycle respiration to glycolysis, reducing sensitivity to the copper ionophore elesclomol (ES). Restoring STEAP4 expression or pharmacological activation of SIRT3 with honokiol (HKL) re-instated mitochondrial STEAP4 localization and re-sensitized HBV-related HCC cells to cuproptosis; combination with ES produced synergistic tumor suppression in vitro and in orthotopic models. Collectively, our findings establish the SIRT3-STEAP4 axis as a novel regulator of cuproptosis resistance in HBV-related HCC. HBx-mediated repression of SIRT3 disrupts STEAP4 deacetylation and mitochondrial targeting, fostering metabolic reprogramming and evasion of copper-induced cell death. The results provide a pre-clinical rationale for copper-directed combination strategies in HBV-associated HCC.

PMID:41840161 | DOI:10.1038/s41418-026-01713-w

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 ⏭

FinToolBench: Evaluating LLM Agents for Real-World Financial Tool Use

✇cs.AI, q-bio.NC updates on arXiv.org
By: Jiaxuan Lu · Kong Wang · Yemin Wang · Qingmei Tang · Hongwei Zeng · Xiang Chen · Jiahao Pi · Shujian Deng · Lingzhi Chen · Yi Fu · Kehua Yang · Xiao Sun
10 March 2026 at 12:00
arXiv:2603.08262v1 Announce Type: new Abstract: The integration of Large Language Models (LLMs) into the financial domain is driving a paradigm shift from passive information retrieval to dynamic, agentic interaction. While general-purpose tool learning has witnessed a surge in benchmarks, the financial sector, characterized by high stakes, strict compliance, and rapid data volatility, remains critically underserved. Existing financial evaluations predominantly focus on static textual analysis or document-based QA, ignoring the complex reality of tool execution. Conversely, general tool benchmarks lack the domain-specific rigor required for finance, often relying on toy environments or a negligible number of financial APIs. To bridge this gap, we introduce FinToolBench, the first real-world, runnable benchmark dedicated to evaluating financial tool learning agents. Unlike prior works limited to a handful of mock tools, FinToolBench establishes a realistic ecosystem coupling 760 executable financial tools with 295 rigorous, tool-required queries. We propose a novel evaluation framework that goes beyond binary execution success, assessing agents on finance-critical dimensions: timeliness, intent type, and regulatory domain alignment. Furthermore, we present FATR, a finance-aware tool retrieval and reasoning baseline that enhances stability and compliance. By providing the first testbed for auditable, agentic financial execution, FinToolBench sets a new standard for trustworthy AI in finance. The tool manifest, execution environment, and evaluation code will be open-sourced to facilitate future research.

TDM-R1: Reinforcing Few-Step Diffusion Models with Non-Differentiable Reward

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yihong Luo · Tianyang Hu · Weijian Luo · Jing Tang
10 March 2026 at 12:00
arXiv:2603.07700v1 Announce Type: cross Abstract: While few-step generative models have enabled powerful image and video generation at significantly lower cost, generic reinforcement learning (RL) paradigms for few-step models remain an unsolved problem. Existing RL approaches for few-step diffusion models strongly rely on back-propagating through differentiable reward models, thereby excluding the majority of important real-world reward signals, e.g., non-differentiable rewards such as humans' binary likeness, object counts, etc. To properly incorporate non-differentiable rewards to improve few-step generative models, we introduce TDM-R1, a novel reinforcement learning paradigm built upon a leading few-step model, Trajectory Distribution Matching (TDM). TDM-R1 decouples the learning process into surrogate reward learning and generator learning. Furthermore, we developed practical methods to obtain per-step reward signals along the deterministic generation trajectory of TDM, resulting in a unified RL post-training method that significantly improves few-step models' ability with generic rewards. We conduct extensive experiments ranging from text-rendering, visual quality, and preference alignment. All results demonstrate that TDM-R1 is a powerful reinforcement learning paradigm for few-step text-to-image models, achieving state-of-the-art reinforcement learning performances on both in-domain and out-of-domain metrics. Furthermore, TDM-R1 also scales effectively to the recent strong Z-Image model, consistently outperforming both its 100-NFE and few-step variants with only 4 NFEs. Project page: https://github.com/Luo-Yihong/TDM-R1

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.
Received — 5 March 2026 ⏭

Phys4D: Fine-Grained Physics-Consistent 4D Modeling from Video Diffusion

✇cs.AI, q-bio.NC updates on arXiv.org
By: Haoran Lu · Shang Wu · Jianshu Zhang · Maojiang Su · Guo Ye · Chenwei Xu · Lie Lu · Pranav Maneriker · Fan Du · Manling Li · Zhaoran Wang · Han Liu
5 March 2026 at 13:00
arXiv:2603.03485v1 Announce Type: cross Abstract: Recent video diffusion models have achieved impressive capabilities as large-scale generative world models. However, these models often struggle with fine-grained physical consistency, exhibiting physically implausible dynamics over time. In this work, we present \textbf{Phys4D}, a pipeline for learning physics-consistent 4D world representations from video diffusion models. Phys4D adopts \textbf{a three-stage training paradigm} that progressively lifts appearance-driven video diffusion models into physics-consistent 4D world representations. We first bootstrap robust geometry and motion representations through large-scale pseudo-supervised pretraining, establishing a foundation for 4D scene modeling. We then perform physics-grounded supervised fine-tuning using simulation-generated data, enforcing temporally consistent 4D dynamics. Finally, we apply simulation-grounded reinforcement learning to correct residual physical violations that are difficult to capture through explicit supervision. To evaluate fine-grained physical consistency beyond appearance-based metrics, we introduce a set of \textbf{4D world consistency evaluation} that probe geometric coherence, motion stability, and long-horizon physical plausibility. Experimental results demonstrate that Phys4D substantially improves fine-grained spatiotemporal and physical consistency compared to appearance-driven baselines, while maintaining strong generative performance. Our project page is available at https://sensational-brioche-7657e7.netlify.app/

GIPO: Gaussian Importance Sampling Policy Optimization

✇cs.AI, q-bio.NC updates on arXiv.org
By: Chengxuan Lu · Zhenquan Zhang · Shukuan Wang · Qunzhi Lin · Baigui Sun · Yang Liu
5 March 2026 at 13:00
arXiv:2603.03955v1 Announce Type: cross Abstract: Post-training with reinforcement learning (RL) has recently shown strong promise for advancing multimodal agents beyond supervised imitation. However, RL remains limited by poor data efficiency, particularly in settings where interaction data are scarce and quickly become outdated. To address this challenge, GIPO (Gaussian Importance sampling Policy Optimization) is proposed as a policy optimization objective based on truncated importance sampling, replacing hard clipping with a log-ratio-based Gaussian trust weight to softly damp extreme importance ratios while maintaining non-zero gradients. Theoretical analysis shows that GIPO introduces an implicit, tunable constraint on the update magnitude, while concentration bounds guarantee robustness and stability under finite-sample estimation. Experimental results show that GIPO achieves state-of-the-art performance among clipping-based baselines across a wide range of replay buffer sizes, from near on-policy to highly stale data, while exhibiting superior bias--variance trade-off, high training stability and improved sample efficiency.

GarmentPile++: Affordance-Driven Cluttered Garments Retrieval with Vision-Language Reasoning

✇cs.AI, q-bio.NC updates on arXiv.org
By: Mingleyang Li · Yuran Wang · Yue Chen · Tianxing Chen · Jiaqi Liang · Zishun Shen · Haoran Lu · Ruihai Wu · Hao Dong
5 March 2026 at 13:00
arXiv:2603.04158v1 Announce Type: cross Abstract: Garment manipulation has attracted increasing attention due to its critical role in home-assistant robotics. However, the majority of existing garment manipulation works assume an initial state consisting of only one garment, while piled garments are far more common in real-world settings. To bridge this gap, we propose a novel garment retrieval pipeline that can not only follow language instruction to execute safe and clean retrieval but also guarantee exactly one garment is retrieved per attempt, establishing a robust foundation for the execution of downstream tasks (e.g., folding, hanging, wearing). Our pipeline seamlessly integrates vision-language reasoning with visual affordance perception, fully leveraging the high-level reasoning and planning capabilities of VLMs alongside the generalization power of visual affordance for low-level actions. To enhance the VLM's comprehensive awareness of each garment's state within a garment pile, we employ visual segmentation model (SAM2) to execute object segmentation on the garment pile for aiding VLM-based reasoning with sufficient visual cues. A mask fine-tuning mechanism is further integrated to address scenarios where the initial segmentation results are suboptimal. In addition, a dual-arm cooperation framework is deployed to address cases involving large or long garments, as well as excessive garment sagging caused by incorrect grasping point determination, both of which are strenuous for a single arm to handle. The effectiveness of our pipeline are consistently demonstrated across diverse tasks and varying scenarios in both real-world and simulation environments. Project page: https://garmentpile2.github.io/.

Generalization of RLVR Using Causal Reasoning as a Testbed

✇cs.AI, q-bio.NC updates on arXiv.org
By: Brian Lu · Hongyu Zhao · Shuo Sun · Hao Peng · Rui Ding · Hongyuan Mei
5 March 2026 at 13:00
arXiv:2512.20760v2 Announce Type: replace-cross Abstract: Reinforcement learning with verifiable rewards (RLVR) has emerged as a promising paradigm for post-training large language models (LLMs) on complex reasoning tasks. Yet, the conditions under which RLVR yields robust generalization remain underexplored. This paper provides an empirical study of RLVR generalization in the setting of probabilistic inference over causal graphical models. This setting offers two natural axes along which to examine generalization: (i) the level of the probabilistic query -- associational, interventional, or counterfactual -- and (ii) the structural complexity of the query, measured by the size of its relevant subgraph. We construct a dataset of causal graphs and queries spanning these difficulty axes and fine-tune Qwen-2.5-Instruct models using RLVR or supervised fine-tuning (SFT). We vary both the model scale (3B-32B) and the query level included in training. We find that RLVR yields stronger within-level and across-level generalization than SFT, but only for specific combinations of model size and training query level. Further analysis shows that RLVR's effectiveness depends on the model's initial reasoning competence. With sufficient initial competence, RLVR improves an LLM's marginalization strategy and reduces errors in intermediate probability calculations, producing substantial accuracy gains, particularly on more complex queries. These results show that RLVR can improve specific causal reasoning subskills, with its benefits emerging only when the model has sufficient initial competence. Our code and data is available at https://github.com/zhichul/rlcausal.

Improving Diffusion Planners by Self-Supervised Action Gating with Energies

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yuan Lu · Dongqi Han · Yansen Wang · Dongsheng Li
4 March 2026 at 13:00
arXiv:2603.02650v1 Announce Type: cross Abstract: Diffusion planners are a strong approach for offline reinforcement learning, but they can fail when value-guided selection favours trajectories that score well yet are locally inconsistent with the environment dynamics, resulting in brittle execution. We propose Self-supervised Action Gating with Energies (SAGE), an inference-time re-ranking method that penalises dynamically inconsistent plans using a latent consistency signal. SAGE trains a Joint-Embedding Predictive Architecture (JEPA) encoder on offline state sequences and an action-conditioned latent predictor for short horizon transitions. At test time, SAGE assigns each sampled candidate an energy given by its latent prediction error and combines this feasibility score with value estimates to select actions. SAGE can integrate into existing diffusion planning pipelines that can sample trajectories and select actions via value scoring; it requires no environment rollouts and no policy re-training. Across locomotion, navigation, and manipulation benchmarks, SAGE improves the performance and robustness of diffusion planners.

DMTrack: Spatio-Temporal Multimodal Tracking via Dual-Adapter

✇cs.AI, q-bio.NC updates on arXiv.org
By: Weihong Li · Shaohua Dong · Haonan Lu · Yanhao Zhang · Heng Fan · Libo Zhang
4 March 2026 at 13:00
arXiv:2508.01592v2 Announce Type: replace-cross Abstract: In this paper, we explore adapter tuning and introduce a novel dual-adapter architecture for spatio-temporal multimodal tracking, dubbed DMTrack. The key of our DMTrack lies in two simple yet effective modules, including a spatio-temporal modality adapter (STMA) and a progressive modality complementary adapter (PMCA) module. The former, applied to each modality alone, aims to adjust spatio-temporal features extracted from a frozen backbone by self-prompting, which to some extent can bridge the gap between different modalities and thus allows better cross-modality fusion. The latter seeks to facilitate cross-modality prompting progressively with two specially designed pixel-wise shallow and deep adapters. The shallow adapter employs shared parameters between the two modalities, aiming to bridge the information flow between the two modality branches, thereby laying the foundation for following modality fusion, while the deep adapter modulates the preliminarily fused information flow with pixel-wise inner-modal attention and further generates modality-aware prompts through pixel-wise inter-modal attention. With such designs, DMTrack achieves promising spatio-temporal multimodal tracking performance with merely 0.93M trainable parameters. Extensive experiments on five benchmarks demonstrate that DMTrack achieves state-of-the-art results. Our code and models will be available at https://github.com/Nightwatch-Fox11/DMTrack.

VeriStruct: AI-assisted Automated Verification of Data-Structure Modules in Verus

✇cs.AI, q-bio.NC updates on arXiv.org
By: Chuyue Sun · Yican Sun · Daneshvar Amrollahi · Ethan Zhang · Shuvendu Lahiri · Shan Lu · David Dill · Clark Barrett
4 March 2026 at 13:00
arXiv:2510.25015v4 Announce Type: replace-cross Abstract: We introduce VeriStruct, a novel framework that extends AI-assisted automated verification from single functions to more complex data structure modules in Verus. VeriStruct employs a planner module to orchestrate the systematic generation of abstractions, type invariants, specifications, and proof code. To address the challenge that LLMs often misunderstand Verus' annotation syntax and verification-specific semantics, VeriStruct embeds syntax guidance within prompts and includes a repair stage to automatically correct annotation errors. In an evaluation on eleven Rust data structure modules, VeriStruct succeeds on ten of the eleven, successfully verifying 128 out of 129 functions (99.2%) in total. These results represent an important step toward the goal of automatic AI-assisted formal verification.
Received — 25 February 2026 ⏭

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.
Received — 17 February 2026 ⏭

Automated Proof Generation for Rust Code via Self-Evolution

✇cs.AI, q-bio.NC updates on arXiv.org
By: Tianyu Chen · Shuai Lu · Shan Lu · Yeyun Gong · Chenyuan Yang · Xuheng Li · Md Rakib Hossain Misu · Hao Yu · Nan Duan · Peng Cheng · Fan Yang · Shuvendu K Lahiri · Tao Xie · Lidong Zhou
17 February 2026 at 13:00
arXiv:2410.15756v3 Announce Type: replace-cross Abstract: Ensuring correctness is crucial for code generation. Formal verification offers a definitive assurance of correctness, but demands substantial human effort in proof construction and hence raises a pressing need for automation. The primary obstacle lies in the severe lack of data-there is much fewer proofs than code snippets for Large Language Models (LLMs) to train upon. In this paper, we introduce SAFE, a framework that overcomes the lack of human-written proofs to enable automated proof generation of Rust code. SAFE establishes a self-evolving cycle where data synthesis and fine-tuning collaborate to enhance the model capability, leveraging the definitive power of a symbolic verifier in telling correct proofs from incorrect ones. SAFE also re-purposes the large number of synthesized incorrect proofs to train the self-debugging capability of the fine-tuned models, empowering them to fix incorrect proofs based on the verifier's feedback. SAFE demonstrates superior efficiency and precision compared to GPT-4o. Through tens of thousands of synthesized proofs and the self-debugging mechanism, we improve the capability of open-source models, initially unacquainted with formal verification, to automatically write proofs for Rust code. This advancement leads to a significant improvement in performance, achieving a 52.52% accuracy rate in a benchmark crafted by human experts, a significant leap over GPT-4o's performance of 14.39%.

CellINR: Implicitly Overcoming Photo-induced Artifacts in 4D Live Fluorescence Microscopy

✇cs.AI, q-bio.NC updates on arXiv.org
By: Cunmin Zhao · Ziyuan Luo · Guoye Guan · Zelin Li · Yiming Ma · Zhongying Zhao · Renjie Wan
17 February 2026 at 13:00
arXiv:2508.19300v2 Announce Type: replace-cross Abstract: 4D live fluorescence microscopy is often compromised by prolonged high intensity illumination which induces photobleaching and phototoxic effects that generate photo-induced artifacts and severely impair image continuity and detail recovery. To address this challenge, we propose the CellINR framework, a case-specific optimization approach based on implicit neural representation. The method employs blind convolution and structure amplification strategies to map 3D spatial coordinates into the high frequency domain, enabling precise modeling and high-accuracy reconstruction of cellular structures while effectively distinguishing true signals from artifacts. Experimental results demonstrate that CellINR significantly outperforms existing techniques in artifact removal and restoration of structural continuity, and for the first time, a paired 4D live cell imaging dataset is provided for evaluating reconstruction performance, thereby offering a solid foundation for subsequent quantitative analyses and biological research. The code and dataset will be public.
There are no more articles
❌