The Sinkhorn treatment effect is a new entropic optimal transport measure of divergence between counterfactual distributions that admits first- and second-order pathwise differentiability, debiased estimators, and asymptotically valid tests for distributional treatment effects.
Computational optima l transport
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
citation-role summary
background 2
method 1
citation-polarity summary
verdicts
UNVERDICTED 8representative citing papers
Modern text encoders resist second-order collapse under mean pooling because token embeddings concentrate tightly within texts, and this resistance correlates with stronger downstream performance.
Defines Hausdorff-style and Wasserstein-style metrics on C-sets, proving the latter are convex relaxations of the former and computable as linear programs.
Decoding alignment metrics can remain high and unchanged even when encoding manifold topology is causally altered, so they do not imply similar function or computation across neural populations.
SPIN performs bidirectional domain transfer in SBI to retain parameter mutual information from unlabeled real observations, improving real-world posterior inference under increasing misspecification.
Derives MSIP algorithm from MMD gradient flows for weighted quantization, extending mean shift and relating to preconditioned gradient descent and Lloyd's clustering.
PCA scatterplots misleadingly indicate clusters in Kuehneotherium teeth data, whereas t-SNE and persistent homology detect a ring-like one-dimensional manifold, backed by a generative model of uniform sampling from a unit circle whose cosine distances follow an arcsine distribution.
Documents a practical PyTorch implementation of batched Sinkhorn iterations for the entropy-regularized Wasserstein loss introduced by Cuturi.
citing papers explorer
-
Hausdorff and Wasserstein metrics on graphs and other structured data
Defines Hausdorff-style and Wasserstein-style metrics on C-sets, proving the latter are convex relaxations of the former and computable as linear programs.