Alternatives and similar repositories for MMSR:

Users that are interested in MMSR are comparing it to the libraries listed below

• yuan-li / truth-inference-at-scale
  ☆20Updated 5 years ago
• charlesjin / adversarial_regularization
  A method based on manifold regularization for training adversarially robust neural networks
  ☆9Updated 5 years ago
• GiulsLu / OT-gradients
  ☆12Updated 6 years ago
• spdj2271 / DEKM
  Deep Embedded K-means Clustering (DEKM)
  ☆27Updated 4 months ago
• siplab-gt / generative-causal-explanations
  Code for "Generative causal explanations of black-box classifiers"
  ☆34Updated 4 years ago
• eddardd / WBTransport
  This repo contains the implementation of the Wasserstein Barycenter Transport proposed in "Wasserstein Barycenter Transport for Acoustic …
  ☆30Updated 2 years ago
• ethanhezhao / NeuralSinkhornTopicModel
  Neural Topic Model via Optimal Transport, ICLR 2021
  ☆15Updated 4 years ago
• lchapel / partial-GW-for-PU
  Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…
  ☆21Updated 5 years ago
• JunwenBai / MPVAE
  MPVAE: Multivariate Probit Variational AutoEncoder for Multi-Label Classification
  ☆31Updated 7 months ago
• IBM / wasserstein-barycenters
  Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…
  ☆22Updated 5 years ago
• iesl / expLinkage
  Supervised hierarchical clustering
  ☆10Updated 5 years ago
• GemsLab / RGM
  Fast embedding-based graph classification with connections to kernels
  ☆12Updated 5 years ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• Hv0nnus / MLOT
  This is the repository to reproduce the experiments of the IJCAI 2020 paper "Metric Learning in Optimal Transport for Domain Adaptation"
  ☆22Updated 4 years ago
• TrentoCrowdAI / crowdsourced-datasets
  Crowdsourced datasets including the individual crowd votes.
  ☆39Updated 5 years ago
• rflamary / JDOT
  Joint distribution optimal transportation for domain adaptation
  ☆102Updated 7 years ago
• maksym33 / FeatureImportanceDL
  ☆43Updated 2 years ago
• eelxpeng / ltvae-release
  ☆22Updated 5 years ago
• kilianFatras / minibatch_Wasserstein
  Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".
  ☆13Updated 4 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆68Updated 5 years ago
• chauhanjatin10 / GraphsFewShot
  Few Shot Learning on Graphs
  ☆33Updated 2 years ago
• microsoft / Domain-Adaptation-with-Conditional-Distribution-Matching-and-Generalized-Label-Shift
  Code for the paper Domain Adaptation with Conditional Distribution Matching and Generalized Label Shift
  ☆37Updated 4 years ago
• jamie2017 / LearningWithNoisyLabels
  Implementation of a state-of-art algorithm from the paper “Learning with Noisy Labels” , which is the first one providing “guarantees for…
  ☆21Updated 7 years ago
• ZaydH / arbitrary_pu
  NeurIPS'20 Paper: "Learning from Positive and Unlabeled Data with Arbitrary Positive Shift"
  ☆17Updated last year
• nmonath / hyperbolic_hierarchical_clustering
  Code for: Gradient-based Hierarchical Clustering using Continuous Representations of Trees in Hyperbolic Space. Nicholas Monath, Manzil Z…
  ☆44Updated 5 years ago
• Newbeeer / Max-MIG
  Code for ICLR 2019 Paper, "MAX-MIG: AN INFORMATION THEORETIC APPROACH FOR JOINT LEARNING FROM CROWDS"
  ☆25Updated last year
• mohsenkheirandishfard / DLRSC
  This is a Pytorch implementation of "Deep Low-Rank Subspace Clustering" (CVPRW 2020).
  ☆14Updated 4 years ago
• bhanML / SIGUA
  ICML'20: SIGUA: Forgetting May Make Learning with Noisy Labels More Robust
  ☆15Updated 4 years ago
• dcmoyer / inv-rep
  Code for Invariant Rep. Without Adversaries (NIPS 2018)
  ☆35Updated 5 years ago