analiza aiqbench
This paper introduces Topological Sheaves of Irreducibility (TSI), a mathematical framework using sheaf theory to analyze compatibility obstructions in multi-agent systems. By separating task-level constraints from system capabilities, the authors provide exact solvability conditions for cochain realization and demonstrate improved decision-making performance on large-scale synthetic inputs. The work advances theoretical machine learning by applying algebraic topology to model higher-order interactions among autonomous agents.
Topological Sheaves of Irreducibility: A Theoretical Framework for Multi-Agent Task Obstructions
arXiv:2610.26777v1 Announce Type: new Abstract: Multi-agent systems can differ under identical agents and communication budgets when they support different forms of joint interaction. We introduce Topological Sheaves of Irreducibility (TSI), a sheaf-theoretic framework separating task-level compatibility obstructions from system capability. A task is represented by an interaction complex $K$ and a capacity sheaf $\mathcal{F}$; nonzero $H^n(K;\mathcal{F})$ defines a structural signature, while registered interventions test capability. For cocycle data, cochain realization is solvable exactly when the represented cohomology class vanishes. Examples show that the signature is sheaf-relative, and the degree-1 reduction yields cycle-space witnesses and observation requirements. We evaluate two finite one-round models. Across 15,625 degree-1 inputs, an all-agent additive primitive solves decision and repair exactly; the optimal pairwise system reaches 88.80% on decision, one input above the 88.79% majority-class baseline, and 26.63% on repair. On a degree-2 tetrahedral-boundary task over 531,441 inputs, the same-2-skeleton system retains all four three-agent primitives yet matches the pairwise-only optimum throughout the registered separation window, whereas adding the class-filling four-agent primitive makes both tasks exact. Status-preserving robustness checks retain exact performance but are not cost-matched to the class-restoring ablation. Conditional on the registered primitives and cost models, TSI provides task-relative, falsifiable tests of higher-order interaction.
Abstract:Multi-agent systems can differ under identical agents and communication budgets when they support different forms of joint interaction. We introduce Topological Sheaves of Irreducibility (TSI), a sheaf-theoretic framework separating task-level compatibility obstructions from system capability. A task is represented by an interaction complex $K$ and a capacity sheaf $\mathcal{F}$; nonzero $H^n(K;\mathcal{F})$ defines a structural signature, while registered interventions test capability. For cocycle data, cochain realization is solvable exactly when the represented cohomology class vanishes. Examples show that the signature is sheaf-relative, and the degree-1 reduction yields cycle-space witnesses and observation requirements. We evaluate two finite one-round models. Across 15,625 degree-1 inputs, an all-agent additive primitive solves decision and repair exactly; the optimal pairwise system reaches 88.80% on decision, one input above the 88.79% majority-class baseline, and 26.63% on repair. On a degree-2 tetrahedral-boundary task over 531,441 inputs, the same-2-skeleton system retains all four three-agent primitives yet matches the pairwise-only optimum throughout the registered separation window, whereas adding the class-filling four-agent primitive makes both tasks exact. Status-preserving robustness checks retain exact performance but are not cost-matched to the class-restoring ablation. Conditional on the registered primitives and cost models, TSI provides task-relative, falsifiable tests of higher-order interaction.
Machine Learning (cs.LG); Multiagent Systems (cs.MA)
arXiv:2610.26777 [cs.LG]
(or arXiv:2610.26777v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2610.26777 Focus to learn more arXiv-issued DOI via DataCite
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 · 290 cuvinte
Subiecte conexe
Algebraic Expressivity Certificates for Shallow Polynomial Neural Networks
arXiv · 26 sept. 2026
Convolution absorbing boundaries for explicit-circuit quantum simulation of the wave equation
arXiv · 4 sept. 2026
Efficient learning of bosonic unitaries beyond the Gaussian class
arXiv · 31 iul. 2026
Universality from Quadratic Angular-Momentum Operations: Exact Dynamical Lie Algebras and the Role of the Casimir Obstruction
arXiv · 15 sept. 2026