Code for ECML/PKDD paper: "LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport"
☆17Jun 27, 2021Updated 5 years ago
Alternatives and similar repositories for LSMI-Sinkhorn
Users that are interested in LSMI-Sinkhorn are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Mutual Information Neural Estimation (Pytorch)☆13Jun 29, 2020Updated 6 years ago
- Conditional Mutual Informaation Neural Estimator☆15Oct 23, 2020Updated 5 years ago
- ☆21Jun 3, 2023Updated 3 years ago
- ☆24Sep 10, 2021Updated 5 years ago
- Code for NeurIPS 2019 paper "Screening Sinkhorn Algorithm for Regularized Optimal Transport"☆10Feb 10, 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.
- Matlab code for tree-Wasserstein distance in the paper "Tree-Sliced Variants of Wasserstein Distances", NeurIPS, 2019. (Tam Le, Makoto Y…☆11Mar 11, 2020Updated 6 years ago
- ☆19Sep 24, 2021Updated 5 years ago
- Scalable data valuation using optimal transport (ICLR 2025)☆15Jul 15, 2025Updated last year
- Code for "Fast Unbalanced Optimal Transport on a Tree" (NeurIPS 2020)☆13Oct 22, 2020Updated 5 years ago
- Tight Mutual Information Estimation With Contrastive Fenchel-Legendre Optimization☆11Nov 29, 2022Updated 3 years ago
- Learning Autoencoders with Relational Regularization☆46Oct 8, 2020Updated 6 years ago
- Simple and extensible hypergradient for PyTorch☆18Feb 23, 2023Updated 3 years ago
- Code about the paper "Joint Contrastive Triple-learning for Deep Multi-view Clustering"☆16Sep 23, 2024Updated 2 years ago
- Learnable Global Pooling Layers Based on Regularized Optimal Transport (ROT)☆16Mar 17, 2024Updated 2 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.
- Euclidean Wasserstein-2 optimal transportation☆46Aug 19, 2023Updated 3 years ago
- This is the code related to the article 'Intrinsic persistent homology via density-based metric learning'☆11May 8, 2023Updated 3 years ago
- Masked Hardware AES with HPC☆21Jul 17, 2026Updated 3 months 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
- Mutual information estimators and benchmarks☆14Oct 6, 2026Updated last week
- Code for paper "One Pass Late Fusion Multi-view Clustering" (ICML 2021)☆17Jul 30, 2021Updated 5 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆17Jan 19, 2023Updated 3 years ago
- ☆20Jun 16, 2020Updated 6 years ago
- ☆17Aug 29, 2025Updated last year
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- About PyTorch implementation for ‘’Robust Multi-View Clustering with Noisy Correspondence‘’ (TKDE 2024)☆11Aug 2, 2024Updated 2 years ago
- source code of IJCAI 2021 paper "Graph Representation with Curriculum Contrastive Learning"☆26Jul 7, 2021Updated 5 years ago
- Diffusion-based Missing-view Generation With the Application on Incomplete Multi-view Clustering☆10May 26, 2024Updated 2 years ago
- ☆17Oct 5, 2020Updated 6 years ago
- Introduction and related code for our NeurIPS22 paper ‘ Align then Fusion: Generalized Large-scale Multi-view Clustering with Anchor Matc…☆25Oct 24, 2022Updated 3 years ago
- Code for "Re-evaluating Word Mover’s Distance" (ICML 2022)☆40Jun 15, 2022Updated 4 years ago
- The source code for "Multimodal Variational Autoencoders for Semi-Supervised Learning: In Defense of Product-of-Experts"☆15Nov 24, 2020Updated 5 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆32Nov 1, 2022Updated 3 years ago
- ☆11May 9, 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.
- Matlab code for the TKDE 2023 paper "Fast Multi-view Clustering via Ensembles: Towards Scalability, Superiority, and Simplicity".☆29Aug 29, 2025Updated last year
- ☆12Dec 7, 2019Updated 6 years ago
- eSNN - Learning similarity measure from data☆12Nov 28, 2019Updated 6 years ago
- ☆10May 3, 2022Updated 4 years ago
- ☆10Feb 4, 2016Updated 10 years ago
- Official PyTorch implementation of 🏁 MFCVAE 🏁: "Multi-Facet Clustering Variatonal Autoencoders (MFCVAE)" (NeurIPS 2021). A class of var…☆41Sep 2, 2023Updated 3 years ago
- [ICML2023] InfoOT: Information Maximizing Optimal Transport☆41Apr 27, 2023Updated 3 years ago