LCSL / bless
Fast algorithm for leverage score sampling, low rank (kernel) matrix factorization and PCA
☆15Updated last year
Related projects ⓘ
Alternatives and complementary repositories for bless
- Rudi, A., Camoriano, R. and Rosasco, L., Less is more: Nyström computational regularization. In Advances in Neural Information Processing…☆12Updated 5 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
- Code for "Exponential Family Estimation via Adversarial Dynamics Embedding" (NeurIPS 2019)☆13Updated 4 years ago
- Wasserstein regularization for sparse multi-task regression☆15Updated 4 years ago
- This repository contains an implementation of the Batch-BKB algorithm as described in the ICML 2020 paper "Near-linear time Gaussian proc…☆13Updated 4 years ago
- ☆12Updated 3 years ago
- Variational Auto-Regressive Gaussian Processes for Continual Learning☆20Updated 3 years ago
- Examples of more involved applications using Geomstats☆32Updated 3 years ago
- A lightweight, multithreaded Python package for sketching, column selection, leverage scores and related computations.☆19Updated 2 months ago
- [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.☆26Updated 5 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- Fast graph-regularized matrix factorization☆20Updated last year
- Pytorch implementation of Planar Flow☆17Updated 4 years ago
- Scalable Log Determinants for Gaussian Process Kernel Learning (https://arxiv.org/abs/1711.03481) (NIPS 2017)☆18Updated 7 years ago
- A lightweight didactic library of kernel methods using the back-end JAX.☆12Updated last year
- FALKON implementation used in the experimental section of "FALKON: An Optimal Large Scale Kernel Method"☆29Updated 4 years ago
- MATLAB implementation of linear support vector classification in hyperbolic space☆21Updated 6 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆28Updated 5 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆18Updated 5 years ago
- Python implementation of smooth optimal transport.☆56Updated 3 years ago
- ☆10Updated 2 years ago
- Supplementary code for the paper "Meta-Solver for Neural Ordinary Differential Equations" https://arxiv.org/abs/2103.08561☆25Updated 3 years ago
- Random feature latent variable models in Python☆22Updated last year
- MDL Complexity computations and experiments from the paper "Revisiting complexity and the bias-variance tradeoff".☆18Updated last year
- ☆17Updated 5 years ago
- Code for Fast Information-theoretic Bayesian Optimisation☆16Updated 6 years ago
- Learning generative models with Sinkhorn Loss☆28Updated 6 years ago
- Investigate the speed of adaptation of structural causal models☆16Updated 3 years ago
- LaTeX source code for the slides☆22Updated 3 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year