Format-Constraint Coupling in Knowledge Graph Construction from Statistical Tables

• URL: http://arxiv.org/abs/2605.21974v1
• Date: Thu, 21 May 2026 04:08:42 GMT
• Title: Format-Constraint Coupling in Knowledge Graph Construction from Statistical Tables
• Abstract summary: We study country-by-year time-series matrices, a common layout on open-data portals.<n>Their joint effect exceeds the sum of independent effects by up to +1.180 (2x2 factorial, 6 datasets).<n> bootstrap 95% CIs are strictly positive on 4/6 datasets, with strongest evidence on wide Type-II matrices.
• Score: 2.1795865731681903
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: An extraction schema should not reduce knowledge graph fidelity. On statistical CSV, however, it can. We study country-by-year time-series matrices, a common layout on open-data portals. In this setting, serialization format and schema constraints interact super-additively. Their joint effect exceeds the sum of independent effects by up to +1.180 (2x2 factorial, 6 datasets). Bootstrap 95% CIs are strictly positive on 4/6 datasets, with strongest evidence on wide Type-II matrices. More critically, a schema applied to a mismatched format can trigger catastrophic mismatch. Fact coverage falls below the unconstrained baseline on 4/6 datasets through entity inflation or extraction refusal. We call this observed pattern format-constraint coupling. Probing and token ablation support a surface-form anchoring explanation centred on column-name references. Controlled variants across format-schema pairings, GraphRAG hosts, and LLM families show the same direction within the measured scope; one LLM family shows only partial activation. The observation also has a diagnostic consequence. Three standard retrieval modes largely mask construction quality (delta <= 1pp), whereas direct graph access exposes gaps up to +47.6pp (p < 0.0001). To support fidelity-aware evaluation, we release CSVFidelity-Bench. It contains 15 datasets, 11 Type-II matrices, 4 Type-III tables, and 1,892 Gold Standard facts across 6 domains.

Related papers

• Scaling Laws for Classical Machine Learning on Tabular Data: A Benchmark Study [0.0]
  127 graduate students each ran a fixed protocol on 3 assigned datasets.<n>For 5 of 6 families, a single family-level exponent predicts each family's cross-dataset curves nearly as well as per-dataset exponents.<n>We release the aggregated curves, per-cell fits, and a practical data-requirement table for N* to reach target error 0.15.
  arXiv  Detail & Related papers  (2026-07-23T23:45:09Z)
• Measuring the Dependency Gap: Diagnosing Inter-Column Fidelity in Tabular Generative Models [5.216183083750454]
  We introduce a dependency-aware fidelity diagnostic that decomposes a strong gradient-boosted classifier two-sample test (XGB-C2ST) into marginal, dependency, and numerical-categorical cross components.<n>We expose a real dependency gap that standard metrics miss and that tracks minority-class utility.
  arXiv  Detail & Related papers  (2026-07-20T23:56:32Z)
• The Contagion Tensor: A Framework for Measuring Output-Distribution Coupling in Multi-Agent LLM Systems -- and Auditing the Claims It Enables [1.0152838128195467]
  Contagion is a measurement framework for quantifying how large language model (LLM) output distributions couple across modalities, agents, and time steps.<n>We instantiate CAF in four variants and evaluate the strongest in a complete 2x2x2 block-orthogonal simulation design.<n>We supplement with real-API experiments across two model families: DeepSeek-Chat (R=30) and GPT-4o-mini (R=15, real vision)
  arXiv  Detail & Related papers  (2026-06-27T09:51:22Z)
• Lying Is Just a Phase: The Hidden Alignment Transition in Language Model Scaling [0.0]
  We measure the coupling between reasoning and truthfulness across 63 base models from 16 families.<n>We find a regime change invisible to loss curves below a family-dependent critical scale $N_c$, capabilities anticorrelate; above it, they cooperate.
  arXiv  Detail & Related papers  (2026-05-13T03:14:09Z)
• LINA: Linear Autoregressive Image Generative Models with Continuous Tokens [56.80443965097921]
  Autoregressive models with continuous tokens form a promising paradigm for visual generation, especially for text-to-image (T2I) synthesis.<n>We study how to design compute-efficient linear attention within this framework.<n>We present LINA, a simple and compute-efficient T2I model built entirely on linear attention, capable of generating high-fidelity 1024x1024 images from user instructions.
  arXiv  Detail & Related papers  (2026-01-30T06:44:33Z)
