REVIEW 8 cited by
Revisiting Semi-Supervised Learning with Graph Embeddings
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
Signed reviews
read the original abstract
We present a semi-supervised learning framework based on graph embeddings. Given a graph between instances, we train an embedding for each instance to jointly predict the class label and the neighborhood context in the graph. We develop both transductive and inductive variants of our method. In the transductive variant of our method, the class labels are determined by both the learned embeddings and input feature vectors, while in the inductive variant, the embeddings are defined as a parametric function of the feature vectors, so predictions can be made on instances not seen during training. On a large and diverse set of benchmark tasks, including text classification, distantly supervised entity extraction, and entity classification, we show improved performance over many of the existing models.
Forward citations
Cited by 8 Pith papers
-
Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement
ACE adds a heterophily-aware auxiliary loss to coarsening-based GNN training, recovering discarded node-level information and improving accuracy on heterophilic graphs by up to ~15 points.
-
A Graph Talks, But Who's Listening? Rethinking Evaluations for Graph-Language Models
Graph-language models give no advantage over prompt-tuned LLMs on a new synthetic graph question-answering benchmark, while existing node-classification benchmarks can be solved using a single modality.
-
Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening
A partition-wise graph filtering method, CPF, unifies graph-wise and node-wise filtering and achieves state-of-the-art node classification on 13 benchmark graphs and anomaly detection on 3 datasets.
-
Semi-Implicit Graph Variational Auto-Encoders
A graph auto-encoder with hierarchical random layers and a sparse-link decoder outperforms previous graph neural networks on link prediction and graph generation.
-
Snowball: Iterative Model Evolution and Confident Sample Discovery for Semi-Supervised Learning on Very Small Labeled Datasets
Snowball couples master-teacher-student consistency training with iterative confident-sample discovery, achieving 11.81% error on CIFAR-10 with only 250 labels, versus 49.91% for Mean-Teacher.
-
Graph-Structured Data Analysis of Component Failure in Autonomous Cargo Ships Based on Feature Fusion
A graph-structured failure-mode dataset for autonomous cargo ships, built with Word2Vec, BERT-KPCA, and Sentence-BERT features, is presented with GNN classification accuracy of 0.735.
-
Scalability Matters: Overcoming Challenges in InstructGLM with Similarity-Degree-Based Sampling
SDM-InstructGLM uses a similarity-degree biased random walk to sample graph neighborhoods for LLM prompts, reporting gains over InstructGLM on CORA and PUBMED that are confounded by a change in node features and train...
-
Graph Representation Learning: A Survey
A survey of graph embedding methods with a small benchmark comparison of seven methods on citation and social network data, and an advertised code library that is not provided.
Discussion (0). Continue with ORCID to comment.