❌

Normal view

TSHA: A Benchmark for Visual Language Models in Trustworthy Safety Hazard Assessment Scenarios

arXiv:2603.29759v1 Announce Type: cross Abstract: Recent advances in vision-language models (VLMs) have accelerated their application to indoor safety hazards assessment. However, existing benchmarks suffer from three fundamental limitations: (1) heavy reliance on synthetic datasets constructed via simulation software, creating a significant domain gap with real-world environments; (2) oversimplified safety tasks with artificial constraints on hazard and scene types, thereby limiting model generalization; and (3) absence of rigorous evaluation protocols to thoroughly assess model capabilities in complex home safety scenarios. To address these challenges, we introduce TSHA (\textbf{T}rustworthy \textbf{S}afety \textbf{H}azards \textbf{A}ssessment), a comprehensive benchmark comprising 81,809 carefully curated training samples drawn from four complementary sources: existing indoor datasets, internet images, AIGC images, and newly captured images. This benchmark set also includes a highly challenging test set with 1707 samples, comprising not only a carefully selected subset from the training distribution but also newly added videos and panoramic images containing multiple safety hazards, used to evaluate the model's robustness in complex safety scenarios. Extensive experiments on 23 popular VLMs demonstrate that current VLMs lack robust capabilities for safety hazard assessment. Importantly, models trained on the TSHA training set not only achieve a significant performance improvement of up to +18.3 points on the TSHA test set but also exhibit enhanced generalizability across other benchmarks, underscoring the substantial contribution and importance of the TSHA benchmark.

Generative AI in Action: Field Experimental Evidence from Alibaba's Customer Service Operations

arXiv:2603.29888v1 Announce Type: cross Abstract: In collaboration with Alibaba, this study leverages a large-scale field experiment to assess the impact of a generative AI assistant on worker performance in e-commerce after-sales service. Human agents providing digital chat support were randomly assigned with access to a gen AI assistant that offered two core functions: diagnosis of customer issues and solution proposals, presented as text messages. Agents retained discretion to adopt, modify, or disregard AI-generated messages. To evaluate gen AI's impact, we estimate both the intention-to-treat (ITT) effect of gen AI access and the local average treatment effect (LATE) of gen AI usage. Results show that gen AI significantly improved service speed, measured by issue identification time and chat duration. Gen AI also improved subjective service quality reflected in customer ratings and dissatisfaction rates, but it had no significant effect on objective service quality indicated by customer retrial rates. The performance improvements stemmed not only from automation but also from changes in the dynamics of agent-customer interactions: agent communication became more informative and efficient, while customers experienced reduced communication burdens. Low performers achieved the greatest improvements in both service speed and quality, narrowing the performance gap. In contrast, top-performing agents showed little improvement in service speed but experienced declines in both subjective and objective service quality. Evidence suggests that this decline results from increased multitasking tendency, proxied by longer shift-away times across concurrent chats, which slowed customer responses and raised abandonment and retrial rates. These findings suggest that gen AI reshapes work, demanding tailored deployment strategies.

ContractSkill: Repairable Contract-Based Skills for Multimodal Web Agents

arXiv:2603.20340v2 Announce Type: replace-cross Abstract: Self-generated skills for web agents are often unstable and can even hurt performance relative to direct acting. We argue that the key bottleneck is not only skill generation quality, but the fact that web skills remain implicit and therefore cannot be checked or locally repaired. To address this, we present ContractSkill, a framework that converts a draft skill into an executable artifact with explicit procedural structure, enabling deterministic verifica tion, fault localization, and minimal local repair. This turns skill refinement from full rewriting into localized editing of a single skill artifact. Experiments on VisualWebArena show that Contract Skill is effective in realistic web environments, while MiniWoB provides a controlled test of the mechanism behind the gain. Under matched transfer layers, repaired artifacts also remain reusable after removing the source model from the loop, providing evi dence of portability within the same benchmark family rather than full-benchmark generalization. These results suggest that the central challenge is not merely generating skills, but mak ing them explicit, executable, and repairable. Code is available at https://github.com/underfitting-lu/contractskill.git.

