2025· Neural Information Processing Systems· pp. 176519-176561· 0 citations· 56 references
Computer Science
TL;DR
This paper provides a theoretical analysis of the impact of deviation in edge weights during the optimization process of structure learning and proposes the PGAP framework, which detects two special graph patterns that arise due to the deviation and shows that their occurrence increases as the degree of deviation grows.
Abstract
Learning the causality between variables, known as DAG structure learning, is critical yet challenging due to issues such as insufficient data and noise. While prior knowledge can improve the learning process and refine the DAG structure, incorporating prior knowledge is not without pitfalls. In particular, we find that the gap between the imprecise prior knowledge and the exact weights modeled by existing methods may result in deviation in edge weights. Such deviation can subsequently cause significant inaccuracies when learning the DAG structure. This paper addresses this challenge by providing a theoretical analysis of the impact of deviation in edge weights during the optimization process of structure learning. We identify two special graph patterns that arise due to the deviation and show that their occurrence increases as the degree of deviation grows. Building on this analysis, we propose the P attern-G uided A daptive P rior (PGAP) framework. PGAP detects these patterns as structural signals during optimization and adaptively adjusts the structure learning process to counteract the identified weight deviation, thereby improving the integration of prior knowledge. Experiments verify the effectiveness and robustness of the proposed method.
Automated data preparation is a critical bottleneck in machine learning on tabular data. Existing methods largely search over a fixed linear sequence of operations, even tools that branch by feature type use hand-specified, rule-based branches that cannot adapt operation composition to individual features. This limits...
Jing Chang, Chang Liu· Proceedings of the 32nd ACM...· 0 citations
This study focuses on learning causal directed acyclic graphs (DAGs) under heteroscedastic noise models (HNMs), where each effect is modeled as a function of its causes and a Gaussian noise term whose variance depends on the causes. While HNMs theoretically guarantee identifiability of causal structures, we show that g...
Eunjung Choi, Seonggyeom Kim, Dong-Kyu Chae· Proceedings of the 32nd ACM...· 0 citations
Existing graph-clustering methods typically improve clustering performance by optimizing model parameters and node representations. Effective means of further improving the clustering results of an already trained and frozen model, however, remain limited. We study post-processing for frozen graph clustering. After che...
Ensuring fairness when training machine learning (ML) models remains a critical challenge, particularly when biases are embedded in the underlying data. This paper presents a fairness-aware graph structure learning framework demonstrating how learning fair graphs leads to fairer data for ML training and, consequently,...
V. Jiang, Gustavo Batista, Michael Bain· Knowledge and Information Sy...· 0 citations
A novel GNN-based LP model via local clustering and subgraphs, termed LCS, is proposed to effectively address the heterogeneous characteristics inherent in complex BNs, along with the consequent challenges of asymmetry and hierarchical modularity.
Xiao-Long Liu, Jianxia Chen, Wenzhe Chen et al.· Journal of Computational Bio...· 0 citations
A Constraint-Guided Dynamic Graph Network (ConDyGNet), whose core idea is “global basis, dynamic weights”, which learns a low-rank global basis as a shared structural constraint and generates patch-wise basis mixing weights to construct dynamic propagation graphs.
Zhen-Zhou Li, Xiang Li, Zhibin Niu· Proceedings of the Thirty-Fi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.