Growing Better Graphs With Latent-Variable Probabilistic Graph Grammars
Recent work in graph models has found that probabilistic hyperedge replacement grammars (HRGs) can be extracted from graphs and used to generate new random graphs with graph properties and substructures close to the original. In this paper, we show how to add latent variables to the model, trained using Expectation-Maximization, to generate still better graphs, that is, ones that generalize better to the test data. We evaluate the new method by separating training and test graphs, building the model on the former and measuring the likelihood of the latter, as a more stringent test of how well the model can generalize to new graphs. On this metric, we find that our latent-variable HRGs consistently outperform several existing graph models and provide interesting insights into the building blocks of real world networks.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Differential equation and probability inspired graph neural networks for latent variable learning
Probabilistic theory and differential equation are powerful tools for the interpretability and guidance of the design of machine learning models, especially for illuminating the mathematical motivation of learning latent…
Stock Predictiontext-classificationText ClassificationVariational InferenceTensor Variable Elimination for Plated Factor Graphs
A wide class of machine learning algorithms can be reduced to variable elimination on factor graphs. While factor graphs provide a unifying notation for these algorithms, they do not provide a compact way to express repe…
Music ModelingProbabilistic ProgrammingSentiment Analysistensor algebraA Full DAG Score-Based Algorithm for Learning Causal Bayesian Networks with Latent Confounders
Causal Bayesian networks (CBN) are popular graphical probabilistic models that encode causal relations among variables. Learning their graphical structure from observational data has received a lot of attention in the li…
Extracting Latent Structure From Multiple Interacting Neural Populations
Developments in neural recording technology are rapidly enabling the recording of populations of neurons in multiple brain areas simultaneously, as well as the identification of the types of neurons being recorded (e.g.,…
The Supervised IBP: Neighbourhood Preserving Infinite Latent Feature Models
We propose a probabilistic model to infer supervised latent variables in the Hamming space from observed data. Our model allows simultaneous inference of the number of binary latent variables, and their values. The laten…
Retrieval