Your paper timeline
Scroll AI takes the way you would scroll a great paper aggregator: quick signal first, deeper critique when something earns your attention, and challenges when a claim feels off.
398 papers in cs.CV
Trending mixes fresh papers with community signal.
0
cs.ROcs.CVcs.LG Chenyuan Chen, Ran Ding, Lechen Zhang et al. · Oct 22, 2026

Whole-body vision-language-action (VLA) policies for humanoid loco-manipulation usually condition only on the current view, so they fail when brief object cues vanish before the robot must act. This paper proposes WholeBodyMem, which uses a frozen SAM3 to track task objects, detects object events (appear, disappear, move, change shape) to causally select up to $B_{\max}=7$ key frames, and feeds those native tokens together with mask-pooled object tokens into a flow-matching action expert via cross-attention and FiLM. On the new HuMeGo benchmark and standard SIMPLE tasks, the method raises the $\Psi_0$ base policy's simulated success from $29.1\%$ to $72.6\%$ and real-world Unitree G1 success from $36.7\%$ to $88.3\%$, while also improving reactive tasks to $86.9\%$.

Humanoid loco-manipulation in dynamic scenes is non-Markovian: cues vanish as objects change or are hidden, or leave the view as the robot turns and walks, yet whole-body vision-language-action (VLA) policies see only the present. We present WholeBodyMem, an object-guided perceptual memory that keeps the pre-history of object events seen before the robot acts on its goal. SAM3 tracks the task objects, and their events causally select key frames within an adaptive budget, which the action expert reads by cross-attention together with object tokens encoding appearance, geometry and time. We also contribute HuMeGo, a humanoid memory benchmark with six simulated and six real-world Unitree G1 tasks. Keeping the right frames rather than more frames, WholeBodyMem surpasses memoryless and uniform-memory baselines, raising its base policy's success from 29.1% to 72.6% in simulation and from 36.7% to 88.3% on the real robot, while also improving the standard SIMPLE tasks (70.2% to 86.9%).
0
cs.CV Chenyao Yang, Peijin Wang, Yingchao Feng et al. · Oct 22, 2026

Existing UAV vision-language navigation benchmarks generate trajectories without kinodynamic constraints, leading to jerky, collision-prone flight. KinoUAV introduces a dataset built from acceleration-driven, kinodynamically feasible trajectories with directional free-space distance labels and a two-stage Cruise–Seek task. The proposed KinoUAV-Agent hierarchically plans waypoints and predicts continuous accelerations, reporting state-of-the-art success and stability on the benchmark.

Unmanned aerial vehicles (UAVs) have recently emerged as important remote sensing platforms, and UAV navigation has shown great potential in remote sensing applications. However, existing methods do not explicitly incorporate kinodynamic modeling or safety distances into trajectory generation, resulting in high absolute yaw rates, frequent collisions, and low navigation success rates, which limit safety and motion stability. To address this challenge, we introduce KinoUAV, a kinodynamic benchmark comprising a dataset and KinoUAV-Agent. First, we develop a hierarchical kinodynamic trajectory generation pipeline that drives UAV through acceleration actions. It uses waypoint chains from global planning and generates trajectories segment by segment under velocity, acceleration, and jerk constraints, reducing oscillations and improving trajectory stability. Furthermore, we introduce directional free-space distance (DFD) labels into the constructed dataset to describe the available clearance for safe motion decisions. The proposed KinoUAV-Agent predicts DFDs and uses them to generate safe actions, decoupling perception from action decision-making. This design enables autonomous obstacle avoidance and improves navigation safety. The benchmark incorporates the proposed Cruise-Seek task, in which the UAV first enters the target region and then searches for the target, reducing the difficulty of target search and improving navigation success. Experiments on KinoUAV show that KinoUAV-Agent outperforms existing methods, achieving the highest success rate while maintaining lower absolute yaw rates and collision rates. These results demonstrate the effectiveness of kinodynamic modeling for safe and stable UAV navigation.
0
cs.CV Xiaowen Liang, H\'el\`ene Cazier, Aur\'elie Beaufr\`ere et al. · Oct 22, 2026

Diagnosing combined hepatocellular-cholangiocarcinoma (cHCC-CCA) is difficult because tumors contain mixed hepatocellular and cholangiocellular morphology. This work attacks the problem with weakly supervised multiple-instance learning: it classifies HES-stained whole-slide images into HCC, CCA, and cHCC-CCA, and introduces an attention-supervision loss and a dual-branch model to force heatmaps onto tumor regions and separate HCC-like from CCA-like components. The clinical aim is to improve both slide-level diagnosis and characterization of intratumoral heterogeneity without costly patch-level annotations.

Combined hepatocellular-cholangiocarcinomas (cHCC-CCA) are a type of cancer that share components of two other primary liver cancers: hepatocellular carcinoma (HCC) and cholangiocarcinoma (CCA). Accurate diagnosis of cHCC-CCA, of which the behavior may resemble that of either HCC or CCA, remains a challenge due to strong intratumoral heterogeneity. Since the prognoses differ between liver cancer types, it is necessary to improve their morphological characterization and recognition in order to accurately identify cHCC-CCA. In this work, we use whole slide images (WSIs) of the two main types of liver cancer (HCC and CCA) and cHCC-CCA, stained with Hematoxylin-Eosin-Safran (HES), to train a classification model that can distinguish between these subtypes and provides a potential solution for localizing different types of tumors in the combined liver cancer images.
0
cs.CV Vu Minh Tran, Thuc Huynh, Son Thanh Luu et al. · Oct 22, 2026

Current chest X-ray report generators that concatenate all available patient records into the decoder prompt produce long, variable-length inputs that can dilute attention and introduce image-irrelevant details. ICGF-CXRMate tackles this by conditioning learnable queries on the current radiograph to compress heterogeneous patient data into a fixed number of clinically relevant tokens, then selectively fusing them into the visual stream via gated cross-attention. On linked MIMIC-CXR and MIMIC-IV-ED examinations, this yields shorter prompts and stronger clinical metrics, offering a practical way to embed emergency-department context without overwhelming the language model.

Auxiliary patient data can improve chest X-ray report generation, but directly concatenating heterogeneous clinical information with visual tokens produces long, variable-length decoder prompts and may expose the model to redundant or image-irrelevant context. We propose ICGF-CXRMate, an image-conditioned clinical context compression and gated fusion framework. Learnable queries are first conditioned on the current chest X-ray representations and then attend to the patient-data sequence, compressing it into a fixed number of clinical context tokens. Gated cross-attention selectively integrates these tokens into the visual stream, while the compressed tokens are retained in the decoder prompt as a direct clinical pathway. Experiments on linked MIMIC-CXR and MIMIC-IV-ED examinations show that ICGF-CXRMate improves report quality while reducing the average prompt length. In Stage~2, it improves RadGraph-F1 from 24.00 to 28.86, CXR-BERT similarity from 56.86 to 62.80, and BLEU-4 from 5.14 to 7.96 compared with CXRMate-ED, while reducing the average prompt length from 373.89 to 288.37 tokens, corresponding to a 22.9\% reduction. After self-critical sequence training, ICGF-CXRMate outperforms CXRMate-ED on six of eight report-quality metrics in Stage~3. Ablation studies confirm the complementary contributions of image-conditioned compression, gated fusion, and direct retention of the compressed clinical tokens.
0
cs.CVcs.CL Olga Loginova, Oleksandr Bezrukov, Frank Keller · Oct 22, 2026

Procedural mistake recognition usually gets tangled up in temporal segmentation and low-level vision features. This paper introduces PRISM, a language-grounded framework that maps video steps to text, optionally structures them with semantic roles, and decodes sequences with a lightweight hidden Markov model trained only on correct executions. By assuming benchmark-provided step boundaries, it isolates the core reasoning problem of detecting deviations in step content and order through a unified edit-based taxonomy.

Procedural mistake recognition requires identifying deviations from valid multi-step activities. We study post-completion recognition from videos with benchmark-provided step boundaries. We introduce PRISM (Procedural mistake Recognition via Interpretable Semantic Modeling), which grounds video segments in language and maps their descriptions to procedural states using a lightweight hidden Markov model trained on correct executions. Reference alignment and semantic checks identify errors in step content and order. To support evaluation across heterogeneous benchmarks, we map dataset-specific annotations to four edit-based error types: insertion, deletion, substitution, and transposition. Across three benchmarks, we compare gold and VLM-generated descriptions in raw, semantic-role, and action-object forms. Decoder controls show consistent gains from the trained local decoder over nearest-candidate matching, with additional, dataset-dependent benefits from sequence decoding. Semantic role labeling improves Any-F1 in all six matched grounded comparisons, although the gains vary across datasets and do not translate into uniform improvements under separate configuration selection. These results establish language grounding as an effective interface for explicit procedural mistake reasoning and characterize the contributions of representation and decoding.
0
cs.CV Shiming Chen, Shuhuang Chen, Salman Khan et al. · Oct 22, 2026

The paper tackles Zero-Shot Domain Generalization (ZSDG), where a model must recognize unseen classes in unseen target domains without access to any source-domain images during training. The proposed Domain Prompt Learning (DoP) built on CLIP introduces a two-stage pipeline: Text Domain Learning (TDL) synthesizes diverse style tokens via text-space orthogonality and consistency losses, and Visual Domain Learning (VDL) refines the best-matching token per test image using self-supervised entropy minimization at test time. This matters because it removes the costly and often infeasible requirement to collect and annotate source-domain data, making domain generalization practical for new or scarce classes.

