Improved Representation of Matrix Lie Group Operations through Tensor Notation

• URL: http://arxiv.org/abs/2606.10289v1
• Date: Tue, 09 Jun 2026 01:24:52 GMT
• Title: Improved Representation of Matrix Lie Group Operations through Tensor Notation
• Abstract summary: This paper introduces a new tool for describing operations with matrix Lie groups: tensors and the Einstein summation notation.<n>The main contribution of this paper is not a new capability, but a more perspicuous mathematical notation for working with matrix Lie groups.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Several recent papers have demonstrated the utility of using Lie groups within estimation problems, yielding improved accuracy and consistency. This paper introduces a new tool for describing operations with matrix Lie groups: tensors and the Einstein summation notation. While tensors and Einstein notation are well-known in other research fields, applying this mathematical notation to represent and compute matrix Lie derivatives is novel. More importantly, this new notation greatly clarifies the derivatives and operations necessary to work with matrix Lie Groups in (gradient-based) estimation frameworks. Therefore, the main contribution of this paper is not a new capability, but a more perspicuous mathematical notation for working with matrix Lie groups.

Related papers

• MathlibLemma: Folklore Lemma Generation and Benchmark for Formal Mathematics [51.65118519899584]
  We introduce MathlibLemma, the first LLM-based multi-agent system to automate the discovery and formalization of mathematical folklore lemmas.<n>We further construct the MathlibLemma benchmark, a suite of 4,028 type-checked Lean statements spanning a broad range of mathematical domains.
  arXiv  Detail & Related papers  (2026-01-30T15:24:42Z)
• Lee and Seung (2000)'s Algorithms for Non-negative Matrix Factorization: A Supplementary Proof Guide [2.0450716801079443]
  Lee and Seung (2000) introduced numerical solutions for non-negative matrix factorization (NMF) using iterative multiplicative update algorithms.<n>This report provides supplementary details to help understand the formulation and derivation of the proofs as used in the original paper.
  arXiv  Detail & Related papers  (2025-01-20T08:59:05Z)
• Understanding Matrix Function Normalizations in Covariance Pooling through the Lens of Riemannian Geometry [63.694184882697435]
  Global Covariance Pooling (GCP) has been demonstrated to improve the performance of Deep Neural Networks (DNNs) by exploiting second-order statistics of high-level representations.<n>This paper provides a comprehensive and unified understanding of the matrix logarithm and power from a Riemannian geometry perspective.
  arXiv  Detail & Related papers  (2024-07-15T07:11:44Z)
• Optimal Matrix-Mimetic Tensor Algebras via Variable Projection [0.0]
  Matrix mimeticity arises from interpreting tensors as operators that can be multiplied, factorized, and analyzed analogous to matrices. We learn optimal linear mappings and corresponding tensor representations without relying on prior knowledge of the data. We provide original theory of uniqueness of the transformation and convergence analysis of our variable-projection-based algorithm.
  arXiv  Detail & Related papers  (2024-06-11T04:52:23Z)
• Beyond symmetrization: effective adjacency matrices and renormalization for (un)singed directed graphs [0.0]
  We define the concept of effective adjacency matrices that arise from the definition of deformed Laplacian operators. These effective matrices allow mapping generic graphs to a family of unsigned, undirected graphs. We show how the Hodge-Helmholtz decomposition can assist us in navigating this complexity.
  arXiv  Detail & Related papers  (2024-06-03T16:48:25Z)
• Accelerated Discovery of Machine-Learned Symmetries: Deriving the Exceptional Lie Groups G2, F4 and E6 [55.41644538483948]
  This letter introduces two improved algorithms that significantly speed up the discovery of symmetry transformations. Given the significant complexity of the exceptional Lie groups, our results demonstrate that this machine-learning method for discovering symmetries is completely general and can be applied to a wide variety of labeled datasets.
  arXiv  Detail & Related papers  (2023-07-10T20:25:44Z)
• Discovering Sparse Representations of Lie Groups with Machine Learning [55.41644538483948]
  We show that our method reproduces the canonical representations of the generators of the Lorentz group. This approach is completely general and can be used to find the infinitesimal generators for any Lie group.
  arXiv  Detail & Related papers  (2023-02-10T17:12:05Z)
• Generalised Spherical Text Embedding [24.217143085109946]
  It jointly encodes the words and the paragraphs as individual matrices of arbitrary column dimension with unit Frobenius norm. We show that the same matrices can be reshaped into vectors of unit norm and transform our problem into an optimization problem over the spherical manifold. We also quantitatively verify the quality of our text embeddings by showing that they demonstrate improved results in document classification, document clustering, and semantic similarity benchmark tests.
  arXiv  Detail & Related papers  (2022-11-30T07:50:07Z)
• Automatic differentiation for Riemannian optimization on low-rank matrix and tensor-train manifolds [71.94111815357064]
  In scientific computing and machine learning applications, matrices and more general multidimensional arrays (tensors) can often be approximated with the help of low-rank decompositions. One of the popular tools for finding the low-rank approximations is to use the Riemannian optimization.
  arXiv  Detail & Related papers  (2021-03-27T19:56:00Z)
• Applying Lie Groups Approaches for Rigid Registration of Point Clouds [3.308743964406687]
  We use Lie groups and Lie algebras to find the rigid transformation that best register two surfaces represented by point clouds. The so called pairwise rigid registration can be formulated by comparing intrinsic second-order orientation tensors. We show promising results when embedding orientation tensor fields in Lie algebras.
  arXiv  Detail & Related papers  (2020-06-23T21:26:57Z)
• Supervised Quantile Normalization for Low-rank Matrix Approximation [50.445371939523305]
  We learn the parameters of quantile normalization operators that can operate row-wise on the values of $X$ and/or of its factorization $UV$ to improve the quality of the low-rank representation of $X$ itself. We demonstrate the applicability of these techniques on synthetic and genomics datasets.
  arXiv  Detail & Related papers  (2020-02-08T21:06:02Z)

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.