OSCR

Representation Transfer via Invariant Input-driven Continuous Attractors for Fast Domain Adaptation.

Overview

Authors: Tie Xu1, Shengdun Wu1, Junwen Luo2, Yao Yang1, Feng Lin3, Junjie Jiang4, Guozhang Chen5, Dongping Yang1,6
  1. Zhejiang Lab,Hangzhou, 311100 China
  2. Institutes of Brain Science, Fudan University,Shanghai, 200433 China
  3. MoE Key Lab of Human Factors and Intelligent Reduction of Vibration & Noise, Fuyao University of Science and Technology, Fuzhou, 350000 China
  4. The Key Laboratory of Biomedical Information Engineering of Ministry of Education, Institute of Health and Rehabilitation Science, School of Life Science and Technology, Xi’an Jiaotong University,Xi’an, 710049 China
  5. National Key Laboratory for Multimedia Information Processing, School of Computer Science, Peking University,Beijing, 100871 China
  6. Shenzhen Loop Area Institute (SLAI), Shenzhen, 518045 China
Journal: Communications biology, volume 9, issue 1, article 747
Dates: received 9 September 2025; accepted 16 March 2026; published online 4 April 2026
Type: Research article · Language: English
License: CC BY-NC-ND
Identifiers: DOI 10.1038/s42003-026-09938-8 · PMID 41935160 · PMCID PMC13230790 · OpenAlex W7149661022
Open access: gold, a free copy (OpenAlex)
Status: code verified (how the code is found and verified)
Categories: computational modeling (no new data) (modality), human (organism), computational (subfield)
Methods: Smoothing, state filtering, decompositions, Machine learning, Statistics, fMRI & imaging
Keywords: Learning algorithms, Dynamical systems
MeSH: Recurrent Neural Networks*, Adaptive Algorithms, Humans, Representation Machine Learning, Soft Computing (* major topic)
Topic: Domain Adaptation and Few-Shot Learning (Artificial Intelligence, Computer Science), according to OpenAlex
Citations: not cited yet (Europe PMC); 76 references in the paper

Abstract

The abstract is not reproduced here: the paper's license (CC BY-NC-ND) does not allow it. Read it in the paper, at the publisher or on Europe PMC.

Code

No file of the authors' code could be read here: it is described below, and read at its source.

Zenodo 16441066

License: CC-BY-4.0
State: the link answers, verified on 28 September 2026
Evidence: files inventoried
Size: 1 file
Software Heritage: not checked
Found in: “Code availability”
Not found: README, license file, CITATION.cff, environment file, tests, continuous integration, documentation
Availability: 1 check, the latest on 28 September 2026: the link answers (HTTP 200)
  • 28 September 2026: the link answers (HTTP 200)
At the source:

Code availability statement

The paper has a code availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:

  • it points to the authors' code: Zenodo 16441066

Read it in the paper: doi.org/10.1038/s42003-026-09938-8.

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;
  • 0 scripts, each with its path and the digest of its content;
  • no match between paragraphs and code yet;
  • 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

Datasets cited

Data availability statement

The paper has a data availability statement. Its license (CC BY-NC-ND) does not allow reproducing it here; in short, from what the harvester recognized in it:

Read it in the paper: doi.org/10.1038/s42003-026-09938-8.

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, 28 September 2026: the first record

Recorded: type, language, journal, volume, issue, pages, dates, 8 authors, 2 keywords, 5 MeSH terms, 2 funders, 60 references.

Cite

This paper

Xu, T., Wu, S., Luo, J., Yang, Y., Lin, F., Jiang, J., Chen, G., & Yang, D. (2026). Representation Transfer via Invariant Input-driven Continuous Attractors for Fast Domain Adaptation. Communications biology, 9(1), 747. https://doi.org/10.1038/s42003-026-09938-8

BibTeX