Domain generalization (DG) aims to improve the generalization of the model to any unseen domains. Targeting this goal, existing DG methods mainly focus on learning domain-invariant features or prompts from the given source domains. However, these methods rely on source-domain data, and collecting and annotating large-scale single- or multi-source datasets is often infeasible, limiting the practical applicability of DG. To tackle this challenge, we propose {\underline{Do}}main \underline{P}rompt Learning (DoP), a method built on a large vision-language model (e.g., CLIP) for zero-shot domain generalization, which recognizes unseen classes in unseen target domains without access to source-domain data. DoP essentially learns the target domain knowledge via prompt both in text and visual modalities to overcome the domain shift in text-visual modalities under the test-time adaptation formulation. Specifically, DoP first takes text domain learning (TDL) to simulate various distribution shifts by learning diverse style tokens implicitly in the text space with inter-style diversity loss and intra-style consistency loss. Subsequently, DoP employs visual domain learning (VDL) to further refine the target-domain-relevant style token generated by TDL by making use of the test visual data with self-supervised learning. Extensive experiments on popular DG benchmark datasets (e.g., PACS, VLCS, OfficeHome, and DomainNet) and ImageNet show that our DoP consistently outperforms the state-of-the-art DG approaches. Codes are available at: https://github.com/shiming-chen/DoP.
0
cs.CV Songlin Yang, Zhe Wang, Xiaotong Zhao et al. · Oct 22, 2026

Cinematic video generation demands both inferring plausible action and camera trajectories from sparse text or reference inputs, and independently controlling character, scene, action, and camera factors without unwanted side effects. The authors argue that simply feeding MLLM features into a Video DiT fails because the DiT can bypass those latents via native text-encoder and VAE-reference pathways. Factor-Aware Predictive Learning (FAPL) fixes this with a three-stage curriculum—latent-only grounding, factor-span replacement, and fixed-generator predictive learning—to force the DiT to rely on MLLM representations and, in turn, teach the MLLM to output generation-compatible latents.

Cinematic video generation requires both temporal inference from limited inputs (i.e., sparse rather than frame-by-frame guidance) and factor-aware control of character, scene, action, and camera. Multimodal large language models (MLLMs) offer useful priors for both capabilities, but their representations are not automatically actionable for video generation: a Video Diffusion Transformer (DiT) may bypass them through native conditioning pathways, and using them does not ensure either factor-aware control or generation-compatible temporal prediction. We propose Factor-Aware Predictive Learning (FAPL), which establishes effective MLLM latent use as a shared prerequisite and then targets the two capabilities with complementary learning signals. First, latent-only generator grounding trains the DiT with a frozen MLLM and connector, strengthening the DiT's use of MLLM latents for generation. Second, for factor-aware control, paired videos specify a target-factor change and non-target preservation, and factor-span replacement trains the DiT to realize this relationship in its output. Third, for temporal inference, text-only and text-plus-complete-video observations share a video target, and the trained DiT is then frozen while the MLLM and connector are optimized through it. This final stage trains limited-input representations for generation while retaining complete-observation reconstruction as a complementary training mode. Extensive experiments demonstrate our consistently better performance on three cinematic video generation tasks (i.e., sparse-to-video, factor-aware editing, and multi-shot generation) over baselines and validate FAPL's contributions to MLLM feature use, temporal control, and factor coordination.
0
cs.CV Zhaolu Kang, Tailong Luo, Lei Wei et al. · Oct 22, 2026

World models are increasingly used to reduce environment interaction when post-training vision-language-action (VLA) policies, yet they are typically trained to minimize next-frame pixel error rather than to produce useful policy gradients. DRILL introduces a bilevel framework that trains the world model to maximize the policy's downstream return after an imagined GRPO update, instantiated as both a lightweight signed surrogate (DRILL-VWI) and a full meta-gradient method (DRILL-IMG). The work matters because it empirically decouples pixel fidelity from policy utility, showing that a world model with substantially worse pixel MSE can yield far better downstream policies.

