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:
- ☆12Sep 26, 2019Updated 7 years ago
- ☆14Jun 3, 2024Updated 2 years ago
- Learning Autoencoders with Relational Regularization☆46Oct 8, 2020Updated 6 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆16Jun 13, 2020Updated 6 years ago
- The code for NeurIPS 2020 paper: Adversarial Crowdsourcing Through Robust Rank-One Matrix Completion.☆10Oct 26, 2020Updated 6 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- 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
- A list of awesome papers and cool resources on optimal transport and its applications in general! As you will notice, this list is curren…☆249May 9, 2021Updated 5 years ago
- This is the code related to the article 'Intrinsic persistent homology via density-based metric learning'☆11May 8, 2023Updated 3 years ago
- Efficient Wasserstein Barycenter in MATLAB (for "Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Support" …☆24Aug 2, 2019Updated 7 years ago
- Contains the code relative to the paper Unbalanced Optimal Transport through Non-negative Penalized Linear Regression https://arxiv.org/a…☆13Oct 26, 2021Updated 5 years ago
- The implementation for the paper "On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm".☆13Apr 11, 2020Updated 6 years ago
- Fast Approximate Quadratic Assignment for (Brain) Graph Matching☆16Aug 23, 2016Updated 10 years ago
- SPOT: Sliced Partial Optimal Transport☆61Mar 6, 2020Updated 6 years ago
- Bayesian Coresets Construction with Accelerated Iterative Hard Thresholding (A-IHT).☆14Apr 8, 2021Updated 5 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Code for Positive-Unlabeled learning.☆34Nov 19, 2022Updated 3 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
- Compute free-support Wasserstein barycenters exactly☆10Aug 22, 2024Updated 2 years ago
- Using Hodge graph neural networks for path prediction; ICML paper @ https://arxiv.org/abs/2102.10058☆13Jan 11, 2022Updated 4 years ago
- ☆17Oct 22, 2020Updated 6 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆50Mar 13, 2023Updated 3 years ago
- Sinkhorn Barycenters via Frank-Wolfe algorithm☆26Feb 3, 2020Updated 6 years ago
- Edge-weighted online bipartite matching (JACM 2022)☆12Jun 18, 2023Updated 3 years ago
- Code for http://proceedings.mlr.press/v80/dvurechensky18a.html☆17Jul 31, 2018Updated 8 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Gromov-Wasserstein based optimal transport for aligning single-cell multi-omics data☆83Jan 25, 2024Updated 2 years ago
- Official Python3 implementation of our ICML 2021 paper "Unbalanced minibatch Optimal Transport; applications to Domain Adaptation"☆53Sep 6, 2022Updated 4 years ago
- Implementation of Inexact Proximal point method for Optimal Transport☆51May 30, 2021Updated 5 years ago
- code submission to NeurIPS2019☆13Aug 9, 2023Updated 3 years ago
- A list of papers for group meeting☆20Jun 20, 2026Updated 4 months ago
- This repository contains codes for performing some clustering techniques including KMeans and Sparse Subspace Clustering☆19Mar 24, 2021Updated 5 years ago
- Differentiable Euler Characteristic Transform☆17Jun 18, 2024Updated 2 years ago
- Collection of resources that combine dynamic systems, control with deep learning.☆31Aug 24, 2026Updated 2 months ago
- Quaternion Product Units for Deep Learning on 3D Rotation Groups☆19May 19, 2020Updated 6 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.
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Jun 14, 2019Updated 7 years ago
- ☆11Aug 22, 2023Updated 3 years ago
- Complete Reinforcement Learning Toolkit for Large Language Models!☆21Aug 2, 2025Updated last year
- It is a repo which allows to compute all divergences derived from the theory of entropically regularized, unbalanced optimal transport. I…☆31Dec 21, 2022Updated 3 years ago
- Code for Optimal Transport for structured data with application on graphs☆111Dec 17, 2022Updated 3 years ago
- ☆18Dec 14, 2021Updated 4 years ago
- Crowdsourcing tools to construct datasets.☆12Sep 17, 2018Updated 8 years ago