atlas

Research map / Learning theory and algorithms / Optimal transport

Sliced Wasserstein Kernels for Probability Distributions

CVPR 2016 · Learning theory and algorithms › Optimal transport · approach: Sliced Wasserstein variants · 144 citations (OpenAlex)

Check your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use Sliced Wasserstein Gaussian or polynomial kernels instead of linear or RBF kernelsSVM classification on UIUC texture and LHI animal face · UIUC texture and LHI animal faceclassification accuracyHelped
Use Sliced Wasserstein kernel PCA instead of PCA on the input distributionsUIUC texture and LHI animal face · UIUC texture and LHI animal facecumulative percent varianceHelped
Use Sliced Wasserstein Gaussian kernel k-means instead of k-means on the input distributionsUIUC texture and LHI animal face · UIUC texture and LHI animal faceV-measureHelped
Use Sliced Wasserstein Gaussian kernel k-means instead of k-means on the input distributionsUIUC texture and LHI animal face · UIUC texture and LHI animal facewithin-cluster sum-of-squares (inertia)Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy