GraphVRNN generates graphs with latent variables and node attributes.
problem Generating diverse and complex graph structures.
method Probabilistic autoregressive model for graph generation.
result GraphVRNN can model complicated distributions and generate plausible structures and node attributes.
Deep neural networks maximize variation when few nodes change activation.
problem Maximizing variation in deep neural networks.
method Theoretical analysis of ReLU activation function and layer node numbers.
result Maximal variation occurs when few nodes change activation.
Develops a new variational estimator for node popularity in bipartite networks.
problem Estimating node popularity in bipartite networks with varying patterns.
method Variational Expectation-Maximization (VEM) framework for the Two-Way Node Popularity Model (TNPM).
result The proposed method achieves superior estimation accuracy across different types of networks.
Proposes VCLANC for attributed network clustering using node and attribute embeddings.
problem Lack of mutual affinity exploitation between nodes and attributes in graph convolution.
method Dual variational auto-encoders for node and attribute embeddings, Gaussian mixture model priors, mutual distance and clustering assignment hardening losses.
result Demonstrates effectiveness on real-world attributed network datasets.
Deep QMC ansatzes improve variational QMC accuracy.
problem Improving variational QMC accuracy with neural network ansatzes.
method Analysis of deep neural network ansatzes PauliNet and FermiNet convergence to fixed-node limit.
result Deep QMC ansatzes can reach fixed-node limit with large network sizes.
Proposes a Bayesian approach for automatic node selection in sparse neural networks.
problem Reduces structural complexity and computational speedup in large-scale predictive models.
method Uses spike-and-slab Gaussian priors and variational Bayes approach for node selection.
result Establishes variational posterior consistency and optimal contraction rates for sparse networks.
A new method learns node embeddings for signed directed networks by capturing both first-order and high-order topologies.
problem Learning representative node embeddings for signed directed networks considering both first-order and high-order topologies.
method Proposes a decoupled variational embedding (DVE) method that leverages a specially designed auto-encoder structure to capture both first-order and high-order topologies.
result Extensive experiments on real-world datasets show the effectiveness of DVE in link sign prediction and node recommendation tasks.
Unified model generates representations for all nodes in growing graphs.
problem Cold start problem in growing graphs isolates new nodes.
method Generative graph convolutional network that learns adaptive node representations.
result Superior performance on citation network datasets.
Proposes a method to model uncertainty in neural ordinary differential equations.
problem Lack of uncertainty modeling and robustness in neural ordinary differential equations.
method Introduces a novel approach to model uncertainty by considering a distribution over the end-time of the ODE solver.
result Demonstrates the effectiveness of the proposed approaches in modelling uncertainty and robustness through experiments.
vGraph learns community membership and node representation jointly.
problem Independent study of community detection and node representation learning limits graph analysis.
method vGraph is a probabilistic generative model that learns community membership and node representation collaboratively.
result vGraph outperforms many baselines in both community detection and node representation learning.
New framework scales graph AE and VAE by training on a subset of nodes.
problem Training scalability and speed issues in graph AE and VAE models.
method Utilizes graph degeneracy to train on a dense subset of nodes, with a propagation mechanism.
result Empirically competitive results on large graphs (millions of nodes and edges).
MoNODEs improve neural ODEs by separating dynamic states from static factors.
problem Learning non-linear dynamics with variations across trajectories.
method Introduces time-invariant modulator variables to separate dynamic states from static factors.
result Consistently improves model generalization and far-horizon forecasting.
VFG model embeds flow-based models with hierarchical structures using variational inference.
problem Flow-based models struggle with high-dimensional latent spaces and lack of tractable inference for graphical structures.
method Integrates flow-based functions through variational inference with aggregation nodes for hierarchical information integration.
result VFG models achieve improved ELBO and likelihood values on multiple datasets.
A new model learns latent spaces for graph data.
problem Scalability and expressivity limitations in graph generative models.
method Sequential Graph Variational Autoencoder (SGVAE) that learns latent spaces directly from graph data.
result Promising results on a cycle dataset, but need for permutation relaxation.
GRADE models evolving graph dynamics by learning node and community representations.
problem Lack of tools to study temporal community dynamics in evolving graphs.
method GRADE is a probabilistic model that learns evolving node and community representations via a random walk prior and variational inference.
result GRADE outperforms baselines in dynamic link prediction and dynamic community detection.
New framework for disentangling graph node and edge features.
problem Learning disentangled representations for attributed graphs with node and edge features.
method Proposes a novel variational objective and architecture for node and edge deconvolutions to disentangle latent factors.
result Demonstrates effectiveness of the proposed model and its extensions on synthetic and real-world datasets.
Graph classification model learns sequentially from graph structure.
problem Graph classification based on structural information.
method Sequential embedding and variational regularization.
result State-of-the-art classification results on molecular datasets.
We show how to use a variational approximation to the logistic function to perform approximate inference in Bayesian networks containing discrete nodes with continuous parents. Essentially, we convert the logistic function to a Gaussian, which facilitates exact inference, and then iteratively adjust the variational par…
We face network data from various sources, such as protein interactions and online social networks. A critical problem is to model network interactions and identify latent groups of network nodes. This problem is challenging due to many reasons. For example, the network nodes are interdependent instead of independent o…
DVE models dynamic changes in feature embeddings for better sequence-aware applications.
problem Dynamic characterization of feature variations in time-varying data.
method Dynamic Variational Embedding (DVE) using recurrent neural networks.
result DVE models intrinsic nature and temporal variation of nodes effectively.
Improved HGF networks avoid negative precision errors in volatility updates.
problem Negative posterior precision errors in volatility-coupled nodes of HGF networks.
method Introduced a modified quadratic approximation to variational energy.
result Robust update equations across parameter space that track posterior faithfully.
New model generates graphs with tighter likelihood bounds and better quality.
problem Intractable likelihood of autoregressive graph models.
method Derive exact joint probability, approximate node orderings, variational inference.
result Lower bound on log-likelihood is significantly tighter than previous methods.
Dynamic trees are mixtures of tree structured belief networks. They solve some of the problems of fixed tree networks at the cost of making exact inference intractable. For this reason approximate methods such as sampling or mean field approaches have been used. However, mean field approximations assume a factorized di…
New graph AE and VAE model predicts directed links better than existing methods.
problem Link prediction in directed graphs, especially for unobserved edges.
method Gravity-inspired decoder scheme for directed graphs.
result Outperforms standard graph AE and VAE on three real-world directed link prediction tasks.
Model infers temporal connections in dynamic graphs from node interactions.
problem Challenges in reasoning about evolving graphs, especially with human-specified edges.
method Temporal point processes and variational autoencoders with bilinear interactions.
result Model outperforms baselines and infers semantically interpretable connections.
Study finds significant instability in node embeddings due to randomness.
problem Stability of node embeddings under random variations.
method Evaluated five node embedding algorithms (HOPE, LINE, node2vec, SDNE, GraphSAGE) on synthetic and empirical graphs.
result Significant instability in embedding spaces and downstream task accuracy.
Network metrics form a fundamental part of the network analysis toolbox. Used to quantitatively measure different aspects of the network, these metrics can give insights into the underlying network structure and function. In this work, we connect network metrics to modern probabilistic machine learning. We focus on the…
DA-GNN improves robustness of GNNs by modeling noise dependencies.
problem Real-world graph node features often contain noise, leading to performance degradation in GNNs.
method DA-GNN captures noise dependencies using variational inference and new benchmark datasets.
result DA-GNN consistently outperforms existing baselines across various noise scenarios.
Adversarial training improves graph autoencoder generalization.
problem Improving graph autoencoder generalization.
method Formulated L2 and L1 adversarial training for graph autoencoders and variational graph autoencoders.
result Adversarial training boosts graph autoencoder and variational graph autoencoder generalization.
Proposes a method to adapt labels on graphs with few labeled nodes.
problem Domain adaptation for graphs with limited labeled nodes.
method Optimization problem solving label transfer using spectral graph wavelets.
result Method yields satisfactory classification accuracy compared to existing methods.
Deep nets' complexity and risk are quantified using total path variation.
problem Quantifying the complexity and risk of deep neural networks.
method Using total path variation, the paper establishes relationships between network complexity and statistical risk.
result The statistical risk and metric entropy of deep nets are proportional to the total variation of path weights.
Graph auto-encoder predicts unobserved node features from biological networks and omics data.
problem Integrating biological networks and continuous node features for better prediction.
method Graph neural networks and feature auto-encoders trained on feature reconstruction.
result Graph feature auto-encoder outperforms auto-encoders trained on graph reconstruction for predicting unobserved node features.
Paper develops a new model for dynamic graph representation learning.
problem Learning over dynamic graphs with changing topology and node attributes.
method Hierarchical variational model with latent random variables and semi-implicit variational inference.
result SI-VGRNN and VGRNN outperform existing methods in dynamic link prediction.
iGCL preserves graph semantics in latent space augmentations.
problem Manual tuning of augmentation ratios and unexpected graph changes.
method iGCL uses a Variational Graph Auto-Encoder to learn augmentations in the latent space, optimizing an upper bound for contrastive loss.
result iGCL achieves state-of-the-art performance on graph-level and node-level tasks.
Many networks are complex dynamical systems, where both attributes of nodes and topology of the network (link structure) can change with time. We propose a model of co-evolving networks where both node at- tributes and network structure evolve under mutual influence. Specifically, we consider a mixed membership stochas…
This paper proposes a method to learn graph representations by partitioning edges into communities.
problem Graph neural networks ignore how edges are formed, leading to suboptimal representation learning.
method Introduces a generative model to partition edges into community-specific weighted edges, then uses these for GNN-based inference and classification.
result The method learns discriminative representations for both node-level and graph-level classification tasks.
FastGAE scales graph AE and VAE to large graphs with millions of nodes.
problem Scalability issues in graph AE and VAE.
method Stochastic subgraph decoding scheme to speed up training.
result Outperforms existing approaches on various real-world graphs.
Bayesian Neural Networks (BNNs) have recently received increasing attention for their ability to provide well-calibrated posterior uncertainties. However, model selection---even choosing the number of nodes---remains an open question. Recent work has proposed the use of a horseshoe prior over node pre-activations of a …
Study on learning sparse fixed-structure Gaussian Bayesian networks with near-optimal sample complexity.
problem Learning a fixed-structure Gaussian Bayesian network up to a bounded error in total variation distance.
method Analysis of node-wise least squares regression and introduction of BatchAvgLeastSquares and CauchyEst algorithms.
result BatchAvgLeastSquares and CauchyEstTree have near-optimal sample complexity.
New risk-dependent centrality measures assess node importance in financial networks.
problem Understanding how external risk levels affect network node importance.
method Developed risk-dependent centrality measures based on SI model of epidemics.
result Observed ranking interlacement phenomenon where nodes can swap positions due to external risk changes.
Graphs are a fundamental abstraction for modeling relational data. However, graphs are discrete and combinatorial in nature, and learning representations suitable for machine learning tasks poses statistical and computational challenges. In this work, we propose Graphite, an algorithmic framework for unsupervised learn…
The paper tackles sparse model fitting in distributed machine learning with graph-structured data.
problem Sparse model fitting across a distributed collection of heterogeneous data sets.
method Basis Pursuit Denoising with a total variation penalty, using ADMM for distributed methods.
result Recovery is successful with fewer samples than solving problems independently, or using methods with large overlap in signal supports.
We propose a novel distributed inference algorithm for continuous graphical models, by extending Stein variational gradient descent (SVGD) to leverage the Markov dependency structure of the distribution of interest. Our approach combines SVGD with a set of structured local kernel functions defined on the Markov blanket…
A new triad decoder improves graph auto-encoders' performance.
problem Graph auto-encoders ignore edge interactions, leading to suboptimal predictions.
method Integrates triadic closure property to predict three edges in a local triad.
result Triad decoder leads to more accurate predictions, clustering, and graph characteristics preservation.
IGNN improves GNNs by maximizing edge-state transform mutual information.
problem Optimizing GNNs for better relational information.
method Variational information maximization to learn optimal transform parameters.
result IGNN achieves state-of-the-art performance on molecular graph tasks.
Neighbor Mixture Model captures node correlations in graphs.
problem Modeling correlations between node labels in graphs.
method Neighbor Mixture Model (NMM) designed for efficient computation and scalability.
result NMM outperforms state-of-the-art models in various graph tasks.
Simple linear model outperforms GCN in graph AE tasks.
problem Challenging tasks like link prediction and node clustering.
method Replaced GCN with a simple linear model on adjacency matrix.
result Simple model consistently reaches competitive performances.
New method separates graph structure from node attributes to recover lost signal.
problem Standard representation learning on attributed graphs merges incompatible metric spaces, leading to geometrically flawed alignment.
method Custom variational autoencoder that separates manifold learning from structural alignment.
result Transforms geometric conflict into interpretable structural descriptor, uncovering connectivity patterns and anomalies.