World models are increasingly used to reduce environment interaction when post-training vision-language-action (VLA) policies with reinforcement learning. Yet they are typically trained to predict pixels one step ahead, even though their role here is not merely to render visually faithful videos but to produce learning signals from imagined rollouts that improve the policy. We show that this mismatch is substantial: lower pixel MSE can produce worse policy gradients, and a world model trained for policy utility can yield better downstream policies despite 17% higher pixel MSE on the next frame. We propose the Downstream-Return Imagination Learning Loop (DRILL), a bilevel framework that updates the world model to maximize the policy's return after an inner GRPO update on imagined rollouts. DRILL has two instantiations. DRILL-VWI is a closed-form surrogate, requiring no additional simulator rollouts, that reweights prediction errors by policy visitation, the group-relative GRPO advantage, and model confidence. DRILL-IMG is a full meta-gradient method that differentiates through the inner update using truncated Hessian-vector products. We show that DRILL-VWI recovers the local one-step component of the DRILL-IMG meta-gradient under score-compatibility and small-residual assumptions. Across five manipulation simulators and two VLA backbones, DRILL-IMG raises mean success rate by 13.1 points over WMPO and 7.9 points over RLVR-World, and complements RLVR pretraining rather than competing with it. More broadly, we believe video world models for VLA reinforcement learning can be productively trained by the policy gradients they produce, not only by pixel-level prediction.
0
cs.CVcs.CLcs.IR Yufei Tong, Guanjie Cheng, Tianle Wu et al. · Oct 22, 2026

This survey tackles long-document visual question answering, where answers require locating and integrating evidence scattered across many pages and modalities including charts, tables, and fine-grained layout. Rather than grouping papers by model architecture, the authors decompose the task into four functional components: document parsing, evidence organization and retrieval, generator organization and learning, and evaluation. The core argument is that task bottlenecks—visual fidelity, evidence dispersion, and budget limits—should drive taxonomy design, not just technical novelty. This reframing matters because the field has grown explosively since 2024 and prior surveys have organized literature by approach rather than by the functional requirements that long documents impose.

Visual document understanding is essential for acquiring knowledge from visually rich documents and is attracting growing research interest. Existing surveys emphasize architectures or technical approaches, with limited attention to how task bottlenecks shape technical choices and research priorities. We present a task-centric survey that decomposes long-document visual question answering (VQA) into four components: document parsing, evidence organization and retrieval, generator organization and learning, and evaluation. For each, we develop a fine-grained taxonomy and trace motivations, technical responses, and cross-component connections. We focus on explicit retrieval while covering direct reading. Our temporal analysis traces expanding priorities from multimodal content understanding to sufficient, high-fidelity evidence acquisition and sustained evidence management. We outline future directions in evidence sufficiency, verifiable and correctable understanding, and budget-aware coordination, with an outlook on continual document understanding.
0
cs.CV Mijeong Kim, Suho Park, Junha Park et al. · Oct 22, 2026

AgentDreamer tackles text-controllable physics simulation by replacing ambiguous video diffusion priors with explicit 3D motion plans generated by an off-the-shelf multimodal agent. The agent reasons over scene geometry and text to produce dense parametric trajectories, which guide a differentiable MPM simulator toward physically feasible motion aligned with the instruction. A new metric, Motion-IG, isolates the information that simulated motion contributes to recovering masked text beyond the prompt alone. While the experimental scope is narrow, the framework offers a clean separation between semantic reasoning and physical grounding.

We propose AgentDreamer, an agent-guided optimization framework that aligns text instructions with simulated motion through explicit 3D motion planning. Given a text instruction and scene geometry, an off-the-shelf agent translates the instruction into a structured semantic motion prior, specifying what should move, in which direction, and in what temporal order. The agent represents this prior using parametric functions over a series of temporal chunks, yielding dense 3D trajectories. We then optimize the parameters of a differentiable MPM simulator such that its rollout best matches the prior while remaining constrained by the scene dynamics. This allows the agent to provide semantic guidance from language, while the simulator grounds it in physically feasible motion. We further introduce Motion-IG, an information-theoretic metric for text-motion alignment based on masked text recovery. By comparing the likelihood of recovering masked motion-related content with and without the simulated motion, Motion-IG measures the information contributed by the motion beyond that available from the remaining text and scene context. Experiments show that AgentDreamer improves text alignment over video-based guidance, producing simulations that more closely follow the requested physical behavior.
0
cs.CVcs.LG Yudhistira Arditya Pratama, Yi-Zeng Hsieh · Oct 22, 2026

GM-GReFEL attacks two coupled problems in dynamic facial expression recognition (DFER): the quadratic cost of self-attention in long clips and noisy crowdsourced labels. It replaces a spatiotemporal Vision Transformer with a Modulated GroupMamba backbone that scans six channel groups—four spatially and two temporally—at linear cost $\mathcal{O}(N)$, re-mixing them via a Channel Affinity Modulation gate. A geometry-aware reliability module blends the classifier output with trainable facial-landmark anchors, weighted by per-sample normalized entropy, to fall back on anatomy when the prediction is uncertain. The authors report best-fold results within 0.3 points of the top method on DFEW and ahead on MAFW, while openly noting that five-fold means are more mixed.

