Review for NeurIPS paper: Heuristic Domain Adaptation

Summary and Contributions: The paper presents a method inspired by heuristic search algorithms (such as A*) for the problem of Domain Adaptation (DA). The authors claim that to achieve domain invariant representations, one must explicitly model domain-specific characteristics. The ideal representation is considered as the goal and the intermediate domain-specific representations are regarded as the distance from the current representation to the ideal one. When the heuristic representations are near zero the terminal state is reached. To achieve this goal the authors propose a domain adaptation network made of a fundament network F and a heuristic network H (that is possibly divided into several subnetworks).