- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper addresses relation collision in visual table retrieval. The problem arises when page-wide late interaction matches query tokens to values and labels from different rows or columns. The proposed method, DeltaBind, uses predicted table structure to crop each value together with its row label and column header into a relation tile, scores each tile with a frozen retriever, and ranks each table by its best tile. DeltaBind improves ColQwen2’s pair accuracy.
Critical strengths
- The problem is well motivated.
- The authors construct datasets that isolate the problem.
Critical weaknesses
-
The evaluated task is narrower than the claimed retrieval problem, which leaves the target community unclear. The title and abstract present the work as visual table retrieval, but what is actually evaluated is reranking within a candidate group given in advance. The candidates are 2–8 tables from the same source, and which tables form a group, and whether they are aligned, is decided by the authors rather than the system. The paper cites a large-scale benchmark that treats tables as images [1], on which the method could have been evaluated as a reranker on top of a first-stage retriever, but this was not done. As a result, it is unclear which community the paper aims to contribute to. It is framed as visual document retrieval, but its evaluation draws on claim verification datasets (TabFact, SciClaimEval), and the aligned setting resembles document version comparison. Each of these communities would expect different baselines and benchmarks, and the paper does not position itself against any of them.
-
The motivating setting is not evaluated. The introduction motivates the problem with revisions in which only a few cells change, so that shared content obscures the difference between versions. This problem should become more severe as tables grow larger and the fraction of changed cells shrinks, yet no evaluation covers this condition. HumanBind excludes tables with more than 12 rows or 8 columns, and on SciClaimEval, the only aligned setting not built from synthetic swaps, DeltaBind falls below the flat baseline. The core motivation therefore remains unsupported.
-
The failure to distinguish cases with the same words but different bindings has already been reported for VLMs [2, 3]. For tables, there are existing approaches that classify rows and columns separately and locate relevant cells at their intersection [4], and approaches that use a row combined with its headers as the retrieval unit [5]. The method itself is largely a combination of existing techniques. Splitting a table into relation units and taking the maximum score among them has the same structure as scoring a document by its best passage score [6]. Within each unit, standard late interaction [7] is used as is, and change filtering is classical image differencing. Since the components are not new, the contribution would need to rest on showing why their combination works, but the experiments do not isolate where the gains come from.
[1] D. Li et al., “Beyond Text-Only: Towards Multimodal Table Retrieval in Open-World,” ICLR 2026.
[2] T. Thrush et al., “Winoground: Probing Vision and Language Models for Visio-Linguistic Compositionality,” CVPR 2022.
[3] M. Yuksekgonul et al., “When and Why Vision-Language Models Behave like Bags-of-Words, and What to Do About It?,” ICLR 2023.
[4] M. Glass et al., “Capturing Row and Column Semantics in Transformer Based Question Answering over Tables,” NAACL 2021.
[5] W. Chen et al., “Open Question Answering over Tables and Text,” ICLR 2021.
[6] Z. Dai and J. Callan, “Deeper Text Understanding for IR with Contextual Neural Language Modeling,” SIGIR 2019.
[7] O. Khattab and M. Zaharia, “ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT,” SIGIR 2020.
Questions for authors
- In a deployed system, who determines the candidate groups and whether a group is aligned? If this requires an oracle, the practical scope of the method changes considerably.
- How much of the gain comes from restricting matches to a single relation, as opposed to cropping and enlarging cells and adding role labels? For example, what happens if the original page-level patch embeddings are pooled within each predicted cell box and the shared-witness rule is applied directly, without cropping or enlarging?