View abstract

Session I.4 - Computational Geometry and Topology

Tuesday, June 13, 14:30 ~ 15:00

Topological Optimization with Big Steps

Dmitriy Morozov

Lawrence Berkeley National Laboratory, USA   -   This email address is being protected from spambots. You need JavaScript enabled to view it.

Using persistent homology to guide optimization has emerged as a novel application of topological data analysis. Existing methods treat persistence calculation as a black box and backpropagate gradients only onto the simplices involved in particular pairs. We show how the cycles and chains used in the persistence calculation can be used to prescribe gradients to larger subsets of the domain. In particular, we show that in a special case, which serves as a building block for general losses, the problem can be solved exactly in linear time. We present empirical experiments that show the practical benefits of our algorithm: the number of steps required for the optimization is reduced by an order of magnitude.

Joint work with Arnur Nigmetov (Lawrence Berkeley National Laboratory, USA).

View abstract PDF