activity
20172020
most citedHierarchical Optimal Transport for Document Representation

49 citations · 168 across the 8 of their papers we have counts for

collaborators

8 papers

cs.LG2020★ 2 cited

Model Fusion with Kullback--Leibler Divergence

Sebastian Claici, Mikhail Yurochkin, Soumya Ghosh +1

We propose a method to fuse posterior distributions learned from heterogeneous datasets. Our algorithm relies on a mean field assumption for both the fused model and the individual…

cs.LG2019★ 10 cited

Incorporating Unlabeled Data into Distributionally Robust Learning

Charlie Frogner, Sebastian Claici, Edward Chien +1

We study a robust alternative to empirical risk minimization called distributionally robust learning (DRL), in which one learns to perform against an adversary who can choose the d…

cs.LG2019★ 2 cited

Alleviating Label Switching with Optimal Transport

Pierre Monteiller, Sebastian Claici, Edward Chien +3

Label switching is a phenomenon arising in mixture model posterior inference that prevents one from meaningfully assessing posterior statistics using standard Monte Carlo procedure…

cs.LG2019★ 49 cited

Hierarchical Optimal Transport for Document Representation

Mikhail Yurochkin, Sebastian Claici, Edward Chien +2

The ability to measure similarity between documents enables intelligent summarization and analysis of large corpora. Past distances between documents suffer from either an inabilit…

math.AP2018★ 33 cited

Dynamical Optimal Transport on Discrete Surfaces

Hugo Lavenant, Sebastian Claici, Edward Chien +1

We propose a technique for interpolating between probability distributions on discrete surfaces, based on the theory of optimal transport. Unlike previous attempts that use linear…

stat.ML2018★ 4 cited

Wasserstein Measure Coresets

Sebastian Claici, Aude Genevay, Justin Solomon

The proliferation of large data sets and Bayesian inference techniques motivates demand for better data sparsification. Coresets provide a principled way of summarizing a large dat…

cs.LG2018★ 46 cited

Stochastic Wasserstein Barycenters

Sebastian Claici, Edward Chien, Justin Solomon

We present a stochastic algorithm to compute the barycenter of a set of probability distributions under the Wasserstein metric from optimal transport. Unlike previous approaches, o…

cs.LG2017★ 22 cited

Parallel Streaming Wasserstein Barycenters

Matthew Staib, Sebastian Claici, Justin Solomon +1

Efficiently aggregating data from different sources is a challenging problem, particularly when samples from each source are distributed differently. These differences can be inher…