Identifiability of Relational Queries in Multi-View Pretraining

• URL: http://arxiv.org/abs/2607.04735v1
• Date: Mon, 06 Jul 2026 07:18:00 GMT
• Title: Identifiability of Relational Queries in Multi-View Pretraining
• Abstract summary: Two globally consistent worlds can agree on every shared attribute yet disagree on the query answer.<n>This ambiguity is structural -- a property of the interface design, not the data volume.<n>We formalize query identifiability for data integration under interface laws.
• Score: 0.500301731167245
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: When data sources are integrated through a shared interface, a downstream query may or may not be determined by what the interface exposes: two globally consistent worlds can agree on every shared attribute yet disagree on the query answer. This ambiguity is structural -- a property of the interface design, not the data volume -- and cannot be resolved by collecting more records or training a larger model. We formalize query identifiability for data integration under interface laws (functional dependencies that hold uniformly across all legal worlds rather than within a single instance) and prove three results. (i) A polynomial-time certificate (CheckCert) decides identifiability via attribute closure, and is exact on instances that expose any residual ambiguity (closure-separable). (ii) Non-identifiable queries face an irreducible 1/2 minimax error floor for any estimator using only interface evidence, bounding multi-view pretraining systems from below. (iii) A minimum-augmentation algorithm (Greedy-MinAug) finds the smallest set of interface additions to certify a query, reducing to Set Cover (logarithmic approximation). Experiments on synthetic benchmarks, real integration datasets spanning three domains (scholarly, product, restaurant), and schemas up to 10^3 attributes confirm CheckCert is exact, both algorithms run in single-digit milliseconds, and ML classifiers exhibit the predicted error floor and abrupt capability gains.

Related papers

• SAM3-LoRA: Parameter-Efficient Adaptation of a Concept-Promptable Foundation Model for Multi-Class Structural Defect Segmentation [0.0]
  This study applies Low-Rank Adaptation (LoRA) to SAM3 for multi-class structural defect segmentation.<n>We describe a supervision procedure that trains a concept-promptable model directly from COCO-style class-labeled instance segmentation.
  arXiv  Detail & Related papers  (2026-08-31T23:19:59Z)
• A Unified Backbone--Expert Framework with Relation-Token and Residual--Classifier Interfaces for Automatic Modulation Recognition [1.547549252134621]
  We propose a unified backbone-expert framework with a common convolutional state-space backbone and two specialized interfaces.<n>Our framework achieves overall average accuracies of 67.28 pm 0.14% on RML2016.10b and 87.19 pm 0.77% on HisarMod 2019.
  arXiv  Detail & Related papers  (2026-08-15T10:26:42Z)
• Topology-Aware Query Selection for Surgical Instrument Instance Segmentation [8.051653068935332]
  Final query selection is a relational, variable-cardinality problem rather than a collection of independent candidate decisions.<n>We evaluate topology-aware query selection, which represents the nonempty candidates of a fixed Mask2Former as a complete graph.<n>We show that the evaluated complete path improved coherent instance-set construction from fixed Mask2Former candidates in specified native-instance contracts.
  arXiv  Detail & Related papers  (2026-08-12T03:29:47Z)
• PluginEval: A Diagnostic Benchmark for Fine-Grained Error Attribution in Function Calling [11.1017602726296]
  Large Language Models increasingly operate as autonomous agents.<n>Current benchmarks face three structural limitations.<n>Eval is a benchmark constructed through a two-stage framework.
  arXiv  Detail & Related papers  (2026-08-09T13:25:54Z)
• SEER: A Self-Grounded Evidence Interface for Controlled Spatial Relation Classification [71.9783246097687]
  SEER hides candidate relations during pair localization, constructs a query-specific view with explicit subject/object roles, and retains the full image and sparse box geometry as complementary evidence.<n>For relation-choice protocols with exact inverse support, an optional refinement swaps the entity roles and changes the forward decision only when exactly one visual state obeys the corresponding inverse relation.<n>The unchanged protocol yields +4.35 to +11.79 on all 2,434 filtered EmbSpatial pair-relation questions across three models.
  arXiv  Detail & Related papers  (2026-08-04T13:16:15Z)
• Iterative Causal Discovery: Per-Edge Impossibility Certificates, Tier-Aware Oracle Queries, and the $1+K$ Lower Bound [0.0]
  Causal-discovery algorithms return a directed graph, but provide no principled means of distinguishing edge directions identified by the data from those assigned without an identifying assumption.<n>We introduce a protocol for observational causal discovery on continuous data that attaches to each candidate edge a discrete impossibility certificate.<n>Two oracle primitives, the meta-hub query and the node-children query, jointly establish an upper bound of $1+K$ expert interactions sufficient to recover any DAG.
  arXiv  Detail & Related papers  (2026-05-26T12:01:32Z)