@article{xu2026representation,
author = {Xu, Tie and Wu, Shengdun and Luo, Junwen and Yang, Yao and Lin, Feng and Jiang, Junjie and Chen, Guozhang and Yang, Dongping},
title = {{Representation Transfer via Invariant Input-driven Continuous Attractors for Fast Domain Adaptation}},
journal = {Communications biology},
year = {2026},
month = apr,
volume = {9},
number = {1},
pages = {747},
publisher = {Nature Publishing Group},
issn = {2399-3642},
doi = {10.1038/s42003-026-09938-8},
url = {https://doi.org/10.1038/s42003-026-09938-8},
pmid = {41935160},
pmcid = {PMC13230790}
}

RIS

TY - JOUR
AU - Xu, Tie
AU - Wu, Shengdun
AU - Luo, Junwen
AU - Yang, Yao
AU - Lin, Feng
AU - Jiang, Junjie
AU - Chen, Guozhang
AU - Yang, Dongping
TI - Representation Transfer via Invariant Input-driven Continuous Attractors for Fast Domain Adaptation
T2 - Communications biology
J2 - Commun Biol
PY - 2026
DA - 2026/04/04
VL - 9
IS - 1
SP - 747
SN - 2399-3642
PB - Nature Publishing Group
DO - 10.1038/s42003-026-09938-8
UR - https://doi.org/10.1038/s42003-026-09938-8
LA - en
ER -

CSL-JSON

{
"id": "10.1038/s42003-026-09938-8",
"type": "article-journal",
"title": "Representation Transfer via Invariant Input-driven Continuous Attractors for Fast Domain Adaptation",
"container-title": "Communications biology",
"author": [
{
"family": "Xu",
"given": "Tie"
},
{
"family": "Wu",
"given": "Shengdun"
},
{
"family": "Luo",
"given": "Junwen"
},
{
"family": "Yang",
"given": "Yao"
},
{
"family": "Lin",
"given": "Feng"
},
{
"family": "Jiang",
"given": "Junjie"
},
{
"family": "Chen",
"given": "Guozhang"
},
{
"family": "Yang",
"given": "Dongping"
}
],
"container-title-short": "Commun Biol",
"volume": "9",
"issue": "1",
"page": "747",
"DOI": "10.1038/s42003-026-09938-8",
"PMID": "41935160",
"PMCID": "PMC13230790",
"ISSN": "2399-3642",
"publisher": "Nature Publishing Group",
"URL": "https://doi.org/10.1038/s42003-026-09938-8",
"language": "en",
"issued": {
"date-parts": [
[
2026,
4,
4
]
]
}
}

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.1126/sciadv.adr3903 [code]
Neural heterogeneity enhances reliable neural information processing: Local sensitivity and globally input-slaved transient dynamics.
Journal: Science advances
In common: 1 reference, 2 authors
[2] doi:10.1371/journal.pcbi.1013081 [code]
Balanced state of networks of winner-take-all units.
Journal: PLoS computational biology
In common: computational, computational modeling (no new data), 6 references
[3] doi:10.3389/fnins.2024.1439414 [code]
Spiking representation learning for associative memories.
Journal: Frontiers in neuroscience
In common: computational modeling (no new data), 6 references
[4] doi:10.1371/journal.pcbi.1013083 [code]
The effects of the post-delay epochs on working memory error reduction.
Journal: PLoS computational biology
In common: 5 references
[5] doi:10.1371/journal.pcbi.1011315 [code]
Geometry of population activity in spiking networks with low-rank structure.
Journal: PLoS computational biology
In common: 6 references
[6] doi:10.1371/journal.pcbi.1011852 [code]
Trained recurrent neural networks develop phase-locked limit cycles in a working memory task.
Journal: PLoS computational biology
In common: computational modeling (no new data), 5 references
[7] doi:10.1073/pnas.2314511121 [code]
A mathematical theory of relational generalization in transitive inference.
Journal: Proceedings of the National Academy of Sciences of the United States of America
In common: 5 references
[8] doi:10.1371/journal.pcbi.1014162 [code]
Exploring neural manifolds across a wide range of intrinsic dimensions.
Journal: PLoS computational biology
In common: computational, 4 references
[9] doi:10.7554/elife.82426 [code]
Flexible control of representational dynamics in a disinhibition-based model of decision-making.
Journal: eLife
In common: 5 references
[10] doi:10.1038/s41467-024-52240-6 [code]
A geometrical solution underlies general neural principle for serial ordering.
Journal: Nature communications
In common: computational modeling (no new data), 4 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.

Add the badge to the code's README

OSCR: the badge of this paper

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 -->
[![OSCR](https://openscicode.org/badge/doi/10.1038/s42003-026-09938-8.svg)](https://openscicode.org/badge/doi/10.1038/s42003-026-09938-8)
<!-- oscr-badge:end -->
reStructuredText
.. oscr-badge:start

.. image:: https://openscicode.org/badge/doi/10.1038/s42003-026-09938-8.svg
   :target: https://openscicode.org/badge/doi/10.1038/s42003-026-09938-8
   :alt: OSCR

.. oscr-badge:end
HTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.1038/s42003-026-09938-8"><img src="https://openscicode.org/badge/doi/10.1038/s42003-026-09938-8.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)

Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.