Feb. 16, 2024, 5:42 a.m. | Maria B{\aa}nkestad, Jennifer Andersson, Sebastian Mair, Jens Sj\"olund

cs.LG updates on arXiv.org arxiv.org

arXiv:2402.10206v1 Announce Type: new
Abstract: Reducing a graph while preserving its overall structure is an important problem with many applications. Typically, the reduction approaches either remove edges (sparsification) or merge nodes (coarsening) in an unsupervised way with no specific downstream task in mind. In this paper, we present an approach for subsampling graph structures using an Ising model defined on either the nodes or edges and learning the external magnetic field of the Ising model using a graph neural network. …

abstract applications arxiv cs.ai cs.lg graph merge mind nodes paper type unsupervised via

Founding AI Engineer, Agents

@ Occam AI | New York

AI Engineer Intern, Agents

@ Occam AI | US

AI Research Scientist

@ Vara | Berlin, Germany and Remote

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne