paper-with-me

Papers

HulluEdit: Single-Pass Evidence-Consistent Subspace Editing for Mitigating Hallucinations in Large Vision-Language Models

2026-02-26 · Yangguang Lin, Quan Fang, Yufei Li, Jiachen Sun, Junyu Gao, Jitao Sang arxiv

Object hallucination in Large Vision-Language Models (LVLMs) significantly hinders their reliable deployment. Existing methods struggle to balance efficiency and accuracy: they often require expensive reference models and multiple forward passes, or apply static edits that risk suppressing genuine visual evidence. To address this, we introduce HulluEdit, a single-pass, reference-free intervention framework. Our core innovation is orthogonal subspace editing: we decompose the hidden states of the model into orthogonal subspaces - visual evidence, conflicting priors, and residual uncertainty - enabling selective suppression of hallucinatory patterns without interfering with visual grounding. This approach mathematically guarantees that edits applied to the prior subspace leave the visual component entirely unaffected. Extensive experiments show that HulluEdit achieves state-of-the-art hallucination reduction on benchmarks including POPE and CHAIR across diverse architectures, while preserving general capabilities on MME and maintaining efficient inference. Our method consistently outperforms contrastive decoding and static subspace editing baselines, offering a new pathway toward more trustworthy LVLMs.

📄 PDF Abstract BibTeX arXiv:2602.22727

Code (0)

등록된 구현이 없습니다.

Tasks

Visual Grounding

Similar Papers 제목 키워드 기반

Mechanistic Evidence for Spectral Structures in Prior-Data Fitted Networks

2026-01-29 · Kaustubh Sharma, Srijan Tiwari, Ojasva Nema, Parikshit Pareek arxiv

Prior-Data Fitted Networks (PFNs) enable amortized Bayesian inference in a single forward pass, yet their internal representations remain opaque. It is unknown whether PFNs encode identifiable Bayesian structure or merel…

Bayesian Inference

On Subspace Approximation and Subset Selection in Fewer Passes by MCMC Sampling

2021-03-20 · Amit Deshpande, Rameshwar Pratap

We consider the problem of subset selection for $\ell_{p}$ subspace approximation, i.e., given $n$ points in $d$ dimensions, we need to pick a small, representative subset of the given points such that its span gives $(1…

Safe-Subspace Pseudo-Label Refinement for Source-Free Graph Domain Adaptation

2026-05-30 · Yingxu Wang, Xinwang Liu, Siyang Gao, Nan Yin arxiv

Source-free graph domain adaptation (SF-GDA) aims to adapt source-trained graph models to unlabeled target graphs when source graphs are no longer accessible. A central obstacle is pseudo-label reliability: under feature…

GRAPH DOMAIN ADAPTATIONContrastive Learning

Exploring System 1 and 2 communication for latent reasoning in LLMs

2025-10-01 · Julian Coda-Forno, Zhuokai Zhao, Qiang Zhang, Dipesh Tamboli 외 arxiv

Should LLM reasoning live in a separate module, or within a single model's forward pass and representational space? We study dual-architecture latent reasoning, where a fluent Base exchanges latent messages with a Coproc…

A Fano-Style Accuracy Upper Bound for LLM Single-Pass Reasoning in Multi-Hop QA

2025-09-25 · Kaiyang Wan, Lang Gao, Honglin Mu, Preslav Nakov 외 arxiv

Multi-Hop Question Answering (MHQA) requires integrating dispersed, interdependent evidence through sequential reasoning under noise. This task is challenging for LLMs as they have a finite per-pass output capacity, beyo…

Multi-hop Question Answering