Whole-to-parts causation mechanism.
The 1 match
- [1] § Proof of concept › Method › Training ↔ script/train_bisection_transInj.py, lines 31–89 · score 0.61 · RAdam, training, epochs, optimization, CUDA, batch
Paper
Loaded from Europe PMC by your browser, not stored by OSCR: doi.org · Europe PMC
The paper is loaded when this pane is shown.
The authors' code
Python · 113 lines · 3.9 KB · no license · 1 match
- import argparse
- import os
- import shutil
- from turtle import color
- from typing import Iterable, Optional, Union
- import torch
- import torch.nn as nn
- import torch.optim as optim
- from torch.utils.data import DataLoader
- from model.main_model import BisectionTrans
- from dataset.colorfont import ColorFontPairDataset, NPZImagesDataset
- import utils.json_model as jm
- import numpy as np
- import random
- from script.init_modelInj import (init_modelInj)
- import math
- def torch_fix_seed(seed: int):
- print("seed is " + str(seed))
- random.seed(seed)
- np.random.seed(seed)
- # Pytorch random
- torch.manual_seed(seed)
- torch.cuda.manual_seed(seed)
- torch.cuda.manual_seed_all(seed)
- torch.backends.cudnn.deterministic =True
- torch.backends.cudnn.benchmark = False
- torch.use_deterministic_algorithms = True
- def main(args):
- torch.set_num_threads(4)
- torch.autograd.set_detect_anomaly(True)
- if len(args.label_dim) == 1:
- args.label_dim = [args.label_dim[0], args.label_dim[0]]
- elif len(args.label_dim) > 2:
- raise ValueError
- print (args.label_dim)
- if args.seed is not None:
- torch_fix_seed(args.seed)
- model = init_modelInj(args.label_dim, p_ch=args.p_ch, n_ch=args.n_ch, orth=args.orth, add_ch=args.add_ch, gp_bias=args.gp_bias)
- model.log_config(args.logdir)
- model.Gn_config(orth=args.orth)
- # device
- if torch.cuda.is_available():
- if args.gpu < 0:
- # logger.info("CPU will be used.")
- device = torch.device("cpu")
- elif args.gpu >= torch.cuda.device_count():
- # logger.warn(f"Specified GPU ID {gpu_id} is invalid. "
- # "CPU will be used instead.")
- device = torch.device("cpu")
- else:
- device = torch.device("cuda", args.gpu)
- else:
- device = torch.device("cpu")
- # logger.warn("No CUDA device is available. CPU will be used.")
- model.to(device)
- optimizer = optim.RAdam(
- [
- {"params": model.Gp.Gp0.parameters()},
- {"params": model.Gp.Gp1.parameters()},
- {"params": filter(lambda p: p.requires_grad, model.Gn.parameters()) },
- ],
- args.learning_rate,
- )
- model.train_config(
- optimizer=optimizer,
- commute=args.commute,
- learning_rate = args.learning_rate,
- aux_rate =args.aux_rate,
- batch_size = args.batch_size,
- color_random=args.color_random,
- add_ch = args.add_ch
- )
- dataset = NPZImagesDataset("color_font_all.npz")
- loaders = (DataLoader(dataset, batch_size=args.batch_size, shuffle=True, drop_last=True),
- DataLoader(dataset, batch_size=args.batch_size, shuffle=True, drop_last=True))
- model.train(loaders, args.epoch)
- if __name__ == "__main__":
- parser = argparse.ArgumentParser()
- parser.add_argument("--gpu", "-g", type=int, default=-1)
- parser.add_argument("--logdir", "-l")
- parser.add_argument("--seed", "-sd", type=int)
- parser.add_argument("--label-dim", "-ldim",type=int, nargs="*", default=32)
- parser.add_argument("--p_ch", "-pch", type=int, default=64)
- parser.add_argument("--n_ch", "-nch", type=int, default=32)
- parser.add_argument("--add_ch", "-addc", action="store_true", default=False)
- # Important parameters
- parser.add_argument("--learning-rate", "-lr", type=float, default=1e-4)
- parser.add_argument("--batch-size", "-bs", type=int, default=128)
- parser.add_argument("--epoch", "-e", type=int, default=1000)
- parser.add_argument("--commute", "-cm", type=float, default=1.0)
- parser.add_argument("--aux_rate", "-ar", type=float, default=0.0)
- parser.add_argument("--orth", "-or", action="store_true", default=False)
- parser.add_argument("--gp_bias", "-gp_b", action="store_true", default=False)
- parser.add_argument("--color_random", "-cro", action="store_false", default=True)
- parser.add_argument("--shape_split", '-ss', action="store_true", default=False)
- main(parser.parse_args())
train_bisection_transInj.py at commit 2e6f0e1, no license · at the source
Overview
Abstract
How can the whole have a causal effect on its parts? This is considered impossible because, if the supervenient whole is completely determined by its parts, then the whole-to-parts causation would be redundant. However, the exclusion argument did not assume a hierarchy of multiple supervenient functions and the existence of an inter-level negative feedback control mechanism. Here, we propose that this mechanism enables a causal effect from the whole to its parts. Feedback control typically involves two mechanisms: observing and controlling of the feedback error. These mechanisms can be implemented at two different levels of the hierarchy. We assume that the macro-level consists of a set of mathematical functions that supervene on physical neural states. An algebraic structure of these functions describes a macro-level equation that determines the feedback error. This equation is independent of an external cause, introducing new causal power to the micro-level while avoiding overdetermination. Modifying the micro synaptic weights within the neural networks via inter-level negative feedback control is a whole-to-parts causation mechanism. It should be noted that this paper does not intend to take a position on the ontology surrounding downward causation.
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 1 match between paragraphs and lines of code.
Yoshiyuki-Ohmura/DownwardCausation
2e6f0e1d2c431804e6f51658a19df57b39f57658, 17 September 2024Availability: 1 check, the latest on 28 September 2026: the link answers
- 28 September 2026: the link answers
17 files
- evaluation.sh, Shell, 13 lines
- exp_Ntest1.sh, Shell, 25 lines
- model/
Gn_model.py , Python, 61 lines - model/
Gp_model.py , Python, 55 lines - model/
__init__.py , Python, 1 line - model/
injectiveConv.py , Python, 70 lines - model/
injectiveLinear.py , Python, 145 lines - model/
layer.py , Python, 168 lines - model/
main_model.py , Python, 467 lines - script/
evaluationInj.py , Python, 119 lines - script/
init_modelInj.py , Python, 30 lines - script/
train_bisection_transInj , Python, 113 lines, 1 match.py - utils/
eval.py , Python, 112 lines - utils/
eval_test.py , Python, 61 lines - utils/
formatting.py , Python, 105 lines - utils/
json_model.py , Python, 52 lines - README.md, Text, 22 lines
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;
- 16 scripts, each with its path and the digest of its content;
- 1 match 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 statement
The original contributions presented in the study are included in the article/
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 2, 28 September 2026
- Funding: added Japan Society for the Promotion of Science: 25H00448
Version 1, 28 September 2026: the first record
Recorded: type, language, journal, volume, pages, dates, 2 authors, 5 keywords, 27 references.
Cite
This paper
Ohmura, Y., & Kuniyoshi, Y. (2026). Whole-to-parts causation mechanism. Frontiers in psychology, 17, 1654139. https://
BibTeX
@article{ohmura2026whole
author = {Ohmura, Yoshiyuki and Kuniyoshi, Yasuo},
title = {{Whole-to-parts causation mechanism}},
journal = {Frontiers in psychology},
year = {2026},
month = may,
volume = {17},
pages = {1654139},
publisher = {Frontiers Media SA},
issn = {1664-1078},
doi = {10.3389/
url = {https://
pmid = {42205955},
pmcid = {PMC13202721}
}
RIS
TY - JOUR
AU - Ohmura, Yoshiyuki
AU - Kuniyoshi, Yasuo
TI - Whole-to-parts causation mechanism
T2 - Frontiers in psychology
J2 - Front Psychol
PY - 2026
DA - 2026/
VL - 17
SP - 1654139
SN - 1664-1078
PB - Frontiers Media SA
DO - 10.3389/
UR - https://
LA - en
ER -
CSL-JSON
{
"id": "10.3389/
"type": "article-journal",
"title": "Whole-to-parts causation mechanism",
"container-title": "Frontiers in psychology",
"author": [
{
"family": "Ohmura",
"given": "Yoshiyuki"
},
{
"family": "Kuniyoshi",
"given": "Yasuo"
}
],
"container-title-short":
"volume": "17",
"page": "1654139",
"DOI": "10.3389/
"PMID": "42205955",
"PMCID": "PMC13202721",
"ISSN": "1664-1078",
"publisher": "Frontiers Media SA",
"URL": "https://
"language": "en",
"issued": {
"date-parts": [
[
2026,
5,
12
]
]
}
}
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.1093/nc/niag013 [code]
- Intrinsic units: identifying a system's causal grain.Journal: Neuroscience of consciousnessIn common: NumPy, none (in silico), computational modeling (no new data), 2 references
- [2] doi:10.1038/s41467-026-74460-8 [code]
- Spike-based alignment learning solves the weight transport problem.Journal: Nature communicationsIn common: PyTorch, NumPy, computational modeling (no new data), 1 reference
- [3] doi:10.3389/fncir.2026.1783892 [code]
- Representations of facial features and surface quality in monkey area TE compared to neural network models.Journal: Frontiers in neural circuitsIn common: PyTorch, NumPy, computational modeling (no new data), 1 reference
- [4] doi: [code]
- Going deeper with morphologically detailed neural networks by simulation-based gradient propagationJournal: Frontiers in computational neuroscienceIn common: NumPy, none (in silico), computational modeling (no new data), 1 reference
- [5] doi:10.1038/s42256-026-01254-4 [code]
- Neural sampling from cognitive maps enables goal-directed imagination and planning.Journal: Nature machine intelligenceIn common: PyTorch, NumPy, none (in silico), computational modeling (no new data)
- [6] doi:10.1038/s41586-026-10670-w [code]
- Zero-shot design of drug-binding proteins via neural iterative selection-expansion.Journal: NatureIn common: PyTorch, NumPy, none (in silico), computational modeling (no new data)
- [7] doi:10.3389/frai.2026.1785867 [code]
- A generalized logistic-logit function and its application to multi-layer perceptron and neuron segmentation.Journal: Frontiers in artificial intelligenceIn common: PyTorch, NumPy, 1 reference
- [8] doi:10.1186/s12859-026-06490-4 [code]
- Tissueformer: extending single-cell foundation models to predict population-level phenotypes.Journal: BMC bioinformaticsIn common: PyTorch, NumPy, 1 reference
- [9] doi:10.1038/s41598-026-43798-w [code]
- A Machine learning pipeline to investigate tissue ingrowth in cerebral aneurysms using preclinical animal models.Journal: Scientific reportsIn common: PyTorch, NumPy, 1 reference
- [10] doi:10.1523/eneuro.0370-25.2026 [code]
- Pretraining for Large-Scale Functional Connectome Fingerprinting Supports Generalization and Transfer Learning in Functional Neuroimaging.Journal: eNeuroIn common: PyTorch, NumPy, 1 reference
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, 16 scripts, and 1 match 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:e8aecbf1ab08a143…
Add the badge to its README
The badge links the code to this page. Copy one of these into the README of the paper's code: only you decide where it goes, and nothing is changed for you.
Markdown
[, paste the snippet at the top, then “Commit changes…” and, to review it first, “Create a new branch and start a pull request”. You open the pull request; OSCR asks for no permission.
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: questions and error reports about this paper and its code, from signed-in readers and its authors. It opens with sign-in.
Reproductions: reports from readers who ran the authors' code: what they reproduced, with which environment, commit and data. It opens with sign-in.
Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.
