Higher-Order Persistence Diagrams

Persistent homology tracks when topological features appear and disappear across filtered data and represents the lifetime of each feature by a persistence interval. In multiple instance learning, when the instances in a bag use filtrations over the same ordered parameter space, we can compare relationships between persistence intervals across instances. No existing method is designed to aggregate collections of persistence diagrams in multiple instance learning into a single persistence diagram of implications between intervals. We introduce higher-order persistence diagrams to represent relationships between persistence intervals and recursively construct each higher-order persistence interval from a pair of lower-order persistence intervals. We then aggregate these relationships across the persistence diagrams in a bag. Explicit construction of this aggregate is computationally expensive, so we introduce harmonic aggregation to compute coordinates of the aggregate from the lower-order persistence diagrams without explicitly constructing it. Computing a harmonic aggregation coordinate has lower asymptotic computational complexity than explicitly constructing the aggregate. We evaluate harmonic aggregation against persistence landscapes, persistence images, and PersLay on random network model and real-world graph-classification benchmarks, and find that harmonic aggregation has the highest accuracy on the random network model benchmark and on most real-world data benchmarks. Anonymized code is available at https://anonymous.4open.science/r/higher-order-PDs-BB69.