Slide 17
Slide 17 text
Intro Fisher 情報幾何 Entropy-constrained transportation problem 最適輸送の幾何 λ-divergences in Sn−1 Discussions References
Transportation problem
▶ χ = (X1
, X2
, . . . , Xn) = χS ∪ χR
;
▶ χS = (X1
, . . . , Xs), p = (p1
, . . . , ps), pi = 1;
▶ χR = (Xj1
, . . . , Xjr
), q = (q1
, . . . , qr), qi = 1;
▶ 輸送計画:s × r 行列 P = (Pij):
j
Pij = pi,
i
Pij = qj,
ij
Pij = 1. (25)
式 (25)を満たす輸送計画集合を U(p, q) と書く.
17/37