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.
1579 papers
Trending mixes fresh papers with community signal.
0
cs.ROcs.CV Yunze Liu, Jing Wang, Shenrui Wu et al. · Oct 14, 2026

Robota-Embed tackles the problem of retrieving relevant physical experience for robots by learning a single embedding space that jointly encodes vision, language, and action from both the current state and a future trajectory segment. The core insight is that a useful retrieval key must capture not just task intent and visual scene, but also the robot's ongoing motion and execution stage, because the goal is to retrieve an appropriate continuation rather than simply a similar observation. A new multi-source benchmark and two downstream applications—in-context policy conditioning and memory evolution around a frozen large policy—show that this unified, action-aware representation significantly outperforms vision-language-only baselines and improves both success rates and token efficiency.

Retrieving useful context for a robot requires matching its task, execution stage, and the continuation that should follow. We introduce Robota-Embed, to our knowledge the first vision-language-action (VLA) embedding model to jointly encode all three modalities in both current-state queries and recorded future continuations. Predictive retrieval training aligns these endpoints, enabling historical continuations to serve as context at inference time. We construct a multi-source corpus of 1,695,684 cleaned training anchors and introduce Robota-Embed-Bench, with 4,000 queries and a shared 8,000-entry gallery. Robota-Embed achieves 47.33% clip-level and 81.77% episode-level R@1, exceeding action-free Gemini Embedding 2 by 22.09 and 33.47 percentage points. Controlled retrieval studies show that removing native action degrades retrieval more than removing vision. We study two complementary applications. Embed2ICL uses retrieved experience for training-free and training-based policy conditioning, increasing success from 47.0% to 56.3% in DROID-Sim and from 86.4% to 92.8% on the LIBERO difficult subset, while improving task progress on real robots. Embed2Evolve uses execution feedback to grow task-local memory and refine context use around a frozen GPT-6 Astra policy. Across five ManiSkill tasks, it achieves 68% success, compared with 24% for GPT-6 Astra Direct and 33% for a harness independently evolved with Omni-Embed-Nemotron-3B under the same protocol. Relative to the latter, it uses approximately 79.5% fewer policy tokens per test rollout, counting both successes and failures. These results show that a unified, action-aware retrieval space can support robot in-context learning and task-local context evolution.
0
cs.CV Yiliu Xu, Xinjin Li, Yu Ma · Oct 14, 2026

End-to-end accuracy on multi-image vision-language tasks hides whether failures stem from visual retrieval, schema understanding, or downstream composition. This paper introduces a within-item $2 \times 2$ factorial Oracle design in which a model performs a 16-image schema-application task under four matched conditions, receiving verified textual schema (Oracle-A), verified ordered target appearances (Oracle-B), both, or neither. The results localize the dominant recoverable deficit to upstream ordered instance recovery—Oracle-B rescues strict accuracy by 54.6 percentage points—while supplying the schema alone barely helps, suggesting that current VLMs often lose the relevant visual facts before any codebook reasoning begins.

Modern vision-language models can accept multi-image contexts, but aggregate accuracy rarely reveals where a multi-image reasoning pipeline fails. We study a controlled schema-application task in which a model must locate two target characters in a 16-image sequence, identify their visual attributes, consult an item-specific visual codebook, and compose two ordered nonce code names. We introduce a within-item 2-by-2 factorial Oracle design: Oracle-A supplies a verified textual schema, Oracle-B supplies a verified ordered target-appearance representation, and both interventions retain the original images and final question. Across 72 new items and 1,188 analyzed model responses, Oracle-B increased strict exact accuracy by 54.6 percentage points (95% confidence interval: 46.3 to 63.0) and outperformed Oracle-A by 60.6 points (Holm-adjusted p-value no greater than .0002). An auxiliary retrieval diagnostic reached only 49.1% ordered-appearance accuracy even after removing code-name generation. Providing both Oracle sources yielded 100% accuracy across all models. These results localize the dominant recoverable deficit to upstream ordered instance recovery rather than primarily to downstream schema use and composition.
0
cs.CV Haoxiang Rao, Fang Zhao, Zhao Wang et al. · Oct 14, 2026

Industrial anomaly detection is bottlenecked by scarce anomalous samples, which limits supervised training and defect understanding. This paper proposes CORE, a training-free framework that leverages Large Multimodal Models to synthesize realistic anomalies in both zero-shot and one-shot regimes through structured prompt optimization. The key idea is to decompose prompts into BASE, VARIANT, and NEGATIVE components and refine them via a self-supervised contrast-and-reflect mechanism without human annotations or task-specific fine-tuning. If effective, this could remove the need for costly real defect collections and enable open-world adaptation.

Industrial anomaly detection (AD) is bottlenecked by the scarcity of anomalous samples, making high-fidelity anomaly synthesis crucial for improving downstream performance. However, existing methods either rely on scarce real anomaly references or auxiliary data, while lacking complex reasoning and iterative optimization capabilities for generating realistic defects in open-set scenarios. To address these challenges, we propose CORE, a cost-efficient and training-free prompt optimization framework based on Large Multimodal Models (LMMs), which unifies zero-shot and one-shot anomaly synthesis. CORE first introduces an Anomaly Context Grounding module to transform sparse user context into defect-aware generation context, which is subsequently instantiated as structured anomaly prompts that disentangle normal-region preservation from anomaly-specific variation, enabling controllable and faithful defect generation. Furthermore, CORE autonomously refines prompts through a self-supervised contrast-and-reflect mechanism. This design empowers general-purpose LMMs to synthesize realistic anomalies under both zero-shot and one-shot settings without task-specific training. Extensive experiments on MVTec-AD and VisA demonstrate that CORE synthesizes realistic and diverse anomalies, yielding superior improvements in downstream AD performance. Furthermore, its model-agnostic and plug-and-play paradigm enables effortless integration with diverse LMMs, facilitating adaptation to unseen open-set scenarios.
0
cs.CVcs.AI Liang Yu, Tao Zhu, Xiangqing Lu et al. · Oct 14, 2026

Real-time monocular human pose estimation breaks down when the lower body is occluded or the subject steps out of frame. This paper introduces a part-decoupled temporal fusion framework that augments monocular video with sparse plantar-pressure and foot-mounted acceleration from smart insoles. The core insight is that cheap, wearable foot sensors provide complementary physical constraints exactly where monocular vision is weakest, enabling robust pose and gait recovery under severe visual degradation.

Real-time monocular human pose estimation is an important sensing component for human-centered intelligent systems. While recent camera-based methods have achieved impressive accuracy, fundamental challenges persist, particularly when visual observations are incomplete, such as during lower-body occlusion or short out-of-frame intervals. In these challenging but common scenarios, vision-only systems often struggle to reconstruct physically plausible lower-limb motion and reliable foot-ground contact. Due to the highly unobtrusive and wearable nature of smart insoles, this paper investigates whether simple plantar pressure and acceleration sensors can effectively resolve these visually induced limitations. To systematically investigate this, we first collect a synchronized multimodal dataset and then propose a part-decoupled temporal fusion framework. The proposed model fuses foot-sensing features into the lower-body branch to compensate for incomplete visual evidence, while a lightweight coordinator exchanges information between the upper- and lower-body temporal representations to maintain whole-body consistency. The framework is evaluated with three representative real-time visual backbones based on 2D keypoints, 3D landmarks, and SMPL-based human mesh recovery. We evaluate our framework on three representative real-time visual backbones. Quantitative experiments demonstrate that incorporating simple foot sensors consistently improves pose accuracy, motion smoothness, and gait-related measurements over vision-only baselines, with the most significant gains observed under occlusion and short visual-dropout conditions. Ultimately, our results demonstrate that unobtrusive foot sensing provides vital and complementary physical observability when camera observations are temporarily unavailable.
0
cs.CV Ke Li, Tianyi Wang, Enning You et al. · Oct 14, 2026

LED-BENCH targets a realistic but under-evaluated setting: answering engineering questions from complete, large-format drawings in mechanical, architectural, and transportation domains. The benchmark contains 107 sheets and 377 expert-verified questions that require models to localize fine-grained evidence and integrate information across distant regions or views. Its central finding is that current multimodal models remain far from solving this problem—the best evaluated model achieves only 52.65% accuracy, and performance consistently degrades on harder reasoning tasks.

Real-world engineering drawings are often large-format and information-dense. Answering practical engineering questions therefore requires both fine-grained understanding of engineering information and complex reasoning over objects, relations, and evidence distributed across different regions or views. Existing benchmarks cover a range of engineering-drawing understanding tasks involving local regions, individual views, specific elements, or more constrained visual settings. However, systematic evaluation of understanding over realistic, large-format engineering drawings remains limited. To address this gap, we introduce LED-BENCH, a multidisciplinary benchmark designed to evaluate fine-grained understanding and complex reasoning over large-format engineering drawings, spanning the mechanical, architectural, and transportation domains. Extensive evaluation of 11 representative multimodal large language models, including 8 proprietary models and 3 open-source models, reveals substantial remaining difficulty: GPT-5.6 Sol achieves 52.65% average accuracy, performance varies across engineering domains, and all evaluated models perform worse on questions requiring broader evidence integration. These results highlight fine-grained understanding, evidence integration, and complex reasoning over large-format engineering drawings as persistent challenges for current multimodal models.
0
cs.CVcs.CL Yanshu Li, Ruixiang Tang, Junyi Jessy Li et al. · Oct 14, 2026

ActICL attacks the problem of suboptimal multimodal in-context learning by training an MLLM agent to iteratively acquire, inspect, and curate demonstrations through tool-augmented reasoning. Its core idea replaces static similarity retrieval with an agentic loop of search, read, curate, and solve actions, learned via a two-stage post-training pipeline of rejection-sampling SFT and joint reinforcement learning. This matters because it shows that even a modestly sized trained agent can construct contexts that substantially improve its own accuracy and also boost larger frontier answering models.

Multimodal in-context learning (ICL) is an important capability of multimodal large language models (MLLMs). Its performance is closely tied to the demonstrations it uses, making demonstration retrieval a core problem for ICL. Common methods use fixed scoring methods to retrieve all the demonstrations at once, which may introduce redundancy and noise. Context-aware retrieval methods have emerged to address this problem by allowing incremental retrieval from a growing context. However, none of them lets the MLLM learn how to judge what new demonstrations it needs and then carry out progressive retrieval on its own. To this end, we introduce ActICL, which trains an MLLM agent to acquire and use an ICL context via tool-augmented reasoning. An ActICL agent analyzes its own information gaps during iterative reasoning and tool-use actions. Based on these gaps, it performs targeted retrieval to acquire a set of initial candidates. It can then use the existing context to further filter the candidates and refine the context, or it can iteratively perform a new retrieval. When the agent judges that the context is sufficient for the task, or when the resource limit is reached with the user request met, it sends the acquired context to an answering model, either the agent itself or another MLLM. We use a two-stage post-training procedure that jointly optimizes the agent's acquisition and answering. With an adaptive number of demonstrations, ActICL improves average performance by 11.6 percentage points over standard similarity-based retrieval across seven benchmarks and three MLLMs, and by 4.4 points compared to the strongest prior baseline. The contexts acquired by ActICL agents can also be used effectively by frontier models. When GPT-5.6-Sol performs 4-shot ICL, ActICL's contexts improve its performance by 3.5 points over standard retrieval, averaged over three benchmarks.
0
cs.CV Yifei Sun, Fenglei Fan, Junhao Jia et al. · Oct 14, 2026

Bone suppression in chest X-rays removes overlapping ribs and clavicles that hide lung pathology, but existing methods suffer from reconstruction-biased latent compression, domain gaps, and very small paired datasets. DeBoneDiT tackles this by combining a depth-supervised auto-encoder with a source-conditioned Brownian bridge diffusion Transformer, and it releases SZCH-X-Rays, a 741-pair high-resolution dataset. The goal is to provide an efficient, software-only alternative to hardware-dependent Dual-Energy Subtraction.

Chest X-Ray (CXR) is a primary modality for diagnosing pulmonary diseases, yet the overlap of bony structures often obscures critical radiographic findings, increasing the risk of diagnostic uncertainty. While Dual-Energy Subtraction (DES) is the clinical benchmark for bone suppression, its widespread adoption is primarily hindered by specialized hardware requirements and increased radiation exposure. Recently, diffusion-based generative models have shown promise for this task, yet they are still constrained by reconstruction-biased latent compression, prior-induced domain gap, and a scarcity of high-quality paired datasets. To address these challenges, we propose DeBoneDiT, a depth-driven conditional bridge diffusion Transformer architecture for efficient high-resolution bone suppression. We first introduce Depth Auto-Encoder (DAE), a structure-aware vision tokenizer for latent compression. By incorporating a multi-level depth feature loss derived from the pretrained Depth Anything V2 encoder, DAE preserves both visual fidelity and structural consistency. Second, we formulate bone suppression as a source-conditioned Brownian bridge diffusion process, leveraging CXRs as both the diffusion prior and structural guidance to narrow the source-to-target domain gap and maintain anatomical plausibility. Furthermore, we have constructed and released SZCH-X-Rays, the largest publicly available high-quality paired dataset for bone suppression to date, comprising 741 pairs of CXR and DES soft tissue images. Extensive experiments and downstream evaluation demonstrate that DeBoneDiT achieves superior bone suppression performance with reduced computational overhead.
0
cs.CVcs.LG Jingjing Liu, Pei Tai, Xianchao Xiu et al. · Oct 14, 2026