Recognizing facial expressions in unconstrained video suffers from two coupled problems: self-attention grows quadratically in cost with clip length, and crowdsourced labels are noisy. We present GM-GReFEL, a spatiotemporal state-space network with a geometry-aware decision stage. Its Modulated GroupMamba backbone replaces a spatiotemporal Vision Transformer. Six channel groups are scanned separately, four over the frame plane and two over time, so the cost grows linearly with sequence length ($\mathcal{O}(N)$); after each layer, a Channel Affinity Modulation gate mixes the groups again. On top of the backbone, a GReFEL reliability module turns the normalized entropy of each prediction into a mixing weight between the classifier output and a vote from trainable geometric anchors, so that facial geometry counts for more when the network is unsure. The model is initialized by static-to-dynamic weight transfer and trained with a Triple Loss. In five-fold cross-validation, the best fold scores 66.57\%/76.46\% UAR/WAR on DFEW, 0.3 points or less below the strongest compared method, and 45.66\%/62.27\% on MAFW, ahead of all compared methods; on FERV39k the mean over five splits, 42.30\%/52.66\%, is competitive. The five-fold means are 64.07\%/74.54\% on DFEW, on par with recent large pre-trained models, and 38.90\%/54.37\% on MAFW, below the best of them. A paired $t$-test on DFEW indicates a modest benefit of temporal modeling (+1.61 UAR points, one-sided $p=0.031$). Attention stays on plausible facial regions, and latency is close to a ViT-B/16 baseline (47.4 vs.\ 46.8 ms per clip). Code: https://github.com/ardiytama/GroupMamba-DFER.
0
cs.CVcs.CL Pengfeng Song, Shaozhong Zhang, Pengfei Shao · Oct 22, 2026

Fine-grained image-text retrieval requires aligning local semantics such as objects, attributes, and relations, yet fixed patches and tokens often produce fragmented matching units. This paper proposes HFCMA, a framework that dynamically aggregates low-level patches and tokens into adaptive visual regions and textual phrases, and then aligns these sets with entropy-regularized optimal transport under a frozen CLIP dual-encoder architecture. By making semantic unit construction an explicit learnable step and enforcing globally consistent matching via a transport plan, HFCMA aims to improve discrimination of subtle differences without sacrificing retrieval scalability.

Fine-grained image-text retrieval requires a model not only to assess global semantic consistency between an image and a text, but also to model visual evidence for local textual semantics, including objects, attributes, quantities, actions, and relations, so as to distinguish semantically similar candidates. Existing methods commonly use fixed image patches, detected regions, or text tokens as the basic matching units and then aggregate local interactions through max pooling, cross attention, or similarity accumulation. Such strategies remain limited in semantic unit construction and global matching consistency. This paper proposes a hierarchical fine-grained cross-modal alignment framework, termed HFCMA. The framework progressively transforms low-level patch and token representations into adaptive visual regions and textual phrases, and then performs structured region-phrase matching within a global retrieval scoring process. Specifically, HFCMA first adopts dynamic granularity discovery (DGD) to aggregate raw patches and tokens into semantically compact visual regions and textual phrases. It then formulates region-phrase matching as an entropy-regularized optimal transport problem, thereby estimating a structured alignment matrix under global marginal constraints. To reduce background noise and local semantic drift, HFCMA further introduces background debiasing, textual importance weighting, and prototype consistency regularization. Experiments on Flickr30K and MS-COCO show that HFCMA effectively combines dynamic semantic unit construction with OT-based structured matching under a dual-encoder retrieval framework. The resulting fine-grained score provides structured local alignment information for candidate ranking and improves the discrimination of subtle semantic differences.
0
cs.CVcs.LG Yue Zhou, Shujun Zhao, Xue Yang et al. · Oct 22, 2026

This survey argues that the central bottleneck for advancing remote sensing vision-language models has shifted from architectural innovation to data curation. It introduces GeoChef, an end-to-end framework that maps dataset taxonomy, construction pipelines, fine-tuning recipes, and evaluation protocols onto a culinary metaphor. By cataloging over 120 datasets and launching a community-driven warehouse, the authors aim to turn small academic teams into proactive data chefs rather than passive consumers of foundation models.

