AI Paper Atlas

Research map / Learning theory and algorithms / Optimal transport

On the Benefit of Optimal Transport for Curriculum Reinforcement Learning

Pascal Klink, Carlo D’Eramo, Jan Peters, Joni Pajarinen

TPAMI 2024 · Learning theory and algorithms › Optimal transport · approach: Neural optimal transport · 9 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
add entropy lower bound on task distribution (H_LB 0.5) (ablation)CURROT · E-Maze, pseudo-metric d_P*final return: 0 -> 0.45Improved
add entropy lower bound (H_LB 0.5) (ablation)CURROT · E-Maze, shortest-path distancefinal return: 0.62 -> 0.61No clear effect
add entropy lower bound (H_LB 1.0) (ablation)CURROT · E-Maze, shortest-path distancefinal return: 0.62 -> 0.53Hurt
add entropy regularization (lambda 1e-2) (ablation)GRADIENT · E-Maze, pseudo-metric d_P*final return: 0.55 -> 0.30Hurt
add entropy regularization (lambda 1e-4) (ablation)GRADIENT · E-Maze, shortest-path distancefinal return: 0.60 -> 0.62No clear effect
use Euclidean distance instead of shortest-path distance (ablation)CURROT and GRADIENT · E-Mazefinal return: 0.62 -> 0Hurt
use pseudo-metric d_P* instead of shortest-path distance (ablation)CURROT · E-Mazefinal return: 0.62 -> 0Hurt

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