The support/query information boundary is identified as an important component of reliable relational ICL evaluation as well as a concern with native-schema leakage candidates from the original relational schema.
Abstract
Relational in-context learning (ICL) uses labeled support examples and their linked relational context to predict labels for new queries. This creates a failure mode when target-derived features are present in the support context but unavailable for the query. We study this setting as support-set target leakage. We construct 20 controlled target-derived features that vary in signal fidelity, representation, semantic transparency, coverage, and zero-, one-, and two-hop relational placement, and evaluate them across 13 RelBench tasks and five relational ICL configurations that vary the ICL head, message-passing depth, pretraining cohort, or relational encoder architecture. We evaluate matched 0-hop, 1-hop, and 2-hop leakage settings, together with a Full leakage condition containing all 20 leaker columns. Within the tested configurations, target-table (0-hop) and Full leakage produce the largest aggregate deviations from clean evaluation, while higher-hop effects are often weaker, consistent with differences in effective exposure associated with temporal reachability, sampling, and aggregation fidelity. Leakage effects are strongly task- and model-dependent and can reverse relative conclusions between model variants even when aggregate changes are small. For leaker detection, we compare an Integrated Gradients (IG)-based screening method with mutual information (MI) and leave-one-column-out (LOCO) on a common Baseline subset. Ranking quality is strongest in the high-impact 0-hop and Full leakage conditions, but detector-based removal does not consistently restore the clean evaluation. A four-task rel-salt case study further shows the same evaluation concern with native-schema leakage candidates from the original relational schema. These results identify the support/query information boundary as an important component of reliable relational ICL evaluation.
This work evaluates a frozen relational encoder with an ICL head on held-out RelBench databases and uses Integrated Gradients to rank and remove suspicious columns, showing that the effect of support-set leakage varies across tasks and relational distances.
Roshan Reddy Upendra, Alexandre Dorais, Joe Meyer et al.· 0 citations
This work investigates context construction for node-level graph ICL: which labeled nodes and auxiliary unlabeled nodes should constitute the prompt for specified queries, and identifies when retrieval channels work best and connects their behavior with graph properties.
Ming-Qi Yang, Zi-Dong-Wei-Zhi-Yuan-He-Tongtang Guo, Ji-Hui Yang et al.· 1 citation
Tabular in-context learning (ICL) has emerged as a training-free and accurate paradigm for tabular prediction, but current approaches to compressing its in-context examples face an accuracy-throughput tradeoff: fixed subsets can sacrifice accuracy, while query-specific retrieval limits cache reuse and batching across q...
Xu Zhao, Jia-Ming Zhao, Bing-Yan Zhao et al.· 0 citations
This work introduces DocHop, a benchmark for integrated chart--context reasoning in document-style images and constructs DocHop via a stochastic logic-first generation pipeline with controllable reasoning depth and visual density, to enable systematic evaluation.
Zhuo-Ran Yu, Le Thien Phuc Nguyen, Jaden Park et al.· 1 citation
It is argued that soft-token fusion requires stronger alignment objectives and schema-aware design before it can serve as a reliable route to relational prediction.
Francisco Galuppo Azevedo, Clarissa Lima Loures· 0 citations
The results show that explicitly selecting and integrating evidence improves long-context reasoning while enabling more compact generation, and the strongest overall result among the evaluated open-source models is obtained.