paper-with-me

홈 › Papers

Max-sliced Bures Distance for Interpreting Discrepancies

2021-01-01 · Austin J. Brockmeier, Claudio Cesar Claros, Carlos H. Mendoza-Cardenas, Yüksel Karahan, Matthew S. Emigh, Luis Gonzalo Sanchez Giraldo

We propose the max-sliced Bures distance, a lower bound on the max-sliced Wasserstein-2 distance, to identify the instances associated with the maximum discrepancy between two samples. By scoring instances by an energy-based witness function, the proposed divergence can identify the specific subsets that are not well matched between the distributions. Localizing these discrepancies can be used to detect and correct for covariate shift and to evaluate generative adversarial networks. Similar to the Fréchet distance, the max-sliced Bures distance can be computed using the first and second-order moments and is able to capture changes in higher-order statistics through a non-linear mapping. We explore two types of non-linear mappings: positive semidefinite kernels where the witness functions belong to a reproducing kernel Hilbert space, and task-relevant mappings learned by a neural network. In the context of samples of natural images, our approach provides an interpretation of the Fréchet inception distance by identifying the synthetic and natural instances that are either over-represented or under-represented with respect to the other sample. We apply the proposed measure to detect imbalances in class distributions in various data sets and to critique generative models.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Hyperbolic Sliced-Wasserstein via Geodesic and Horospherical Projections

2022-11-18 · Clément Bonet, Laetitia Chapel, Lucas Drumetz, Nicolas Courty

It has been shown beneficial for many types of data which present an underlying hierarchical structure to be embedded in hyperbolic spaces. Consequently, many tools of machine learning were extended to such spaces, but o…

image-classificationImage Classification

Spherical Sliced-Wasserstein

2022-06-17 · Clément Bonet, Paul Berg, Nicolas Courty, François Septier 외

Many variants of the Wasserstein distance have been introduced to reduce its original computational burden. In particular the Sliced-Wasserstein distance (SW), which leverages one-dimensional projections for which a clos…

Density EstimationVariational Inference

A Sliced-Wasserstein Framework on Correlation Matrices for EEG Decoding

2026-06-04 · Chen Hu, Rui Wang, Jiale Zhou, Jingjun Yi 외 arxiv

Electroencephalography (EEG) offers noninvasive, millisecond resolution recordings of neuronal activity and is widely used in neuroscience and healthcare. Many EEG decoding pipelines rely on covariance descriptors for th…

Domain GeneralizationEeg Decoding

Mixability of Integral Losses: a Key to Efficient Online Aggregation of Functional and Probabilistic Forecasts

2019-12-15 · Alexander Korotin, Vladimir V'yugin, Evgeny Burnaev

In this paper we extend the setting of the online prediction with expert advice to function-valued forecasts. At each step of the online game several experts predict a function, and the learner has to efficiently aggrega…

Subspace Detours: Building Transport Plans that are Optimal on Subspace Projections

2019-05-24 · NeurIPS 2019 12 · Boris Muzellec, Marco Cuturi

Computing optimal transport (OT) between measures in high dimensions is doomed by the curse of dimensionality. A popular approach to avoid this curse is to project input measures on lower-dimensional subspaces (1D lines …

Domain AdaptationWord Embeddings