AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Statistical and Topological Properties of Sliced Probability Divergences

NeurIPS 2020 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of ranking and selection · 18 citations (OpenAlex)

Read the paperCheck 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
slice the divergence (Sliced-Wasserstein instead of Wasserstein)Wasserstein · Gaussian samples, varying dimensionsample-complexity convergence rateHelped
slice the Sinkhorn divergence (Sliced-Sinkhorn)Sinkhorn divergence · Gaussian samples, varying d and epsilonsample-complexity convergence rateHelped
slice the Sinkhorn divergence (Sliced-Sinkhorn)Sinkhorn divergence · MNIST/CIFAR-10 two-sampleexecution time: almost 130 times fasterHelped
slice the Sinkhorn divergence (Sliced-Sinkhorn)Sinkhorn divergence · Gaussian samples, increasing dimensionSinkhorn iterations until convergenceHelped
use sliced divergences in two-sample testing on real dataWasserstein and Sinkhorn · MNIST and CIFAR-10samples needed to converge to zeroHelped
increase number of Monte Carlo projections L (ablation)Sliced-Wasserstein · Gaussian samples, d=2 to 100Monte Carlo errorHelped

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