During the deep learning era, innovations in remote sensing (RS) vision models primarily focused on optimizing network architectures for specific tasks and conducting end-to-end training. However, with the advent of the Vision-Language Models (VLMs) era, constrained by substantial computational resource demands, the mainstream research paradigm has shifted towards adapting general-purpose VLMs using RS vertical domain data for fine-tuning, rather than modifying their core architectures. This transition marks a change in the innovation pathway from model-centric to data-centric. Despite the increasing importance of data, the academic community still lacks a systematic, data-centric survey to guide researchers in constructing high-quality RS vision-language datasets for various application scenarios and in conducting effective model fine-tuning and performance evaluation based on these datasets. To address this gap, this paper presents a systematic review of the development status of RS datasets tailored for VLMs. It further provides a comprehensive practical guide for RS researchers in the large model era, covering the entire pipeline from data construction to fine-tuning and evaluation. This paper aims to encourage the academic community to build more diverse and higher-quality vision-language datasets for specialized RS sub-fields. Ultimately, the goal is to converge these efforts into a comprehensive RS vision-language corpus that offers extensive task coverage and a wide geographical distribution, thereby laying a solid data foundation for advancing towards general artificial intelligence in RS.
0
cs.CVcs.AIcs.LG Khaled Waleed Dawoud, Muhammad Zaigham Zaheer, Khan Muhammad et al. · Oct 22, 2026

MoG-VLM attacks the prohibitive cost of zero-shot video anomaly detection with Vision-Language Models by treating motion not as a feature but as a lightweight gate that decides when to run expensive VLM inference. It introduces Temporal Gradient Magnitude (TGM) for content-aware frame sampling, anchor-triggered hierarchical lookback windows for temporal refinement, and a tier-aware fusion rule that balances frame-level and video-level语义 signals without any learned parameters. The work reports state-of-the-art zero-shot training-free AUC-ROC on XD-Violence (91.91%), UCF-Crime (84.30%), and MSAD (87.88%), alongside a claimed 1.31× speedup over the prior best method.

Vision-Language Models (VLMs) have shown strong potential for video anomaly detection, but dense frame-level inference makes them impractical for real-time deployment. Existing acceleration commonly relies on uniform sampling, which ignores content dynamics and can either waste computation on static segments or miss localized anomalies. We propose MoG-VLM a motion-adaptive anomaly detection framework that leverages motion purely as a lightweight control signal to decide when VLM inference is necessary. To this end, we introduce Temporal Gradient Magnitude (TGM) which performs content-aware sampling to concentrate computation on informative regions while avoiding redundant processing. We further introduce a hierarchical dual-stream design in which dense multi-frame VLM reasoning is activated only around frames with elevated anomaly likelihood, via anchor-triggered context-window expansion with early termination. A fusion module then reconciles these instantaneous semantic cues with temporal action dynamics. Across four benchmarks, our method achieves 91.91%, 84.30%, 87.88%, and 78.96% AUC-ROC on XD-Violence, UCF-Crime, MSAD, and ShanghaiTech, respectively, establishing new state of the art on three benchmarks under the zero-shot, training-free setting. On XD-Violence, we improve over the previous best result by +0.57% while delivering a 1.31x inference speedup. These results demonstrate that content-aware allocation of VLM capacity, processing fewer frames more intelligently rather than all frames uniformly, is a more effective axis of progress than uniformly densifying VLM inference across frames. Code is available on GitHub: https://github.com/kdawoud91/MoG-VLM.
0
cs.CVcs.LG Ignacy Kolton, Wenxuan Li, Zongwei Zhou et al. · Oct 22, 2026

DLoss tackles objective misalignment in radiology report generation: standard cross-entropy treats diagnostic and narrative tokens identically, so models can sound fluent while omitting critical findings or inserting false ones. The core idea is to pool decoder probabilities across sequence positions with different operators—noisy-OR for supported diagnoses and tempered log-sum-exp for unsupported ones—and add this as an auxiliary loss without changing architecture or inference. Evaluated across six 3D MedVLMs on ~50,000 abdominal CT scans, DLoss improves clinical metrics on most benchmarks, though gains vary widely by backbone.

Automated radiology report generation requires models to do more than produce fluent clinical narratives: they must explicitly state supported diagnoses while avoiding unsupported ones. However, existing medical vision-language models (MedVLMs) are typically trained with token-level maximum likelihood objectives, which prioritize text agreement over diagnostically critical terms. As a result, models can miss key diagnoses and introduce wrong ones. We identify this as an objective misalignment between conventional language modeling and the asymmetric diagnostic requirements of radiology reporting. To encode these requirements, we introduce Diagnostic Loss (DLoss), a differentiable, architecture-agnostic objective that operates directly on decoder token probabilities. DLoss separately aggregates probability mass over vocabularies associated with diagnoses supported by the reference report and with unsupported alternatives. Using asymmetric pooling across token positions in the report, it encourages supported diagnoses to receive sufficient probability in at least one position while suppressing spurious probability spikes for unsupported diagnoses across all positions during training. The loss can be applied to existing 3D MedVLMs without modifying their vision backbones, language decoders, or inference procedures, and introduces no additional inference-time computation. We train and evaluate DLoss on 50,000 abdominal CT scans across several 3D MedVLM architectures on both in-distribution and out-of-distribution report-generation benchmarks. Across these settings, DLoss improves diagnostic faithfulness while maintaining competitive performance on conventional language-generation metrics, showing the value of asymmetric sequence-level supervision for radiology report generation. The code for DLoss is available at https://github.com/gmum/DLoss.
0
cs.LGcs.CVcs.RO Hossein Resani, Javen Qinfeng Shi · Oct 22, 2026

