REVIEW 6 cited by
A Survey on Graph Structure Learning: Progress and Opportunities
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
A Survey on Graph Structure Learning: Progress and Opportunities
read the original abstract
Graphs are widely used to describe real-world objects and their interactions. Graph Neural Networks (GNNs) as a de facto model for analyzing graphstructured data, are highly sensitive to the quality of the given graph structures. Therefore, noisy or incomplete graphs often lead to unsatisfactory representations and prevent us from fully understanding the mechanism underlying the system. In pursuit of an optimal graph structure for downstream tasks, recent studies have sparked an effort around the central theme of Graph Structure Learning (GSL), which aims to jointly learn an optimized graph structure and corresponding graph representations. In the presented survey, we broadly review recent progress in GSL methods. Specifically, we first formulate a general pipeline of GSL and review state-of-the-art methods classified by the way of modeling graph structures, followed by applications of GSL across domains. Finally, we point out some issues in current studies and discuss future directions.
Forward citations
Cited by 6 Pith papers
-
Is Fixing Schema Graphs Necessary? Full-Resolution Graph Structure Learning for Relational Deep Learning
FROG makes full-resolution graph structure learnable in relational deep learning by modeling table roles as optimizable components in message passing, regularized by functional dependency constraints.
-
When LLM Agents Meet Graph Optimization: An Automated Data Quality Improvement Approach
LAGA is a unified multi-agent LLM framework that automates comprehensive quality optimization for text-attributed graphs by running detection, planning, action, and evaluation agents in a closed loop.
-
Blind Recovery of Latent Domains via Unsupervised Symmetry Discovery
Unsupervised symmetry discovery via shallow group-convolutional networks recovers latent domains from linear measurements of random fields by learning symmetry actions under stationarity and locality constraints.
-
Curb Your Attention: Causal Attention Gating for Robust Trajectory Prediction in Autonomous Driving
CRiTIC improves robustness of trajectory predictions against non-causal agents by up to 54% and cross-domain performance by up to 29% via a Causal Discovery Network and Causal Attention Gating in a Transformer.
-
OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation
OpenRTAG is a benchmark that organizes text-attributed-graph data-quality issues into a 3x3 taxonomy (text/structure/label by sparsity/noise/imbalance) and evaluates model robustness across nine datasets and three tasks.
-
Dynamic Elliptical Graph Factor Models via Riemannian Optimization with Geodesic Temporal Regularization
DEGfM is a dynamic elliptical graph factor model that performs Riemannian optimization on the Grassmann manifold with geodesic temporal regularization to infer time-varying precision matrices.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.