A Stable Multi-Scale Kernel for Topological Machine Learning
Topological data analysis offers a rich source of valuable information to study vision problems. Yet, so far we lack a theoretically sound connection to popular kernel-based learning techniques, such as kernel SVMs or kernel PCA. In this work, we establish such a connection by designing a multi-scale kernel for persistence diagrams, a stable summary representation of topological features in data. We show that this kernel is positive definite and prove its stability with respect to the 1-Wasserstein distance. Experiments on two benchmark datasets for 3D shape classification/retrieval and texture recognition show considerable performance gains of the proposed method compared to an alternative approach that is based on the recently introduced persistence landscapes.
Code (0)
등록된 구현이 없습니다.
Tasks
3D Shape ClassificationBIG-bench Machine LearningGeneral ClassificationRetrievalTopological Data AnalysisMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A Kernel for Multi-Parameter Persistent Homology
Topological data analysis and its main method, persistent homology, provide a toolkit for computing topological information of high-dimensional and noisy data sets. Kernels for one-parameter persistent homology have been…
BIG-bench Machine LearningTopological Data AnalysisTopological Machine Learning with Persistence Indicator Functions
Techniques from computational topology, in particular persistent homology, are becoming increasingly relevant for data analysis. Their stable metrics permit the use of many distance-based data analysis methods, such as m…
BIG-bench Machine LearningTopological Data AnalysisTopological Bayesian Optimization with Persistence Diagrams
Finding an optimal parameter of a black-box function is important for searching stable material structures and finding optimal neural network structures, and Bayesian optimization algorithms are widely used for the purpo…
Bayesian OptimizationTopological Data AnalysisLipschitz Bounds for Persistent Laplacian Eigenvalues under One-Simplex Insertions
Persistent Laplacians are matrix operators that track how the shape and structure of data transform across scales and are popularly adopted in biology, physics, and machine learning. Their eigenvalues are concise descrip…
Topological Data AnalysisHigher-order topological kernels via quantum computation
Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. TDA enhances the analysis of objects by embedding them into a simplicial complex and extracting useful …
Quantum Machine LearningTopological Data Analysis