Generative graph dictionary learning

Z Zeng, R Zhu, Y Xia, H Zeng… - … Conference on Machine …, 2023 - proceedings.mlr.press
Dictionary learning, which approximates data samples by a set of shared atoms, is a
fundamental task in representation learning. However, dictionary learning over graphs …

Parrot: Position-aware regularized optimal transport for network alignment

Z Zeng, S Zhang, Y Xia, H Tong - … of the ACM Web Conference 2023, 2023 - dl.acm.org
Network alignment is a critical steppingstone behind a variety of multi-network mining tasks.
Most of the existing methods essentially optimize a Frobenius-like distance or ranking-based …

Hierarchical multi-marginal optimal transport for network alignment

Z Zeng, B Du, S Zhang, Y Xia, Z Liu… - Proceedings of the AAAI …, 2024 - ojs.aaai.org
Finding node correspondence across networks, namely multi-network alignment, is an
essential prerequisite for joint learning on multiple networks. Despite great success in …

Distribution alignment optimization through neural collapse for long-tailed classification

J Gao, H Zhao, D dan Guo, H Zha - Forty-first International …, 2024 - openreview.net
A well-trained deep neural network on balanced datasets usually exhibits the Neural
Collapse (NC) phenomenon, which is an informative indicator of the model achieving good …

TOT: topology-aware optimal transport for multimodal hate detection

L Zhang, L Jin, X Sun, G Xu, Z Zhang, X Li… - Proceedings of the …, 2023 - ojs.aaai.org
Multimodal hate detection, which aims to identify the harmful content online such as memes,
is crucial for building a wholesome internet environment. Previous work has made …

Wasserstein-based graph alignment

HP Maretic, M El Gheche, M Minder… - … on Signal and …, 2022 - ieeexplore.ieee.org
A novel method for comparing non-aligned graphs of various sizes is proposed, based on
the Wasserstein distance between graph signal distributions induced by the respective …

Bures-Wasserstein means of graphs

I Haasler, P Frossard - International Conference on Artificial …, 2024 - proceedings.mlr.press
Finding the mean of sampled data is a fundamental task in machine learning and statistics.
However, in cases where the data samples are graph objects, defining a mean is an …

Exploiting Geometry for Treatment Effect Estimation via Optimal Transport

Y Yan, Z Yang, W Chen, R Cai, Z Hao… - Proceedings of the AAAI …, 2024 - ojs.aaai.org
Estimating treatment effects from observational data suffers from the issue of confounding
bias, which is induced by the imbalanced confounder distributions between the treated and …

A Wasserstein Graph Distance Based on Distributions of Probabilistic Node Embeddings

M Scholkemper, D Kühn, G Nabbefeld… - ICASSP 2024-2024 …, 2024 - ieeexplore.ieee.org
Distance measures between graphs are important primitives for a variety of learning tasks. In
this work, we describe an unsupervised, optimal transport based approach to define a …

An Optimal Transport Approach for Network Regression

AG Zalles, KM Hung, AE Finneran, L Beaudrot… - arXiv preprint arXiv …, 2024 - arxiv.org
We study the problem of network regression, where one is interested in how the topology of
a network changes as a function of Euclidean covariates. We build upon recent …