4 papers
Johnson-Lindenstrauss Lemma Beyond Euclidean Geometry
Chengyuan Deng, Jie Gao, Kevin Lu +2
The Johnson-Lindenstrauss (JL) lemma is a cornerstone of dimensionality reduction in Euclidean space, but its applicability to non-Euclidean data has remained limited. This paper e…
TopInG: Topologically Interpretable Graph Learning via Persistent Rationale Filtration
Cheng Xin, Fan Xu, Xin Ding +2
Graph Neural Networks (GNNs) have shown remarkable success across various scientific fields, yet their adoption in critical decision-making is often hindered by a lack of interpret…
Vantage Point Selection Algorithms for Bottleneck Capacity Estimation
Vikrant Ashvinkumar, Rezaul Chowdhury, Jie Gao +3
Motivated by the problem of estimating bottleneck capacities on the Internet, we formulate and study the problem of vantage point selection. We are given a graph whose e…
On The Expressive Power of Knowledge Graph Embedding Methods
Jiexing Gao, Dmitry Rodin, Vasily Motolygin +1
Knowledge Graph Embedding (KGE) is a popular approach, which aims to represent entities and relations of a knowledge graph in latent spaces. Their representations are known as embe…