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.
Develops GNNs for incomplete graphs, improving learning from missing node attributes.
MissNODAG learns cyclic causal graphs from incomplete data.
MGMC method handles missing data in medical datasets for accurate disease classification.
We prove that the pressure metric on the Teichmüller space of a bordered surface is incomplete and its partial completion can be given by the moduli space of metric graphs for a fat graph associated to the same bordered surface equipped with pressure metric. As a corollary, we show that the pressure metric is not a con…
Graph neural networks (GNNs) are a popular class of machine learning models whose major advantage is their ability to incorporate a sparse and discrete dependency structure between data points. Unfortunately, GNNs can only be used when such a graph-structure is available. In practice, however, real-world graphs are oft…
New method discovers causal structures from incomplete data.
Bayesian method infers transition matrices from incomplete graph data with topological constraints.
A new framework learns cyclic causal graphs from incomplete data.
Clinical diagnostic decision making and population-based studies often rely on multi-modal data which is noisy and incomplete. Recently, several works proposed geometric deep learning approaches to solve disease classification, by modeling patients as nodes in a graph, along with graph signal processing of multi-modal …
Two new methods improve graph embedding without needing a complete graph structure.
WGNN learns graph representations from incomplete attribute data.
Graph Convolutional Networks (GCNs) have received increasing attention in the machine learning community for effectively leveraging both the content features of nodes and the linkage patterns across graphs in various applications. As real-world graphs are often incomplete and noisy, treating them as ground-truth inform…
A method to complete incomplete correlation matrices using maximum entropy.
Graph neural networks fail to distinguish certain 3D atom configurations.
We study the problem of learning influence functions under incomplete observations of node activations. Incomplete observations are a major concern as most (online and real-world) social networks are not fully observable. We establish both proper and improper PAC learnability of influence functions under randomly missi…
NeuralIF uses neural networks to improve preconditioning for faster CG convergence.
PAIR-CI calibrates CI tests for causal discovery with incomplete data.
Unified framework infers time-varying graphs from incomplete signals.
Learning low-dimensional embeddings of knowledge graphs is a powerful approach used to predict unobserved or missing edges between entities. However, an open challenge in this area is developing techniques that can go beyond simple edge prediction and handle more complex logical queries, which might involve multiple un…
We consider the problem of signal recovery on graphs as graphs model data with complex structure as signals on a graph. Graph signal recovery implies recovery of one or multiple smooth graph signals from noisy, corrupted, or incomplete measurements. We propose a graph signal model and formulate signal recovery as a cor…
Paper explores exact recovery of communities in weighted graphs using Gaussian and exponential distributions.
Real-time traffic volume inference is key to an intelligent city. It is a challenging task because accurate traffic volumes on the roads can only be measured at certain locations where sensors are installed. Moreover, the traffic evolves over time due to the influences of weather, events, holidays, etc. Existing soluti…
Knowledge graphs have emerged as an important model for studying complex multi-relational data. This has given rise to the construction of numerous large scale but incomplete knowledge graphs encoding information extracted from various resources. An effective and scalable approach to jointly learn over multiple graphs …
This paper evaluates knowledge graph completion models under the open-world assumption, revealing unexpected behavior of metrics.
Graph machine learning lacks a balanced theory, focusing on expressive power and optimization.
Algorithm learns graph ARMA processes for missing signal estimation.
Spectral clustering is one of the most popular, yet still incompletely understood, methods for community detection on graphs. This article studies spectral clustering based on the Bethe-Hessian matrix for sparse heterogeneous graphs (following the degree-corrected stochastic block model) in a …
Paper introduces a graph-based approach for retrosynthesis prediction.
Knowledge graph embeddings rank among the most successful methods for link prediction in knowledge graphs, i.e., the task of completing an incomplete collection of relational facts. A downside of these models is their strong sensitivity to model hyperparameters, in particular regularizers, which have to be extensively …
New method clusters strong and weak views effectively, improving performance by up to 40%.
The paper explores the -Liouville property on graphs and its connections to stochastic completeness.
Paper addresses group synchronization with incomplete measurements and proves linear convergence of GPM.
In matrix factorization, available graph side-information may not be well suited for the matrix completion problem, having edges that disagree with the latent-feature relations learnt from the incomplete data matrix. We show that removing these edges improves prediction accuracy and scalability. We…
Method reconstructs missing wind farm data using graph theory and nearest neighbors.
Knowledge graphs enable a wide variety of applications, including question answering and information retrieval. Despite the great effort invested in their creation and maintenance, even the largest (e.g., Yago, DBPedia or Wikidata) remain incomplete. We introduce Relational Graph Convolutional Networks (R-GCNs) and app…
The noncompact Yamabe flow can lead to incomplete metrics over infinite time.
Spatial-temporal graph modeling is an important task to analyze the spatial relations and temporal trends of components in a system. Existing approaches mostly capture the spatial dependency on a fixed graph structure, assuming that the underlying relation between entities is pre-determined. However, the explicit graph…
New flow preserves singularities on incomplete manifolds.
The possibility of statistical evaluation of the market completeness and incompleteness is investigated for continuous time diffusion stock market models. It is known that the market completeness is not a robust property: small random deviations of the coefficients convert a complete market model into a incomplete one.…
Graph structured data provide two-fold information: graph structures and node attributes. Numerous graph-based algorithms rely on both information to achieve success in supervised tasks, such as node classification and link prediction. However, node attributes could be missing or incomplete, which significantly deterio…
GRAPE uses graph representation to handle missing data in feature imputation and label prediction.
Knowledge Graphs (KGs) have found many applications in industry and academic settings, which in turn, have motivated considerable research efforts towards large-scale information extraction from a variety of sources. Despite such efforts, it is well known that even state-of-the-art KGs suffer from incompleteness. Link …
In order to find a way of measuring the degree of incompleteness of an incomplete financial market, the rank of the vector price process of the traded assets and the dimension of the associated acceptance set are introduced. We show that they are equal and state a variety of consequences.
New method improves traffic speed estimation from sparse data.
Proposes a novel graph learning framework for robust graph topology learning from graph signals.
This paper solves hedging in incomplete markets using neural networks.
New method clusters multilayer graphs with missing nodes.
NePTuNe combines neural and tensor methods for efficient link prediction in knowledge graphs.