Skip to content

Landmine598/OT-DA

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

25 Commits
 
 
 
 

Repository files navigation

OT-DA

Optimal Transport Theories

Ae-OT: a New Generative Model based on Extended Semi-discrete Optimal transport. ICLR 2020
Sliced optimal transport sampling. ACM Trans. Graph. 39(4): 99 (2020)
A General Approach to Fairness with Optimal Transport. AAAI 2020: 3633-3640
Optimal Transport in Reproducing Kernel Hilbert Spaces: Theory and Applications. IEEE Trans. Pattern Anal. Mach. Intell. 42(7): 1741-1754 (2020)
Optimal transport in Reproducing Kernel Hilbert Spaces: Theory and applications [2019TPAMI]
Fast and flexible inference of joint distributions from their marginals.[ICML2019]
On Scalable and Efficient Computation of Large Scale Optimal Transport [ICML2019]
On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms [ICML2019]
A Graph Theoretic Additive Approximation of Optimal Transport [2019NIPS]
Hierarchical Optimal Transport for Multimodal Distribution Alignment [2019NIPS]
Screening Sinkhorn Algorithm for Regularized Optimal Transport [2019NIPS]
A Direct tilde{O}(1/epsilon) Iteration Parallel Algorithm for Optimal Transport [2019NIPS]
Large-scale optimal transport map estimation using projection pursuit [2019NIPS]
Discriminator optimal transport [2019NIPS]
Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem [2019NIPS]
Approximate Optimal Transport for Continuous Densities with Copulas [2019IJCAI]
Large-scale Optimal Transport and Mapping Estimation [2018ICML]
Semi-dual Regularized Optimal Transport [2018SIAM]
Stochastic Optimization for Large-scale Optimal Transport [2016NIPS]
Mapping estimation for discrete optimal transport [2016NIPS]
Sinkhorn distances: Lightspeed computation of optimal transport [2013NIPS]
Entropic regularization of continuous optimal
Smooth and sparse optimal transport [2018ICAIS]
On the translocation of masses [2006JMS]
Forward-Backward Splitting for Optimal Transport based Problems [2019arXiv]

Wasserstein

Pattern-Based Music Generation with Wasserstein Autoencoders and PRC Descriptions [2020IJCAI]
Unsupervised Multilingual Alignment using Wasserstein Barycenter [2020IJCAI]
Barycenters of Natural Images–Constrained Wasserstein Barycenters for Image Morphing [CVPR2020]
Severity-Aware Semantic Segmentation with Reinforced Wasserstein Training [CVPR2020]
Three-Player Wasserstein GAN via Amortised Duality [IJCAI2019]
Parallel Wasserstein Generative Adversarial Nets with Multiple Discriminators [IJCAI2019]
Asymptotic Guarantees for Learning Generative Models with the Sliced-Wasserstein Distance [NIPS2019]
Multi-marginal Wasserstein GAN [NIPS2019]
Propagating Uncertainty in Reinforcement Learning via Wasserstein Barycenters [NIPS2019]
Wasserstein Weisfeiler-Lehman Graph Kernels [NIPS2019]
Quantum Wasserstein Generative Adversarial Networks [NIPS2019]
Interior-Point Methods Strike Back: Solving the Wasserstein Barycenter Problem [NIPS2019]
Stochastic Runge-Kutta Accelerates Langevin Monte Carlo and Beyond [NIPS2019]
Concentration of risk measures: A Wasserstein distance approach [NIPS2019]
Tree-Sliced Variants of Wasserstein Distances [NIPS2019]
Sliced Gromov-Wasserstein [NIPS2019]
Wasserstein Dependency Measure for Representation Learning [NIPS2019]
Accelerated Linear Convergence of StochasƟc Momentum Methods in Wasserstein Distances [ICML2019]
A Gradual, Semi-Discrete Approach to GeneraƟve Network Training via Explicit Wasserstein MinimizaƟon [ICML2019]
Wasserstein of Wasserstein Loss for Learning GeneraƟve Models[ICML2019]
On the Complexity of ApproximaƟng Wasserstein Barycenters [ICML2019]
Understanding MCMC Dynamics as Flows on the Wasserstein Space [ICML2019]
Sliced-Wasserstein Flows: Nonparametric GeneraƟve Modeling via OpƟmal Transport and Diffusions [ICML2019]
The Wasserstein Transform [ICML2019]
Subspace Robust Wasserstein Distances [ICML2019]
Wasserstein Adversarial Examples via Projected Sinkhorn IteraƟons [ICML2019]
Gromov-Wasserstein Learning for Graph Matching and Node Embedding [ICML2019]

Smooth