Unsupervised feature selection often forces practitioners to hand-tune regularization parameters in sparse PCA models or to collect large labeled datasets for deep learning. This paper proposes MDUFS-Net and MDUFS-Net+, which unfold an ADMM solver for $\ell_{2,0}$-norm regularized PCA into a trainable deep network, embed a Stiefel manifold projection to preserve orthogonality, and optionally add element-wise $\ell_0$ sparsity. The work matters because it tries to retain the interpretability of model-driven optimization while automating parameter adaptation via gradient-based learning.

Unsupervised feature selection (UFS) is of great significance in image processing and pattern recognition. Nevertheless, existing model-based methods often rely on manually tuned hyperparameters, while deep learning-based methods generally require massive training data. To address these issues, this paper proposes an efficient manifold deep unfolding feature selection network (MDUFS-Net). Technically, we first incorporate the $\ell_{2,0}$-norm into the classic principal component analysis (PCA) framework, then unfold the alternating direction method of multipliers (ADMM)-based iterative algorithm into an end-to-end trainable network, thereby enabling automatic parameter learning. Moreover, a manifold optimization strategy is developed to improve the numerical robustness. On this basis, we further extend MDUFS-Net into an enhanced variant called MDUFS-Net+ by introducing the $\ell_{0}$-norm for more discriminative feature representations. Extensive experiments validate that our proposed MDUFS-Net and MDUFS-Net+ outperform state-of-the-art methods in the UFS task, with promising performance in clustering. Our code is available at https://github.com/xianchaoxiu/MDUFS.
0
cs.CVcs.AI Chunxi Luo, Qishuai Ding, Xingchen Peng et al. · Oct 14, 2026

FrameEvidence is a diagnostic benchmark for multi-image spatial reasoning that tests whether vision-language models correctly answer questions when the reference frame or the set of visual evidence is manipulated. It introduces 960 Chinese multiple-choice questions arranged in 320 matched triplets, where FQ1 varies the spatial reference frame while holding images fixed and FQ2 deletes or adds images to test evidence necessity and invariance. The core finding is a sharp divergence between single-item accuracy, which reaches 50\% for GPT-5.6, and joint correctness across matched variants, which remains below 11\% for $\mathrm{FQ1\text{-}GEM}$. This design exposes how standard accuracy obscures brittle reasoning and answer instability.

A spatial answer depends on the reference frame specified in language and its supporting visual evidence. Item accuracy alone obscures whether correctness persists when either changes. We introduce Frame Evidence, a benchmark of 320 matched triplets and 960 Chinese multiple-choice questions from captured and rendered scenes. One family compares three grounded reference frames over fixed images. The other pairs image deletion annotated as insufficient with answer-preserving addition. Joint metrics require correct answers across all three frames and paired evidence variants. Across 20 configurations on 288 held-out questions, GPT three-shot reaches 50.00\% item accuracy, but the best three-frame group accuracy is 5/48 (10.42\%), reached by GPT two-shot. Few-shot prompting and task-specific adaptation improve item accuracy without consistently improving joint correctness. Input controls show where images support matched success, while repeated executions reveal answer instability beneath similar scores.
0
cs.CV Ziyi Fang, Jingzhi Li, Xiaojun Jia et al. · Oct 14, 2026

Text-to-image safety alignment typically relies on coarse, image-level preference signals that can degrade overall generation quality. SaTPO proposes step-wise transition preferences between an unsafe prompt and its safe rewrite, sharing the parent latent state and noise to isolate the safety direction without a learned reward model. Multi-scale drift regularization and benign replay attempt to preserve ordinary generation, and experiments on Stable Diffusion v1.5 and SDXL report lower unsafe-detection rates and better FID than strong baselines.

