The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
☆35Jan 22, 2021Updated 5 years ago
Alternatives and similar repositories for WEGL
Users that are interested in WEGL are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- The Linear Optimal Transport Framework☆16Oct 7, 2020Updated 6 years ago
- Source code for CIKM 2019 paper "Temporal Network Embedding with Micro- and Macro-dynamics"☆36Dec 27, 2021Updated 4 years ago
- Feature Selection using Simulated Annealing☆11Aug 10, 2022Updated 4 years ago
- Implementation of the Sliced Wasserstein Autoencoders☆92Jun 6, 2018Updated 8 years ago
- Official repository of "Minibatch optimal transport distances; analysis and applications" (https://arxiv.org/pdf/2101.01792.pdf)☆10Oct 15, 2021Updated 5 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- ☆10Jun 22, 2022Updated 4 years ago
- The pytorch implementation of ClusterSCL (WWW2022).☆15Apr 20, 2023Updated 3 years ago
- Code for our TMLR '24-ICLR '25 work: MMD-Regularized UOT.☆10Jun 23, 2025Updated last year
- Accompanying code for the ICML'23 paper "Unscented Autoencoder", authored by Faris Janjos, Lars Rosenbaum, Maxim Dolgov, and J. Marius Zo…☆10Sep 14, 2023Updated 3 years ago
- Guiding Entity Alignment via Adversarial Knowledge Embedding☆16Oct 21, 2020Updated 6 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 5 years ago
- The Implementation of "AutoNE: Hyperparameter Optimization for Massive Network Embedding"(KDD 2019)☆17Jul 6, 2023Updated 3 years ago
- [ICLR 2023] "Graph Domain Adaptation via Theory-Grounded Spectral Regularization" by Yuning You, Tianlong Chen, Zhangyang Wang, Yang Shen☆25Feb 27, 2023Updated 3 years ago
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆24Nov 18, 2019Updated 6 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- ☆12May 31, 2021Updated 5 years ago
- ☆11Feb 22, 2024Updated 2 years ago
- ☆14Jun 22, 2024Updated 2 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆77Aug 20, 2019Updated 7 years ago
- Official Pytorch implementation for "Tree-Based Diffusion Schrödinger Bridge with Applications to Wasserstein Barycenters" (NeurIPS 2023)☆10Mar 5, 2024Updated 2 years ago
- PyTorch implementation of "Wasserstein-2 Generative Networks" (ICLR 2021)☆67Feb 3, 2023Updated 3 years ago
- Code for Semi-relaxed Gromov-Wasserstein divergence with applications on graphs (ICLR 2022)☆10Mar 11, 2022Updated 4 years ago
- GOODAT: Towards Test-time Graph Out-of-Distribution Detection☆13Mar 18, 2024Updated 2 years ago
- A Pytorch implementation of missing data imputation using optimal transport.☆108Jun 20, 2021Updated 5 years ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- ☆18Dec 6, 2020Updated 5 years ago
- Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants☆16Apr 23, 2026Updated 6 months ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Dec 8, 2022Updated 3 years ago
- Persistence Learning☆15Sep 1, 2017Updated 9 years ago
- ☆16May 19, 2025Updated last year
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Jun 14, 2019Updated 7 years ago
- Implementation of the BasePlanE models and the experiments from the NeurIPS 2023 paper "PlanE: Representation Learning over Planar Graphs…☆13Jan 27, 2024Updated 2 years ago
- Custom graph/network/multi-weighted network class based on storing list of neighbors for each nodes (as opposed to edge list) for scalabl…☆11Jan 18, 2024Updated 2 years ago
- Python implementation of the supervised graph prediction method proposed in http://arxiv.org/abs/2202.03813 using PyTorch library and POT…☆15Feb 25, 2022Updated 4 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- PyTorch implementation of the OT-Flow approach in arXiv:2006.00104☆61Jul 25, 2024Updated 2 years ago
- Code for Optimal Transport for structured data with application on graphs☆111Dec 17, 2022Updated 3 years ago
- Representation and learning framework for dynamic graphs using Graph Neural Networks.☆12Feb 4, 2022Updated 4 years ago
- Implementation of Pooling by Sliced-Wasserstein Embedding (NeurIPS 2021)☆11Nov 10, 2021Updated 4 years ago
- ☆60Jul 10, 2019Updated 7 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆35Feb 20, 2020Updated 6 years ago
- [WSDM'23] GOOD-D: On Unsupervised Graph Out-Of-Distribution Detection☆44Mar 2, 2023Updated 3 years ago