Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs/2002.08276
☆21Mar 3, 2020Updated 6 years ago
Alternatives and similar repositories for partial-GW-for-PU
Users that are interested in partial-GW-for-PU are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Fast Approximate Quadratic Assignment for (Brain) Graph Matching☆16Aug 23, 2016Updated 9 years ago
- This is the code related to the article 'Intrinsic persistent homology via density-based metric learning'☆10May 8, 2023Updated 3 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆17Jan 19, 2023Updated 3 years ago
- The code for NeurIPS 2020 paper: Adversarial Crowdsourcing Through Robust Rank-One Matrix Completion.☆10Oct 26, 2020Updated 5 years ago
- A list of awesome papers and cool resources on optimal transport and its applications in general! As you will notice, this list is curren…☆246May 9, 2021Updated 5 years ago
- Proton VPN Special Offer - Get 70% off • AdSpecial partner offer. Trusted by over 100 million users worldwide. Tested, Approved and Recommended by Experts.
- Bayesian Coresets Construction with Accelerated Iterative Hard Thresholding (A-IHT).☆14Apr 8, 2021Updated 5 years ago
- J-D. Benamou, G. Carlier, M. Cuturi, L. Nenna, G. Peyré. Iterative Bregman Projections for Regularized Transportation Problems. SIAM Jour…☆34Jan 7, 2017Updated 9 years ago
- ☆17Oct 22, 2020Updated 5 years ago
- Tools for generating and comparing Decorated Merge Trees, enriched persistence-based topological data descriptors.☆17Aug 27, 2022Updated 3 years ago
- Scalable Bayes via Barycenter in Wasserstein Space☆10Sep 7, 2017Updated 8 years ago
- Learning Generative Models across Incomparable Spaces (ICML 2019)☆29Mar 11, 2020Updated 6 years ago
- ☆20Jun 14, 2019Updated 7 years ago
- Python implementation of smooth optimal transport.☆60May 5, 2021Updated 5 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Dec 8, 2022Updated 3 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.
- Code for NIPS 2017 spotlight paper: "Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration" by Jason Alt…☆30Jan 4, 2018Updated 8 years ago
- ☆14Jun 3, 2024Updated 2 years ago
- This repository contains codes for performing some clustering techniques including KMeans and Sparse Subspace Clustering☆19Mar 24, 2021Updated 5 years ago
- Efficient Wasserstein Barycenter in MATLAB (for "Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Support" …☆24Aug 2, 2019Updated 6 years ago
- code submission to NeurIPS2019☆13Aug 9, 2023Updated 2 years ago
- Quaternion Product Units for Deep Learning on 3D Rotation Groups☆19May 19, 2020Updated 6 years ago
- Complete Reinforcement Learning Toolkit for Large Language Models!☆21Aug 2, 2025Updated 10 months ago
- Scalable framework for comparing metric measure spaces with up to 1M points.