How many memories can a local learning rule protect, and what fixes the number? Physical learning rules train resistive networks through local measurements, and the standard rules conserve a mass-like function of the conductances, a law whose general form was posed as an open problem with the expectation that no useful solution theory exists. We answer it, in the direction the expectation ran against, and the answer is a capacity theory. The Tellegen identity behind the conserved mass localizes: the feedback state is pinned to zero at the inputs, so every sector of the circuit that the input electrodes separate carries its own private conserved mass, by an argument consuming only Kirchhoff's law and that boundary condition, hence valid for arbitrary nonlinear branch laws. The number of independent sector masses is a topological property of the circuit, bounded by the number of output electrodes. An untrainable element can destroy the mass of its own sector and of no other, which says where fixed nonlinear components may be placed; per-edge learning rates select which functionals are conserved and never how many; and adjoint coupled learning, which clamps its outputs before measuring, drains every output-carrying sector at a rate set by the squared output multipliers. In linear circuits we then classify the identities: exact rational computation over all 502 circuits on up to five vertices with two inputs and one or two outputs, and hundreds of larger ones, yields a closed-form count, proved on that family and conjectured in general, with the sector statement a theorem at every circuit size. The anticipated series-parallel polynomial laws appear as exactly the series-class cubic differences, and the number the opening question asks for is a budget: one designed mass per sector, the differences the topology donates, and one broadcast scalar for each protected functional beyond.
A discrete Schur-Cohn criterion for Verlet with velocity coupling, necessary and sufficient per latent root, with no commutation hypothesis is proved here: a discrete Schur-Cohn criterion for Verlet with velocity coupling.
F. Arrabal-Campos, Ignacio Fernández, Francisco G. Montoya et al.· 1 citation
A passive, reciprocal, linear network driven by forces or currents and read at points it drives cannot be trained below an error floor computed from the target beforehand. The usual parameter count for such networks does not charge for Maxwell-Betti reciprocity. We prove that when such an elastic, resistor or flow netw...
Thai-Son Vu, Hoang-Giang Nguyen, Q. Nguyen et al.· 1 citation
This chapter reconstructs the McCulloch-Pitts program as a physics of neural computation rather than the familiar cartoon of a binary neuron, and recovers the original distinction between thresholded excitatory summation and absolute inhibitory veto.
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...
A no-go theorem is used to separate four versions of neural network field theory, according to whether the defining object is the finite width ensemble or its infinite width limit, and whether the target the authors want to compute is a quantum or an effective field theory.
This chapter reconstructs the Hopfield network as a physical theory of memory rather than merely an early neural-network algorithm, treating the Hopfield network as an effective theory whose symmetry, locality, and point-neuron assumptions delimit its biological reach.
Nima Dehghani· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.