Sinkhorn Algorithm as a Special Case of Stochastic Mirror Descent
Gaussian-Smoothed Optimal Transport Metric Structure and Statistical Efficiency
An Optimal Control Derivation of Nonlinear Smoothing Equations
Accelerated Alternating Minimization, Accelerated Sinkhorn’s Algorithm and Accelerated Iterative Bregman Projections
A geometric approach to the transport of discontinuous densities

Applications

Domain Adaptation

Multi-source Domain Adaptation via Weighted Joint Distributions Optimal Transport. CoRR abs/2006.12938 (2020)
Metric Learning in Optimal Transport for Domain Adaptation [2020IJCAI][pytorch]
Joint Partial Optimal Transport for Open Set Domain Adaptation [2020IJCAI]
Reliable Weighted Optimal Transport for Unsupervised Domain Adaptation [2020CVPR]
Enhanced Transport Distance for Unsupervised Domain Adaptation [2020CVPR]
Differentially Private Optimal Transport: Application to Domain Adaptation [2019IJCAI]
Normalized Wasserstein for Mixture Distributions with Applications in Adversarial Learning and Domain Adaptation [2019ICCV]
Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptation [2019CVPR]
Locality Preserving Joint Transfer for Domain Adaptation [2019TIP-]
Statistical Optimal Transportvia Factored Couplings [2019AISTATS]
Optimal Transport for Multi-source Domain Adaptation under Target Shift [2019AISTATS]
Semi-supervised optimal transport for heterogeneous domain adaptation [2018IJCAI]
Unsupervised Domain Adaptation with Regularized Optimal Transport [2018IEEE会议]
Feature Selection for Unsupervised Domain Adaptation [2018]
DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptation [2018ECCV]
Re-weighted Adversarial Adaptation Network for Unsupervised Domain Adaptation [2018CVPR]
Wasserstein Distance Guided Representation Learning for Domain Adaptation [2018AAAI]
Joint distribution optimal transportation for domain adaptation [2017NIPS]
Optimal Transport for Domain Adaptation [2016PAMI]
Fast computation of wasserstein barycenters [2014ICML]

GAN

Three-Player Wasserstein GAN via Amortised Duality [2019IJCAI]
Wasserstein generative adversarial networks [2017ICML]

Others

Evaluating Natural Language Generation via Unbalanced Optimal Transport [IJCAI2020]
Improving Cross-lingual Entity Alignment via Optimal Transport [2019IJCAI]
Hierarchical Optimal Transport for Document Representation [2019NIPS]
Differentiable Ranking and Sorting using Optimal Transport [2019NIPS]
Lower Bounds on Adversarial Robustness from Optimal Transport [2019NIPS]
Solving graph compression via optimal transport [2019NIPS]
Alleviating Label Switching with Optimal Transport [2019NIPS]
GOT: An Optimal Transport framework for Graph comparison [2019NIPS]
Obtaining Fairness using Optimal Transport Theory [ICML2019]
Optimal Transport for structured data with application on graphs [ICML2019]
Synchronizing Probability Measures on Rotations via Optimal Transport [2020CVPR]
Semantic Correspondence as an Optimal Transport Problem [CVPR2020]
遥感An Entropic Optimal Transport loss for learning deep neural networks under label noise in remote sensing images. Comput. Vis. Image Underst. 191: 102863 (2020)
Unsupervised Domain Adaptation With Optimal Transport in Multi-Site Segmentation of Multiple Sclerosis Lesions From MRI Data. Frontiers Comput. Neurosci. 14: 19 (2020)
Weakly supervised cross-domain alignment with optimal transport. CoRR abs/2008.06597 (2020)
Domain Generalization with Optimal Transport and Metric Learning. CoRR abs/2007.10573 (2020)
Sequence Generation with Optimal-Transport-Enhanced Reinforcement Learning. AAAI 2020: 7512-7520
Optimal Feature Transport for Cross-View Image Geo-Localization. AAAI 2020: 11990-11997 Rationalizing Text Matching: Learning Sparse Alignments via Optimal Transport. ACL 2020: 5609-5626
Ae-OT: a New Generative Model based on Extended Semi-discrete Optimal transport. ICLR 2020

2020AISTATS Context Mover's Distance & Barycenters: Optimal Transport of Contexts for Building Representations
Utility/Privacy Trade-off through the lens of Optimal Transport.
Regularity as Regularization: Smooth and Strongly Convex Brenier Potentials in Optimal Transport
Unsupervised Hierarchy Matching with Optimal Transport over Hyperbolic Spaces
Spatio-temporal alignments: Optimal transport through space and time
Fast Algorithms for Computational Optimal Transport and Wasserstein Barycenter.
Quantitative stability of optimal transport maps and linearization of the 2-Wasserstein space
Gaussian-Smoothed Optimal Transport: Metric Structure and Statistical Efficiency

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published