Vector Summaries of Persistence Diagrams for Permutation-based Hypothesis Testing

• URL: http://arxiv.org/abs/2306.06257v1
• Date: Fri, 9 Jun 2023 21:01:41 GMT
• Title: Vector Summaries of Persistence Diagrams for Permutation-based Hypothesis Testing
• Abstract summary: We introduce an alternative vectorization method for the Betti function based on integration and prove stability results. We propose a new shuffling technique of group labels to increase the power of the test.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Over the past decade, the techniques of topological data analysis (TDA) have grown into prominence to describe the shape of data. In recent years, there has been increasing interest in developing statistical methods and in particular hypothesis testing procedures for TDA. Under the statistical perspective, persistence diagrams -- the central multi-scale topological descriptors of data provided by TDA -- are viewed as random observations sampled from some population or process. In this context, one of the earliest works on hypothesis testing focuses on the two-group permutation-based approach where the associated loss function is defined in terms of within-group pairwise bottleneck or Wasserstein distances between persistence diagrams (Robinson and Turner, 2017). However, in situations where persistence diagrams are large in size and number, the permutation test in question gets computationally more costly to apply. To address this limitation, we instead consider pairwise distances between vectorized functional summaries of persistence diagrams for the loss function. In the present work, we explore the utility of the Betti function in this regard, which is one of the simplest function summaries of persistence diagrams. We introduce an alternative vectorization method for the Betti function based on integration and prove stability results with respect to the Wasserstein distance. Moreover, we propose a new shuffling technique of group labels to increase the power of the test. Through several experimental studies, on both synthetic and real data, we show that the vectorized Betti function leads to competitive results compared to the baseline method involving the Wasserstein distances for the permutation test.

Related papers

• From Persistence to Survival: Hypothesis Testing, Effect Sizes and Vectorisation for Topological Features [0.0]
  We introduce STRAND (Survival Topological Representation ANalysis of Diagrams), which treats (collections of) PDs as survival data.<n>We derive (i) a non-parametric two-sample test with calibrated Type I error and high power from a small number of diagrams; (ii) interpretable effect sizes; and (iii) a 1-Wasserstein-stable feature vector for downstream machine learning.
  arXiv  Detail & Related papers  (2026-06-10T10:41:44Z)
• The Density of Cross-Persistence Diagrams and Its Applications [67.12329106585666]
  Topological Data Analysis (TDA) provides powerful tools to explore the shape and structure of data through topological features such as clusters, loops, and voids.<n>Persistence diagrams are a cornerstone of TDA, capturing the evolution of these features across scales.<n>Cross-persistence diagrams (cross-barcodes), introduced recently, address this limitation by characterizing relationships between topological features of two point clouds.
  arXiv  Detail & Related papers  (2026-03-12T07:33:15Z)
• Causal Graph Learning via Distributional Invariance of Cause-Effect Relationship [54.575090553659074]
  We develop an algorithm that efficiently uncovers causal relationships with quadratic complexity in the number of observational variables.<n>Our experiments on a varied benchmark of large-scale datasets show superior or equivalent performance compared to existing works.
  arXiv  Detail & Related papers  (2026-02-03T10:26:16Z)
• Hypothesis Testing for Generalized Thurstone Models [12.379142732634113]
  We develop a hypothesis testing framework to determine whether pairwise comparison data is generated by an underlying model.<n>We propose a hypothesis test based on our separation distance, construct confidence intervals, establish time-uniform bounds on the probabilities of type I and II errors.<n>We validate our results through experiments on synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2025-12-02T16:32:42Z)
• Efficient Covariance Estimation for Sparsified Functional Data [51.69796254617083]
  proposed Random-knots (Random-knots-Spatial) and B-spline (Bspline-Spatial) estimators of the covariance function are computationally efficient.<n>Asymptotic pointwise of the covariance are obtained for sparsified individual trajectories under some regularity conditions.
  arXiv  Detail & Related papers  (2025-11-23T00:50:33Z)
• Minimax-Optimal Two-Sample Test with Sliced Wasserstein [2.019622939313173]
  We study the problem of nonparametric two-sample testing using the sliced Wasserstein (SW) distance.<n>We propose a permutation-based SW test and analyze its performance.
  arXiv  Detail & Related papers  (2025-10-31T14:20:06Z)
• A Sample Efficient Conditional Independence Test in the Presence of Discretization [54.047334792855345]
  Conditional Independence (CI) tests directly to discretized data can lead to incorrect conclusions.<n>Recent advancements have sought to infer the correct CI relationship between the latent variables through binarizing observed data.<n>Motivated by this, this paper introduces a sample-efficient CI test that does not rely on the binarization process.
  arXiv  Detail & Related papers  (2025-06-10T12:41:26Z)
• Probabilistic causal graphs as categorical data synthesizers: Do they do better than Gaussian Copulas and Conditional Tabular GANs? [0.0]
  This study investigates the generation of high-quality synthetic categorical data, such as survey data, using causal graph models. We used the categorical data that are based on the survey of accessibility to services for people with disabilities. We created both SEM and BN models to represent causal relationships and to capture joint distributions between variables.
  arXiv  Detail & Related papers  (2025-04-15T18:41:54Z)
