Alleviating Label Switching with Optimal Transport
Label switching is a phenomenon arising in mixture model posterior inference that prevents one from meaningfully assessing posterior statistics using standard Monte Carlo procedures. This issue arises due to invariance of the posterior under actions of a group; for example, permuting the ordering of mixture components has no effect on the likelihood. We propose a resolution to label switching that leverages machinery from optimal transport. Our algorithm efficiently computes posterior statistics in the quotient space of the symmetry group. We give conditions under which there is a meaningful solution to label switching and demonstrate advantages over alternative approaches on simulated and real data.
Code (1)
Similar Papers 제목 키워드 기반
OT-Filter: An Optimal Transport Filter for Learning With Noisy Labels
The success of deep learning is largely attributed to the training over clean data. However, data is often coupled with noisy labels in practice. Learning with noisy labels is challenging because the performance of t…
Learning with noisy labelsMemorizationFine-Tuning Graph Neural Networks via Graph Topology induced Optimal Transport
Recently, the pretrain-finetuning paradigm has attracted tons of attention in graph learning community due to its power of alleviating the lack of labels problem in many real-world applications. Current studies use exist…
Graph ClassificationGraph LearningGraph Neural NetworkMolecular Property Prediction+1Folded Transport MCMC: Eliminating Label Switching by Sampling on a Fundamental Domain
In Bayesian mixture models and other exchangeable-component models, the posterior is invariant under permutation of component labels, creating m! equivalent modes-the label-switching problem. Standard MCMC methods either…
Many processors, little time: MCMC for partitions via optimal transport couplings
Markov chain Monte Carlo (MCMC) methods are often used in clustering since they guarantee asymptotically exact expectations in the infinite-time limit. In finite time, though, slow mixing often leads to poor performance.…
ClusteringTo Switch or Not to Switch? Balanced Policy Switching in Offline Reinforcement Learning
Reinforcement learning (RL) -- finding the optimal behaviour (also referred to as policy) maximizing the collected long-term cumulative reward -- is among the most influential approaches in machine learning with a large …
Offline RLReinforcement Learning (RL)