• Beyond Fixed Benchmarks and Worst-Case Attacks: Dynamic Boundary Evaluation for Language Models [20.61766907174782]
  We propose Dynamic Boundary Evaluation (DBE), which actively locates each model's boundary and places it on a globally comparable difficulty scale.<n>DBE delivers three artifacts: (i) a calibrated item bank covering safety, capability, and truthfulness, with per-item difficulty labels validated across $9$ reference LLMs; (ii) Skill-Guided Boundary Search (SGBS), a search algorithm that finds boundary items for a given target LLM using only API-level query access; and (iii) an evaluation protocol that places a new LLM on a unified ability scale and grows the evaluation set adaptively when the target falls outside
  arXiv  Detail & Related papers  (2026-05-07T13:15:31Z)
• A Tight Expressivity Hierarchy for GNN-Based Entity Resolution in Master Data Management [2.4366811507669115]
  We prove a four-theorem separation theory on typed entity-attribute graphs.<n>For each predicate we prove tight bounds -- constructing graph pairs provably indistinguishable by every MPNN lacking the required adaptation.<n>Results yield a minimal-architecture principle: practitioners can select the cheapest sufficient adaptation set, with a guarantee that no simpler architecture works.
  arXiv  Detail & Related papers  (2026-03-28T06:38:03Z)
• Towards One-for-All Anomaly Detection for Tabular Data [87.63505963517512]
  Tabular anomaly detection (TAD) is critical in many real-world applications.<n>We propose OFA-TAD, a framework that only requires one-time training on multiple source datasets.<n>Experiments on 34 datasets from 14 domains demonstrate that OFA-TAD achieves superior anomaly detection performance.
  arXiv  Detail & Related papers  (2026-03-15T14:42:05Z)
• Causal Identification from Counterfactual Data: Completeness and Bounding Results [54.147490305295456]
  We develop an algorithm for identifying counterfactual queries from an arbitrary set of Layer 3 distributions.<n>We establish the theoretical limit of which counterfactuals can be identified from physically realizable distributions.<n>We derive novel analytic bounds for such quantities using realizable counterfactual data.
  arXiv  Detail & Related papers  (2026-02-26T22:48:12Z)
• WeDetect: Fast Open-Vocabulary Object Detection as Retrieval [74.39703419628829]
  Open-vocabulary object detection aims to detect arbitrary classes via text prompts.<n> Methods without cross-modal fusion layers (non-fusion) offer faster inference by treating recognition as a retrieval problem.<n>We develop a model family named WeDetect to achieve state-of-the-art performance across 15 benchmarks with high inference efficiency.
  arXiv  Detail & Related papers  (2025-12-13T12:40:28Z)
• MR$^2$-Bench: Going Beyond Matching to Reasoning in Multimodal Retrieval [86.35779264575154]
  Multimodal retrieval is becoming a crucial component of modern AI applications, yet its evaluation lags behind the demands of more realistic and challenging scenarios.<n>We introduce MR$2$-Bench, a reasoning-intensive benchmark for multimodal retrieval.
  arXiv  Detail & Related papers  (2025-09-30T15:09:14Z)
• CompassVerifier: A Unified and Robust Verifier for LLMs Evaluation and Outcome Reward [50.97588334916863]
  We develop CompassVerifier, an accurate and robust lightweight verifier model for evaluation and outcome reward.<n>It demonstrates multi-domain competency spanning math, knowledge, and diverse reasoning tasks, with the capability to process various answer types.<n>We introduce VerifierBench benchmark comprising model outputs collected from multiple data sources, augmented through manual analysis of metaerror patterns to enhance CompassVerifier.
  arXiv  Detail & Related papers  (2025-08-05T17:55:24Z)
• DDL: A Large-Scale Datasets for Deepfake Detection and Localization in Diversified Real-World Scenarios [51.916287988122406]
  We present a novel large-scale deepfake detection and localization (textbfDDL) dataset containing over $textbf1.4M+$ forged samples.<n>Our DDL not only provides a more challenging benchmark for complex real-world forgeries but also offers crucial support for building next-generation deepfake detection, localization, and interpretability methods.
  arXiv  Detail & Related papers  (2025-06-29T15:29:03Z)
• Table Integration in Data Lakes Unleashed: Pairwise Integrability Judgment, Integrable Set Discovery, and Multi-Tuple Conflict Resolution [11.719923132819158]
  We train a binary-supervised adversarial learning algorithm to address the task of pairwise integrability judgment.<n>We introduce an innovative in-context learning methodology to tackle multi-tuple conflict resolution.
  arXiv  Detail & Related papers  (2024-11-30T02:45:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.