Safety alignment of text-to-image diffusion models aims to suppress harmful content without compromising useful generation capabilities. However, preferences over completed images compress multidimensional generation factors into a coarse signal, potentially driving changes beyond those required for safety. To address this, we propose Safety Transition Preference Optimization (SaTPO), which enforces step-wise alignment during denoising. SaTPO leverages the insight that an unsafe prompt and its safe rewrite naturally form a tightly coupled preference pair when conditioned on a shared parent state and noise realization. By anchoring optimization on identical parent states, SaTPO eliminates historical trajectory divergence, confining safety adaptation to an incremental alignment while preserving task-relevant semantics. Multi-scale drift constraints and benign replay further limit behavioral deviation and preserve ordinary generation. We additionally construct CoProPV, a refined dataset ensuring visually verified contrasts. Experiments on Stable Diffusion v1.5 and SDXL demonstrate improved safety-quality trade-offs. Compared with AlignGuard, PerspectiveVision unsafe-detection rates on Inappropriate Image Prompts decrease from 12.70% to 6.00% and from 15.04% to 9.30%, respectively, while FID improves from 32.28 to 25.95 and from 36.50 to 27.51. Warning: this paper includes potentially offensive content.
0
cs.CVeess.AS Jing-Xuan Zhang, Genshun Wan, Jianqing Gao et al. · Oct 14, 2026

This paper proposes FLARE, a framework for learning robust visual speech representations for lipreading by distilling knowledge from Whisper audio models into discrete codes via random-projection quantization, while jointly processing full-face and lip-ROI video streams. The core idea is that richer acoustic supervision and complementary facial dynamics can mitigate the ambiguity and pose sensitivity that plague visual speech recognition. FLARE achieves competitive word error rates on LRS2, LRS3, and the challenging out-of-domain WildVSR benchmark, and the authors back their design with extensive ablations and representation visualizations.

Lipreading remains challenging due to the inherent ambiguity of visual speech cues and their sensitivity to head pose and video resolution. In this work, we propose FLARE, a framework for robust visual speech representation learning via cross-modal distillation and joint face-lip modeling. FLARE leverages semantically rich Whisper representations as the acoustic teacher signal, converting them into discrete distillation targets through a random-projection quantizer and pretraining the model with a masked prediction objective. To capture complementary visual information, FLARE employs a dual-stream architecture that jointly processes lip region-of-interest (ROI) and full-face inputs, where the lip stream captures finegrained articulatory motion and the face stream encodes broader facial dynamics. During pretraining, auxiliary audio input is incorporated to facilitate cross-modal alignment, and modality dropout is applied to encourage robust visual-only representations. For downstream lipreading, FLARE serves as a visual encoder coupled with either a lightweight Transformer decoder or an LLM-based decoder. Evaluated on LRS2, LRS3, and the out-of-domain WildVSR benchmark, FLARE achieves strong lipreading performance, with word error rates of 11.7%, 13.2%, and 34.3%, respectively. A progressive design study confirms the contribution of each major component. Further analyses demonstrate that joint face-lip modeling improves robustness under degraded video resolution and large head pose variation, while yielding more phoneme-discriminative visual representations. Code and pretrained models are available at https://github.com/jxzhanggg/FLARE.
0
cs.CV Yiyang Chen, Guo-Hua Wang, Yaoli Liu et al. · Oct 14, 2026

Text-to-image models increasingly generate Chinese text that is readable yet structurally defective at the stroke level, but OCR and vision-language systems miss these errors because they are optimized for recognition invariance rather than glyph fidelity. TextVerifier reframes the problem as target-conditioned anomaly detection: given a target character and an image crop, it predicts whether the crop is a correct rendering. The core idea is to replace single-character text tokens with Ideographic Description Sequences in a compact CLIP-style dual tower, training the verifier through a three-stage curriculum that culminates in label-free hard negatives mined from an inpainting model's training trajectory. The work matters because Chinese rendering errors are often invisible to string-level metrics yet fatal in publishing and education, and existing benchmarks score only whole-image OCR accuracy rather than per-character correctness.

Text-to-image models increasingly generate readable Chinese text that still contains local rendering defects, such as a character with an extra or missing stroke or a malformed component. Such errors are invisible to OCR and vision-language models, which are trained for recognition and are therefore invariant to the very structural deviations that define a rendering error. We formalize text rendering verification as a target-conditioned problem: given a target character and an image crop, decide whether the crop is a correct rendering of that character. Our verifier TEXTVERIFIER feeds the text tower a character's Ideographic Description Sequence (IDS) rather than a single-character symbol, and is trained on 12.7M crop-IDS pairs plus label-free "same-character, different-quality" hard pairs sampled from the training trajectory of a text-region inpainting model. To evaluate this ability we build TEXTRENDERBENCH-ZH, the first per-character benchmark for generated Chinese text, annotating position, identity, and correctness for 7,358 characters. TEXTVERIFIER reaches an F1 of 0.844, far above OCR confidence (0.526), a general VLM (0.329), and TextPecker (0.590). Used as a per-character reward for Flow-GRPO post-training, it further reduces rendering errors, showing that its score can both detect and correct errors.
0
cs.CV Dikai Li, Weijia Wang, Yuan-Gen Wang · Oct 14, 2026

