Pith. sign in

REVIEW 3 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

arxiv 2103.03036 v2 pith:H4O72NSB submitted 2021-03-04 cs.LG cs.SI

classification cs.LGcs.SI
keywords graphstructuregraphslearningmethodsprogressrecentrepresentations
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation

    cs.AI 2026-07 conditional novelty 5.0 of 10

    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.

  2. Graph-Augmented Large Language Model Agents: Current Progress and Future Prospects

    cs.AI 2025-07 conditional novelty 3.0 of 10

    A survey that categorizes Graph-augmented LLM Agent research into planning, memory, tool management, and multi-agent design, and outlines open directions.

  3. Finding the Cores of Higher Graphs Using Geometric and Topological Means: A Survey

    math.HO 2025-06 accept novelty 2.0 of 10

    A structured review of geometric and topological methods for extracting small core representations from graphs, hypergraphs, and simplicial complexes.

Pith tools