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.
Study error bounds in evaluating distributional computational graphs.
CoSimGNN improves graph similarity computation for large graphs.
Graph similarity computation is one of the core operations in many graph-based applications, such as graph similarity search, graph database analysis, graph clustering, etc. Since computing the exact distance/similarity between two graphs is typically NP-hard, a series of approximate methods have been proposed with a t…
We introduce GSimCNN (Graph Similarity Computation via Convolutional Neural Networks) for predicting the similarity score between two graphs. As the core operation of graph similarity search, pairwise graph similarity computation is a challenging problem due to the NP-hard nature of computing many graph distance/simila…
PSimGNN partitions graphs into subgraphs for efficient graph similarity computation.
Graph embedding aims at learning a vector-based representation of vertices that incorporates the structure of the graph. This representation then enables inference of graph properties. Existing graph embedding techniques, however, do not scale well to large graphs. We therefore propose a framework for parallel computat…
Efficiently computes embeddings for large graphs using coarsening.
This paper examines properties of feedforward graphs to improve neural network performance.
Graph similarity search is among the most important graph-based applications, e.g. finding the chemical compounds that are most similar to a query compound. Graph similarity computation, such as Graph Edit Distance (GED) and Maximum Common Subgraph (MCS), is the core operation of graph similarity search and many other …
Quantum computing improves graph neural network aggregation.
Empirical error estimates improve graph sparsification reliability.
The von Neumann graph entropy (VNGE) facilitates measurement of information divergence and distance between graphs in a graph sequence. It has been successfully applied to various learning tasks driven by network-based data. While effective, VNGE is computationally demanding as it requires the full eigenspectrum of the…
FastGAT reduces GNN computation time by 10x using graph sparsification.
Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different shape and size for every input, such networks do not directly support batched t…
Graph-structured data arise in wide applications, such as computer vision, bioinformatics, and social networks. Quantifying similarities among graphs is a fundamental problem. In this paper, we develop a framework for computing graph kernels, based on return probabilities of random walks. The advantages of our proposed…
Graph potentials link to topological QFTs, with computational methods.
Statistical-computational gap found in aligning multiple Gaussian graphs.
Quantum computing techniques improve graph analysis and community detection.
PASCO speeds up graph clustering for large graphs.
Linear time algorithm for random walk kernels on sparse graphs.
Paper improves GNN inference speed and memory usage.
Graph Neural Networks (GNNs) are based on repeated aggregations of information across nodes' neighbors in a graph. However, because common neighbors are shared between different nodes, this leads to repeated and inefficient computations. We propose Hierarchically Aggregated computation Graphs (HAGs), a new GNN graph re…
Pyramidal GNN combines RC and pooling for efficient graph embeddings.
WEGL embeds graphs in a vector space for faster machine learning.
A fast graph embedding method for large graphs.
Attention operators have been widely applied in various fields, including computer vision, natural language processing, and network embedding learning. Attention operators on graph data enables learnable weights when aggregating information from neighboring nodes. However, graph attention operators (GAOs) consume exces…
We construct maps on hat Heegaard Floer homology for cobordisms decorated with graphs. The graph TQFT allows for cobordisms with disconnected ends. Our construction uses Juhász's sutured Floer TQFT. We compute the maps for several elementary graph cobordisms. As an application, we compute the action of the fundamental …
We present a deep reinforcement learning approach to minimizing the execution cost of neural network computation graphs in an optimizing compiler. Unlike earlier learning-based works that require training the optimizer on the same graph to be optimized, we propose a learning approach that trains an optimizer offline an…
Surveying machine learning for solving graph optimization problems.
The paper computes an approximation to the sample Frechet mean of graph sets using spectral information.
We compute the average Tristram---Levine signature of any graph link with positive weights in a three sphere, generalizing the results of Kirby and Melvin. The main tools are the Neumann's algorithm for computing the equivariant signatures of graph links and the Reciprocity Law for Dedekind sums.
The PageRank of a graph is a scalar function defined on the node set of the graph which encodes nodes centrality information of the graph. In this article, we use the PageRank function along with persistent homology to obtain a scalable graph descriptor and utilize it to compare the similarities between graphs. For a g…
PES method reduces bias in gradient estimation for unrolled graphs.
The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable manifolds (up to graph complexity 32) and for compact orientable 3-manifolds with toric …
Graph learning method improves brain state classification.
The study provides a criterion to compute the total Thurston-Bennequin invariant of Legendrian graphs.
Two graph homologies help compute embedding space.
We propose an approach to learning with graph-structured data in the problem domain of graph classification. In particular, we present a novel type of readout operation to aggregate node features into a graph-level representation. To this end, we leverage persistent homology computed via a real-valued, learnable, filte…
A new GCN variant tackles large eigengaps in dense graphs and hypergraphs.
In graph neural networks (GNNs), pooling operators compute local summaries of input graphs to capture their global properties, and they are fundamental for building deep GNNs that learn hierarchical representations. In this work, we propose the Node Decimation Pooling (NDP), a pooling operator for GNNs that generates c…
Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a "good" layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to se…
Recently, graph neural networks have been adopted in a wide variety of applications ranging from relational representations to modeling irregular data domains such as point clouds and social graphs. However, the space of graph neural network architectures remains highly fragmented impeding the development of optimized …
We introduce vine computational graphs for efficient ML integration of vine copulas.
tf_geometric simplifies graph deep learning in TensorFlow.
New approach models computer network activity as mixtures of sources.
Efficient graph neural networks for large graphs without sampling.
The paper computes groups and modules for wheel graphs using Fibonacci and Chebyshev polynomials.
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how to compare graphs. This problem is often formulated as a graph matching problem where one seeks a mapping between vertices of two graphs whic…