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.
DGRCL integrates dynamic and static graph relations for financial market prediction.
Graph neural networks are extended to continuous-depth models using differential equations.
Introduces PELP for graph-enhanced word embeddings.
Network sampling is integral to the analysis of social, information, and biological networks. Since many real-world networks are massive in size, continuously evolving, and/or distributed in nature, the network structure is often sampled in order to facilitate study. For these reasons, a more thorough and complete unde…
e-GGPs learn graph vertex transitions over time.
Knowledge graphs (KGs) typically contain temporal facts indicating relationships among entities at different times. Due to their incompleteness, several approaches have been proposed to infer new facts for a KG based on the existing ones-a problem known as KG completion. KG embedding approaches have proved effective fo…
Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) is demonstrated to efficiently solve eigenvalue problems for graph Laplacians that appear in spectral clustering. For static graph partitioning, 10-20 iterations of LOBPCG without preconditioning result in ~10x error reduction, enough to achieve 100% corr…
An important part of many machine learning workflows on graphs is vertex representation learning, i.e., learning a low-dimensional vector representation for each vertex in the graph. Recently, several powerful techniques for unsupervised representation learning have been demonstrated to give the state-of-the-art perfor…
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…
Attack graphs are a powerful tool for security risk assessment by analysing network vulnerabilities and the paths attackers can use to compromise network resources. The uncertainty about the attacker's behaviour makes Bayesian networks suitable to model attack graphs to perform static and dynamic analysis. Previous app…
Network representation learning in low dimensional vector space has attracted considerable attention in both academic and industrial domains. Most real-world networks are dynamic with addition/deletion of nodes and edges. The existing graph embedding methods are designed for static networks and they cannot capture evol…
Attack graphs provide compact representations of the attack paths that an attacker can follow to compromise network resources by analysing network vulnerabilities and topology. These representations are a powerful tool for security risk assessment. Bayesian inference on attack graphs enables the estimation of the risk …
One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions,…
Novel method models dynamic brain graphs from time series data.
CTGCN learns dynamic graph embeddings preserving both local and global graph structure.
We address the problem of reverse engineering of stripped executables, which contain no debug information. This is a challenging problem because of the low amount of syntactic information available in stripped executables, and the diverse assembly code patterns arising from compiler optimizations. We present a novel ap…
Study null energy condition impacts on special hypersurfaces in static spacetimes.
Temporal graph kernels improve classification of dissemination processes.
TGN outperforms static GNNs in detecting financial fraud.
PGNs dynamically infer and use graph structures to improve model generalization.
Representation learning on graphs has emerged as a powerful mechanism to automate feature vector generation for downstream machine learning tasks. The advances in representation on graphs have centered on both homogeneous and heterogeneous graphs, where the latter presenting the challenges associated with multi-typed n…
TG-GAN models dynamic graph evolution for continuous-time temporal graphs.
New static black hole uniqueness theorems for negative cosmological constant.
Recently, graph neural networks (GNNs) have proved to be suitable in tasks on unstructured data. Particularly in tasks as community detection, node classification, and link prediction. However, most GNN models still operate with static relationships. We propose the Graph Learning Network (GLN), a simple yet effective p…
Framework for dynamic node embeddings from graph streams.
TGAT learns node embeddings for evolving graphs, capturing both static and temporal features.
Loss-guided training accelerates node embedding methods on graphs.
Graphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learning models for graphs have been mostly designed for static graphs. However, many applications involve evolving graphs. This introduces import…
Reinforcement learning (RL) tasks are challenging to implement, execute and test due to algorithmic instability, hyper-parameter sensitivity, and heterogeneous distributed communication patterns. We argue for the separation of logical component composition, backend graph definition, and distributed execution. To this e…
MTHetGNN models complex relations in multivariate time series forecasting.
HYPA-DBGNN detects anomalous sequential patterns in temporal graphs.
Unified model forecasts epidemics with spatial and temporal dynamics.
Learning latent representations of nodes in graphs is an important and ubiquitous task with widespread applications such as link prediction, node classification, and graph visualization. Previous methods on graph representation learning mainly focus on static graphs, however, many real-world graphs are dynamic and evol…
A new algorithm reduces memory usage for deep learning models.
We describe DyNet, a toolkit for implementing neural network models based on dynamic declaration of network structure. In the static declaration strategy that is used in toolkits like Theano, CNTK, and TensorFlow, the user first defines a computation graph (a symbolic representation of the computation), and then exampl…
Dyn-VGAE learns evolving network structures.
Proposes RNNE for dynamic network embedding.
A novel approach to computing barycenters on graph-supported probability measures.
Graph neural networks predict solid-state NMR parameters from atomic structures.
The paper introduces fixed-point centralities for networks and graphons.
CoMGNN models heterogeneous graphs with evolving nodes and edges.
Neural GDEs improve graph prediction by blending discrete structures and differential equations.
New method clusters evolving networks using spatio-temporal graph Laplacian.
Representation learning over graph structured data has been mostly studied in static graph settings while efforts for modeling dynamic graphs are still scant. In this paper, we develop a novel hierarchical variational model that introduces additional latent random variables to jointly model the hidden states of a graph…
BLISS optimizes GNN training by adaptively sampling nodes.
Business Architecture (BA) plays a significant role in helping organizations understand enterprise structures and processes, and align them with strategic objectives. However, traditional BAs are represented in fixed structure with static model elements and fail to dynamically capture business insights based on interna…
Most of real-world graphs are dynamic, i.e., they change over time by a sequence of update operations. While the regression problem has been studied for static graphs and temporal graphs, it is not investigated for general dynamic graphs. In this paper, we study regression over dynamic graphs. First, we present the not…
Causality graphs are routinely estimated in social sciences, natural sciences, and engineering due to their capacity to efficiently represent the spatiotemporal structure of multivariate data sets in a format amenable for human interpretation, forecasting, and anomaly detection. A popular approach to mathematically for…