A Proofs

Neural Information Processing Systems 

Proof of Theorem 2. The Kantorovich Rubinstein (KR) distance is defined as follows. The optimal partial transport distance is defined as follows. We prove the contraposition of Theorem 2 for the KR distance. We solve the BHCP problem using this algorithm.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found