Symmetric Divergence and Normalized Similarity: A Unified Topological Framework for Representation Analysis

• URL: http://arxiv.org/abs/2606.06342v1
• Date: Thu, 04 Jun 2026 16:14:13 GMT
• Title: Symmetric Divergence and Normalized Similarity: A Unified Topological Framework for Representation Analysis
• Abstract summary: We develop a unified topological toolkit serving fine-grained structural diagnosis and robust, standardized evaluation.<n>To enable reliable benchmarking across heterogeneous settings, we propose Normalized Topological Similarity (NTS)<n>NTS yields a scale-invariant metric bounded between -1 and 1, effectively overcoming the scale and sample-dependence of unnormalized divergences.
• Score: 17.24563134209321
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Topological Data Analysis (TDA) offers a principled, intrinsic lens for comparing neural representations. However, existing paired topological divergences (e.g., RTD) are limited by heuristic asymmetry and, more critically, unbounded scores that depend on sample size, hindering reliable cross-scenario benchmarking. To address these challenges, we develop a unified topological toolkit serving two complementary needs: fine-grained structural diagnosis and robust, standardized evaluation. First, we complete the RTD framework by introducing Symmetric Representation Topology Divergence (SRTD) and its efficient variant SRTD-lite. Beyond resolving the theoretical asymmetry of prior variants, SRTD consolidates diagnostic information into a single, comprehensive cross-barcode signature. This allows for precise localization of structural discrepancies and serves as an effective optimization objective without the overhead of dual directional computations. Second, to enable reliable benchmarking across heterogeneous settings, we propose Normalized Topological Similarity (NTS). By measuring the rank correlation of hierarchical merge orders, NTS yields a scale-invariant metric bounded between -1 and 1, effectively overcoming the scale and sample-dependence of unnormalized divergences. Experiments across synthetic and real-world deep learning settings demonstrate that our toolkit captures functional shifts in CNNs missed by geometric measures and robustly maps LLM genealogy even under distance saturation, offering a rigorous, topology-aware perspective that complements measures like CKA.

Related papers

• Topology-Driven Transferability Estimation for 3D Medical Vision Foundation Models [24.834339924064505]
  We propose a voxel-wise framework for dense prediction tasks in 3D medical imaging.<n>Our framework estimates transferability directly from the alignment between the sparse 1-skeleton geometric graph of dense features and semantic labels.<n>Our framework achieves state-of-the-art transferability estimation with an average weighted Kendall (outperforming by 0.36) while accelerating evaluation by 56 times.
  arXiv  Detail & Related papers  (2026-07-05T09:45:18Z)
• Learning Topology-Aware Representations via Test-Time Adaptation for Anomaly Segmentation [12.965117238061096]
  TopoTTA is a novel framework that integrates persistent homology, a tool from topological data analysis, into the test-time pipeline.<n>It derives robust topological pseudo-labels that guide a lightweight test-time classifier, enhancing segmentation quality without retraining the backbone model.<n>Extensive experiments demonstrate an average 15% F1 improvement over state-of-the-art unsupervised anomaly detection and segmentation methods.
  arXiv  Detail & Related papers  (2026-06-26T17:04:42Z)
• Convex Distance Operator Transport: A Convex and Geometry-Preserving Formulation [9.94046521985351]
  We introduce Convex Distance Transport Operator (CDOT), the first convex optimal transport framework that aligns distributions across heterogeneous domains.<n>CDOT employs an operator-based regularization that aligns aggregated distance structures by introducing distance and conditional expectation operators.
  arXiv  Detail & Related papers  (2026-06-01T10:38:09Z)
• Aligning Network Equivariance with Data Symmetry: A Theoretical Framework and Adaptive Approach for Image Restoration [71.51826063983434]
  Image restoration is an inherently ill posed inverse problem.<n>We use non strict symmetry as a constraint to formulate the restoration inverse problem.<n>We show that the equivariance error of the optimal restoration operator is strictly bounded by the data symmetry error and the discretization mesh size.
  arXiv  Detail & Related papers  (2026-05-13T16:22:19Z)
• The Geometry of Transfer: Unlocking Medical Vision Manifolds for Training-Free Model Ranking [31.961181244685932]
  We propose a novel Topology-Driven Transferability Estimation framework that evaluates manifold tractability rather than statistical overlap.<n>Our approach significantly outperforms state-of-the-art baselines by around textbf31% relative improvement in the weighted Kendall.
  arXiv  Detail & Related papers  (2026-02-27T11:04:15Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• MS-ISSM: Objective Quality Assessment of Point Clouds Using Multi-scale Implicit Structural Similarity [65.85858856481131]
  unstructured and irregular nature of point clouds poses a significant challenge for objective quality assessment (PCQA)<n>We propose the Multi-scale Implicit Structural Similarity Measurement (MS-ISSM)
  arXiv  Detail & Related papers  (2026-01-03T14:58:52Z)
• The Procrustean Bed of Time Series: The Optimization Bias of Point-wise Loss [53.542743390809356]
  This paper aims to provide a first-principles analysis of the Expectation of Optimization Bias (EOB)<n>Our analysis reveals a fundamental paradigm paradox: the more deterministic and structured the time series, the more severe the bias by point-wise loss function.<n>We present a concrete solution that simultaneously achieves both principles via DFT or DWT.
  arXiv  Detail & Related papers  (2025-12-21T06:08:22Z)
• No-rank Tensor Decomposition Using Metric Learning [0.0]
  This paper introduces a no-rank tensor decomposition framework grounded in metric learning.<n>We provide theoretical guarantees for the framework's convergence and establish bounds on its metric properties.<n>Our approach achieves superior performance with smaller training datasets compared to transformer-based methods.
  arXiv  Detail & Related papers  (2025-11-03T18:21:53Z)
• Representation-Aware Distributionally Robust Optimization: A Knowledge Transfer Framework [6.529107536201152]
  We propose a novel framework for Wasserstein distributionally robust learning that accounts for predictive representations when guarding against distributional shifts.<n>We show that READ embeds a multidimensional alignment parameter into the transport cost, allowing the model to differentially discourage perturbations along directions associated with informative representations.<n>We conclude by demonstrating the effectiveness of our framework through extensive simulations and a real-world study.
  arXiv  Detail & Related papers  (2025-09-11T11:42:17Z)
• NDCG-Consistent Softmax Approximation with Accelerated Convergence [67.10365329542365]
  We propose novel loss formulations that align directly with ranking metrics.<n>We integrate the proposed RG losses with the highly efficient Alternating Least Squares (ALS) optimization method.<n> Empirical evaluations on real-world datasets demonstrate that our approach achieves comparable or superior ranking performance.
  arXiv  Detail & Related papers  (2025-06-11T06:59:17Z)
• Latent Semantic Consensus For Deterministic Geometric Model Fitting [109.44565542031384]
  We propose an effective method called Latent Semantic Consensus (LSC) LSC formulates the model fitting problem into two latent semantic spaces based on data points and model hypotheses. LSC is able to provide consistent and reliable solutions within only a few milliseconds for general multi-structural model fitting.
  arXiv  Detail & Related papers  (2024-03-11T05:35:38Z)
• Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation [52.73824786627612]
  This paper establishes new convergence results for textitgeodesic strongly monotone games.<n>Our key result shows that RGD attains last-iterate linear convergence in a textitgeometry-agnostic fashion.<n>Overall, this paper presents the first geometry-agnostic last-iterate convergence analysis for games beyond the Euclidean settings.
  arXiv  Detail & Related papers  (2023-06-29T01:20:44Z)

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.