AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Tight Bounds for Schrodinger Potential Estimation in Unpaired Data Translation

Nikita Puchkin, Denis Suchkov, Alexey Naumov, Denis Belomestny

ICLR 2026 · Learning theory and algorithms › Sample complexity · approach: Minimax estimation rates

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
replace Wiener reference process with Ornstein-Uhlenbeck referenceLightSB · Gaussian mixture, standardSliced W1: 0.260 -> 0.156Improved
replace Wiener reference with OULightSB · Gaussian mixture, irregularSliced W1: 0.525 -> 0.214Improved
replace Wiener reference with OULightSB · Gaussian mixture, anisotropicSliced W1: 0.255 -> 0.206Improved
replace Wiener reference with OULightSB · Gaussian mixture, irregularMode Coverage: 21.8 -> 25.0Improved
replace Wiener reference with OULightSB · Gaussian mixture, standardMMD: 0.0004 -> 0.0003No clear effect
replace Wiener reference with OULightSB · Single-cell intermediate distributionW1: 0.823 -> 0.812No clear effect
replace Wiener reference with OULightSB · ALAE FFHQ Adult-to-ChildqualitativeImproved

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