În afara temei aiqbench
Această știre a fost preluată de la o sursă pe care o urmărim, dar nu ține de domeniul AI sau cuantic, așa că nu există o perspectivă aiqbench pentru ea.
Source-Resolved Collective Cognition in Robotics: Mathematical Foundations for Multimodal and Collective Estimation, and Their Reach across the Cognition Loop
arXiv:2611.02693v1 Announce Type: new 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.
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.
93 pages, 14 figures. Reference implementation archived at Zenodo, doi:https://doi.org/10.5281/zenodo.23862358
Robotics (cs.RO); Multiagent Systems (cs.MA)
G.1.3; I.2.9; I.4.8
arXiv:2611.02693 [cs.RO]
(or arXiv:2611.02693v1 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2611.02693 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 329 cuvinte