Inside-JEPA tackles the opacity of latent world models by embedding relational channels for ordered entity pairs directly into the JEPA latent state. The core idea is that an inverse-dynamics loss—recovering actions from changes in these channels—can ground them to geometric relations without any relation labels during training. This matters because it could let world-model states be read and given goals in relational terms, the natural vocabulary for planning and manipulation.

Joint-embedding predictive architectures (JEPAs) learn world models in latent space, enabling efficient planning but leaving their states opaque. We introduce Inside-JEPA, which places relational channels for ordered entity pairs inside the JEPA latent state and shows that an inverse-dynamics loss can ground these channels without relation labels when its head reads them, either alone or as part of the full state. On Something-Something V2, latent prediction alone performs no better than a random relation head, while inverse-dynamics supervision that recovers actions from channel changes improves relational AUROC by .065-.103 across ten settings with annotated boxes, by .081 on RH20T robot episodes with held-out tasks, and by .050-.061 across five relations using off-the-shelf detection and tracking. An inverse head on entity latents decodes actions more accurately but barely improves relational grounding; shuffled labels, two label-free objectives, and action labels on only 5% of the pairs also fail to ground the channels. Given an action, predicted relational changes approach the quality of observed future relations (AUROC .599 vs .621). For one-step relational goals, a supervised readout of the 16 channels ranks the correct action among the top five of 65 in 43% of cases, compared with 24% for prediction-only latents and 17% for a frequency prior.
0
cs.CVcs.AI Thanh-Khoi Nguyen, Thien-Phuc Tran, Minh-Triet Tran · Oct 22, 2026

RecallGS tackles online open-vocabulary semantic 3D Gaussian Splatting from streaming images. Rather than learning a heavy 3D U-Net to inject geometric context into 2D CLIP features, it treats the agent's observation history as a non-parametric prior: it retrieves relevant past frames with CLIP, verifies their geometric support via alpha-compositing weights, and fuses the verified historical semantics into the current Gaussians. The core claim is that this training-free recall-ground-fuse pipeline recovers geometry-aware semantic context without the inference overhead of an additional learned 3D branch.

Online semantic 3D Gaussian Splatting (3DGS) enables open-vocabulary scene understanding from streaming observations. However, existing methods recover geometric context missing from image-derived semantic features using an additionally learned 3D network, incurring extra training and runtime overhead. We observe that such geometric-semantic evidence may already exist in the agent's observation history and can be retrieved rather than learned. Based on this insight, we introduce RecallGS (Geometry-Grounded Recall for Online Semantic Gaussian Splatting), a lightweight, training-free mechanism that treats past observations as a non-parametric geometric-semantic prior. RecallGS follows a recall-ground-fuse pipeline: CLIP retrieves relevant observations, alpha-compositing weights identify geometrically supported views, and aggregate their semantic features over each Gaussian's rendered footprint. On ScanNet and ScanNet++, RecallGS achieves strong semantic segmentation performance at 2.48 FPS, demonstrating that geometric-semantic context can be effectively recovered from observation history without an additional learned 3D branch.
0
cs.CVcs.AI Haojun Xu, Jie Huang, Xin Lu et al. · Oct 22, 2026

Direct Forcing tackles few-step autoregressive text-to-video generation by eliminating the costly ODE initialization stage that prior distillation methods require. The authors propose a single-stage recipe that jointly learns causal continuation alignment and rollout distribution matching from reference videos, using maximum mean discrepancy and dynamic gradient balancing. Starting from a bidirectional Wan2.1-$1.3$B checkpoint, the method trains in just $250$ updates and achieves $84.63$ VBench Total, offering a markedly shorter path to a fast causal generator.