Industrial board inspection must remain reliable across unseen lighting, surface contamination, and production-line conditions, yet training data is typically drawn from limited source scenarios. This paper treats the IDA 2026 Track 1 benchmark as a domain generalization problem and argues that standard mAP-driven checkpoint selection misaligns with the screening-heavy deployment objective. The authors propose a single-model YOLOv11-based framework with four modules—appearance-robust training (MixRand and IBN-a), small-defect preservation (SPD, SimAM, and NWD), confidence calibration (VFL and threshold search), and metric-aligned checkpoint averaging (a custom Track 1 proxy plus SWAD)—to improve cross-scenario defect detection and clean-board screening without ensembles or external data.

Automated defect detection of industrial boards must remain highly reliable under cross-scenario variations in lighting, surface contaminants, and production line conditions. This makes cross-scenario defect detection a domain generalization problem, wherein models are required to detect, localize, and classify defects across unseen scenarios while minimizing false alarms on clean boards. For the IDA 2026 Track 1 challenge, we propose a cross-scenario defect detection method that includes four complementary modules: cross-scenario robust training, small-defect-aware learning, score calibration and inference threshold selection, and metric-aligned checkpoint selection. These four modules respectively introduce cross-scenario robust normalization and DSU-style statistic perturbation with progressive random convolution, NWD and parameter-free spatial attention, the VFL learning objective, and a custom SWAD variant driven by the Track 1-oriented proxy. Experimental results demonstrate that our model achieves a Track 1 score of 0.564 with a screening score of 0.696 on the test dataset on a single RTX 4090 GPU. The code is available at https://github.com/GZHU-DVL/Dikai.
0
cs.CV Huiping Ren, Shuai Wan, Luqian Bai et al. · Oct 14, 2026

3D Gaussian Splatting enables high-quality real-time rendering but its millions of primitives incur heavy storage costs. RDCompGS targets compression pipelines that map Gaussian attributes into 2D grids for mature image codecs like H.265/HEVC and JPEG XL. The core idea is to close the loop between Gaussian optimization and subsequent coding by adding a differentiable coding-rate estimate, derived from DCT coefficient statistics, to the standard rendering loss, alongside an adaptive constraint that balances rate and distortion across quantization steps. By jointly optimizing for both reconstruction fidelity and compressibility during training, the method delivers substantial bit-rate savings without sacrificing rendering quality.

3D Gaussian Splatting (3DGS) enables high-quality, real-time novel view synthesis but requires significant storage and transmission resources. Mapping Gaussian attributes to 2D representations enables efficient compression using mature image codecs. However, Gaussian representations that achieve comparable rendering quality are generally treated similarly during optimization, despite substantial differences in coding rate, leading to limited rate-distortion (R-D) performance after compression. To address this limitation, we propose RDCompGS, a 3DGS compression method that enables overall R-D optimization of Gaussian representations with respect to subsequent coding. A differentiable estimate of the coding rate is incorporated into the R-D optimization with rendering distortion. The rate constraint adjustment model further regulates the R-D trade-off across different compression conditions. Extensive experiments on three benchmark datasets demonstrate that RDCompGS achieves average Bj{\o}ntegaard Delta Rate reductions of 37.84% and 49.31% with H.265/HEVC and JPEG XL, respectively. The estimated rate also shows a strong correlation with the actual bit-rate under different compression conditions.
0
cs.CV Konan Sasaki, Junya Komori, Kazuhiro Hotta · Oct 14, 2026

3D point cloud segmentation models like Point Transformer V3 use space-filling curves (SFC) to approximate nearest neighbors efficiently, but SFC adjacency can misalign with true spatial proximity. This paper proposes DAS Loss, a training-time contrastive objective that penalizes or rewards feature similarity for SFC-adjacent pairs that are spatially distant, depending on whether they share a class label. The method boosts mIoU on PTv3 without adding parameters or inference cost, offering a lightweight plug-in for serialized point cloud transformers.

As a lightweight and highly accurate method for nearest-neighbor search in 3D point clouds, approaches based on space-filling curves (SFC) have been proposed. However, due to the inherent properties of SFC, a gap arises between proximity relationships along the SFC and those in the original Euclidean space. In this study, we propose a loss function that reduces the influence of this gap. Specifically, we compute the distances between adjacent points along the SFC and train the model to optimize feature similarity between pairs of points that are distant from each other in the original 3D space. We incorporate the proposed method into a high-performing 3D point cloud segmentation model and evaluate its effectiveness on three datasets. The results demonstrate that the proposed method outperforms conventional methods on both indoor and outdoor point cloud datasets.
0
cs.CVcs.AI Zihao Lin, Haoyu Dong, Haobo Xu et al. · Oct 14, 2026