Robust transcriptomic hallmarks targeting intratumor heterogeneity in intrahepatic cholangiocarcinoma

Cell Rep Med. 2026 Mar 30:102708. doi: 10.1016/j.xcrm.2026.102708. Online ahead of print.

ABSTRACT

Intratumor heterogeneity (ITH) undermines transcriptome-based stratification in intrahepatic cholangiocarcinoma (iCCA). Here, we integrate multi-omics data from multi-region, single-region, and single-cell RNA sequencing cohorts to systematically characterize gene expression ITH. We uncover that immune and stromal heterogeneity are primary drivers of ITH, leading to misclassification of a median 27.8% of tumors by existing subtyping systems. To overcome this, we identify a low-intratumor-heterogeneity/high-intertumor-variability (LIHV) gene set and develop an ITH-insensitive classification system defining five subgroups: inflammatory (SI), metabolic (SII), atypical (SIII-1), immune-silent (SIII-2), and neurodegenerative (SIII-3). These subgroups exhibit distinct clinical outcomes, molecular features, immune landscapes, and therapeutic vulnerabilities. GPRC5A and VTCN1 serve as robust immunohistochemical biomarkers for SI and SIII tumors, while serum CEA and CA19-9 identify inflammatory iCCA. Therapeutically, HSP90 inhibition synergizes with anti-PD1 in inflammatory iCCA, whereas combined anti-PD1 and anti-TIM3 suppresses neurodegenerative iCCA. Collectively, our study provides a robust molecular framework and actionable therapeutic strategies for iCCA.

PMID:41916296 | DOI:10.1016/j.xcrm.2026.102708

Doxorubicin promotes the production of inflammatory cytokines in tumor-associated macrophages through activating lactate dehydrogenase A

Cell Death Discovery, Published online: 31 March 2026; doi:10.1038/s41420-026-03014-0

Doxorubicin promotes the production of inflammatory cytokines in tumor-associated macrophages through activating lactate dehydrogenase A

Proposed Role of Circadian Clock Genes in Pathogenesis of HCC: Molecular Subtyping and Characterization

Biomedicines. 2026 Mar 12;14(3):645. doi: 10.3390/biomedicines14030645.

ABSTRACT

Background: Hepatocellular carcinoma (HCC) stands as a prevalent global health issue with increasing incidence and mortality rates. Hepatocellular carcinoma (HCC) exhibits profound molecular and clinical heterogeneity, which limits the effectiveness of current therapeutic strategies. Circadian rhythm disruption has been implicated in metabolic reprogramming, proliferation, and immune modulation in cancer, but its role in shaping HCC heterogeneity remains poorly defined. Methods: Four public HCC transcriptomic cohorts (TCGA-LIHC, CHCC, LIRI, LICA) were integrated using RMA normalization and ComBat for batch correction. Consensus clustering based on 31 core circadian clock genes (CCGs) identified robust molecular subtypes. Multi-omics characterization-including genomic alterations, pathway activity (GSEA/GSVA), immune microenvironment profiling (CIBERSORT, EPIC, MCP-counter, xCell), and drug-sensitivity prediction (pRRophetic/oncoPredict)-was performed to delineate subtype-specific biological properties. A nine-gene CCG-based RiskScore model was constructed using LASSO Cox regression to internally validate subtype robustness and intra-subtype risk stratification. Results: Using consensus clustering of 31 core CCGs in TCGA-LIHC and three independent validation cohorts (CHCC, LIRI, LICA), we identified three reproducible subtypes-Cluster-1 (metabolic-quiescent), Cluster-2 (transition-intermediate), and Cluster-3 (proliferation-inflammatory)-which were recapitulated across cohorts and showed distinct overall survival (Cluster-3 worst; log-rank p values significant across datasets). Multi-omic characterization revealed that Cluster-3 exhibits the highest tumor mutational burden and CNV burden with enrichment of TP53/AXIN1/TERT alterations, strong activation of cell-cycle, E2F, and G2M programs, and an immune-hot yet immunosuppressed microenvironment enriched for TAMs, Tregs and MDSCs. By contrast, Cluster-1 shows relative genomic stability, dominant hepatic metabolic signatures (fatty-acid oxidation, bile-acid and xenobiotic metabolism) and an immune-cold phenotype. Single-cell mapping linked ALAS1 expression to malignant hepatocytes predominating in Cluster-1, whereas NONO and CSNK1D localized to stromal (CAFs/TECs) and both malignant/immune compartments respectively in Cluster-3, providing a cellular mechanism for subtype-specific metabolism, angiogenesis and immune modulation. Finally, a nine-gene CCG-based RiskScore validated prognostic stratification and drug-sensitivity predictions indicated subtype-specific therapeutic vulnerabilities (notably increased predicted TKI sensitivity in Cluster-3). Conclusion: In conclusion, this study proposes a robust circadian rhythm-based molecular classification of hepatocellular carcinoma, revealing three biologically and clinically distinct subtypes characterized by divergent genomic alterations, metabolic programs, immune microenvironment states, and prognostic patterns. By integrating bulk and single-cell transcriptomic data, we identify subtype-specific roles of key circadian regulators-including ALAS1, NONO, and CSNK1D-in shaping tumor metabolism, proliferation, stromal remodeling, and immune suppression. These findings highlight circadian dysregulation as a potential upstream factor associated with HCC heterogeneity and provide a conceptual framework for developing subtype-tailored mechanistic studies and circadian-informed therapeutic strategies.

