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.
Revises GNN neighborhood aggregation for more accurate node classification.
GraphAIR improves graph representation learning by capturing non-linear interactions.
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 …
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…
A new GNN model SPIN achieves state-of-the-art performance on diverse real-world datasets.
Develops GNNs for incomplete graphs, improving learning from missing node attributes.
GCNs improve regression tasks by aggregating neighbor signals.
The paper introduces a method to control false splits in tree-based data aggregation.
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 …
Geom-GCN improves graph neural networks by preserving structural information and capturing long-range dependencies.
GraLSP improves graph neural networks by incorporating local structural patterns.
EHNA learns node embeddings from historical network neighborhoods.
Graph convolutional networks (GCNs) have been successfully applied in node classification tasks of network mining. However, most of these models based on neighborhood aggregation are usually shallow and lack the "graph pooling" mechanism, which prevents the model from obtaining adequate global information. In order to …
STAG injects noise into graph neural networks to improve performance.
In rank aggregation (RA), a collection of preferences from different users are summarized into a total order under the assumption of homogeneity of users. Model misspecification in RA arises since the homogeneity assumption fails to be satisfied in the complex real-world situation. Existing robust RAs usually resort to…
HKConv learns hyperbolic features by aggregating kernel points.
AWARE improves graph prediction by aggregating walks with attention schemes.
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…
Recent deep learning approaches for representation learning on graphs follow a neighborhood aggregation procedure. We analyze some important properties of these models, and propose a strategy to overcome those. In particular, the range of "neighboring" nodes that a node's representation draws from strongly depends on t…
New aggregation method improves GNN robustness to structural perturbations.
Graph Convolutional Networks (GCNs) have shown very powerful for graph data representation and learning tasks. Existing GCNs usually conduct feature aggregation on a fixed neighborhood graph in which each node computes its representation by aggregating the feature representations of all its neighbors which is biased by…
A variety of graph neural networks (GNNs) frameworks for representation learning on graphs have been recently developed. These frameworks rely on aggregation and iteration scheme to learn the representation of nodes. However, information between nodes is inevitably lost in the scheme during learning. In order to reduce…
LATTE tackles heterogeneous network embedding challenges with layer-stacked attention.
Topic models are frequently used in machine learning owing to their high interpretability and modular structure. However, extending a topic model to include a supervisory signal, to incorporate pre-trained word embedding vectors and to include a nonlinear output function is not an easy task because one has to resort to…
Augments GNNs with diversification to preserve node identity.
Semi-supervised node classification in attributed graphs, i.e., graphs with node features, involves learning to classify unlabeled nodes given a partially labeled graph. Label predictions are made by jointly modeling the node and its' neighborhood features. State-of-the-art models for node classification on such attrib…
Develops a new method for robust risk measurement by averaging nearby payoffs.
New clustering methods for binary data using combinatorial optimization.
In this work, we propose to learn a generative model using both learned features (through a latent space) and memories (through neighbors). Although human learning makes seamless use of both learned perceptual features and instance recall, current generative learning paradigms only make use of one of these two componen…
A new ensemble method improves kNN performance by extending the neighborhood rule.
A new graph neural network tackles oversmoothing and generalization issues.
New approach to deeper graph neural networks to avoid performance degradation.
The paper introduces a new loss function to prevent overfitting in semi-supervised graph networks.
Graph convolutional networks (GCNs) have recently become one of the most powerful tools for graph analytics tasks in numerous applications, ranging from social networks and natural language processing to bioinformatics and chemoinformatics, thanks to their ability to capture the complex relationships between concepts. …
Proposes a new method for predicting missing relations in knowledge graphs.
In this short paper we define the wealth process in a spin model for market microstructure, for individual agents and in aggregate. The agents in our model try to balance their desire to belong to the local majority (herding behavior), defined over random network neighborhoods, and the occasional advantage of belonging…
Individual choices are either based on personal experience or on information provided by peers. The latter case, causes individuals to conform to the majority in their neighborhood. Such herding behavior may be very efficient in aggregating disperse private information, thereby revealing the optimal choice. However if …
Using publicly available traffic camera data in New York City, we quantify time-dependent patterns in aggregate pedestrian foot traffic. These patterns exhibit repeatable diurnal behaviors that differ for weekdays and weekends but are broadly consistent across neighborhoods in the borough of Manhattan. Weekday patterns…
Graph Neural Networks (GNNs) are an effective framework for representation learning of graphs. GNNs follow a neighborhood aggregation scheme, where the representation vector of a node is computed by recursively aggregating and transforming representation vectors of its neighboring nodes. Many GNN variants have been pro…
We present our ongoing work on understanding the limitations of graph convolutional networks (GCNs) as well as our work on generalizations of graph convolutions for representing more complex node attribute dependencies. Based on an analysis of GCNs with the help of the corresponding computation graphs, we propose a gen…
Graph Convolutional Networks (GCNs) have proved to be a most powerful architecture in aggregating local neighborhood information for individual graph nodes. Low-rank proximities and node features are successfully leveraged in existing GCNs, however, attributes that graph links may carry are commonly ignored, as almost …
ie-HGCN addresses HIN challenges by efficiently learning node representations.
Proposes a 2-WL-based graph convolution for improved graph classification.
SGATs learn sparse attention coefficients to improve graph learning tasks on large, noisy graphs.
Proposes a novel node embedding framework for graphs using Fisher Information.
Recently popularized graph neural networks achieve the state-of-the-art accuracy on a number of standard benchmark datasets for graph-based semi-supervised learning, improving significantly over existing approaches. These architectures alternate between a propagation layer that aggregates the hidden states of the local…
A method to robustly federate learning with non-i.i.d. data and Byzantine workers.
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.