matthklein / fair_k_center_clusteringLinks
Code for our paper "Fair k-Center Clustering for Data Summarization"
☆12Updated 6 years ago
Alternatives and similar repositories for fair_k_center_clustering
Users that are interested in fair_k_center_clustering are comparing it to the libraries listed below
Sorting:
- ☆32Updated 7 years ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆20Updated 6 years ago
- Coresets☆37Updated 3 years ago
- Non-Parametric Calibration for Classification (AISTATS 2020)☆19Updated 3 years ago
- Learning Tree structures and Tree metrics☆24Updated last year
- FALKON implementation used in the experimental section of "FALKON: An Optimal Large Scale Kernel Method"☆30Updated 5 years ago
- SpectralClustering_RandomBinning (SC_RB) is a simple code for scaling up spectral clustering on large-scale datasets.☆12Updated 6 years ago
- PyTorch implementation of the paper "Neural Decomposition: Functional ANOVA with Variational Autoencoders"☆25Updated 5 years ago
- This packages provides a simple python implementation of Invariant Causal Prediction (ICP)☆13Updated last year
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆57Updated 6 years ago
- Optimization and Regularization variants of Non-negative Matrix Factorization (NMF)☆34Updated 7 years ago
- The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…☆49Updated 2 years ago
- Dirichlet Process K-means☆48Updated last year
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 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
- CO-Optimal Transport☆42Updated 5 years ago
- NeurIPS 2016. Linear-time interpretable nonparametric two-sample test.☆64Updated 7 years ago
- Stochastic Gradient Riemannian Langevin Dynamics☆34Updated 10 years ago
- The Shape of Data: Intrinsic Distance for Comparing Data Distributions☆12Updated 6 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- Python implementation of smooth optimal transport.☆60Updated 4 years ago
- Python implementation of the Invariant Causal Prediction (ICP) algorithm, from the 2015 paper "Causal inference using invariant predictio…☆24Updated last year
- [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.☆26Updated 6 years ago
- NeurIPS 2017 best paper. An interpretable linear-time kernel goodness-of-fit test.☆67Updated 6 years ago
- Change Detection in Graph Streams by Learning Graph Embeddings on Constant-Curvature Manifolds (2018, https://arxiv.org/abs/1805.06299)☆11Updated 5 years ago
- ☆21Updated 6 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆37Updated 2 years ago
- Approximate knockoffs and model-free variable selection.☆56Updated 4 years ago
- Code for the Structural Agnostic Model (https://arxiv.org/abs/1803.04929)☆54Updated 4 years ago
- Distance Metric Learning Algorithms for Python☆175Updated 4 years ago