Hierarchical neural circuit theory of normalization and inter-areal communication.
6 blocks of code here have a permanent identifier (oscr:b:…), listed with the matches below: citable for good, with a page of its own. Select a match and press Cite to copy it. What a block identifier is.
The 9 matches
- [1] § Methods › The model ↔ Utils/Create_weight_matrices.py, lines 84 to 181 · score 0.73 · encoding matrix, receptive fields, weight matrix, connectivity matrix, transpose, symmetric · block
oscr:b:MTTSC9Q6QFCEN-P· Report a mismatch - [2] § Methods › Communication subspaces › Interpretation of the results ↔ Utils/matrix_spectrum.py, lines 34 to 167 · score 0.72 · spectral density matrix, auto spectra, cross power spectrum, squared, coherence · block
oscr:b:874K8K9NMX8SE-M· Report a mismatch - [3] § Methods › The model ↔ Utils/Create_weight_matrices.py, lines 84 to 181 · score 0.70 · raised cosine, encoding matrix, ring model, stimulus, connectivity, recurrent · block
oscr:b:MTTSC9Q6QFCEN-P· Report a mismatch - [4] § Methods › The model ↔ Three_area/Parameters_3.py, lines 84 to 155 · score 0.70 · raised cosine, encoding matrix, ring model, stimulus, connectivity, recurrent · block
oscr:b:HAXZQPNN8ZDV8-V· Report a mismatch - [5] § Methods › The model ↔ Three_area/Parameters_3.py, lines 84 to 155 · score 0.69 · connectivity matrix, normalization matrix, inter areal, transpose, symmetric, Gaussian · block
oscr:b:HAXZQPNN8ZDV8-V· Report a mismatch - [6] § Methods › The model ↔ Three_area/Communication_3.py, lines 52 to 114 · score 0.62 · Gaussian rectification, membrane potentials, firing rates, variable, matrix, model · block
oscr:b:DY2H28JZMAD67-T· Report a mismatch - [7] § Methods › Communication subspaces › Interpretation of the results ↔ Utils/Communication.py, lines 351 to 379 · score 0.56 · left singular vectors, eigenvectors, Alignment · block
oscr:b:HNDCJR8VKNFA9-1· Report a mismatch - [8] § Results › Theory › The core mechanism in brief ↔ Utils/Communication.py, lines 167 to 253 · score 0.55 · reduced rank regression, covariance matrix, cross · block
oscr:b:76GTGT44CJDKN-Q· Report a mismatch - [9] § Methods › Frequency decomposition of the communication subspace ↔ Utils/matrix_spectrum.py, lines 34 to 167 · score 0.54 · power spectral density, PSD, Wiener, inverse, matrix · block
oscr:b:874K8K9NMX8SE-M· Report a mismatch
Paper
Loaded from Europe PMC by your browser; OSCR does not store it: doi.org · Europe PMC
The paper is loaded when this pane is shown.
The authors' code
Python · 182 lines · 6.4 KB · MIT · 2 matches
- import numpy as np
- import math
- def Norm_matrix(N,std_dev,gaussian_height):
- '''Gaussian Normalization pool within each layers'''
- # std_dev = std_dev
- convMat = np.zeros((N, N))
- for row in range(N):
- # Instead of generating a kernel upfront, we'll compute the Gaussian values with wrap-around in this loop
- for col in range(N):
- # Calculate the distance considering the wrap-around (circular condition)
- circular_distance = min(abs(col - row), N - abs(col - row))
- # Gaussian value calculation based on the circular distance
- value = (1 / (std_dev * np.sqrt(2 * np.pi))) * np.exp(-0.5 * (circular_distance ** 2) / (std_dev ** 2))
- convMat[row, col] = value
- # Normalize the row to make the sum of its elements equal to 1.
- convMat[row] /= np.max(convMat[row])
- convMat[row] = convMat[row] * gaussian_height
- return (convMat + convMat.T)/2.0
- def Recurrence_matrix(N, kernel):
- '''Inter-areal recurrent excitation matrix'''
- K = len(kernel)
- convMat = np.zeros((N, N))
- for row in range(N):
- i = 0
- for col in range(int(row - np.floor(K / 2)), int(row + np.ceil(K / 2))):
- # print(col)
- convMat[row, np.remainder(col + N, N)] = kernel[i]
- i = i + 1
- return convMat
- def RescaleEigenvalues(convMat):
- '''Rescale the eigenvalues recurrent excitation matrix'''
- Utmp, Stmp, Vh = np.linalg.svd(convMat)
- Stmp[Stmp > 1] = 1 # Stmp is 1d vector
- Stmp = Stmp * 1.0
- n_convMat = (Utmp @ np.diag(Stmp) @ Vh)
- return n_convMat
- def ReceptiveFields(N,theta,M):
- '''Receptive fields matrix'''
- d = int(N / 2)
- pint = d - 1
- if pint < 1:
- pint = 1
- const = np.sqrt(d / N) * np.sqrt((2 ** (2 * pint) * (math.factorial(pint)) ** 2)
- / (math.factorial(2 * pint) * (pint + 1)))
- RFs = np.zeros((N, M))
- for idx in range(N):
- thetaOffset = idx * 2 * np.pi / N
- thetaDiff = (theta - thetaOffset) / 2
- rf = const * np.cos(thetaDiff) ** pint
- RFs[idx, :] = abs(rf)
- return RFs
- def get_W14(N):
- '''Receptive fields matrix'''
- d = int(N / 2)
- pint = d - 1
- if pint < 1:
- pint = 1
- const = np.sqrt(d / N) * np.sqrt((2 ** (2 * pint) * (math.factorial(pint)) ** 2)
- / (math.factorial(2 * pint) * (pint + 1)))
- RFs = np.zeros((N, N))
- theta = np.linspace(0, 2 * np.pi, N, endpoint=False)
- for idx in range(N):
- thetaOffset = idx * 2 * np.pi / N
- thetaDiff = (theta - thetaOffset) / 2
- rf = const * np.cos(thetaDiff) ** pint
- RFs[idx, :] = abs(rf)
- return RFs
- def setup_parameters(config, tau=1e-3, kernel=None, N=36, M=None, tauPlus=1*1e-3, **kwargs):
- '''This function sets up the parameters for the ring model.
- Params:
- config: configuration dictionary from YAML
- kernel: kernel for the within area recurrent matrix
- N: number of neurons
- M: number of stimuli
- kwargs: additional arguments'''
- if kernel is None:
- kernel = [0.02807382, -0.060944743, -0.073386624, 0.41472545, 0.7973934,
- 0.41472545, -0.073386624, -0.060944743, 0.02807382] # qmf 9 kernel
- # within area recurrent matrix
- W11 = Recurrence_matrix(N, kernel)
- W11 = (W11.T + W11)/2.0 # making symmetric
- W11 = RescaleEigenvalues(W11) # rescaling eigenvalues to one
- # Wn1 = Norm_matrix(N, std_dev=N/2,gaussian_height=1) # Normalization pool within each layers
- # Wn2 = Norm_matrix(N, std_dev=N/2,gaussian_height=1) # Normalization pool within each layers
- Wn1 = np.ones((N,N))
- Wn2 = np.ones((N,N))
- # Wn1 = identity_matrix
- # Wn2 = identity_matrix
- # Wn1 = (Wn1 + Wn1.T)/2.0 # making symmetric
- # Wn2 = (Wn2 + Wn2.T)/2.0 # making symmetric
- W44 = W11 # currently setting same within area recurrent matrix
- # W44 = identity_matrix
- # theta1 = np.arange(0, 2 * np.pi, 2 * np.pi / 36)
- # Wy1y2 = Wy1y1**2 # For sabilization by feedback plot
- W14 = W11 @ W11 # connectivity matrix
- # W14 = identity_matrix
- # W14 = W11
- W41 = W14.T # Wy2y1 is transpose of Wy1y2
- W45 = W14
- # W11 = identity_matrix # identity matrix check if the results holds
- # W44 = identity_matrix
- # Changing the weight matrices
- # identity_matrix = np.eye(N) * 1e-6
- # Wn1 = identity_matrix
- # Wn2 = identity_matrix
- # W14 = 1/np.sqrt(N) * np.ones((N, N))
- # W41 = W14.T
- # W14 = get_W14(N)
- # W41 = W14.T
- # W45 = np.ones((N,N))
- if M is None:
- theta = np.arange(0, 2 * np.pi, 2 * np.pi / 360)
- # theta = np.arange(0, np.pi, np.pi / 360)
- M = len(theta)
- else:
- theta = np.linspace(0, 2 * np.pi, M)
- # Encoding matrix: Receptive fields are raised cosine
- Wzx = ReceptiveFields(N, theta, M)
- # Wzx = np.ones((N, M))/np.sqrt(N)
- pars = {
- 'N': N, 'M': M,
- 'tauY1': tau, 'tauY4': tau,
- 'tauYPlus1': tauPlus, 'tauYPlus4': tauPlus,
- 'tauP1': tau, 'tauP4': tau,
- 'tauPPlus1': tauPlus, 'tauPPlus4': tauPlus,
- 'tauU1': tau, 'tauU4': tau,
- 'tauUPlus1': tauPlus, 'tauUPlus4': tauPlus,
- 'tauS1': tau, 'tauS4': tau,
- 'tauSPlus1': tauPlus, 'tauSPlus4': tauPlus,
- 'tauBeta1': tau, 'tauBeta4': tau,
- 'tauGamma1': tau, 'tauGamma4': tau,
- 'tau': tau, 'tauPlus': tauPlus,
- 'tau_x': tau, 'tau_f': config['noise_params']['tau_f'],
- 'sigma1': config['model_params']['sigma1'], 'sigma4': config['model_params']['sigma4'],
- 'dt': tauPlus/3,
- 'W11': W11, 'W44': W44,
- 'W14': W14*0.7, 'W41': W41*1.0, 'W45': W45,
- 'Wn1': Wn1, 'Wn4': Wn2,
- 'Wzx': Wzx*0.7,
- # Load parameters from config
- 'sigma_f': config['noise_params']['sigma_f'],
- 'alpha1': config['model_params']['alpha1'],
- 'alpha4': config['model_params']['alpha4'],
- 'beta1': config['model_params']['beta1'],
- 'beta4': config['model_params']['beta4'],
- 'gamma1': config['model_params']['gamma1'],
- 'gamma4': config['model_params']['gamma4'],
- 'b1': config['model_params']['b1'],
- 'b4': config['model_params']['b4'],
- 'g1': config['model_params']['g1'],
- 'g4': config['model_params']['g4']
- }
- for k in kwargs:
- pars[k] = kwargs[k]
- return pars
Create_weight_matrices.py at commit 9ee11f9, under MIT · at the source
Overview
- Simons Center for Computational Physical Chemistry, Department of Chemistry, New York University New York United States
- Center for Soft Matter Research, Department of Physics, New York University New York United States
- Courant Institute of Mathematical Sciences, New York University New York United States
- Department of Psychology, New York University New York United States
- Center for Neural Science, New York University New York United States
Abstract
The primate brain exhibits a hierarchical, modular architecture with conserved microcircuits executing canonical computations across reciprocally connected cortical areas. We present a hierarchical neural circuit theory with feedback connections that dynamically implements divisive normalization across its hierarchy. In a two-stage instantiation (V1 ↔ V2), increasing feedback from V2 to V1 amplifies responses in both areas. We analytically derive power spectra (V1) and coherence spectra (V1-V2) as functions of frequency (f) and compare them with experimental observations: peaks in both spectra shift to higher frequencies with increased stimulus contrast, and power decays as 1/
Reproduced under the paper's license (CC BY), from the paper cited above.
Repository
Its files are read in the Code ↔ Paper reader above, with 9 matches between paragraphs and lines of code.
asit-pal/hierarchical-organics
9ee11f956299e846c32bce31c40660aacca0da16, 10 November 2026Availability: 1 check, the latest on 20 November 2026: the link answers
- 20 November 2026: the link answers
49 files
- Analysis/
Coherence_analysis.py , Python, 133 lines - Analysis/
Communication_analysis.p , Python, 164 linesy - Analysis/
Effective_time_constants , Python, 130 lines.py - Analysis/
Fano_factor.py , Python, 96 lines - Analysis/
Freq_wise_dim_freq.py , Python, 134 lines - Analysis/
Freq_wise_pred_perf_freq , Python, 134 lines.py - Analysis/
Gain_modulation.py , Python, 104 lines - Analysis/
Plot_correlation_matrix. , Python, 808 linespy - Analysis/
Power_spectra_analysis.p , Python, 155 linesy - Analysis/
Stability_analysis.py , Python, 156 lines - Analysis/
Stability_analysis_beta. , Python, 157 linespy - Analysis/
__init__.py , Python, 1 line - Job_Scripts/
submit_analysis.sh , Shell, 71 lines - Models/
Model.py , Python, 464 lines - Models/
__init__.py , Python, 1 line - Plotting/
Plot_PS_fixed_gamma_with , Python, 320 lines_power_decay.py - Plotting/
Plot_coherence_fixed_con , Python, 236 linestrast.py - Plotting/
Plot_coherence_fixed_gam , Python, 185 linesma.py - Plotting/
Plot_coherence_grid.py , Python, 285 lines - Plotting/
Plot_communication_analy , Python, 212 linessis.py - Plotting/
Plot_communication_analy , Python, 216 linessis_3.py - Plotting/
Plot_dim_vs_freq.py , Python, 298 lines - Plotting/
Plot_dimensionality_vs_g , Python, 203 linesain.py - Plotting/
Plot_fano_factor.py , Python, 95 lines - Plotting/
Plot_freq_wise_decom.py , Python, 266 lines - Plotting/
Plot_gain_modulation.py , Python, 358 lines - Plotting/
Plot_max_perf_vs_contras , Python, 171 linest.py - Plotting/
Plot_max_perf_vs_gain.py , Python, 187 lines - Plotting/
Plot_power_grid.py , Python, 243 lines - Plotting/
Plot_power_spectra_fixed , Python, 271 lines_contrast.py - Plotting/
Plot_power_spectra_fixed , Python, 151 lines_gamma.py - Plotting/
Plotting.py , Python, 760 lines - Plotting/
__init__.py , Python, 1 line - Plotting/
plot_stability_curves.py , Python, 99 lines - Plotting/
plot_weight_matrices.py , Python, 85 lines - Tests/
low_pass_white_noise.py , Python, 71 lines - Three_area/
Communication_3.py , Python, 297 lines, 1 match - Three_area/
Communication_analysis_3 , Python, 79 lines.py - Three_area/
Parameters_3.py , Python, 156 lines, 2 matches - Three_area/
Three_area_model.py , Python, 315 lines - Three_area/
__init__.py , Python, 4 lines - Utils/
Coherence.py , Python, 490 lines - Utils/
Communication.py , Python, 818 lines, 2 matches - Utils/
Create_weight_matrices.p , Python, 182 lines, 2 matchesy - Utils/
__init__.py , Python, 1 line - Utils/
matrix_spectrum.py , Python, 171 lines, 2 matches - __init__.py, Python, 3 lines
- LICENSE, License, 21 lines
- README.md, Text, 154 lines
The paper's code and data availability statement is in the Data section.
Tracing map
Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.
What the map holds:
- 1 repository of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
- 47 scripts, each with its path and the digest of its content;
- 9 matches between paragraphs of the paper and lines of the code (method lexical-v1);
- neither the text of the paper nor the code itself.
Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.
Data
No dataset and no data link were found in the paper.
Data availability
The code to generate all the figures can be found in the following GitHub repository: https://
Reproduced under the paper's license (CC BY), from the paper cited above.
Versions
The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.
Version 1, 20 November 2026: the first record
Recorded: type, language, journal, volume, pages, dates, 4 authors, 7 keywords, 5 MeSH terms, 3 funders, 102 references.
Cite
This paper
Pal, A., Rawat, S., Heeger, D. J., & Martiniani, S. (2026). Hierarchical neural circuit theory of normalization and inter-areal communication. eLife, 15, RP111297. https://
BibTeX
@article{pal2026hierarch
author = {Pal, Asit and Rawat, Shivang and Heeger, David J and Martiniani, Stefano},
title = {{Hierarchical neural circuit theory of normalization and inter-areal communication}},
journal = {eLife},
year = {2026},
month = nov,
volume = {15},
pages = {RP111297},
publisher = {eLife Sciences Publications, Ltd},
issn = {2050-084X},
doi = {10.7554/
url = {https://
pmid = {43042781},
pmcid = {PMC13777271}
}
RIS
TY - JOUR
AU - Pal, Asit
AU - Rawat, Shivang
AU - Heeger, David J
AU - Martiniani, Stefano
TI - Hierarchical neural circuit theory of normalization and inter-areal communication
T2 - eLife
J2 - eLife
PY - 2026
DA - 2026/
VL - 15
SP - RP111297
SN - 2050-084X
PB - eLife Sciences Publications, Ltd
DO - 10.7554/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.7554/
"type": "article-journal",
"title": "Hierarchical neural circuit theory of normalization and inter-areal communication",
"container-title": "eLife",
"author": [
{
"family": "Pal",
"given": "Asit"
},
{
"family": "Rawat",
"given": "Shivang"
},
{
"family": "Heeger",
"given": "David J"
},
{
"family": "Martiniani",
"given": "Stefano"
}
],
"container-title-short":
"volume": "15",
"page": "RP111297",
"DOI": "10.7554/
"PMID": "43042781",
"PMCID": "PMC13777271",
"ISSN": "2050-084X",
"publisher": "eLife Sciences Publications, Ltd",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
11,
17
]
]
}
}
The tracing map gets a citation of its own once an author has validated it and it has a DOI.
Similar papers
The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.
- [1] doi:10.7554/elife.99808 [code]
- Untangling stability and gain modulation in cortical circuits with multiple interneuron classes.Journal: eLifeIn common: systems, 12 references
- [2] doi:10.1126/sciadv.adv9396 [code]
- Neuronal heterogeneity of normalization strength in a circuit model.Journal: Science advancesIn common: systems, 10 references
- [3] doi:10.1016/j.neuron.2024.04.020
- Distinct feedforward and feedback pathways for cell-type specific attention effects.Journal: NeuronIn common: 11 references
- [4] doi:10.1016/j.neuron.2022.01.002 [code]
- Predictive coding of natural images by V1 firing rates and rhythmic synchronization.Journal: NeuronIn common: SciPy, Matplotlib, NumPy, 9 references
- [5] doi:10.1371/journal.pbio.3003831 [code]
- Disinhibitory signaling enables flexible coding of top-down information in cortical networks.Journal: PLoS biologyIn common: PyTorch, SciPy, Matplotlib, 1 other tool, systems, 7 references
- [6] doi:10.1371/journal.pcbi.1013958 [code]
- Computing the effects of excitatory-inhibitory balance on neuronal input-output properties.Journal: PLoS computational biologyIn common: 9 references
- [7] doi:10.1371/journal.pcbi.1013081 [code]
- Balanced state of networks of winner-take-all units.Journal: PLoS computational biologyIn common: SciPy, Matplotlib, NumPy, 8 references
- [8] doi:10.7554/elife.71801 [code]
- Gated recurrence enables simple and accurate sequence prediction in stochastic, changing, and structured environments.Journal: eLifeIn common: PyTorch, SciPy, Matplotlib, 1 other tool, 8 references
- [9] doi:10.7554/elife.108408 [code]
- Frequency and laminar profile of feature-specific visual activity revealed by interleaved EEG-fMRI.Journal: eLifeIn common: SciPy, Matplotlib, NumPy, systems, 8 references
- [10] doi:10.1371/journal.pcbi.1011704 [code]
- Normalization by orientation-tuned surround in human V1-V3.Journal: PLoS computational biologyIn common: systems, 8 references
Contribute
The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.
Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.
Claim this paper
Correct its record
Say what each link of this record is, remove the ones that are not the paper's, add the ones that are missing. The correction becomes a new version of the record, in its Versions section.
Validate its tracing map
You validate the map as this page shows it: 1 repository of the authors' code, each at its verified commit and with its license, 47 scripts, and 9 matches between paragraphs and code (see the Code and Map sections). It then receives a DOI on Zenodo, with you (your ORCID iD) and OSCR as its creators; the code itself is not deposited.
The map's fingerprint: sha256:718be85583b46f5f…
Add the badge to the code's README
If you are an author or a maintainer of this paper's code, you can add this badge. It says what OSCR knows of the paper (its code, its validated tracing map) and links the code to this page. Paste one of these snippets under the README's title. Keep the two marks around it, so that the badge can be replaced in place and is never added twice. OSCR changes nothing in your repository.
Markdown
<!-- oscr-badge:start -->
[](https://openscicode.org/badge/doi/10.7554/elife.111297)
<!-- oscr-badge:end -->reStructuredText
.. oscr-badge:start
.. image:: https://openscicode.org/badge/doi/10.7554/elife.111297.svg
:target: https://openscicode.org/badge/doi/10.7554/elife.111297
:alt: OSCR
.. oscr-badge:endHTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.7554/elife.111297"><img src="https://openscicode.org/badge/doi/10.7554/elife.111297.svg" alt="OSCR"></a>
<!-- oscr-badge:end -->If you choose to, you can have the badge kept up to date for you, with oscr badge --write from the command line or with the GitHub Action in your repository's workflows. Every other form and option (a card, AsciiDoc, LaTeX, shields.io) is on the badge page.
Request its removal
To ask OSCR to remove this record, the copies of its authors' scripts or its tracing map, use the removal request page: signed in, you say who you are, what to remove and why, then review and confirm the request. Published rules decide every request (how).
Discussion, reproductions, activity
Discussion: code errors and mismatches between the code and the paper about this paper and its code, from readers and its authors, beside the paper and its tracing map.
Report a mismatch between the code and the paper · Report a code error (signed in)
Reproductions: reports from readers who ran the authors' code and did not get the paper's result, what they ran, with which environment, commit and data.
Report a reproduction failure (signed in)
Versions of its code: the releases of its code tied to a version of this paper (the preprint, the accepted manuscript, the version of record…), each with the tracing map versioned with it.
Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.
