A Maximum Entropy approach to Massive Graph Spectra
Graph spectral techniques for measuring graph similarity, or for learning the cluster number, require kernel smoothing. The choice of kernel function and bandwidth are typically chosen in an ad-hoc manner and heavily affect the resulting output. We prove that kernel smoothing biases the moments of the spectral density. We propose an information theoretically optimal approach to learn a smooth graph spectral density, which fully respects the moment information. Our method's computational cost is linear in the number of edges, and hence can be applied to large networks, with millions of nodes. We apply our method to the problems to graph similarity and cluster number learning, where we outperform comparable iterative spectral approaches on synthetic and real graphs.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph SimilaritySimilar Papers 제목 키워드 기반
Handling Missing Data via Max-Entropy Regularized Graph Autoencoder
Graph neural networks (GNNs) are popular weapons for modeling relational data. Existing GNNs are not specified for attribute-incomplete graphs, making missing attribute imputation a burning issue. Until recently, many wo…
AttributeImputationEntropic Spectral Learning for Large-Scale Graphs
Graph spectra have been successfully used to classify network types, compute the similarity between graphs, and determine the number of communities in a network. For large graphs, where an eigen-decomposition is infeasib…
Community DetectionSpectral Kernel Dynamics via Maximum Caliber: Fixed Points, Geodesics, and Phase Transitions
We derive a closed-form geometric functional for kernel dynamics on finite graphs by applying the Maximum Caliber (MaxCal) variational principle to the spectral transfer function h(lambda) of the graph Laplacian eigenbas…
The Maximum von Neumann Entropy Principle: Theory and Applications in Machine Learning
Von Neumann entropy (VNE) is a fundamental quantity in quantum information theory and has recently been adopted in machine learning as a spectral measure of diversity for kernel matrices and kernel covariance operators. …
Machine learning Hadron Spectral Functions in Lattice QCD
Hadron spectral functions carry all the information of hadrons and are encoded in the Euclidean two-point correlation functions. The extraction of hadron spectral functions from the correlator is a typical ill-posed inve…
BIG-bench Machine Learning