• Testing Dependency of Weighted Random Graphs [4.0554893636822]
  We study the task of detecting the edge dependency between two random graphs. For general edge-weight distributions, we establish thresholds at which optimal testing becomes information-theoretically possible or impossible.
  arXiv  Detail & Related papers  (2024-09-23T10:07:41Z)
• Unveiling the Statistical Foundations of Chain-of-Thought Prompting Methods [59.779795063072655]
  Chain-of-Thought (CoT) prompting and its variants have gained popularity as effective methods for solving multi-step reasoning problems. We analyze CoT prompting from a statistical estimation perspective, providing a comprehensive characterization of its sample complexity.
  arXiv  Detail & Related papers  (2024-08-25T04:07:18Z)
• Graph Stochastic Neural Process for Inductive Few-shot Knowledge Graph Completion [63.68647582680998]
  We focus on a task called inductive few-shot knowledge graph completion (I-FKGC) Inspired by the idea of inductive reasoning, we cast I-FKGC as an inductive reasoning problem. We present a neural process-based hypothesis extractor that models the joint distribution of hypothesis, from which we can sample a hypothesis for predictions. In the second module, based on the hypothesis, we propose a graph attention-based predictor to test if the triple in the query set aligns with the extracted hypothesis.
  arXiv  Detail & Related papers  (2024-08-03T13:37:40Z)
• Amortizing intractable inference in diffusion models for vision, language, and control [89.65631572949702]
  This paper studies amortized sampling of the posterior over data, $mathbfxsim prm post(mathbfx)propto p(mathbfx)r(mathbfx)$, in a model that consists of a diffusion generative model prior $p(mathbfx)$ and a black-box constraint or function $r(mathbfx)$. We prove the correctness of a data-free learning objective, relative trajectory balance, for training a diffusion model that samples from
  arXiv  Detail & Related papers  (2024-05-31T16:18:46Z)
• Seeing Unseen: Discover Novel Biomedical Concepts via Geometry-Constrained Probabilistic Modeling [53.7117640028211]
  We present a geometry-constrained probabilistic modeling treatment to resolve the identified issues. We incorporate a suite of critical geometric properties to impose proper constraints on the layout of constructed embedding space. A spectral graph-theoretic method is devised to estimate the number of potential novel classes.
  arXiv  Detail & Related papers  (2024-03-02T00:56:05Z)
• Levenshtein Distance Embedding with Poisson Regression for DNA Storage [8.943376293527114]
  Sequence embedding maps Levenshtein distance to a conventional distance between embedding vectors. In this paper, a novel neural network-based sequence embedding technique using Poisson regression is proposed. We demonstrate the superior performance of the proposed method compared to state-of-the-art approaches.
  arXiv  Detail & Related papers  (2023-12-13T07:20:27Z)
• Low-Rank Covariance Completion for Graph Quilting with Applications to Functional Connectivity [8.500141848121782]
  In many calcium imaging data sets, the full population of neurons is not recorded simultaneously, but instead in partially overlapping blocks. In this paper, we introduce a novel two-step approach to Graph Quilting, which first imputes the nuclear structure matrix using low-rank co completion. We show the efficacy of these methods for estimating connectivity from calcium imaging data.
  arXiv  Detail & Related papers  (2022-09-17T08:03:46Z)
• Robust Topological Inference in the Presence of Outliers [18.6112824677157]
  The distance function to a compact set plays a crucial role in the paradigm of topological data analysis. Despite its stability to perturbations in the Hausdorff distance, persistent homology is highly sensitive to outliers. We propose a $textitmedian-of-means$ variant of the distance function ($textsfMoM Dist$), and establish its statistical properties.
  arXiv  Detail & Related papers  (2022-06-03T19:45:43Z)
• A Probabilistic Graph Coupling View of Dimension Reduction [5.35952718937799]
  We introduce a unifying statistical framework based on the coupling of hidden graphs using cross entropy. We show that existing pairwise similarity DR methods can be retrieved from our framework with particular choices of priors for the graphs. Our model is leveraged and extended to address the issue while new links are drawn with Laplacian eigenmaps and PCA.
  arXiv  Detail & Related papers  (2022-01-31T08:21:55Z)
• Tesseract: Tensorised Actors for Multi-Agent Reinforcement Learning [92.05556163518999]
  MARL exacerbates matters by imposing various constraints on communication and observability. For value-based methods, it poses challenges in accurately representing the optimal value function. For policy gradient methods, it makes training the critic difficult and exacerbates the problem of the lagging critic. We show that from a learning theory perspective, both problems can be addressed by accurately representing the associated action-value function.
  arXiv  Detail & Related papers  (2021-05-31T23:08:05Z)
• Continuous Regularized Wasserstein Barycenters [51.620781112674024]
  We introduce a new dual formulation for the regularized Wasserstein barycenter problem. We establish strong duality and use the corresponding primal-dual relationship to parametrize the barycenter implicitly using the dual potentials of regularized transport problems.
  arXiv  Detail & Related papers  (2020-08-28T08:28:06Z)

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.