Rank-Preserving Index-Dependent Matrix Transformations: Applications to Clockwork and Deconstruction Theory Space Models

• URL: http://arxiv.org/abs/2409.09033v2
• Date: Tue, 24 Jun 2025 09:37:48 GMT
• Title: Rank-Preserving Index-Dependent Matrix Transformations: Applications to Clockwork and Deconstruction Theory Space Models
• Authors: Aadarsh Singh,
• Abstract summary: This paper establishes the precise mathematical conditions on $g_f(i,j)$ that preserve the rank and nullity of the original matrix.<n>We show how our framework can be used to tailor 0-mode profiles and fermionic mass spectra in clockwork and dimensional deconstruction models.
• Score: 1.9580473532948401
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a versatile framework of index-dependent element-wise matrix transformations, $b_{ij} = a_{ij} / g_f(i,j)$, with direct applications to hierarchy generating mass hierarchies in high-energy physics. This paper establishes the precise mathematical conditions on $g_f(i,j)$ that preserve the rank and nullity of the original matrix. Our study reveals that such transformations provide a powerful method for engineering specific properties of a matrix's null space; by appropriately selecting the function $g_f(i,j)$, one can generate null vectors (or eigenvectors) with diverse and controllable localization patterns. The broad applicability of this technique is discussed, with detailed examples drawn from high-energy physics. We demonstrate how our framework can be used to tailor 0-mode profiles and fermionic mass spectra in clockwork and dimensional deconstruction models, showing that the standard clockwork mechanism arises as a particular case $(g_f(i,j) = f^{(i-j)})$, thereby offering new tools for particle physics BSM model building. This work illustrates the potential of these transformations in model building across various fields where localized modes or specific spectral properties are crucial.

Related papers

• Inverting Self-Organizing Maps: A Unified Activation-Based Framework [39.146761527401424]
  We show that the activation pattern of a SOM can be inverted to recover the exact input under mild geometric conditions.<n>We introduce the Manifold-Aware Unified SOM Inversion and Control (MUSIC) update rule.<n>We validate the approach using synthetic Gaussian mixtures, the MNIST and the Faces in the Wild dataset.
  arXiv  Detail & Related papers  (2026-01-20T11:02:54Z)
• Universality and Optimal Architectures for Layered Programmable Unitary Decompositions [2.879036956042182]
  decomposition of arbitrary unitary transformations into sequences of simpler, physically realizable operations is a foundational problem in quantum information science.<n>We establish a 1D Quantum Field model for justifying the universality of a broad class of such factorizations.<n>This framework provides a unified method to verify the universality of various proposed architectures.
  arXiv  Detail & Related papers  (2025-10-22T09:15:58Z)
• Structured Sparse Transition Matrices to Enable State Tracking in State-Space Models [68.31088463716269]
  We propose a structured sparse parametrization of transition matrices in state-space models (SSMs)<n>Our method, PD-SSM, parametrizes the transition matrix as the product of a column one-hot matrix ($P$) and a complex-valued diagonal matrix ($D$)<n>The model significantly outperforms a wide collection of modern SSM variants on various FSA state tracking tasks.
  arXiv  Detail & Related papers  (2025-09-26T12:46:30Z)
• Multi-Community Spectral Clustering for Geometric Graphs [0.0699049312989311]
  We introduce a spectral clustering algorithm for community recovery on graphs generated by this model.<n>We prove weak consistency and show that a simple local refinement step ensures strong consistency.<n>A key ingredient is an application of a non-standard version of Davis-Kahan theorem to control eigenspaces when eigenvalues are not simple.
  arXiv  Detail & Related papers  (2025-07-27T14:09:00Z)
• Efficient Adaptation of Pre-trained Vision Transformer underpinned by Approximately Orthogonal Fine-Tuning Strategy [57.54306942529943]
  We propose an Approximately Orthogonal Fine-Tuning (AOFT) strategy for representing the low-rank weight matrices.<n>Our method achieves competitive performance across a range of downstream image classification tasks.
  arXiv  Detail & Related papers  (2025-07-17T16:09:05Z)