• Covariate-assisted graph matching [1.4466802614938332]
  We propose two novel graph matching methods, where a partial alignment for a set of nodes, called seeds, is known.<n>The effectiveness of our methods is demonstrated through numerical experiments and in an application to matching the statistics academic genealogy and the collaboration networks.
  arXiv  Detail & Related papers  (2025-12-12T18:12:56Z)
• IVGAE: Handling Incomplete Heterogeneous Data with a Variational Graph Autoencoder [4.935498694293104]
  We present textbfIVGAE, a Variational Graph Autoencoder framework for robust imputation of incomplete heterogeneous data.<n>IVGAE constructs a bipartite graph to represent sample-feature relationships and applies graph representation learning to model structural dependencies.<n>Experiments on 16 real-world datasets show that IVGAE achieves consistent improvements in RMSE and downstream F1 across MCAR, MAR, and MNAR missing scenarios under 30% missing rates.
  arXiv  Detail & Related papers  (2025-11-27T05:14:50Z)
• Unsupervised Visual Chain-of-Thought Reasoning via Preference Optimization [69.29207684569695]
  Chain-of-thought (CoT) reasoning greatly improves the interpretability and problem-solving abilities of multimodal large language models (MLLMs)<n>Existing approaches are focused on text CoT, limiting their ability to leverage visual cues.<n>In this paper, we introduce Unsupervised Visual CoT (UV-CoT), a novel framework for image-level CoT reasoning via preference optimization.
  arXiv  Detail & Related papers  (2025-04-25T14:48:18Z)
• DeCaFlow: A deconfounding causal generative model [48.86777554649186]
  We introduce DeCaFlow, a deconfounding causal generative model.<n>We extend previous results on causal estimation under hidden confounding to show that a single instance of DeCaFlow provides correct estimates for all causal queries identifiable with do-calculus.<n>Our empirical results on diverse settings show that DeCaFlow outperforms existing approaches, while demonstrating its out-of-the-box applicability to any given causal graph.
  arXiv  Detail & Related papers  (2025-03-19T11:14:16Z)
• Scalable Incomplete Multi-View Clustering with Structure Alignment [71.62781659121092]
  In this paper, we propose a novel incomplete anchor graph learning framework. We construct the view-specific anchor graph to capture the complementary information from different views. The time and space complexity of the proposed SIMVC-SA is proven to be linearly correlated with the number of samples.
  arXiv  Detail & Related papers  (2023-08-31T08:30:26Z)
• One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering [56.81492360414741]
  We show how to enforce a one-step normalized cut for bipartite graphs, especially with linear-time complexity. In this paper, we first characterize a novel one-step bipartite graph cut criterion with normalized constraints, and theoretically prove its equivalence to a trace problem. We extend this cut criterion to a scalable subspace clustering approach, where adaptive anchor learning, bipartite graph learning, and one-step normalized bipartite graph partitioning are simultaneously modeled.
  arXiv  Detail & Related papers  (2023-05-12T11:27:20Z)
• Data-Driven Subgroup Identification for Linear Regression [15.709279037284054]
  We propose DDGroup, a data-driven method to identify subgroups in the data with a uniform linear relationship between the features and the label. We show theoretically that DDGroup recovers a region where a single linear model with low variance is well-specified. Experiments show that DDGroup can uncover subgroups with qualitatively different relationships which are missed by simply applying parametric approaches to the whole dataset.
  arXiv  Detail & Related papers  (2023-04-29T08:32:09Z)
• Variational Estimators of the Degree-corrected Latent Block Model for Bipartite Networks [1.0923877073891446]
  We introduce the degree-corrected latent block model (DC-LBM), which accounts for the varying degrees in row and column clusters. We develop an efficient variational expectation-maximization algorithm by creating closed-form solutions for parameter estimates in the M steps.
  arXiv  Detail & Related papers  (2022-06-16T22:04:53Z)
• Align then Fusion: Generalized Large-scale Multi-view Clustering with Anchor Matching Correspondences [53.09276639185084]
  Multi-view anchor graph clustering selects representative anchors to avoid full pair-wise similarities. Existing approaches do not pay sufficient attention to establishing correct correspondences between the anchor sets across views.
  arXiv  Detail & Related papers  (2022-05-30T13:07:40Z)
• Examining and Combating Spurious Features under Distribution Shift [94.31956965507085]
  We define and analyze robust and spurious representations using the information-theoretic concept of minimal sufficient statistics. We prove that even when there is only bias of the input distribution, models can still pick up spurious features from their training data. Inspired by our analysis, we demonstrate that group DRO can fail when groups do not directly account for various spurious correlations.
  arXiv  Detail & Related papers  (2021-06-14T05:39:09Z)

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.