atlas

Research map / Learning theory and algorithms / Optimal transport

Learning to Count via Unbalanced Optimal Transport

AAAI 2021 · Learning theory and algorithms › Optimal transport · approach: Neural optimal transport · 92 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
Train by minimizing UOT between predicted density and point annotations rather than using Bayesian lossVGG-19 crowd counter · NWPU-CROWDMAE: 105.4 -> 87.8Helped
Train by minimizing UOT between predicted density and point annotations rather than using Bayesian lossVGG-19 crowd counter · UCF-QNRFF-measure: 70.85% -> 74.75%Helped
Use ℓ2 cost rather than ℓ1 cost (ablation)UOT crowd counter · UCF-QNRFMAE: 92.7 -> 83.3Helped
Use ℓ2 cost rather than WFR cost (ablation)UOT crowd counter · UCF-QNRFMAE: 85.8 -> 83.3Helped
Use KL penalty rather than QR penalty with ℓ2 cost (ablation)UOT crowd counter · UCF-QNRFMAE: 87.1 -> 83.3Helped
Use KL penalty rather than QR penalty with ℓ1 cost (ablation)UOT crowd counter · UCF-QNRFMAE: 91.6 -> 92.7No clear effect
Use ℓ2 cost and KL penalty rather than WFR cost and QR penalty (ablation)UOT crowd counter · UCF-QNRFMSE: 152.1 -> 142.3Helped

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