mlsanityData to 14 Oct 2026

Graph Learning Metallic Glass Discovery from Wikipedia

arXiv 2507.19536 ↗First posted 22 Jul 2025cs.LG cond-mat.dis-nn cond-mat.mtrl-scicited by 2

Not on the map. Why?

Abstract (arXiv)

Synthesizing new materials efficiently is highly demanded in various research fields. However, this process is usually slow and expensive, especially for metallic glasses, whose formation strongly depends on the optimal combinations of multiple elements to resist crystallization. This constraint renders only several thousands of candidates explored in the vast material space since 1960. Recently, data-driven approaches armed by advanced machine learning techniques provided alternative routes for intelligent materials design. Due to data scarcity and immature material encoding, the conventional tabular data is usually mined by statistical learning algorithms, giving limited model predictability and generalizability. Here, we propose sophisticated data learning from material network representations. The node elements are encoded from the Wikipedia by a language model. Graph neural networks with versatile architectures are designed to serve as recommendation systems to explore hidden relationships among materials. By employing Wikipedia embeddings from different languages, we assess the capability of natural languages in materials design. Our study proposes a new paradigm to harvesting new amorphous materials and beyond with artificial intelligence.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 3 of its 42 references that are in the map. First posted on arXiv 22 Jul 2025.

Builds on

3 of 42 references.

References · 3

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2019Neural Graph Collaborative Filteringcited by 661
  3. 2023TransGNN: Harnessing the Collaborative Power of Transformers and Graph Neural Networks for Recommender Systemscited by 11

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.