This work improves GNN training efficiency by maximizing ego-graph information.
problem Training dedicated GNNs is costly for large-scale graphs.
method Proposes EGI (Ego-Graph Information maximization) to capture essential graph information and establish a theoretical framework for transfer learning.
result Demonstrates the effectiveness of EGI in improving GNN training efficiency and transferability.
GINNs combine deep learning with PGMs for physics-based multiscale systems.
problem Intrinsic computational bottlenecks and lack of sufficient data for QoI estimation.
method Hybrid approach combining deep learning with probabilistic graphical models, informed by structured priors for CVs.
result GINNs produce tight confidence intervals for non-Gaussian QoIs.
Graph Information Bottleneck (GIB) optimizes graph representations for robustness against adversarial attacks.
problem Challenges in learning graph representations due to structure and feature information.
method GIB is an information-theoretic principle that balances expressiveness and robustness by maximizing mutual information between representation and target, while constraining mutual information with input data.
result GIB-based models are more robust to adversarial attacks, achieving up to 31% improvement.
New principle controls graph-informed adversarial discrepancies.
problem Graph-informed adversarial learning for interpolative divergences.
method Proves infimal subadditivity for interpolative divergences.
result Graph-informed adversarial learning is justified for interpolative divergences.
Proposes GIB for recognizing informative subgraphs in graphs.
problem Recognizing a subgraph that is maximally informative yet compressive.
method Graph Information Bottleneck (GIB) framework, mutual information estimator, bi-level optimization, connectivity loss.
result IB-subgraph improves graph classification, interpretation, and denoising.
TIP model improves POSE prediction with less resources.
problem Predicting polypharmacy side effects from drug-protein interactions.
method TIP model operates on three subgraphs for progressive representation learning.
result Improves accuracy by 7%+, time efficiency by 83imes, and space efficiency by 3imes. This paper improves GNN robustness by aligning feature and adjacency matrix learning.
problem Improving robustness of graph neural networks (GNN) in noisy graph data.
method Proposes a novel regularized GSL approach that aligns feature information and graph information, incorporating sparse dimensional reduction.
result Demonstrates superior performance in noisy graph structures compared to competitive baselines.
FairDTD improves fairness in GNNs by distilling dual teacher knowledge, balancing utility and bias.
problem Bias in GNN predictions due to sensitive attributes.
method Dual-Teacher Distillation with a causal graph model, feature and structure teachers, and graph-level distillation.
result Achieves optimal fairness while preserving high model utility.
Graph learning is often unnecessary for common benchmarks, as node features can suffice.
problem The necessity of graph learning in common graph benchmarks is often assumed.
method We compared graph learning to feature-only models on seven datasets and found that graph structure often adds little to performance.
result Node features can often suffice for common graph benchmarks, challenging the orthodoxy.
Graph neural controlled differential equations learn graph dynamics from vertex observations.
problem Predicting future states of dynamical systems on graphs with limited vertex data.
method Incorporates graph topology information into NCDE to predict graph dynamics.
result Informed NCDE requires fewer parameters and lower MAE compared to previous methods.
Propagation-regularization improves GNN performance by infusing extra graph information.
problem The effectiveness of graph Laplacian regularization in GNNs is questioned and improved upon.
method Introducing Propagation-regularization (P-reg) to enhance GNN performance.
result P-reg boosts GNN performance on various tasks across multiple datasets.
MaGNet integrates local and global graph information for interpretable results.
problem Lack of interpretability and inability to learn varying-order representations in GNNs.
method Model-agnostic Graph Neural Network (MaGNet) framework integrating estimation and interpretation models.
result MaGNet effectively integrates information of various orders and provides meaningful, interpretable results.
Edge features contain important information about graphs. However, current state-of-the-art neural network models designed for graph learning, e.g. graph convolutional networks (GCN) and graph attention networks (GAT), adequately utilize edge features, especially multi-dimensional edge features. In this paper, we build…
Applying machine learning to molecules is challenging because of their natural representation as graphs rather than vectors.Several architectures have been recently proposed for deep learning from molecular graphs, but they suffer from informationbottlenecks because they only pass information from a graph node to its d…
WGNN learns graph representations from incomplete attribute data.
problem Missing node attributes in graphs.
method WGNN learns node representations from decomposed attribute matrices and uses Wasserstein space for message passing.
result WGNN outperforms existing methods in node classification tasks with missing attribute data.
Novel TRI-GNN framework improves graph classification robustness.
problem Graph neural networks suffer from over-smoothing and vulnerability to graph perturbations.
method Integrates higher-order graph information via persistent homology and local graph structure learning.
result TRI-GNN outperforms state-of-the-art baselines on node classification tasks.
Advances in collaborative filtering and ranking methods.
problem Improving recommendation systems efficiency and accuracy.
method Graph information encoding, pairwise and listwise approaches, regularization techniques, personalization.
result New methods significantly improve recommendation system performance.
HC-GNN tackles long-range graph information and high-order neighbourhoods.
problem Costly encoding of long-range information and failure to encode high-order neighbourhoods.
method Hierarchical structure with multi-level super graphs and innovative intra- and inter-level propagation.
result HC-GNN efficiently captures long-range interactions and incorporates meso- and macro-level semantics.
AWARE improves graph prediction by aggregating walks with attention schemes.
problem Improving graph prediction accuracy using walk aggregation.
method Integrates attention schemes into walk-aggregating GNNs.
result AWARE outperforms existing methods in graph-level prediction tasks.
We study the challenges of applying deep learning to gene expression data. We find experimentally that there exists non-linear signal in the data, however is it not discovered automatically given the noise and low numbers of samples used in most research. We discuss how gene interaction graphs (same pathway, protein-pr…
Proposes a method to select features for subgroup datasets with systematic missing data.
problem Feature selection for datasets with subgroup structure and systematic missing data.
method Develops a heterogeneous graph neural network to propagate information between feature-subgroup-target variable connections.
result Demonstrates improved feature selection performance and scalability.
A framework separates chemical and structural contributions to aqueous solubility.
problem Merging chemical and structural information in solubility models obscures their relative contributions.
method Additive MLP-GNN framework with separate chemical and structural branches.
result Framework reveals distinct roles of chemical and structural information in solubility.
In this paper, we consider recommender systems with side information in the form of graphs. Existing collaborative filtering algorithms mainly utilize only immediate neighborhood information and have a hard time taking advantage of deeper neighborhoods beyond 1-2 hops. The main caveat of exploiting deeper graph informa…
For highly sensitive real-world predictive analytic applications such as healthcare and medicine, having good prediction accuracy alone is often not enough. These kinds of applications require a decision making process which uses uncertainty estimation as input whenever possible. Quality of uncertainty estimation is a …
Clustering and community detection with multiple graphs have typically focused on aligned graphs, where there is a mapping between nodes across the graphs (e.g., multi-view, multi-layer, temporal graphs). However, there are numerous application areas with multiple graphs that are only partially aligned, or even unalign…
New algorithms optimize decision-making under uncertainty with graph information.
problem Optimizing decisions in large, uncertain environments with graph-based similarities.
method Graph-based UcB and ζ-UcB algorithms for maximizing and satisficing.
result Proves algorithms are near-optimal and benefits from graph side information.
Graph embedding is an important approach for graph analysis tasks such as node classification and link prediction. The goal of graph embedding is to find a low dimensional representation of graph nodes that preserves the graph information. Recent methods like Graph Convolutional Network (GCN) try to consider node attri…
Framework separates chemical and structural contributions to aqueous solubility.
problem Merging chemical and structural information in solubility models obscures their relative importance.
method Additive MLP-GNN framework with separate chemical and structural branches.
result Framework reveals distinct roles of chemical and structural information in solubility.
Optimized variable orderings improve autoregressive model performance.
problem Challenges in variable ordering affect autoregressive model efficiency.
method Learn graphical model structure to inform optimal variable orderings.
result Graph-informed orderings yield higher-fidelity samples.
Structure inference is an important task for network data processing and analysis in data science. In recent years, quite a few approaches have been developed to learn the graph structure underlying a set of observations captured in a data space. Although real-world data is often acquired in settings where relationship…
Paper uses graph structure to improve Wikipedia classification.
problem Classifying Wikipedia into a fine-grained named entity hierarchy.
method Explores graph descriptors and weighted models for feature vectors.
result Graph information reduces sparsity and improves classification.
Random projections help in representing sparse graphs efficiently.
problem Efficiently representing sparse graphs of varying sizes and vertex sets.
method Random projection of adjacency matrices to retain graph functionality and properties.
result Random projections can accurately represent graphs of different sizes and vertex sets in the same space.
Locality preserving projections (LPP) are a classical dimensionality reduction method based on data graph information. However, LPP is still responsive to extreme outliers. LPP aiming for vectorial data may undermine data structural information when it is applied to multidimensional data. Besides, it assumes the dimens…
This work presents entropic constraints from DAGs with hidden variables.
problem Characterizing causal relations in systems with hidden variables.
method Entropic inequality constraints derived from e-separation relations. result These constraints can learn about true causal models from observed data.
Learning the "blocking" structure is a central challenge for high dimensional data (e.g., gene expression data). Recently, a sparse singular value decomposition (SVD) has been used as a biclustering tool to achieve this goal. However, this model ignores the structural information between variables (e.g., gene interacti…
Paper uses SDP for community detection with side information.
problem Community detection in graphs with additional non-graph data.
method Formulates SDP relaxation for maximum likelihood node labeling with side information.
result SDP achieves same exact recovery threshold as maximum likelihood with side information.
Study matches two noisy point clouds with geometric transformations and relabeling.
problem Matching two noisy point clouds with orthogonal transformations and relabeling.
method Information-theoretic results and Ping-Pong algorithm for computational alignment.
result The Ping-Pong algorithm retrieves the planted signal after one step.
Graphs of neural networks are represented to preserve symmetry, improving performance across various tasks.
problem Lack of equivariance in neural network representations of other neural networks.
method Represent neural networks as computational graphs and use graph neural networks to preserve permutation symmetry.
result Single model encodes diverse neural architectures, outperforming state-of-the-art methods.
Neural networks can approximate functions uniformly across various measures.
problem Universal approximation of functions across different probability measures.
method Proving neural networks are dense in Orlicz spaces, extending classical theorems.
result Neural networks uniformly approximate functions for weakly compact families of measures.
Optimal rates for shallow ReLU networks in nonparametric regression.
problem Approximating smooth and non-smooth functions with shallow ReLU networks.
method Analysis of shallow ReLUk neural networks, using variation norms and deep learning theory. result Optimal approximation rates for shallow ReLU networks in nonparametric regression.
Novel framework explains generalization in deep neural networks.
problem Understanding and improving generalization in deep neural networks.
method Topological Quantum Neural Networks as the semi-classical limit of Deep Neural Networks.
result Demonstrates that the perceptron, viewed as the semi-classical limit, achieves similar results to standard neural networks without training.
Investigates how neural network graph structure impacts predictive performance.
problem Lack of understanding between neural network graph structure and predictive performance.
method Developed relational graph representation to analyze neural networks, identifying a 'sweet spot' for improved performance.
result Identified a 'sweet spot' in relational graph structure that significantly improves neural network predictive performance.
GraphTEE estimates treatment effects on graph-structured targets, mitigating bias.
problem Understanding treatment effects on graph-structured targets with observational bias.
method GraphTEE framework focusing on confounding variable sets and new regularization.
result GraphTEE mitigates bias better than previous methods.
Equivariant neural networks use symmetry to interpret complex data.
problem Interpreting and understanding the behavior of equivariant neural networks.
method Decompose layers into simple representations and analyze nonlinear activation functions.
result Equivariant neural networks can be interpreted using a filtration generalizing Fourier series.
Two new criteria help understand the advantage of deep neural networks.
problem Understanding the advantage of deepening neural networks.
method Proposed two new criteria to evaluate the expressivity of functions computable by deep neural networks.
result Increasing layers is more effective than increasing units in improving the expressivity of deep neural networks.
Paper benchmarks quantum neural networks against classical ones for binary classification tasks.
problem Comparing quantum neural networks with classical ones for binary classification.
method Evaluated with two toy examples, focusing on model complexity and training data size.
result EQNN and QNN outperform ENN and DNN for smaller parameter sets and training data samples.
Secret neural networks hidden within trained models.
problem Excess capacity in neural networks allows embedding secret models.
method Novel framework for hiding secret neural networks within carrier networks.
result Detection of hidden networks is computationally infeasible.
The paper proves consistency of neural networks with regularization.
problem Overfitting in neural networks with large scale data.
method Theoretical framework of neural networks with regularization, sieves method, and minimal neural networks theory.
result The estimated neural network converges to the true underlying function as sample size increases.