1 code implementation • 15 Jun 2022 • Jongwoo Ko, Bongsoo Yi, Se-Young Yun
While existing methods address this problem in various directions, they still produce unpredictable sub-optimal results since they rely on the posterior information estimated by the feature extractor corrupted by noisy labels.
2 code implementations • 13 Jun 2021 • Bongsoo Yi, Kevin O'Connor, Kevin McGoff, Andrew B. Nobel
Given two networks and a cost function relating their vertices, NetOTC finds a transition coupling of their associated random walks having minimum expected cost.