• Weyl's Relations, Integrable Matrix Models and Quantum Computation [0.0]
  We show that the Heisenberg commutation relations can be satisfied in a specific $N-1$ dimensional subspace.<n>This setup is used to construct a hierarchy of parameter-dependent commuting matrices in $N$ dimensions.
  arXiv  Detail & Related papers  (2025-06-20T08:45:44Z)
• A Unified Variational Framework for Quantum Excited States [2.935517095941649]
  We introduce a novel variational principle that overcomes limitations, enabling the textitsimultaneous determination of multiple low-energy excited states.<n>We demonstrate the power and generality of this method across diverse physical systems and variational ansatzes.<n>In all applications, the method accurately and simultaneously obtains multiple lowest-lying energy levels and their corresponding states.
  arXiv  Detail & Related papers  (2025-04-30T09:28:04Z)
• Wrapped Gaussian on the manifold of Symmetric Positive Definite Matrices [6.7523635840772505]
  Circular and non-flat data distributions are prevalent across diverse domains of data science.<n>A principled approach to accounting for the underlying geometry of such data is pivotal.<n>This work lays the groundwork for extending classical machine learning and statistical methods to more complex and structured data.
  arXiv  Detail & Related papers  (2025-02-03T16:46:46Z)
• Entrywise application of non-linear functions on orthogonally invariant matrices [44.99833362998488]
  We investigate how the entrywise application of a non-linear function to symmetric invariant random matrix ensembles alters the spectral distribution. We find that in all those cases a Gaussian equivalence principle holds, that is, the effect of the non-linear function is the same as taking a linear combination of the involved matrices and an additional independent GOE.
  arXiv  Detail & Related papers  (2024-12-09T19:41:09Z)
• Matrix representation of the resolvent operator in square-integrable basis and physical application [0.0]
  We obtain simple formulas for the matrix elements of the resolvent operator (the Green's function) in any finite set of square integrable basis. A byproduct of our findings is an expression for the normalized eigenvectors of a matrix in terms of its eigenvalues.
  arXiv  Detail & Related papers  (2024-11-23T14:25:57Z)
• Laplace transform based quantum eigenvalue transformation via linear combination of Hamiltonian simulation [13.96848357202551]
  We propose an efficient quantum algorithm for performing a class of eigenvalue transformations that can be expressed as a certain type of matrix Laplace transformation. We demonstrate that our eigenvalue transformation approach can solve this problem without explicitly inverting $A$.
  arXiv  Detail & Related papers  (2024-11-06T15:47:48Z)
• Efficient Adaptation of Pre-trained Vision Transformer via Householder Transformation [53.88562288388169]
  A common strategy for. Efficient Fine-Tuning (PEFT) of pre-trained Vision Transformers (ViTs) involves adapting the model to downstream tasks. We propose a novel PEFT approach inspired by Singular Value Decomposition (SVD) for representing the adaptation matrix. SVD decomposes a matrix into the product of a left unitary matrix, a diagonal matrix of scaling values, and a right unitary matrix.
  arXiv  Detail & Related papers  (2024-10-30T12:08:30Z)
• Efficient conversion from fermionic Gaussian states to matrix product states [48.225436651971805]
  We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states. It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems. The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
  arXiv  Detail & Related papers  (2024-08-02T10:15:26Z)
• 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)
• Entrywise error bounds for low-rank approximations of kernel matrices [55.524284152242096]
  We derive entrywise error bounds for low-rank approximations of kernel matrices obtained using the truncated eigen-decomposition. A key technical innovation is a delocalisation result for the eigenvectors of the kernel matrix corresponding to small eigenvalues. We validate our theory with an empirical study of a collection of synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2024-05-23T12:26:25Z)
• Large-scale gradient-based training of Mixtures of Factor Analyzers [67.21722742907981]
  This article contributes both a theoretical analysis as well as a new method for efficient high-dimensional training by gradient descent. We prove that MFA training and inference/sampling can be performed based on precision matrices, which does not require matrix inversions after training is completed. Besides the theoretical analysis and matrices, we apply MFA to typical image datasets such as SVHN and MNIST, and demonstrate the ability to perform sample generation and outlier detection.
  arXiv  Detail & Related papers  (2023-08-26T06:12:33Z)
