sidak / context-mover-distance-and-barycentersView external linksLinks
Code accompanying our paper at AISTATS 2020
☆21Jan 12, 2021Updated 5 years ago
Alternatives and similar repositories for context-mover-distance-and-barycenters
Users that are interested in context-mover-distance-and-barycenters are comparing it to the libraries listed below
Sorting:
- Code for our ICLR19 paper "Wasserstein Barycenters for Model Ensembling", Pierre Dognin, Igor Melnyk, Youssef Mroueh, Jarret Ross, Cicero…☆23Nov 18, 2019Updated 6 years ago
- A thorough review of the paper "Learning Embeddings into Entropic Wasserstein Spaces" by Frogner et al. Includes a reproduction of the re…☆22Jan 31, 2020Updated 6 years ago
- ☆12Mar 18, 2024Updated last year
- ☆10May 11, 2017Updated 8 years ago
- ☆11Oct 9, 2021Updated 4 years ago
- Python code for implementing embeddings in the Wasserstein space of elliptical distributions☆11Jul 22, 2020Updated 5 years ago
- Code base for NeurIPS 2022 paper Curriculum Reinforcement Learning using Optimal Transport via Gradual Domain Adaptation.☆11Aug 21, 2023Updated 2 years ago
- Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…☆15Apr 26, 2023Updated 2 years ago
- Experimental codes for the paper 'How to Learn Item Representation for Cold-Start Multimedia Recommendation?'☆18Jan 12, 2024Updated 2 years ago
- Supervised Training of Conditional Monge Maps☆19Oct 30, 2023Updated 2 years ago
- The dataset for paper "Why Do We Click: Visual Impression-aware News Recommendation", ACM MM 2021☆15Feb 24, 2022Updated 3 years ago
- Projecting Embeddings for Domain Adaptation: Joint Modeling of Sentiment in Diverse Domains☆16Jun 23, 2018Updated 7 years ago
- "Answering queries over Knowledge Graphs with Graph Convolutional Networks" @ ICLR 2020 Workshop on Graph Representation Learning☆15Jul 13, 2020Updated 5 years ago
- Latent optimal transport (LOT) for low rank transport and clustering☆20Jul 22, 2021Updated 4 years ago
- ☆20Apr 25, 2021Updated 4 years ago
- Tensorflow implementation of optimal transport (OT) with Sinkhorn algorithm.☆19Nov 5, 2019Updated 6 years ago
- Neural Topic Model via Optimal Transport, ICLR 2021☆16Mar 31, 2021Updated 4 years ago
- ☆21Nov 9, 2021Updated 4 years ago
- ☆18Apr 22, 2019Updated 6 years ago
- [ACL 2023]: Training Trajectories of Language Models Across Scales https://arxiv.org/pdf/2212.09803.pdf☆25Nov 14, 2023Updated 2 years ago
- Code for gradient rollback, which explains predictions of neural matrix factorization models, as for example used for knowledge base comp…☆21Mar 16, 2021Updated 4 years ago
- Neural Topic Modeling with Continual Lifelong Learning (ICML 2020)☆24Jun 21, 2020Updated 5 years ago
- Geometry-aware Multilingual Embeddings☆26Dec 8, 2022Updated 3 years ago
- ☆21Mar 3, 2023Updated 2 years ago
- TopicModel4J: A Java Package for Topic Models (Contain LDA, Collapsed Variational Bayesian Inference for LDA, author-topic model, BTM, di…☆28Feb 4, 2023Updated 3 years ago
- Density Order Embeddings☆33May 15, 2019Updated 6 years ago
- Off-policy Learning in Two-stage Recommender Systems. https://dl.acm.org/doi/pdf/10.1145/3366423.3380130☆30Jun 11, 2020Updated 5 years ago
- Pytorch Implemetation for our NAACL2019 Paper "Riemannian Normalizing Flow on Variational Wasserstein Autoencoder for Text Modeling" http…☆63Apr 1, 2020Updated 5 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Nov 1, 2022Updated 3 years ago
- 15619 Cloud Computing☆33May 8, 2014Updated 11 years ago
- This is the Javascript Code, it helps you to find you visited your Facebook Profile.☆12Sep 13, 2018Updated 7 years ago
- C++ implementation of the Hellinger PCA for computing word embeddings.☆32Nov 11, 2016Updated 9 years ago
- ☆41Feb 6, 2021Updated 5 years ago
- General Strategy for Unlearning in Graph Neural Networks☆47Feb 20, 2023Updated 2 years ago
- hierarchical core-periphery structure☆10Jul 21, 2023Updated 2 years ago
- Identifying Nuances in Fake News vs. Satire: Using Semantic and Linguistic Cues (NLP4IF, EMNLP-IJCNLP 2019)☆11Dec 21, 2020Updated 5 years ago
- A fast heuristic search algorithm for finding the longest common subsequence of multiple strings☆10Nov 22, 2023Updated 2 years ago
- ☆10Dec 10, 2018Updated 7 years ago
- Stochastic Kronecker Generation in Python, Used in RPI TRUST☆10Dec 13, 2017Updated 8 years ago