Papers › Clustering units in neural networks: upstream vs downstream information

Clustering units in neural networks: upstream vs downstream information

22 Mar 2022arXiv:2203.11815archive 2025-07-28

Richard D. Lange, David S. Rolnick, Konrad P. Kording

It has been hypothesized that some form of "modular" structure in artificial neural networks should be useful for learning, compositionality, and generalization. However, defining and quantifying modularity remains an open problem. We cast the problem of detecting functional modules into the problem of detecting clusters of similar-functioning units. This begs the question of what makes two units functionally similar. For this, we consider two broad families of methods: those that define similarity based on how units respond to structured variations in inputs ("upstream"), and those based on how variations in hidden unit activations affect outputs ("downstream"). We conduct an empirical study quantifying modularity of hidden layer representations of simple feedforward, fully connected networks, across a range of hyperparameters. For each model, we quantify pairwise associations between hidden units in each layer using a variety of both upstream and downstream measures, then cluster them by maximizing their "modularity score" using established tools from network science. We find two surprising results: first, dropout dramatically increased modularity, while other forms of weight regularization had more modest effects. Second, although we observe that there is usually good agreement about clusters within both upstream methods and downstream methods, there is little agreement about the cluster assignments across these two families of methods. This has important implications for representation-learning, as it suggests that finding modular representations that reflect structure in inputs (e.g. disentanglement) may be a distinct goal from learning modular representations that reflect structure in outputs (e.g. compositionality).

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.

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="2203.11815")

Code

Syntology Ran 13 of 15 code samples harvested from 1 repository linked to this paper; 2 have no recorded run. Of those that ran: 13 ran with no contract checked.

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

wrongu/modularity officialmentioned in paperpytorchMIT 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; 13 ran; 0 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-25; that is when this build read the record, not when the samples ran.

13ran
2unverified

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 wrongu/modularity. “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.

best_model wrongu/modularity/analysis.py official repository ran MIT (permissive) · 3c8817de7268fd3e · report
corrcov wrongu/modularity/associations.py official repository ran fingerprinted MIT (permissive) · 8f1b37230e0e63f7 · report
girvan_newman wrongu/modularity/modularity.py official repository ran MIT (permissive) · e97a9f275da126b0 · report
is_iterable wrongu/modularity/util.py official repository ran fingerprinted MIT (permissive) · e777d089d7f9983f · report
is_valid_adjacency_matrix wrongu/modularity/modularity.py official repository ran MIT (permissive) · ff44186668c788a6 · report
last_model wrongu/modularity/analysis.py official repository ran MIT (permissive) · 7822097901139cf2 · report
log2prob wrongu/modularity/probability.py official repository ran fingerprinted MIT (permissive) · e043f2d92ffd7dab · report
log_normalize wrongu/modularity/probability.py official repository ran fingerprinted MIT (permissive) · b90540f21b539e44 · report
merge_dicts wrongu/modularity/util.py official repository ran MIT (permissive) · 028c5c4fc9dd3797 · report
prod wrongu/modularity/models/cifar10.py official repository ran fingerprinted MIT (permissive) · a828da824800b5de · report
soft_num_clusters wrongu/modularity/modularity.py official repository ran fingerprinted MIT (permissive) · a7f0e094813bc883 · report
temperature wrongu/modularity/probability.py official repository ran fingerprinted MIT (permissive) · 50bc4124ee074d37 · report
validate_layer_size wrongu/modularity/models/cifar10.py official repository ran MIT (permissive) · 8514a1c62a638ec8 · report
sum_hessian wrongu/modularity/associations.py official repository unverified MIT (permissive) · 57f67813b1665e3b · report
sum_hessian_conv wrongu/modularity/associations.py official repository unverified MIT (permissive) · bf597a04bcc92e05 · report

Tasks

ClusteringDisentanglementRepresentation Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Dropout

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