This paper tackles the problem of recursive self-improvement for agentic video-understanding harnesses, asking how automated evolution can discover generalizable designs when it must learn from limited, noisy, and repeatedly reused validation feedback. The authors first diagnose three interconnected failure modes in a baseline system (validation overfitting, search-budget dilution, and the early-experience trap), then propose VideoHarness-SRSI, an evidence-governed framework that hides validation content from the proposer, warms up with controlled interventions, and evolves mechanisms in isolated probe–race branches before factorial composition. Across four benchmarks, the method improves the mean held-out score by 6.2% relative to the baseline and cuts the validation–test gap by 37.9%, supporting the central claim that how search is informed and organized matters as much as how well it optimizes validation metrics.

LLM system capabilities depend not only on model parameters but also on the executable harnesses that organize information acquisition, tool use, reasoning, and memory. Recursive harness evolution can automate their design, but how it can reliably discover generalizable systems from limited, noisy, and repeatedly reused feedback remains unclear. We study this question in agentic video understanding, where rich multimodal evidence and coupled mechanisms make harness optimization challenging. We first introduce VideoHarness-BRSI, a recursive self-improvement framework that evolves video harnesses around a frozen vision-language model. Analyzing over 4,000 evolved candidates, we find it competitive with hand-engineered systems but identify three interconnected failure modes: validation overfitting, search-budget dilution, and the early-experience trap. We trace all three to a common root: the same imperfect validation evidence drives both harness revisions and the proposer's search strategy. We therefore propose VideoHarness-SRSI, an evidence-governed framework in which every search decision rests on evidence that is transferable, sufficient, and gathered before the search commits. It restricts the proposer to content-free feedback, informs exploration with instrumented warm-up experiments, and develops mechanisms in isolated probe-race branches before factorial composition and joint refinement. Across four video understanding benchmarks, VideoHarness-SRSI improves the equally weighted mean held-out score by 6.2% relative to VideoHarness-BRSI and reduces the mean validation-test gap by 37.9%. Reliable harness evolution thus depends on how search is organized and informed, not only on how well it optimizes validation performance.
0
cs.ROcs.AIcs.CV Yue Zhang, Han Lin, Zun Wang et al. · Oct 14, 2026

Wedge addresses the inefficiency of generic environment generation for embodied navigation: pretrained agents fail for different environmental reasons, so simply adding more diverse or realistic training scenes may not address their actual shortcomings. The paper proposes a policy-conditioned generation framework that diagnoses an agent's specific weaknesses by contrasting its successful and failed rollouts, uses an LLM to propose executable environmental features (such as target visibility or blind-path ratio), validates them via success-rate gaps, and generates targeted training environments. This approach is tested across three heterogeneous agents—an RL policy, an imitation-learned model, and a black-box VLM—showing consistent gains in ProcTHOR and transfer to HM3D.

Simulated environments enable scalable training data generation for embodied agents, but more data does not necessarily provide what a particular agent needs to learn. Existing environment-generation pipelines largely optimize generic properties such as realism, diversity, or task coverage, while different pretrained policies can fail for different environmental reasons. We therefore introduce WEDGE, a framework for weakness-guided navigation learning in which the failure modes of a pretrained agent guide the generation of training environments at each adaptation round. Given a pretrained policy, WEDGE uses an LLM to propose executable weakness features from contrasting successful and failed rollouts, automatically validates them on the diagnostic set, and selects the strongest validated weakness based on its success-rate gap. The validated weaknesses are then mapped to the environmental factors that control them. WEDGE varies these factors to construct environments in the difficulty regimes where the policy struggles, producing targeted training experience for adaptation. Across three navigation agents with different adaptation mechanisms, we find that policies exhibit distinct weakness profiles and benefit from different training environments. Weakness-conditioned adaptation consistently outperforms matched random and hard-example alternatives on ProcTHOR, while the resulting gains for Uni-NaVid and Gemini also extend to HM3D after ProcTHOR adaptation. Iterative re-diagnosis further shows that dominant weaknesses can persist or shift as the policy improves, providing updated guidance for subsequent environment construction. Together, these results show that policy failures are not only diagnostic signals, but actionable guidance for constructing training environments that target a policy's current weaknesses.
0
cs.CV Chenxu Wang, Hangyi Kuang, Bo-Wen Yin et al. · Oct 14, 2026

