matthklein / fair_k_center_clustering
Code for our paper "Fair k-Center Clustering for Data Summarization"
☆11Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for fair_k_center_clustering
- Coresets☆37Updated 2 years ago
- Variational Fair clustering☆11Updated 5 months 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
- Wasserstein regularization for sparse multi-task regression☆15Updated 4 years ago
- [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.☆26Updated 5 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- Non-Parametric Calibration for Classification (AISTATS 2020)☆19Updated 2 years ago
- ☆12Updated 3 years ago
- Code of the paper Fair k-Means Clustering☆13Updated 3 years ago
- MDL Complexity computations and experiments from the paper "Revisiting complexity and the bias-variance tradeoff".☆18Updated last year
- FALKON implementation used in the experimental section of "FALKON: An Optimal Large Scale Kernel Method"☆29Updated 4 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- MATLAB implementation of linear support vector classification in hyperbolic space☆21Updated 6 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆18Updated 5 years ago
- Learning Tree structures and Tree metrics☆23Updated 3 months ago
- ☆10Updated 8 months ago
- Binary Classifier Calibration Models☆15Updated 7 years ago
- Software relating to relational empirical risk minimization☆17Updated 3 years ago
- Code for the paper "Getting a CLUE: A Method for Explaining Uncertainty Estimates"☆36Updated 6 months ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 4 years ago
- Efficient LSH-based kernel density estimation☆28Updated 5 years ago
- ☆12Updated 6 years ago
- A study of performance of optimal transport.☆10Updated 4 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 4 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- Source code for the Joint Shapley values: a measure of joint feature importance☆13Updated 3 years ago
- python code for kernel methods☆37Updated 5 years ago
- Variational Auto-Regressive Gaussian Processes for Continual Learning☆20Updated 3 years ago
- Pytorch package for geometric softmax☆12Updated 5 years ago
- ☆22Updated 9 years ago