Pith. sign in

REVIEW 2 cited by

Robust Barycenter Estimation using Semi-Unbalanced Neural Optimal Transport

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.03974 v2 pith:FKVJPNFG submitted 2024-10-04 stat.ML cs.AIcs.LG

classification stat.MLcs.AIcs.LG
keywords barycenterproblemrobustbarycenterscontinuousdataestimatingmethod
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Aggregating data from multiple sources can be formalized as an Optimal Transport (OT) barycenter problem, which seeks to compute the average of probability distributions with respect to OT discrepancies. However, in real-world scenarios, the presence of outliers and noise in the data measures can significantly hinder the performance of traditional statistical methods for estimating OT barycenters. To address this issue, we propose a novel scalable approach for estimating the robust continuous barycenter, leveraging the dual formulation of the (semi-)unbalanced OT problem. To the best of our knowledge, this paper is the first attempt to develop an algorithm for robust barycenters under the continuous distribution setup. Our method is framed as a min-max optimization problem and is adaptable to general cost functions. We rigorously establish the theoretical underpinnings of the proposed method and demonstrate its robustness to outliers and class imbalance through a number of illustrative experiments. Our source code is publicly available at https://github.com/milenagazdieva/U-NOTBarycenters.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Wasserstein Gradient Flows for Scalable and Regularized Barycenter Computation

    stat.ML 2025-10 conditional novelty 5.0 of 10

    A mini-batch Wasserstein gradient-flow algorithm computes scalable and label-aware Wasserstein barycenters, with empirical gains on domain adaptation.

  2. A Robust Local Fr\'echet Regression Using Unbalanced Neural Optimal Transport with Applications to Dynamic Single-cell Genomics Data

    stat.AP 2025-06 reject novelty 5.0 of 10

    A neural-network local Fréchet regression using unbalanced optimal transport is introduced to interpolate single-cell distributions over time, with applications to three differentiation datasets.

Pith tools