Regularized Wasserstein Means for Aligning Distributional Data
We propose to align distributional data from the perspective of Wasserstein means. We raise the problem of regularizing Wasserstein means and propose several terms tailored to tackle different problems. Our formulation is based on the variational transportation to distribute a sparse discrete measure into the target domain. The resulting sparse representation well captures the desired property of the domain while reducing the mapping cost. We demonstrate the scalability and robustness of our method with examples in domain adaptation, point set registration, and skeleton layout.
Code (1)
Tasks
Domain AdaptationSimilar Papers 제목 키워드 기반
Distributional Reinforcement Learning with Regularized Wasserstein Loss
The empirical success of distributional reinforcement learning (RL) highly relies on the choice of distribution divergence equipped with an appropriate distribution representation. In this paper, we propose \textit{Sinkh…
Atari GamesDistributional Reinforcement Learningreinforcement-learningReinforcement Learning+1Exact Generalization Guarantees for (Regularized) Wasserstein Distributionally Robust Models
Wasserstein distributionally robust estimators have emerged as powerful models for prediction and decision-making under uncertainty. These estimators provide attractive generalization guarantees: the robust objective obt…
Decision MakingDecision Making Under UncertaintyUnregularized limit of stochastic gradient method for Wasserstein distributionally robust optimization
Distributionally robust optimization offers a compelling framework for model fitting in machine learning, as it systematically accounts for data uncertainty. Focusing on Wasserstein distributionally robust optimization, …
Adversarial Classification via Distributional Robustness with Wasserstein Ambiguity
We study a model for adversarial classification based on distributionally robust chance constraints. We show that under Wasserstein ambiguity, the model aims to minimize the conditional value-at-risk of the distance to m…
ClassificationGeneral ClassificationConfidence Regions in Wasserstein Distributionally Robust Estimation
Wasserstein distributionally robust optimization estimators are obtained as solutions of min-max problems in which the statistician selects a parameter minimizing the worst-case loss among all probability models within a…