When Branch-Local Shunting Helps: A Gain-Load-Alignment Principle for Dendritic E/I Networks

Abstract

Biological neurons combine excitatory and inhibitory (E/I) activity on branched dendrites through shunting, in which inhibition divisively attenuates excitation. Whether this improves population readout over additive E/I integration of the same nonnegative inputs remains unclear. We introduce DendriNet, a trainable framework that varies integration rule, morphology, synaptic allocation, divisor locality, and dendritic nonlinearities. For population codes with multiplicative gain, a local linearization of any realizable shunting readout yields a decision direction within the positive additive E/I cone; matching the additive optimum requires a positive self-consistent shunting realization. Every scalar shunting threshold also has an exact affine additive realization. Beyond this local limit, performance follows a gain-load-alignment principle: branch-local shunting helps when a reliable divisor suppresses signal-aligned gain more than it attenuates signal or adds denominator variability. Passive additive trees flatten to linear readouts, whereas shunting trees compose local divisors. In a designed hierarchy, deep shunting outperforms tangent and fitted-linear controls, but flexible nonlinear predictors overtake it with enough labels. Support shuffling reverses the linear comparisons, sensor corruption reverses the fitted-linear comparison, and resource-matched activated training shows no consistent depth benefit. The same support and reliability interaction appears in frozen-feature normalization. Across three mouse V1 sessions, the shunting-over-additive decoder gap is largest for narrow readouts, reverses under strong private noise at the widest readout, and varies across running states. Morphology can determine where reliable nuisance estimates meet task-relevant signals, but neither depth nor shunting is intrinsically advantageous.