Landmine598 / OT-DALinks
☆14Updated 5 years ago
Alternatives and similar repositories for OT-DA
Users that are interested in OT-DA are comparing it to the libraries listed below
Sorting:
- (ICASSP'21/CVPR'21) Wasserstein Barycenter Transport☆30Updated 3 years ago
- Invariant-feature Subspace Recovery (ISR)☆23Updated 3 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆58Updated 7 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Efficient Conditionally Invariant Representation Learning (ICLR 2023, Oral)☆21Updated 2 years ago
- ☆42Updated 5 years ago
- ☆37Updated 4 years ago
- Official Python3 implementation of our ICML 2021 paper "Unbalanced minibatch Optimal Transport; applications to Domain Adaptation"☆47Updated 3 years ago
- Distributional Sliced-Wasserstein distance code☆50Updated last year
- Code for the paper Domain Adaptation with Conditional Distribution Matching and Generalized Label Shift☆38Updated 5 years ago
- A new mini-batch framework for optimal transport in deep generative models, deep domain adaptation, approximate Bayesian computation, col…☆36Updated 2 years ago
- Pytorch implementation of regularization methods for deep networks obtained via kernel methods.☆22Updated 5 years ago
- This repository is the implementation of Deep Dirichlet Process Mixture Models (UAI 2022)☆13Updated 3 years ago
- ☆17Updated 3 years ago
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆22Updated 6 years ago
- Code for Model Agnostic Sample Reweighting for Out-of-Distribution Learning☆44Updated 2 years ago
- PyTorch implementation for the ICLR 2020 paper "Understanding the Limitations of Variational Mutual Information Estimators"☆77Updated 5 years ago
- Code for "Generalisation Guarantees for Continual Learning with Orthogonal Gradient Descent" (ICML 2020 - Lifelong Learning Workshop)☆44Updated 3 years ago
- Robust Optimal Transport code☆43Updated 3 years ago
- ☆33Updated 4 years ago
- ☆49Updated 3 years ago
- We define and estimate smooth unique information of samples with respect to classifier weights and predictions. We compute these quantiti…☆11Updated 4 years ago
- ☆36Updated 4 years ago
- ☆44Updated 3 weeks ago
- Code for the paper "Getting a CLUE: A Method for Explaining Uncertainty Estimates"☆36Updated last year
- Learning Autoencoders with Relational Regularization☆46Updated 5 years ago
- ☆31Updated 4 years ago
- Official implementation of paper Gradient Matching for Domain Generalization☆122Updated 3 years ago
- Code for "Just Train Twice: Improving Group Robustness without Training Group Information"☆72Updated last year
- Implementation of the paper "Understanding anomaly detection with deep invertible networks through hierarchies of distributions and featu…☆42Updated 4 years ago