AI Paper Atlas

Research map / Learning theory and algorithms / Optimal transport

Optimal Transport for Stationary Markov Chains via Policy Iteration

Kevin O'Connor, Kevin McGoff, Andrew B. Nobel

JMLR 2022 · Learning theory and algorithms › Optimal transport · approach: Sinkhorn and entropic OT algorithms · 5 citations (OpenAlex)

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 exact policy iteration with entropy-regularized approximate versionExactOTC · Simulation, random chains d=100, xi=100total runtime: roughly 80%Improved
weaken regularization by increasing xi (75, 100, 200) (ablation)EntropicOTC · Simulation, random chains d=10 to 100approximation errorImproved
replace 1-step transition coupling with infinite-horizon OTC1-step OTC · Appendix exampleexpected cost: 5/3 -> 1Improved
use EntropicOTC instead of ExactOTC for pairwise piece costsExactOTC · Music HMM pairs (36 pieces)pairwise OTC cost: 8 x 10^-3 average differenceNo clear effect

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