samirasamadi / Fair-PCA
Code of Fair PCA algorithm introduced in the paper "The Price of Fair PCA: One Extra Dimension"
☆27Updated 2 years ago
Alternatives and similar repositories for Fair-PCA
Users that are interested in Fair-PCA are comparing it to the libraries listed below
Sorting:
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆73Updated 8 years ago
- Wasserstein regularization for sparse multi-task regression☆15Updated 4 years ago
- CUDA extension for the SPORCO project☆18Updated 3 years ago
- A matlab toolbox to perform Wasserstein Dictionary Learning or NMF☆32Updated 8 years ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆18Updated 5 years ago
- Adaptive optimization procedure☆16Updated 7 years ago
- Sliced Wasserstein Distance for Learning Gaussian Mixture Models☆62Updated 2 years ago
- Tensor methods have emerged as a powerful paradigm for consistent learning of many latent variable models such as topic models, independe…☆17Updated 8 years ago
- supervised deep sparse coding networks☆31Updated 7 years ago
- Implementation of the ALI-G algorithm (PyTorch, Tensorflow)☆22Updated 4 years ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆55Updated 6 years ago
- Scaled MMD GAN☆36Updated 5 years ago
- Code for http://proceedings.mlr.press/v80/dvurechensky18a.html☆16Updated 6 years ago
- Greedy Adaptive Dictionary (GAD) is a learning algorithm that sets out to find sparse atoms for speech signals.☆11Updated 6 years ago
- ☆15Updated 7 years ago
- Tensorflow Implementation of "Large-scale Optimal Transport and Mapping Estimation"(ICLR2018/NIPS 2017 OTML)☆19Updated 6 years ago
- In this paper, we show that the performance of a learnt generative model is closely related to the model's ability to accurately represen…☆41Updated 4 years ago
- Experiments for ICML paper DICOD: Distributed Convolutional Coordinate Descent for Convolutional Sparse Coding, ICML 2018, T. Moreau, L. …☆12Updated 6 years ago
- GitHub repository for "Building Deep Networks on Grassmann Manifolds", AAAI 2018.☆25Updated 3 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- The Deep Weight Prior, ICLR 2019☆45Updated 4 years ago
- Implementation of Rippel, Snoek, and Adams 2015 (https://arxiv.org/pdf/1506.03767.pdf)☆38Updated 6 years ago
- demo codes for several approximate optimal transport solvers☆20Updated 7 years ago
- Uncertainty interpretations of the neural network☆32Updated 7 years ago
- Keras implementation of Deep Wasserstein Embeddings☆48Updated 7 years ago
- Code for NeurIPS 2019 paper "Screening Sinkhorn Algorithm for Regularized Optimal Transport"☆10Updated 5 years ago
- Efficient Wasserstein Barycenter in MATLAB (for "Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Support" …☆25Updated 5 years ago
- Repository with code for paper "Inhibited Softmax for Uncertainty Estimation in Neural Networks"☆25Updated 6 years ago
- PyTorch Implementation of CVPR'19 - On the Intrinsic Dimensionality of Image Representation☆23Updated 5 years ago
- Code for NIPS 2017 spotlight paper: "Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration" by Jason Alt…☆31Updated 7 years ago