MLLM-based detectors fail in dense scenes when autoregressive coordinate generation collapses into box-repetition loops, wasting the finite decoding budget on redundant predictions. This work attributes the failure to historical-answer attention takeover—raw coordinate history crowds out the visual context needed to discover new objects. The proposed Compressed Window Auto-Regression (WinAR) keeps exact autoregression inside local windows and compresses completed windows into latent tokens via a learned Window History Compressor. On the RSDense benchmark with 200–2,000 objects per image, WinAR improves RexOmni F1@IoU$=0.5$ from 32.16 to 39.36 while cutting redundancy from 35.48% to 13.00%, and it generalizes to parallel decoding and polygon outputs.

MLLM-based detectors formulate vision-language grounding as autoregressive coordinate generation, yet in dense scenes, they often collapse into a box repetition loop, repeatedly emitting identical boxes until the decoding budget is exhausted. We trace this failure to historical-answer attention takeover: Under full-history autoregression, repeated coordinate tokens in the growing answer history attract disproportionate attention, crowding out the attention sinks needed to attend to new visual evidence. % To break this loop, in this paper, we propose \textbf{Compressed Window Auto-Regression} (WinAR). This new mechanism partitions a long answer sequence into consecutive generation windows and restricts full token-level autoregression to the current window only while compressing each previous window into a fixed set of latent tokens that condition subsequent decoding. This design reduces the repeated exposure to raw historical coordinates that triggers the attention takeover, yet preserves cross-window dependencies essential for coherent multi-object generation. On RSDense, which contains 200-2,000 objects per image, our model WinARDet improves RexOmni F1-score (IoU=0.5) from 32.16 to 39.36 over the baseline, while reducing the redundancy rate from 35.48% to 13.00%. WinARDet also generalizes across decoding strategies and output formats, including parallel box decoding and polygon generation, providing a practical paradigm for long-horizon vision-language grounding across scene densities.
0
cs.CLcs.AIcs.CV Josh Barua, Kyle Mahowald, William Rudman · Oct 14, 2026

When text and images conflict in vision-language models, prior work has characterized behavior as modality-specific biases such as "blind faith in text." This paper proposes a predictive alternative: a two-parameter Bayesian cue combination rule in which each modality contributes conditionally independent evidence weighted by a constant integration bias, plus a prior. The authors show that this simple linear model accurately predicts how VLM preferences shift across dozens of input degradation conditions and even transfers to entirely new corruption types without refitting, offering a unified account of why text sometimes dominates and vision sometimes wins.

Vision-language models must reconcile conflicting text and images. Prior work has characterized the resulting behavior in terms of modality biases--e.g., a "blind faith in text"--but why preferences vary across models, domains, and input conditions remains unclear. We develop a predictive account from a Bayesian perspective, positing that VLMs combine conditionally independent evidence from each modality with prior beliefs, subject to modality-specific biases. The resulting two-parameter cue combination model accurately predicts VLM preferences under unseen combinations of input degradation and transfers to new forms of unreliability without refitting. Separating evidence strength from integration bias explains how VLMs can follow text even while weighting visual evidence more heavily, reconciling reports of text and vision dominance under a single combination rule.
0
cs.LGcs.CVeess.SP Akshay Malhotra, Nicolas Zilberstein, Shahab Hamidi-Rad · Oct 14, 2026

The paper solves zero-shot stitching of autoencoders: enabling an encoder from one independently trained model to work with a decoder from another. The core idea is a training-time topological regularizer based on 0-dimensional persistent homology (MST edges) that preserves the input data's geometric skeleton in each latent space, so that after training only a lightweight affine map is needed. This matters for distributed and privacy-sensitive settings where encoders and decoders cannot be jointly optimized or share weights.

As large, powerful pre-trained models become more prevalent, there is growing interest in developing methods that allow different neural networks to be seamlessly combined with little or no direct communication between them. Take autoencoder-based data compression as an example: the ability to independently choose architectures and train encoder and decoder models, while still ensuring they work together, could fundamentally transform how such models are built, deployed, and updated. In this work, we introduce a novel approach that leverages topological regularization to align the latent spaces of two independently trained autoencoder models, entirely eliminating the need for coordination during training. We provide a conditional theoretical analysis showing how the structural agreement encouraged by our regularizer can translate into approximate geometric compatibility between independently learned representations. Reconstruction experiments validate this approach empirically, substantially narrowing the interoperability gap across multiple datasets.