AI & ML
Hypergraph-Enhanced Evidence Selection for Long-Context Multimodal Document QA
arXiv cs.DB0 views
arXiv:2610.35542v1 Announce Type: cross Abstract: Long-context multimodal document question answering (QA) has become an important yet challenging task for modern vision-language models (VLMs), as it requires reasoning over evidence dispersed across pages and modalities within limited input budgets. Current pipelines adopt retrieval-augmented generation (RAG) to select multimodal evidence for downstream VLMs. However, existing systems mainly rely on static selection rules over fixed-granularity retrieval units such as pages or blocks, resulting in information loss during retrieval and suboptimal performance in downstream reasoning. To alleviate these issues, we formulate the core task as budget-aware evidence selection over structured document evidence and propose HyperDoc, a document RAG framework that constructs compact yet sufficient evidence while preserving document relations. Specifically, HyperDoc constructs a document hypergraph to explicitly capture structural, logical, and cross-modal relationships among multimodal document elements. Over this structured evidence space, HyperDoc performs adaptive cost-aware hyperedge selection based on query intent and input budget. Extensive experiments on three representative benchmarks demonstrate that HyperDoc outperforms various types of state-of-the-art baselines.
Source:https://arxiv.org/abs/2610.35542PreviousCoPE-CGL: Community-aware Prototype Extraction for Replay-Free Continual Graph LearningNextLSM-Vec: A Memory-Efficient Disk-Based System for Large-Scale Dynamic Vector Search
Related posts
Sharp Non-Asymptotic Analysis of the Penalized Challenger in $\beta$-EB-TCI for Bernoulli Bandits
0arXiv stat.ML
Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary
0arXiv stat.ML
Spectral Condition for $\mu$P under Width-Depth Scaling
0arXiv stat.ML
A Function-Space Stability Boundary for Generalization in Interpolating Learning Systems
0arXiv stat.ML
Who Gets Watched? Allocating Scarce Escalation Resources on Pediatric Wards with Neural Index Policies
0arXiv stat.ML
Minimax Alternating Regret for the Experts Problem and Online Convex Optimization
0arXiv stat.ML