FrED: External Data Influence Estimation via Domain Knowledge Graph Grounding

• URL: http://arxiv.org/abs/2607.21615v1
• Date: Tue, 26 May 2026 15:14:34 GMT
• Title: FrED: External Data Influence Estimation via Domain Knowledge Graph Grounding
• Abstract summary: We propose a novel probabilistic framework that operates entirely in a black-box setting.<n>Our method fuses continuous feature similarities with discrete, domain-specific Knowledge Graphs.<n>We evaluate our framework across two distinct domains: abstract artistic image synthesis and high-dimensional physical weather forecasting.
• Score: 3.686386213696443
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The rapid deployment of generative AI has amplified the critical need for Training Data Attribution to ensure transparency and accountability. However, current parametric approaches require computationally prohibitive access to model weights, while similarity-based methods ignore deep structural context. We propose a novel probabilistic framework that operates entirely in a black-box setting. Our method fuses continuous feature similarities with discrete, domain-specific Knowledge Graphs (KGs). This approach ensures the attribution is grounded in structural reality, explicitly rewarding highly specific historical samples while preventing generic background data from dominating the results. We evaluate our framework across two distinct domains where linking outputs to data and domain context is inherently complex: abstract artistic image synthesis and high-dimensional physical weather forecasting. Extensive benchmarking demonstrates the robust efficacy of our approach. In the artistic domain, it achieves a strong Linear Datamodeling Score that exceeds standard black-box similarity baselines, while closing much of the gap to gradient-based estimators. We additionally present a cross-domain feasibility case study in environmental forecasting, where we use domain KGs to retrieve physically consistent historical analogs for regional flood forecasts, improving geographic localisation over a latent-only baseline. Operating entirely without internal model access, our approach provides an efficient, interpretable mechanism for post-hoc influence analysis and domain-grounded retrieval.

Related papers

• Overcoming the Modality Gap in Context-Aided Forecasting [54.976964834365056]
  We introduce a semi-synthetic data augmentation method that generates contexts both descriptive of temporal dynamics and verifiably complementary to numerical histories.<n>This approach enables massive-scale dataset creation, resulting in CAF-7M, a corpus of 7 million context-augmented time series windows.
  arXiv  Detail & Related papers  (2026-03-12T21:05:33Z)
• Explainable Human-in-the-Loop Segmentation via Critic Feedback Signals [0.20999222360659608]
  We propose a human-in-the-loop interactive framework that enables interventional learning through targeted human corrections of segmentation outputs.<n>We demonstrate that our framework improves segmentation accuracy by up to 9 mIoU points on challenging cubemap data.<n>This work provides a practical framework for researchers and practitioners seeking to build segmentation systems that are accurate, robust to dataset biases, data-efficient, and adaptable to real-world domains such as urban climate monitoring and autonomous driving.
  arXiv  Detail & Related papers  (2025-10-11T01:16:41Z)
• Domain Generalized Stereo Matching with Uncertainty-guided Data Augmentation [11.938635624781313]
  State-of-the-art stereo matching (SM) models often fail to generalize to real data domains due to domain differences.<n>We leverage data augmentation to expand the training domain, encouraging the model to acquire robust cross-domain feature representations.<n>Our approach is simple, architecture-agnostic, and can be integrated into any SM networks.
  arXiv  Detail & Related papers  (2025-08-02T10:26:53Z)
• DIDS: Domain Impact-aware Data Sampling for Large Language Model Training [61.10643823069603]
  We present Domain Impact-aware Data Sampling (DIDS) for large language models.<n>DIDS group training data based on learning effects, where a proxy language model and dimensionality reduction are employed.<n>It achieves 3.4% higher average performance while maintaining comparable training efficiency.
  arXiv  Detail & Related papers  (2025-04-17T13:09:38Z)
• Domain Specific Data Distillation and Multi-modal Embedding Generation [0.0]
  The challenge of creating domain-centric embeddings arises from the abundance of unstructured data and the scarcity of domain-specific structured data. This paper introduces a novel modeling approach that leverages structured data to filter noise from unstructured data, resulting in embeddings with high precision and recall for domain-specific attribute prediction.
  arXiv  Detail & Related papers  (2024-10-27T03:47:46Z)
• Optimal Aggregation of Prediction Intervals under Unsupervised Domain Shift [9.387706860375461]
  A distribution shift occurs when the underlying data-generating process changes, leading to a deviation in the model's performance. The prediction interval serves as a crucial tool for characterizing uncertainties induced by their underlying distribution. We propose methodologies for aggregating prediction intervals to obtain one with minimal width and adequate coverage on the target domain.
  arXiv  Detail & Related papers  (2024-05-16T17:55:42Z)
• Trust your Good Friends: Source-free Domain Adaptation by Reciprocal Neighborhood Clustering [50.46892302138662]
  We address the source-free domain adaptation problem, where the source pretrained model is adapted to the target domain in the absence of source data. Our method is based on the observation that target data, which might not align with the source domain classifier, still forms clear clusters. We demonstrate that this local structure can be efficiently captured by considering the local neighbors, the reciprocal neighbors, and the expanded neighborhood.
  arXiv  Detail & Related papers  (2023-09-01T15:31:18Z)
• One-Shot Domain Adaptive and Generalizable Semantic Segmentation with Class-Aware Cross-Domain Transformers [96.51828911883456]
  Unsupervised sim-to-real domain adaptation (UDA) for semantic segmentation aims to improve the real-world test performance of a model trained on simulated data. Traditional UDA often assumes that there are abundant unlabeled real-world data samples available during training for the adaptation. We explore the one-shot unsupervised sim-to-real domain adaptation (OSUDA) and generalization problem, where only one real-world data sample is available.
  arXiv  Detail & Related papers  (2022-12-14T15:54:15Z)
• Relation Matters: Foreground-aware Graph-based Relational Reasoning for Domain Adaptive Object Detection [81.07378219410182]
  We propose a new and general framework for DomainD, named Foreground-aware Graph-based Reasoning (FGRR) FGRR incorporates graph structures into the detection pipeline to explicitly model the intra- and inter-domain foreground object relations. Empirical results demonstrate that the proposed FGRR exceeds the state-of-the-art on four DomainD benchmarks.
  arXiv  Detail & Related papers  (2022-06-06T05:12:48Z)
• f-Domain-Adversarial Learning: Theory and Algorithms [82.97698406515667]
  Unsupervised domain adaptation is used in many machine learning applications where, during training, a model has access to unlabeled data in the target domain. We derive a novel generalization bound for domain adaptation that exploits a new measure of discrepancy between distributions based on a variational characterization of f-divergences.
  arXiv  Detail & Related papers  (2021-06-21T18:21: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.