Generalized infinite dimensional Alpha-Procrustes based geometries

• URL: http://arxiv.org/abs/2511.09801v1
• Date: Fri, 14 Nov 2025 01:10:14 GMT
• Title: Generalized infinite dimensional Alpha-Procrustes based geometries
• Authors: Salvish Goomanee, Andi Han, Pratik Jawanpuria, Bamdev Mishra,
• Abstract summary: We introduce a formalism based on unitized Hilbert-Schmidt operators and an extended Mahalanobis norm.<n>Our approach also incorporates a learnable regularization parameter that enhances geometric stability in high-dimensional comparisons.<n>This work lays a theoretical and computational foundation for advancing robust geometric methods in machine learning, statistical inference, and functional data analysis.
• Score: 17.137900705948322
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work extends the recently introduced Alpha-Procrustes family of Riemannian metrics for symmetric positive definite (SPD) matrices by incorporating generalized versions of the Bures-Wasserstein (GBW), Log-Euclidean, and Wasserstein distances. While the Alpha-Procrustes framework has unified many classical metrics in both finite- and infinite- dimensional settings, it previously lacked the structural components necessary to realize these generalized forms. We introduce a formalism based on unitized Hilbert-Schmidt operators and an extended Mahalanobis norm that allows the construction of robust, infinite-dimensional generalizations of GBW and Log-Hilbert-Schmidt distances. Our approach also incorporates a learnable regularization parameter that enhances geometric stability in high-dimensional comparisons. Preliminary experiments reproducing benchmarks from the literature demonstrate the improved performance of our generalized metrics, particularly in scenarios involving comparisons between datasets of varying dimension and scale. This work lays a theoretical and computational foundation for advancing robust geometric methods in machine learning, statistical inference, and functional data analysis.

Related papers

• Towards A Unified PAC-Bayesian Framework for Norm-based Generalization Bounds [63.47271262149291]
  We propose a unified framework for PAC-Bayesian norm-based generalization.<n>The key to our approach is a sensitivity matrix that quantifies the network outputs with respect to structured weight perturbations.<n>We derive a family of generalization bounds that recover several existing PAC-Bayesian results as special cases.
  arXiv  Detail & Related papers  (2026-01-13T00:42:22Z)
• Learning Geometry: A Framework for Building Adaptive Manifold Models through Metric Optimization [8.201374511929538]
  This paper proposes a novel paradigm for machine learning that moves beyond traditional parameter optimization.<n>We optimize the metric tensor field on a manifold with a predefined topology, thereby dynamically shaping the geometric structure of the model space.<n>This work lays a solid foundation for constructing fully dynamic "meta-learners" capable of autonomously evolving their geometry and topology.
  arXiv  Detail & Related papers  (2025-10-30T01:53:32Z)
• Generalized Tensor-based Parameter-Efficient Fine-Tuning via Lie Group Transformations [50.010924231754856]
  Adapting pre-trained foundation models for diverse downstream tasks is a core practice in artificial intelligence.<n>To overcome this, parameter-efficient fine-tuning (PEFT) methods like LoRA have emerged and are becoming a growing research focus.<n>We propose a generalization that extends matrix-based PEFT methods to higher-dimensional parameter spaces without compromising their structural properties.
  arXiv  Detail & Related papers  (2025-04-01T14:36:45Z)
• Merging Hazy Sets with m-Schemes: A Geometric Approach to Data Visualization [0.09320657506524149]
  We introduce a framework for aggregating dissimilarity functions that arise from locally adjusting a metric through density-aware normalization.<n>We formalize these approaches as m-schemes, a class of methods closely related to t-norms and t-conorms in probabilistic metrics.
  arXiv  Detail & Related papers  (2025-03-03T15:40:08Z)
• RMLR: Extending Multinomial Logistic Regression into General Geometries [64.16104856124029]
  Our framework only requires minimal geometric properties, thus exhibiting broad applicability. We develop five families of SPD MLRs under five types of power-deformed metrics. On rotation matrices we propose Lie MLR based on the popular bi-invariant metric.
  arXiv  Detail & Related papers  (2024-09-28T18:38:21Z)
• Product Geometries on Cholesky Manifolds with Applications to SPD Manifolds [65.04845593770727]
  We present two new metrics on the Symmetric Positive Definite (SPD) manifold via the Cholesky manifold. Our metrics are easy to use, computationally efficient, and numerically stable.
  arXiv  Detail & Related papers  (2024-07-02T18:46:13Z)
• Generalizing Knowledge Graph Embedding with Universal Orthogonal Parameterization [22.86465452511445]
  GoldE is a powerful framework for knowledge graph embedding. It features a universal orthogonal parameterization based on a generalized form of Householder reflection. It achieves state-of-the-art performance on three standard benchmarks.
  arXiv  Detail & Related papers  (2024-05-14T12:26:19Z)
• The Fisher-Rao geometry of CES distributions [50.50897590847961]
  The Fisher-Rao information geometry allows for leveraging tools from differential geometry. We will present some practical uses of these geometric tools in the framework of elliptical distributions.
  arXiv  Detail & Related papers  (2023-10-02T09:23:32Z)
• Differential geometry with extreme eigenvalues in the positive semidefinite cone [1.9116784879310025]
  We present a route to a scalable geometric framework for the analysis and processing of SPD-valued data based on the efficient of extreme generalized eigenvalues. We define a novel iterative mean of SPD matrices based on this geometry and prove its existence and uniqueness for a given finite collection of points.
  arXiv  Detail & Related papers  (2023-04-14T18:37:49Z)
• Adaptive Log-Euclidean Metrics for SPD Matrix Learning [73.12655932115881]
  We propose Adaptive Log-Euclidean Metrics (ALEMs), which extend the widely used Log-Euclidean Metric (LEM) The experimental and theoretical results demonstrate the merit of the proposed metrics in improving the performance of SPD neural networks.
  arXiv  Detail & Related papers  (2023-03-26T18:31:52Z)
• Generalization Bounds with Data-dependent Fractal Dimensions [5.833272638548154]
  We prove fractal geometry-based generalization bounds without requiring any Lipschitz assumption. Despite introducing a significant amount of technical complications, this new notion lets us control the generalization error.
  arXiv  Detail & Related papers  (2023-02-06T13:24:48Z)

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.