cs.RONov 2, 2026

Source-Resolved Collective Cognition in Robotics: Mathematical Foundations for Multimodal and Collective Estimation, and Their Reach across the Cognition Loop

Authors: Juergen Graf

Organizations: Cognitive Systems and Robotics Laboratory (CSRL), Department of Computer Science, Trier University of Applied Sciences, Trier, Germany

Abstract

The Generalized Singular Value Decomposition (GSVD) is a central tool for comparing two linear operators that act on the same unknown. Once the output metrics are fixed, it answers the basis-independent question "along which state directions does the first operator dominate the second, and by how much?". This foundational volume builds the GSVD and its surrounding estimation theory from the ground up. Part I re-derives every piece of linear algebra and statistical estimation machinery needed later -- inner products, the four subspaces, orthogonal matrices, the spectral theorem, quadratic forms, the ordinary SVD, Lie-group tangent perturbations, Jacobians, covariance, whitening, Fisher information, CCA, mutual information, discrimination criteria, and covariance intersection -- with self-contained derivations and worked numerical examples. Part II states the GSVD in both a transparent and a dimensionally general form, then proves it by two complementary routes. Part III works one small matrix pair through five different lenses, each computed by hand and verified numerically. Part IV separates information attribution, subspace geometry, statistical dependence, and decision-theoretic discrimination for collective systems. Part V evaluates the role and limits of the GSVD across the cognition loop. Part VI covers numerical practice, including a tested reference implementation. Every number printed in this document was verified in double precision. Where a statement is an assumption rather than a theorem, it is labelled as such.

Figures & tables

Explore similar work

Mar 10, 2026

GSVD for Geometry-Grounded Dataset Comparison: An Alignment Angle Is All You Need

Geometry-grounded learning asks models to respect structure in the problem domain rather than treating observations as arbitrary vectors. Motivated by this view, we revisit a classical but underused primitive for comparing datasets: linear relations between two data matrices, expressed via the co-span constraint Ax=By=zAx = By = z in a shared ambient space. To operationalize this comparison, we use the generalized singular value decomposition (GSVD) as a joint coordinate system for two subspaces. In particular, we exploit the GSVD form A=HCUA = HCU, B=HSVB = HSV with C⊤C+S⊤S=IC^{\top}C + S^{\top}S = I, which separates shared versus dataset-specific directions through the diagonal structure of (C,S)(C, S). From these factors we derive an interpretable angle score θ(z)∈[0,π/2]θ(z) \in [0, π/2] for a sample zz, quantifying whether z is explained relatively more by AA, more by BB, or comparably by both. The primary role of θ(z)θ(z) is as a per-sample geometric diagnostic. We illustrate the behavior of the score on MNIST through angle distributions and representative GSVD directions. A binary classifier derived from θ(z)θ(z) is presented as an illustrative application of the score as an interpretable diagnostic tool.
Aug 31, 2026

Compact and Infinite-Order Error Analysis for Null-Space SVD Estimation

We study null-space estimation from a noisy matrix. For a simple left null space, we first derive an exact compact expression for the error of the smallest left singular vector. We then give an all-order series for the SVD vector and projector, followed by compact and consistently truncated series forms for the fixed-realization empirical risk and conditional population generalization risk. The recursion extends to a multiple-dimensional null space by following the complete invariant subspace. The convergence radius is not inferred from an error plot: it is computed independently from the nearest complex exceptional point that joins a retained eigenvalue branch to its complement. A reduced-nullity experiment shows that moving this spectral boundary can increase the radius, although the improvement is not monotone in the retained nullity. For individually ordered null directions under Gaussian training with τ≥mτ\geq m, we prove that the Wishart splitting matrix WW gives a strict second-order empirical ranking. Gaussian averaging equalizes the leading generalization risks at both small and very large noise, while a column-swap theorem proves strict expected generalization ranking for an isotropic signal subspace. For unequal spikes, an exact population-overlap criterion and a simultaneous 99%99\% Monte Carlo confidence certificate explain the observed intermediate ranking. A sixth-order risk correction improves the lower-crossover estimate in the reported experiment. This equal--ranked--equal phenomenon is a finite-sample diagnostic related to spectral mixing, but its tolerance crossings, the exceptional-point radius, and the asymptotic BBP threshold are three distinct quantities.
Apr 7, 2026

Training Without Orthogonalization, Inference With SVD: A Gradient Analysis of Rotation Representations

Recent work has shown that removing orthogonalization during training and applying it only at inference improves rotation estimation in deep learning, with empirical evidence favoring 9D representations with SVD projection. However, the theoretical understanding of why SVD orthogonalization specifically harms training, and why it should be preferred over Gram-Schmidt at inference, remains incomplete. We provide a detailed gradient analysis of SVD orthogonalization specialized to 3×33 \times 3 matrices and SO(3)SO(3) projection. Our central result derives the exact spectrum of the SVD backward pass Jacobian: it has rank 33 (matching the dimension of SO(3)SO(3)) with nonzero singular values 2/(si+sj)2/(s_i + s_j) and condition number κ=(s1+s2)/(s2+s3)κ= (s_1 + s_2)/(s_2 + s_3), creating quantifiable gradient distortion that is most severe when the predicted matrix is far from SO(3)SO(3) (e.g., early in training when s3≈0s_3 \approx 0). We further show that even stabilized SVD gradients introduce gradient direction error, whereas removing SVD from the training loop avoids this tradeoff entirely. We also prove that the 6D Gram-Schmidt Jacobian has an asymmetric spectrum: its parameters receive unequal gradient signal, explaining why 9D parameterization is preferable. Together, these results provide the theoretical foundation for training with direct 9D regression and applying SVD projection only at inference.