Metraipolis › archive › dc_08fd046517e2
Blind directions of physical learning networks: where to measure and what to measure — arXiv:2609.06582
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.06582
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T16:01:48.859Z
- SHA-256 of the archived text
70e1f85de1ed74a238da16d95cbbbe31f3a96be83ed4efe243eac0098e723445- Stable URL of this page
https://metraipolis.com/documento/dc_08fd046517e2
How to cite
Blind directions of physical learning networks: where to measure and what to measure — arXiv:2609.06582 — arXiv (en), https://arxiv.org/abs/2609.06582 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_08fd046517e2 (Metraipolis archive dc_08fd046517e2, sha256 70e1f85de1ed74a238da16d95cbbbe31f3a96be83ed4efe243eac0098e723445)
BibTeX
@misc{dc08fd046517e2,
title = {Blind directions of physical learning networks: where to measure and what to measure — arXiv:2609.06582},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.06582},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_08fd046517e2; sha256 70e1f85de1ed74a238da16d95cbbbe31f3a96be83ed4efe243eac0098e723445},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06582. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A physical learning network is read at a few accessible nodes. Every task and learning rule that uses only the steady voltages and currents there, at a fixed operating point, acts through the boundary response map. Changes in the kernel of its Jacobian are blind to first order. A walk along one fiber ran to a 600-step cap, one edge then at 15.2 times its start. A decomposition theorem splits the response Jacobian over the hidden components. The blind dimension adds over components whose surviving slots are disjoint. A boundary-to-boundary edge adds one parameter and deletes one slot. Exposing a hidden node changes only its component. For one hidden node the contribution counts the bipartite components of the non-adjacency graph of its neighbors. For a pocket of h hidden nodes a factor-analysis bound caps what outside electrodes can expose. It is attained when every pocket node meets every neighbor and no edge joins two of those neighbors, so past a threshold further electrodes outside such a pocket expose nothing. An electrode inside such a pocket, when its hidden nodes form a clique, is worth h-1 directions where one outside is worth none. Read as vector displacements rather than potentials, the same nodes left no deficit beyond counting in all 90 spring networks tested, each a pocket fully joined to five or more accessible nodes, and nothing blind in 88. What limits the reading is the quantity measured as much as the number of contacts. Maximum-weight spanning forests give a proved upper bound on the blind dimension. The matching equality is proved for one hidden node and conjectured beyond. It holds in all 5,343 components whose maximum could be attained and certified, and the forest count matched the certified blind dimension in 1,448 of 1,500 held-out networks, where the maximum must be searched. A self-learning circuit shows the split on hardware. Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-09-09 in physics.soc-ph). Categorie arXiv: Physics and Society (physics.soc-ph) ; Soft Condensed Matter (cond-mat.soft). Pagina del lavoro: https://arxiv.org/abs/2609.06582 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T15:45:24.120Z dalla pagina https://arxiv.org/catchup/physics.soc-ph/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).