Publication
Wasserstein propagation for semi-supervised learning
Probability distributions and histograms are natural representations for product ratings, traffic measurements, and other data considered in many machine learning applications. Thus, this paper introduces a technique for graph-based semi-supervised learning of histograms, derived from the theory of optimal transportation. Our method has several properties making it suitable for this application; in particular, its behavior can be characterized by the moments and shapes of the histograms at the labeled nodes. In addition, it can be used for histograms on non-standard domains like circles, revealing a strategy for manifold-valued semi-supervised learning. We also extend this technique to related problems such as smoothing distributions on graph nodes.
Download publicationAssociated Researchers
Related Resources
See what’s new.
01/01/2015
Pouch Motors: Printable Soft Actuators Integrated with Computational Design
We propose pouch motors, a new family of printable soft actuators…
01/01/2012
Consensus Meshing
Consider an algorithm for generating a triangle mesh interpolating a…
02/22/2023
Machine Shop Safety 101: How to Work Smart & Safe
A primer on machine shop safety from the Fusion 360 team. …
11/28/2022
From Fiction to Future: [better] World Building
Using speculative fiction to explore how the future might look and…
Get in touch
Something pique your interest? Get in touch if you’d like to learn more about Autodesk Research, our projects, people, and potential collaboration opportunities.
Contact us