Papers › What should a neuron aim for? Designing local objective functions based on information theory

What should a neuron aim for? Designing local objective functions based on information theory

3 Dec 2024arXiv:2412.02482archive 2025-07-28

Andreas C. Schneider, Valentin Neuhaus, David A. Ehrlich, Abdullah Makkeh, Alexander S. Ecker, Viola Priesemann, Michael Wibral

In modern deep neural networks, the learning dynamics of the individual neurons is often obscure, as the networks are trained via global optimization. Conversely, biological systems build on self-organized, local learning, achieving robustness and efficiency with limited global information. We here show how self-organization between individual artificial neurons can be achieved by designing abstract bio-inspired local learning goals. These goals are parameterized using a recent extension of information theory, Partial Information Decomposition (PID), which decomposes the information that a set of information sources holds about an outcome into unique, redundant and synergistic contributions. Our framework enables neurons to locally shape the integration of information from various input classes, i.e. feedforward, feedback, and lateral, by selecting which of the three inputs should contribute uniquely, redundantly or synergistically to the output. This selection is expressed as a weighted sum of PID terms, which, for a given problem, can be directly derived from intuitive reasoning or via numerical optimization, offering a window into understanding task-relevant local information processing. Achieving neuron-level interpretability while enabling strong performance using local learning, our work advances a principled information-theoretic foundation for local learning strategies.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2412.02482")

Code

Syntology Ran 6 of 15 code samples harvested from 1 repository linked to this paper; 9 have no recorded run. Of those that ran: 1 ran · honoured contract; 5 ran · our draft was wrong.

By repository: official repository: 15 samples from 1 repository, 6 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

priesemann-group/infomorphic_networks officialmentioned in papermentioned on GitHubpytorchBSD-3-Clause report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

15 samples harvested; 6 ran; 1 honoured the contract we drafted; 9 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
5ran · our draft was wrong
9unverified

Licence: 0 of the 15 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from priesemann-group/infomorphic_networks. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

InformationDecomposition priesemann-group/infomorphic_networks/im_net/im_model.py official repository ran · our draft was wrong BSD-3-Clause (permissive) · 80273d573dbb5d3d · report
compute_isx priesemann-group/infomorphic_networks/im_net/im_model.py official repository ran · honoured contract BSD-3-Clause (permissive) · 73d1af8eaddb0a36 · report
compute_marginals priesemann-group/infomorphic_networks/im_net/im_model.py official repository ran · our draft was wrong fingerprinted BSD-3-Clause (permissive) · bcb3ea419cafa185 · report
load_reordered_moebius_function priesemann-group/infomorphic_networks/im_net/im_model.py official repository ran · our draft was wrong BSD-3-Clause (permissive) · 424f9fe7b9ff0f54 · report
powerset priesemann-group/infomorphic_networks/im_net/im_model.py official repository ran · our draft was wrong BSD-3-Clause (permissive) · 2964b884853dfa1a · report
union_probability priesemann-group/infomorphic_networks/im_net/im_model.py official repository ran · our draft was wrong BSD-3-Clause (permissive) · 4777efd3ee78e1bb · report
acc_discrete Priesemann-Group/Infomorphic_Networks/im_net/helper_functions.py official repository unverified BSD-3-Clause (permissive) · 851c1e5ab56013cb · report
activation_map Priesemann-Group/Infomorphic_Networks/im_net/helper_functions.py official repository unverified BSD-3-Clause (permissive) · 57064aa385c07040 · report
check_ax_and_colors Priesemann-Group/Infomorphic_Networks/im_net/plotting.py official repository unverified BSD-3-Clause (permissive) · 7977b0050b73788c · report
confusion_mat Priesemann-Group/Infomorphic_Networks/im_net/helper_functions.py official repository unverified BSD-3-Clause (permissive) · 505aef682aa0a2f4 · report
dataset_helper Priesemann-Group/Infomorphic_Networks/im_net/datasets.py official repository unverified BSD-3-Clause (permissive) · 83dcc781ebcc4017 · report
get_atom_labels Priesemann-Group/Infomorphic_Networks/im_net/plotting.py official repository unverified BSD-3-Clause (permissive) · 42c320e01d2ea2c2 · report
get_normalization_transform Priesemann-Group/Infomorphic_Networks/im_net/datasets.py official repository unverified BSD-3-Clause (permissive) · 764aa72fa73eaa6c · report
grab_data Priesemann-Group/Infomorphic_Networks/im_net/datasets.py official repository unverified BSD-3-Clause (permissive) · 0d81c1f3e5515ea2 · report
plot_min_max Priesemann-Group/Infomorphic_Networks/im_net/plotting.py official repository unverified BSD-3-Clause (permissive) · 4e89b96c5b758e96 · report

Tasks

global-optimization

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SET

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections