DMGE learns cross-domain user behavior embeddings using multi-graphs and GNNs.
problem Data sparsity in learning large-scale item embedding from individual domain data.
method Construct multi-graphs from users' behaviors across domains, use multi-graph neural networks to learn cross-domain representation.
result DMGE outperforms state-of-the-art embedding methods in various tasks.
Network analysis of human brain connectivity is critically important for understanding brain function and disease states. Embedding a brain network as a whole graph instance into a meaningful low-dimensional representation can be used to investigate disease mechanisms and inform therapeutic interventions. Moreover, by …
We propose a friend recommendation system (an application of link prediction) using edge embeddings on social networks. Most real-world social networks are multi-graphs, where different kinds of relationships (e.g. chat, friendship) are possible between a pair of users. Existing network embedding techniques do not leve…
Bayesian framework proves thresholds for multi-graph alignment feasibility.
problem Determining when multi-graph alignment is statistically possible.
method Developed a Bayesian estimation framework over metric spaces.
result Identified thresholds for Gaussian and sparse Erdős-Rényi models.
Paper proposes a new method for population-wise matching of sulcal graphs.
problem Challenges in matching cortical fold variations across individuals.
method Population-wise multi-graph matching of sulcal graphs.
result Effectiveness of multi-graph matching in obtaining consistent labeling of sulcal basins.
Matrix completion models are among the most common formulations of recommender systems. Recent works have showed a boost of performance of these techniques when introducing the pairwise relationships between users/items in the form of graphs, and imposing smoothness priors on these graphs. However, such techniques do n…
New framework learns labels at both bag and graph levels.
problem Learning multi-label classifiers from multi-graph bags.
method Designing scoring functions and rank-loss objective for graph and bag levels; developing sub-gradient descent algorithm.
result Superior performance over state-of-the-art algorithms.
A new graph neural network framework captures long-range interactions efficiently.
problem Efficiently modeling long-range interactions in graph neural networks for PDEs.
method Proposes a multi-level graph neural network framework using multipole methods.
result Captures interaction at all ranges with only linear complexity, learning discretization-invariant solution operators.
One fundamental issue in managing bike sharing systems is the bike flow prediction. Due to the hardness of predicting the flow for a single station, recent research works often predict the bike flow at cluster-level. While such studies gain satisfactory prediction accuracy, they cannot directly guide some fine-grained …
Origin-destination (OD) matrices are often used in urban planning, where a city is partitioned into regions and an element (i, j) in an OD matrix records the cost (e.g., travel time, fuel consumption, or travel speed) from region i to region j. In this paper, we partition a day into multiple intervals, e.g., 96 15-min …
This paper generalizes graph representation for diverse data types.
problem Representing and querying hybrid data types in a unified way.
method Introducing a directed Tensor-Typed Multi-Graph with embeddings.
result Unified representation for visual, linguistic, and auditory data.
Framework combines HMM and MTGCN for spatiotemporal causal inference in clinical data.
problem Challenges in observing direct treatment effects in clinical domains.
method Integrates Hidden Markov Model and Multi Task and Multi Graph Convolutional Network for spatiotemporal data.
result Advances predictive causal inference by structurally adapting to spatiotemporal complexities.
SF-GCN improves semi-supervised classification by fusing multi-view data structures.
problem Semi-supervised classification challenges due to multi-view data diversity and complexity.
method Structure fusion based on graph convolutional networks (SF-GCN) that balances specificity and commonality.
result SF-GCN outperforms state-of-the-art methods on citation networks datasets.
Proposes a method to improve urban spatiotemporal forecasting using multi-modal graph interaction.
problem Improving spatiotemporal forecasting in urban areas using graph convolution networks.
method Develops modality interaction mechanisms for multi-graph convolution networks to reduce generalization error.
result Proposed techniques improve prediction accuracy and model robustness compared to state-of-the-art baselines.
Paper improves risk bound for MTL with graph-dependent data.
problem Sub-optimal risk bound in multi-task learning with graph-dependent data.
method Proposes a new Bennett-type inequality and develops new Talagrand-type inequality and local fractional Rademacher complexity.
result Derives a sharper risk bound of O(nlogn). Invariant and equivariant networks have been successfully used for learning images, sets, point clouds, and graphs. A basic challenge in developing such networks is finding the maximal collection of invariant and equivariant linear layers. Although this question is answered for the first three examples (for popular tra…
Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and optimization applications. The problem is of an exponential complexity with respect to t…
ALMGIG uses adversarial learning to generate and infer novel molecules efficiently.
problem Efficiently generating and inferring novel molecules using graph representations.
method Adversarial learning framework that avoids explicit graph isomorphism, using cycle-consistency loss and multi-graph Graph Isomorphism Network.
result ALMGIG more accurately learns the distribution over the space of molecules and efficiently searches the molecular space.
A new framework SIMBA improves graph classification performance on size-imbalanced datasets.
problem Size imbalance in graph classification leads to poor model performance.
method Energy-guided structural smoothing between head and tail graphs, re-weighting based on energy propagation.
result SIMBA outperforms existing methods in size-imbalanced graph classification tasks.
We prove that the ends of a properly immersed simply or one connected minimal surface in H(2)xR contained in a slab of height less than πof H(2)xR, are multi-graphs. When such a surface is embedded then the ends are graphs. When embedded and simply connected, it is an entire graph.
tf_geometric simplifies graph deep learning in TensorFlow.
problem Efficient graph deep learning in TensorFlow.
method Kernel libraries and infrastructures for GNNs.
result tf_geometric supports various graph tasks and provides efficient GNN models.
A new framework predicts stock movements using news sentiment and relational data.
problem Predicting stock prices from textual information is challenging due to market uncertainty and natural language complexity.
method Multi-Graph Recurrent Network (MGRN) combining textual sentiment from financial news and relational data.
result The model outperforms benchmarks in predicting stock movements.
A novel multi-view spectral clustering model fuses and clusters data views.
problem Fusing and clustering multi-view data effectively.
method Simultaneously fuses and clusters views into a single graph.
result The proposed method outperforms existing techniques.
The success of graph embeddings or node representation learning in a variety of downstream tasks, such as node classification, link prediction, and recommendation systems, has led to their popularity in recent years. Representation learning algorithms aim to preserve local and global network structure by identifying no…
Unlike R3, the homogeneous spaces E(−1,τ) have a great variety of entire vertical minimal graphs. In this paper we explore conditions which guarantees that a minimal surface in E(−1,τ) is such a graph. More specifically: we introduce the definition of a generalized slab in $\mathbb{E…
In this work we study convex relaxations of quadratic optimisation problems over permutation matrices. While existing semidefinite programming approaches can achieve remarkably tight relaxations, they have the strong disadvantage that they lift the original n×n-dimensional variable to an n2×n2-d…
Predict stock movement by considering cross effects among stocks.
problem Challenges in predicting stock price movement due to cross effects among stocks.
method Multi-GCGRU framework combining GCN and GRU, encoding cross effects from financial domain knowledge and data-driven relationships.
result Our model outperforms other baselines in predicting stock movement.
Enhances community detection in correlated networks with node attributes.
problem Community detection in multiple networks with correlated node attributes and edges.
method Introduced the correlated Contextual Stochastic Block Model (CSBM), developed a two-step matching procedure.
result Algorithm recovers exact node correspondence, enabling enhanced community detection.
Enhances graph classification with multiple graphs.
problem Improving graph classification accuracy with multiple graphs.
method Graph fusion embedding using encoder embedding.
result The method consistently improves classification accuracy for large vertex sets.
Knowledge graphs have emerged as an important model for studying complex multi-relational data. This has given rise to the construction of numerous large scale but incomplete knowledge graphs encoding information extracted from various resources. An effective and scalable approach to jointly learn over multiple graphs …
End-to-end trainable graph matching using improved combinatorial solvers.
problem Graph matching in deep learning.
method Combining deep learning with optimized combinatorial solvers.
result Advances state-of-the-art on deep graph matching benchmarks.
Let G be a finitely generated group acting faithfully and properly discontinuously by homeomorphisms on a planar surface X⊆S2. We prove that G admits such an action that is in addition co-compact, provided we can replace X by another surface Y⊆S2. We also prove that if …
Low-dimensional embeddings of nodes in large graphs have proved extremely useful in a variety of prediction tasks, from content recommendation to identifying protein functions. However, most existing approaches require that all nodes in the graph are present during training of the embeddings; these previous approaches …
Paper develops an online EM algorithm for graph signal inference from streaming data.
problem Joint inference and clustering of graph signals with non-white excitation.
method Mixture model with low-rank plus sparse prior, online EM algorithm.
result Proposed online EM algorithm converges to MAP solution.
New 3D protein analysis methods improve accuracy.
problem Lack of suitable learning algorithms for protein data.
method Intrinsic-Extrinsic Convolution and Pooling for 3D protein structures.
result Outperforms state-of-the-art methods on protein analysis tasks.
In this paper we study constant mean curvature surfaces Σ in a product space, M2×R, where M2 is a complete Riemannian manifold. We assume the angle function $ν= \meta{N}{\partial_t}$ does not change sign on Σ. We classify these surfaces according to the infimum c(Σ) of the G…
Paper introduces method to make neural networks symmetrical.
problem Creating symmetrical neural networks for data with inherent symmetries.
method Introduces a method for modifying neural networks to enforce equivariance.
result Group convolutional neural networks are a special case of the introduced framework.
We propose a scalable Gromov-Wasserstein learning (S-GWL) method and establish a novel and theoretically-supported paradigm for large-scale graph analysis. The proposed method is based on the fact that Gromov-Wasserstein discrepancy is a pseudometric on graphs. Given two graphs, the optimal transport associated with th…
Multi-view spectral clustering, which aims at yielding an agreement or consensus data objects grouping across multi-views with their graph laplacian matrices, is a fundamental clustering problem. Among the existing methods, Low-Rank Representation (LRR) based method is quite superior in terms of its effectiveness, intu…
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.
The FAIRnets Ontology makes neural networks findable, accessible, interoperable, and reusable.
problem The resource-intensive training of neural networks and the lack of training data availability.
method Development of FAIRnets Ontology to model neural networks on a meta-level and creation of a knowledge graph (FAIRnets) of over 18,400 neural networks.
result The FAIRnets Ontology and knowledge graph enable the reuse and recommendation of neural networks to data scientists.
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.
FGNN generalizes graph neural networks to capture higher-order dependencies.
problem Capturing higher-order dependencies in graph-structured data.
method Introducing a factor graph neural network (FGNN) that can represent Max-Product Belief Propagation.
result FGNN effectively represents Max-Product Belief Propagation and performs well on both synthetic and real datasets.
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.