Finding the Homology of Decision Boundaries with Active Learning

Accurately and efficiently characterizing the decision boundary of classifiers is important for problems related to model selection and meta-learning. Inspired by topological data analysis, the characterization of decision boundaries using their homology has recently emerged as a general and powerful tool. In this paper, we propose an active learning algorithm to recover the homology of decision boundaries. Our algorithm sequentially and adaptively selects which samples it requires the labels of. We theoretically analyze the proposed framework and show that the query complexity of our active learning algorithm depends naturally on the intrinsic complexity of the underlying manifold. We demonstrate the effectiveness of our framework in selecting best-performing machine learning models for datasets just using their respective homological summaries. Experiments on several standard datasets show the sample complexity improvement in recovering the homology and demonstrate the practical utility of the framework for model selection. Source code for our algorithms and experimental results is available at this https URL.

[1]  Chao Chen,et al.  A Topological Regularizer for Classifiers via Persistent Homology , 2019, AISTATS.

[2]  Karsten M. Borgwardt,et al.  A Persistent Weisfeiler-Lehman Procedure for Graph Classification , 2019, ICML.

[3]  Verónica Bolón-Canedo,et al.  Can classification performance be predicted by complexity measures? A study using microarray data , 2017, Knowledge and Information Systems.

[4]  Dmitriy Morozov,et al.  Geometry Helps to Compare Persistence Diagrams , 2016, ALENEX.

[5]  Robert Ghrist,et al.  Elementary Applied Topology , 2014 .

[6]  Amos J. Storkey,et al.  Towards a Neural Statistician , 2016, ICLR.

[7]  Kenji Fukumizu,et al.  Persistence weighted Gaussian kernel for topological data analysis , 2016, ICML.

[8]  Kush R. Varshney,et al.  Topological Data Analysis of Decision Boundaries with Application to Model Selection , 2019, ICML.

[9]  Kush R. Varshney,et al.  Persistent topology of decision boundaries , 2015, 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[10]  Tin Kam Ho,et al.  Measures of Geometrical Complexity in Classification Problems , 2006 .

[11]  Frédéric Chazal,et al.  Homotopy Reconstruction via the Cech Complex and the Vietoris-Rips Complex , 2020, Symposium on Computational Geometry.

[12]  Alex Krizhevsky,et al.  Learning Multiple Layers of Features from Tiny Images , 2009 .

[13]  Andreas Uhl,et al.  Deep Learning with Topological Signatures , 2017, NIPS.

[14]  Stephen Smale,et al.  Finding the Homology of Submanifolds with High Confidence from Random Samples , 2008, Discret. Comput. Geom..

[15]  Ruslan Salakhutdinov,et al.  On Characterizing the Capacity of Neural Networks using Algebraic Topology , 2018, ArXiv.

[16]  Alon Itai,et al.  Geometry Helps in Bottleneck Matching and Related Problems , 2001, Algorithmica.

[17]  H. Edelsbrunner,et al.  Persistent Homology — a Survey , 2022 .

[18]  Karsten M. Borgwardt,et al.  Neural Persistence: A Complexity Measure for Deep Neural Networks Using Algebraic Topology , 2018, ICLR.

[19]  Yoshua Bengio,et al.  Gradient-based learning applied to document recognition , 1998, Proc. IEEE.

[20]  Robert D. Nowak,et al.  S2: An Efficient Graph Based Active Learning Algorithm with Application to Nonparametric Classification , 2015, COLT.

[21]  Ulrich Bauer Ripser: efficient computation of Vietoris-Rips persistence barcodes , 2019, ArXiv.