A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Neighborhood sampling affects graph neural network training outcomes.
Revises GNN neighborhood aggregation for more accurate node classification.
Learning graph-structured data with graph neural networks (GNNs) has been recently emerging as an important field because of its wide applicability in bioinformatics, chemoinformatics, social network analysis and data mining. Recent GNN algorithms are based on neural message passing, which enables GNNs to integrate loc…
We propose a dynamic neighborhood aggregation (DNA) procedure guided by (multi-head) attention for representation learning on graphs. In contrast to current graph neural networks which follow a simple neighborhood aggregation scheme, our DNA procedure allows for a selective and node-adaptive aggregation of neighboring …
Many prediction problems can be phrased as inferences over local neighborhoods of graphs. The graph represents the interaction between entities, and the neighborhood of each entity contains information that allows the inferences or predictions. We present an approach for applying machine learning directly to such graph…
As an efficient and scalable graph neural network, GraphSAGE has enabled an inductive capability for inferring unseen nodes or graphs by aggregating subsampled local neighborhoods and by learning in a mini-batch gradient descent fashion. The neighborhood sampling used in GraphSAGE is effective in order to improve compu…
A new GNN model SPIN achieves state-of-the-art performance on diverse real-world datasets.
Existing popular methods for semi-supervised learning with Graph Neural Networks (such as the Graph Convolutional Network) provably cannot learn a general class of neighborhood mixing relationships. To address this weakness, we propose a new model, MixHop, that can learn these relationships, including difference operat…
Understanding intrinsic patterns and predicting spatiotemporal characteristics of cities require a comprehensive representation of urban neighborhoods. Existing works relied on either inter- or intra-region connectivities to generate neighborhood representations but failed to fully utilize the informative yet heterogen…
Proposes NRS to find flat minima in deep neural networks.
Develops GNNs for incomplete graphs, improving learning from missing node attributes.
GCNs learn by embedding similar nodes within a class and leveraging consistent neighborhood structures.
PushNet efficiently and adaptively pushes messages in neural networks, improving performance.
Convolutional neural networks (CNNs) can be applied to graph similarity matching, in which case they are called graph CNNs. Graph CNNs are attracting increasing attention due to their effectiveness and efficiency. However, the existing convolution approaches focus only on regular data forms and require the transfer of …
A new classifier encodes local neighborhoods for each class using Fly Bloom Filters.
NCP improves deep classifier uncertainty quantification efficiency.
The paper studies neural networks' convergence near origin and saddle points.
Improved RL for knowledge graph reasoning with entity types.
VisitHGNN predicts visit probabilities between neighborhoods and POIs using graph neural networks.
The past decade has witnessed a successful application of deep learning to solving many challenging problems in machine learning and artificial intelligence. However, the loss functions of deep neural networks (especially nonlinear networks) are still far from being well understood from a theoretical aspect. In this pa…
A new graph neural network tackles oversmoothing and generalization issues.
Neural message passing algorithms for semi-supervised classification on graphs have recently achieved great success. However, for classifying a node these methods only consider nodes that are a few propagation steps away and the size of this utilized neighborhood is hard to extend. In this paper, we use the relationshi…
A new method for training GNNs without a teacher model.
Spectral analysis of neighborhood graphs is one of the most widely used techniques for exploratory data analysis, with applications ranging from machine learning to social sciences. In such applications, it is typical to first encode relationships between the data samples using an appropriate similarity function. Popul…
Feed-forward networks are widely used in cross-modal applications to bridge modalities by mapping distributed vectors of one modality to the other, or to a shared space. The predicted vectors are then used to perform e.g., retrieval or labeling. Thus, the success of the whole system relies on the ability of the mapping…
New graph embedding method improves link prediction and node classification.
Graph representation learning, aiming to learn low-dimensional representations which capture the geometric dependencies between nodes in the original graph, has gained increasing popularity in a variety of graph analysis tasks, including node classification and link prediction. Existing representation learning methods …
We study model recovery for data classification, where the training labels are generated from a one-hidden-layer neural network with sigmoid activations, also known as a single-layer feedforward network, and the goal is to recover the weights of the neural network. We consider two network models, the fully-connected ne…
Graph neural networks struggle with heterophily, but new designs improve their performance.
HKConv learns hyperbolic features by aggregating kernel points.
Gradient descent in neural networks analyzed using RKBS for broader applicability.
GraphReach improves GNN performance by incorporating node positions.
We present graph attention networks (GATs), novel neural network architectures that operate on graph-structured data, leveraging masked self-attentional layers to address the shortcomings of prior methods based on graph convolutions or their approximations. By stacking layers in which nodes are able to attend over thei…
Almost all local minima in neural networks are strongly convex.
We derive spectral sequences for the intersection homology of stratified fibrations and approximate tubular neighborhoods in manifold stratified spaces. These neighborhoods include regular neighborhoods in PL stratified spaces.
Making an adaptive prediction based on one's input is an important ability for general artificial intelligence. In this work, we step forward in this direction and propose a semi-parametric method, Meta-Neighborhoods, where predictions are made adaptively to the neighborhood of the input. We show that Meta-Neighborhood…
New fusion blocks improve equivariant neural networks for molecular dynamics.
ES-MLP combines Graph-MLP with edge splitting for node classification on both homophilic and heterophilic graphs.
Data-driven neighborhood definitions and graph constructions are often used in machine learning and signal processing applications. k-nearest neighbor~(kNN) and -neighborhood methods are among the most common methods used for neighborhood selection, due to their computational simplicity. However, the choice of param…
Develops a smooth operator framework for analyzing neural network representations.
New approach to deeper graph neural networks to avoid performance degradation.
Message-passing neural networks (MPNNs) have been successfully applied to representation learning on graphs in a variety of real-world applications. However, two fundamental weaknesses of MPNNs' aggregators limit their ability to represent graph-structured data: losing the structural information of nodes in neighborhoo…
This work presents a two-stage neural architecture for learning and refining structural correspondences between graphs. First, we use localized node embeddings computed by a graph neural network to obtain an initial ranking of soft correspondences between nodes. Secondly, we employ synchronous message passing networks …
Study geodesics entering a fixed cusp neighborhood multiple times.
Deep learning with Convolutional Neural Networks has shown great promise in various areas of image-based classification and enhancement but is often unsuitable for predictive modeling involving non-image based features or features without spatial correlations. We present a novel approach for representation of high dime…
It is not until recently that graph neural networks (GNNs) are adopted to perform graph representation learning, among which, those based on the aggregation of features within the neighborhood of a node achieved great success. However, despite such achievements, GNNs illustrate defects in identifying some common struct…
Improved anti-cancer drug sensitivity prediction using REFINED CNN ensemble learning.
Skeleta and other pure subsets of manifold stratified spaces are shown to have neighborhoods which are teardrops of stratified approximate fibrations (under dimension and compactness assumptions). In general, the stratified approximate fibrations cannot be replaced by bundles, and the teardrops cannot be replaced by ma…