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.
New method for identifying graph shift operators using vertex-time autoregressive models.
IDPGs extend RDPGs with a Poisson process for random latent positions.
A fast graph embedding method for large graphs.
New model calculates logarithmic surface diameter.
Data-driven methods link graphon limits to random walks and spectral clustering.
We present a new random sampling strategy for k-bandlimited signals defined on graphs, based on determinantal point processes (DPP). For small graphs, ie, in cases where the spectrum of the graph is accessible, we exhibit a DPP sampling scheme that enables perfect recovery of bandlimited signals. For large graphs, ie, …
DGP learns speech recognition by modeling complex relationships between utterances.
A new method improves graph random features with quasi-Monte Carlo techniques.
Given a graph embedded in an orientable surface, a process consisting of random excitations and random node and face balancing is constructed and analyzed. It is shown that given a priori bounds g' on the genus and n' on the number of nodes, one can determine the genus of the surface from local observations of the proc…
Enhances graph neural networks with random walks to improve performance.
We consider learning on graphs, guided by kernels that encode similarity between vertices. Our focus is on random walk kernels, the analogues of squared exponential kernels in Euclidean spaces. We show that on large, locally treelike, graphs these have some counter-intuitive properties, specifically in the limit of lar…
New graph embedding method improves link prediction and node classification.
We introduce a novel encoder-decoder architecture to embed functional processes into latent vector spaces. This embedding can then be decoded to sample the encoded functions over any arbitrary domain. This autoencoder generalizes the recently introduced Conditional Neural Process (CNP) model of random processes. Our ar…
New method calculates Ricci curvature from distances between weighted volumes.
Statistical physics approaches can be used to derive accurate predictions for the performance of inference methods learning from potentially noisy data, as quantified by the learning curve defined as the average error versus number of training examples. We analyse a challenging problem in the area of non-parametric inf…
Study of lengths of cycles in large genus random maps converging to Poisson process.
AgraSSt assesses graph generators using Stein operators and kernel discrepancies.
Method learns SDEs from one trajectory using GP priors and randomized cross-validation.
A scalable GP model for online uncertainty quantification over graphs.
We propose a novel statistical model for sparse networks with overlapping community structure. The model is based on representing the graph as an exchangeable point process, and naturally generalizes existing probabilistic models with overlapping block-structure to the sparse regime. Our construction builds on vectors …
We present Graph Random Neural Features (GRNF), a novel embedding method from graph-structured data to real vectors based on a family of graph neural networks. The embedding naturally deals with graph isomorphism and preserves the metric structure of the graph domain, in probability. In addition to being an explicit em…
New model learns graph spectra accurately, outperforming existing methods.
Recently, techniques for applying convolutional neural networks to graph-structured data have emerged. Graph convolutional neural networks (GCNNs) have been used to address node and graph classification and matrix completion. Although the performance has been impressive, the current implementations have limited capabil…
Bayesian nonparametric approach for clustering non-exchangeable groups.
Continuous vector representations of words and objects appear to carry surprisingly rich semantic content. In this paper, we advance both the conceptual and theoretical understanding of word embeddings in three ways. First, we ground embeddings in semantic spaces studied in cognitive-psychometric literature and introdu…
We present a nonparametric prior over reversible Markov chains. We use completely random measures, specifically gamma processes, to construct a countably infinite graph with weighted edges. By enforcing symmetry to make the edges undirected we define a prior over random walks on graphs that results in a reversible Mark…
GAT-RWOS uses graph attention to improve imbalanced data classification.
The study examines convergence of stochastic processes on large graphs and adjacency matrices.
Enhances GNN robustness during inference using Conditional Random Fields.
Generative models of graph structure have applications in biology and social sciences. The state of the art is GraphRNN, which decomposes the graph generation process into a series of sequential steps. While effective for modest sizes, it loses its permutation invariance for larger graphs. Instead, we present a permuta…
Improved error correction using neural networks and belief propagation.
Structure learning in random fields has attracted considerable attention due to its difficulty and importance in areas such as remote sensing, computational biology, natural language processing, protein networks, and social network analysis. We consider the problem of estimating the probabilistic graph structure associ…
The natural habitat of most Bayesian methods is data represented by exchangeable sequences of observations, for which de Finetti's theorem provides the theoretical foundation. Dirichlet process clustering, Gaussian process regression, and many other parametric and nonparametric Bayesian models fall within the remit of …
Statistical network modeling has focused on representing the graph as a discrete structure, namely the adjacency matrix, and considering the exchangeability of this array. In such cases, the Aldous-Hoover representation theorem (Aldous, 1981;Hoover, 1979} applies and informs us that the graph is necessarily either dens…
This paper presents a bias-variance tradeoff of graph Laplacian regularizer, which is widely used in graph signal processing and semi-supervised learning tasks. The scaling law of the optimal regularization parameter is specified in terms of the spectral graph properties and a novel signal-to-noise ratio parameter, whi…
A parametrization of hypergraphs based on the geometry of points in is developed. Informative prior distributions on hypergraphs are induced through this parametrization by priors on point configurations via spatial processes. This prior specification is used to infer conditional independence models or M…
Graph-based state representation improves deep RL performance.
We propose a method for inferring the conditional indepen- dence graph (CIG) of a high-dimensional discrete-time Gaus- sian vector random process from finite-length observations. Our approach does not rely on a parametric model (such as, e.g., an autoregressive model) for the vector random process; rather, it only assu…
Online CPD for weighted and directed graphs using RDPG model.
We construct an infinitely exchangeable process on the set $\cate$ of subsets of the power set of the natural numbers via a Poisson point process with mean measure on the power set of . Each $E\in\cate$ has a least monotone cover in $\catf$, the collection of monotone subsets of $\cate$, an…
Although many successful ensemble clustering approaches have been developed in recent years, there are still two limitations to most of the existing approaches. First, they mostly overlook the issue of uncertain links, which may mislead the overall consensus process. Second, they generally lack the ability to incorpora…
TG-GAN models dynamic graph evolution for continuous-time temporal graphs.
New method for faster graph parameter inference from large random Kronecker graphs.
GraphMoE generates random graphs using neural networks and graphlets.
Scalable machine learning with path signatures for time series and graphs.
Random quotients of mapping class groups have rigid properties.
Graph Neural Networks struggle on random graphs without node identifiers.
The Dynamic Chain Event Graph (DCEG) is able to depict many classes of discrete random processes exhibiting asymmetries in their developments and context-specific conditional probabilities structures. However, paradoxically, this very generality has so far frustrated its wide application. So in this paper we develop an…