• Householder Projector for Unsupervised Latent Semantics Discovery [58.92485745195358]
  Householder Projector helps StyleGANs to discover more disentangled and precise semantic attributes without sacrificing image fidelity. We integrate our projector into pre-trained StyleGAN2/StyleGAN3 and evaluate the models on several benchmarks.
  arXiv  Detail & Related papers  (2023-07-16T11:43:04Z)
• Geometric Clifford Algebra Networks [53.456211342585824]
  We propose Geometric Clifford Algebra Networks (GCANs) for modeling dynamical systems. GCANs are based on symmetry group transformations using geometric (Clifford) algebras.
  arXiv  Detail & Related papers  (2023-02-13T18:48:33Z)
• $h(1) \oplus su(2)$ vector algebra eigenstates with eigenvalues in the matrix domain [0.0]
  We find a subset of generalized vector coherent states in the matrix domain. For a special choice of the matrix eigenvalue parameters we found the so-called vector coherent states with matrices associated to the Heisenberg-Weyl group.
  arXiv  Detail & Related papers  (2023-01-25T18:10:01Z)
• Learning Graphical Factor Models with Riemannian Optimization [70.13748170371889]
  This paper proposes a flexible algorithmic framework for graph learning under low-rank structural constraints. The problem is expressed as penalized maximum likelihood estimation of an elliptical distribution. We leverage geometries of positive definite matrices and positive semi-definite matrices of fixed rank that are well suited to elliptical models.
  arXiv  Detail & Related papers  (2022-10-21T13:19:45Z)
• When Random Tensors meet Random Matrices [50.568841545067144]
  This paper studies asymmetric order-$d$ spiked tensor models with Gaussian noise. We show that the analysis of the considered model boils down to the analysis of an equivalent spiked symmetric textitblock-wise random matrix.
  arXiv  Detail & Related papers  (2021-12-23T04:05:01Z)
• Identifiability in Exact Two-Layer Sparse Matrix Factorization [0.0]
  Sparse matrix factorization is the problem of approximating a matrix Z by a product of L sparse factors X(L) X(L--1). This paper focuses on identifiability issues that appear in this problem, in view of better understanding under which sparsity constraints the problem is well-posed.
  arXiv  Detail & Related papers  (2021-10-04T07:56:37Z)
• Symplectic decomposition from submatrix determinants [0.0]
  An important theorem in Gaussian quantum information tells us that we can diagonalise the covariance matrix of any Gaussian state via a symplectic transformation. Inspired by a recently presented technique for finding the eigenvectors of a Hermitian matrix from certain submatrix eigenvalues, we derive a similar method for finding the diagonalising symplectic from certain submatrix determinants.
  arXiv  Detail & Related papers  (2021-08-11T18:00:03Z)
• Non-PSD Matrix Sketching with Applications to Regression and Optimization [56.730993511802865]
  We present dimensionality reduction methods for non-PSD and square-roots" matrices. We show how these techniques can be used for multiple downstream tasks.
  arXiv  Detail & Related papers  (2021-06-16T04:07:48Z)
• Characterization of preorders induced by positive maps in the set of Hermitian matrices [0.0]
  Uhlmann showed that there exists a positive, unital and trace-preserving map transforming a Hermitian matrix $A$ into another $B$ if and only if the vector of eigenvalues of $A$ majorizes that of $B$. I argue how this can be used to construct measures quantifying the lack of positive semidefiniteness of any given Hermitian matrix with relevant monotonicity properties.
  arXiv  Detail & Related papers  (2021-05-18T18:52:43Z)
• Feature Weighted Non-negative Matrix Factorization [92.45013716097753]
  We propose the Feature weighted Non-negative Matrix Factorization (FNMF) in this paper. FNMF learns the weights of features adaptively according to their importances. It can be solved efficiently with the suggested optimization algorithm.
  arXiv  Detail & Related papers  (2021-03-24T21:17:17Z)
• 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.