PMID:41898292 | PMC:PMC13024568 | DOI:10.3390/biomedicines14030645

SVNeoPP: A Workflow for Structural-Variant-Derived Neoantigen Prediction and Prioritization Using Multi-Omics Data

Biology (Basel). 2026 Mar 19;15(6):492. doi: 10.3390/biology15060492.

ABSTRACT

BACKGROUND: Tumor neoantigens are key targets for personalized vaccines and T-cell therapies, yet most pipelines focus on neoantigens derived from SNV/small indel and often yield a limited number of high-quality candidates. SVs are prevalent in tumors and can generate novel chimeric sequences and neopeptides, making them a promising additional source of neoantigens. However, SV-derived neoantigen prediction remains challenging due to breakpoint uncertainty, isoform-dependent coding inference, and limited integration of multi-dimensional evidence and reproducibility.

METHODS: We developed SVNeoPP (Structural Variant Neoantigen Prediction and Prioritization), an end-to-end workflow for SV-derived neoantigen analysis. SVNeoPP takes WGS and RNA-seq as inputs, performs SV calling and annotation, and reconstructs altered transcripts and coding sequences in a traceable, isoform-aware manner to generate candidate peptides. Candidates are prescreened by integrating antigen-processing features with HLA binding prediction, and then hierarchically filtered and prioritized based on transcript expression, LC-MS/MS proteomics evidence, immunogenicity predictions, and sequence similarity to experimentally validated neoantigen databases. SVNeoPP is implemented in Snakemake to enable modular extension, checkpoint-based restarts, and end-to-end reproducibility.

RESULTS: Using a hepatocellular carcinoma (HCC) multi-omics dataset as a proof of concept, we demonstrated the performance of SVNeoPP and obtained a high-priority shortlist of candidate peptides. Compared with other methods, SVNeoPP substantially expanded the candidate search space for SV-derived neoantigens and showed more favorable distributions of antigen-processing and HLA binding features.

CONCLUSIONS: SVNeoPP provides a reusable, traceable, and interpretable multi-dimensional evidence-driven framework for SV-derived neoantigens. As a complementary module to SNV/small-indel pipelines, it broadens the neoantigen candidate repertoire and generates ranked candidates with interpretable evidence to facilitate downstream prioritization and decision-making.

PMID:41892252 | PMC:PMC13024079 | DOI:10.3390/biology15060492

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

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

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

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

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

Thinking in Streaming Video

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

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

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

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

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.

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

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

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

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

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

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.
❌