On the effectiveness of persistent homology

• URL: http://arxiv.org/abs/2206.10551v1
• Date: Tue, 21 Jun 2022 17:30:27 GMT
• Title: On the effectiveness of persistent homology
• Authors: Renata Turke\v{s}, Guido Mont\'ufar and Nina Otter
• Abstract summary: Persistent homology (PH) is one of the most popular methods in Topological Data Analysis. The goal of this work is to identify some types of problems on which PH performs well or even better than other methods in data analysis.
• Score: 0.9208007322096533
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Persistent homology (PH) is one of the most popular methods in Topological Data Analysis. While PH has been used in many different types of applications, the reasons behind its success remain elusive. In particular, it is not known for which classes of problems it is most effective, or to what extent it can detect geometric or topological features. The goal of this work is to identify some types of problems on which PH performs well or even better than other methods in data analysis. We consider three fundamental shape-analysis tasks: the detection of the number of holes, curvature and convexity from 2D and 3D point clouds sampled from shapes. Experiments demonstrate that PH is successful in these tasks, outperforming several baselines, including PointNet, an architecture inspired precisely by the properties of point clouds. In addition, we observe that PH remains effective for limited computational resources and limited training data, as well as out-of-distribution test data, including various data transformations and noise.

Related papers

• PHLP: Sole Persistent Homology for Link Prediction -- Interpretable Feature Extraction [2.8413459430736396]
  Link prediction (LP) is a significant research area in graph data. Although graph neural network (GNN)-based models have achieved high performance in LP, understanding why they perform well is challenging. We propose a novel method that employs PH for LP (PHLP) focusing on how the presence or absence of target links influences the overall topology.
  arXiv  Detail & Related papers  (2024-04-23T16:54:56Z)
• Simple Ingredients for Offline Reinforcement Learning [86.1988266277766]
  offline reinforcement learning algorithms have proven effective on datasets highly connected to the target downstream task. We show that existing methods struggle with diverse data: their performance considerably deteriorates as data collected for related but different tasks is simply added to the offline buffer. We show that scale, more than algorithmic considerations, is the key factor influencing performance.
  arXiv  Detail & Related papers  (2024-03-19T18:57:53Z)
• Non-isotropic Persistent Homology: Leveraging the Metric Dependency of PH [5.70896453969985]
  We show that information on the point cloud is lost when restricting persistent homology to a single distance function. We numerically show that non-isotropic persistent homology can extract information on orientation, orientational variance, and scaling of randomly generated point clouds.
  arXiv  Detail & Related papers  (2023-10-25T08:03:17Z)
• Notes on Applicability of Explainable AI Methods to Machine Learning Models Using Features Extracted by Persistent Homology [0.0]
  Persistent homology (PH) has found wide-ranging applications in machine learning. The ability to achieve satisfactory levels of accuracy with relatively simple downstream machine learning models, when processing these extracted features, underlines the pipeline's superior interpretability. We explore the potential application of explainable AI methodologies to this PH-ML pipeline.
  arXiv  Detail & Related papers  (2023-10-15T08:56:15Z)
• Physics Inspired Hybrid Attention for SAR Target Recognition [61.01086031364307]
  We propose a physics inspired hybrid attention (PIHA) mechanism and the once-for-all (OFA) evaluation protocol to address the issues. PIHA leverages the high-level semantics of physical information to activate and guide the feature group aware of local semantics of target. Our method outperforms other state-of-the-art approaches in 12 test scenarios with same ASC parameters.
  arXiv  Detail & Related papers  (2023-09-27T14:39:41Z)
• PointHPS: Cascaded 3D Human Pose and Shape Estimation from Point Clouds [99.60575439926963]
  We propose a principled framework, PointHPS, for accurate 3D HPS from point clouds captured in real-world settings. PointHPS iteratively refines point features through a cascaded architecture. Extensive experiments demonstrate that PointHPS, with its powerful point feature extraction and processing scheme, outperforms State-of-the-Art methods.
  arXiv  Detail & Related papers  (2023-08-28T11:10:14Z)
• Tight basis cycle representatives for persistent homology of large data sets [0.0]
  Persistent homology (PH) is a popular tool for topological data analysis that has found applications across diverse areas of research. Although powerful in theory, PH suffers from high computation cost that precludes its application to large data sets. We provide a strategy and algorithms to compute tight representative boundaries around nontrivial robust features in large data sets.
  arXiv  Detail & Related papers  (2022-06-06T22:00:42Z)
• GPCO: An Unsupervised Green Point Cloud Odometry Method [64.86292006892093]
  A lightweight point cloud odometry solution is proposed and named the green point cloud odometry (GPCO) method. GPCO is an unsupervised learning method that predicts object motion by matching features of consecutive point cloud scans. It is observed that GPCO outperforms benchmarking deep learning methods in accuracy while it has a significantly smaller model size and less training time.
  arXiv  Detail & Related papers  (2021-12-08T00:24:03Z)
• Artificial Text Detection via Examining the Topology of Attention Maps [58.46367297712477]
  We propose three novel types of interpretable topological features for this task based on Topological Data Analysis (TDA) We empirically show that the features derived from the BERT model outperform count- and neural-based baselines up to 10% on three common datasets. The probing analysis of the features reveals their sensitivity to the surface and syntactic properties.
  arXiv  Detail & Related papers  (2021-09-10T12:13:45Z)
• Dory: Overcoming Barriers to Computing Persistent Homology [0.0]
  We present Dory, an efficient and scalable algorithm that can compute the persistent homology of large data sets. As an application, we compute the PH of the human genome at high resolution as revealed by a genome-wide Hi-C data set.
  arXiv  Detail & Related papers  (2021-03-09T18:28:22Z)
• Influence Functions in Deep Learning Are Fragile [52.31375893260445]
  influence functions approximate the effect of samples in test-time predictions. influence estimates are fairly accurate for shallow networks. Hessian regularization is important to get highquality influence estimates.
  arXiv  Detail & Related papers  (2020-06-25T18:25:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.