Few-step autoregressive video generation enables low-latency streaming, yet prevailing training pipelines separate causal adaptation from distribution matching. Recent representation-based text-to-video methods retain this separation by starting from ODE-initialized checkpoints, even when the target distribution is defined directly by reference videos. We introduce Direct Forcing, a single-stage framework that uses reference videos both as paired examples of how a history continues and as a target population for self-generated rollouts. Causal Continuation Alignment learns paired spatiotemporal correspondence under reference histories, while Rollout Distribution Matching uses maximum mean discrepancy to align the representation distributions of self-generated and reference videos. Together, these complementary signals allow a pretrained video model to learn causal continuation and the target video distribution in a single training stage. Dynamic Gradient Balancing adapts the relative gradient contributions of continuation alignment and distribution matching during training. Starting from bidirectional Wan2.1-1.3B, Direct Forcing learns a four-step autoregressive generator in 250 updates without a separate initialization stage or online diffusion-score supervision, achieving 84.63 VBench Total and 86.01 Quality. Ablation studies further demonstrate the benefits of dynamic gradient balancing and reveal distinct representation preferences: deeper features benefit continuation alignment, whereas intermediate features yield better performance for rollout distribution matching.
0
cs.CVcs.AI Dominik Engel, Yousef Rajeh, Leon Sick et al. · Oct 22, 2026

Open-vocabulary 3D segmentation relies on CLIP features lifted into Gaussian reconstructions, but raw cosine similarity ignores scene-specific directional concentration. This paper proposes a query-time calibration pipeline that subtracts a shared scene direction, whitens text prototypes with a fixed generic reference vocabulary, and recalibrates scores via soft clustering or a CSLS-based relevance margin. The result is a training-free boost in mIoU across seven lifting methods and four datasets, demonstrating that simply changing how features are compared can be as impactful as redesigning the lifting itself.

Lifting vision-language features such as CLIP into 3D Gaussian reconstructions enables open-vocabulary segmentation through natural-language queries. Although CLIP represents a broad range of semantic concepts, the lifted features of individual scenes can exhibit strong directional concentration, while raw cosine similarity does not account for the scene-specific feature distribution. We show that substantial segmentation gains can be obtained by changing how a fixed lifted feature field is compared with text. Our method partially subtracts a shared scene direction from visual features and text prototypes and whitens text prototypes using a fixed reference vocabulary of generic terms. It then uses soft clustering for multiclass prediction and CSLS with a relevance margin against the reference vocabulary for single-query prediction. Beyond reducing directional concentration, scene centering improves class-relative feature separation in every evaluated scene. Across seven lifting methods and four datasets, the resulting query-time calibration consistently improves mean intersection over union in both multiclass and single-query segmentation. These gains require no retraining, source-image re-encoding, or feature re-lifting, demonstrating the value of scene-conditioned comparison for making better use of existing lifted representations.
0
eess.IVcs.AIcs.CV David Hamlyn, Sunny Chaudhary, Jonathon Hare et al. · Oct 22, 2026

Accurate intra-hour solar irradiance forecasting from ground-based sky images is essential for grid balancing and storage scheduling as PV penetration rises. GateFormer tackles this by embedding observed global horizontal irradiance directly into a Vision Transformer token stream, then producing two complementary forecasts—a multi-step trajectory and a direct final-horizon displacement—that are adaptively blended and residual-corrected in prediction space. The core claim is that this forecast-space decomposition, rather than conventional latent fusion or ensemble combination, yields consistent gains across three heterogeneous sky-imaging datasets.

Sub-hourly dispatch, balancing, and storage control increasingly depend on forecasts that anticipate rapid variability in solar generation. Accurate sky-image-based irradiance forecasting requires a combination of visual cloud dynamics with recent irradiance state while adapting to different short-term irradiance-change regimes. To address this, we introduce GateFormer, a GHI-conditioned dual-decoder ViT for intra-hour global horizontal irradiance (GHI) forecasting through forecast-space decomposition. GateFormer embeds observed GHI into the visual token stream, allowing interaction with sky-image patch features through self-attention. From this shared representation, a Trajectory Head predicts future GHI sequence, while a Delta Head predicts final-horizon change from the latest observed GHI. The two final-horizon forecasts are adaptively weighted in prediction space, with magnitude- and direction-supervision targeting the remaining error. On the NREL-TSI benchmark, GateFormer attains 125.01 W/m^2 RMSE at +30 min, improving over a state-of-the-art transformer baseline by 9.6% under paired-timestamp evaluation. Across NREL-TSI, Chilbolton, and SIRTA, GateFormer achieves the lowest final-horizon RMSE among the evaluated baselines, with forecast skill of 22.97-28.86% relative to smart persistence. Component ablations show adaptive weighting outperforms both individual decoders and fixed averaging, distinguishing GateFormer from conventional forecast combination, while the supervised correction further reduces RMSE by 1.68 W/m^2 and MAE by 4.86 W/m^2. Ramp-regime diagnostics show larger gains during operationally important positive ramps, reducing RMSE by 26.27 W/m^2. These results identify forecast-space decomposition as an alternative forecasting formulation, with potential relevance to other multimodal short-horizon forecasting tasks and deployment using only sky images and measured GHI.