Next Article in Journal
Formal Context Transforms and Their Affordances for Exploratory Data Analysis
Previous Article in Journal
Neural Network-Based Adaptive Finite-Time Control for Pure-Feedback Stochastic Nonlinear Systems with Full State Constraints, Actuator Faults, and Backlash-like Hysteresis
Previous Article in Special Issue
Pseudo-Multiview Learning Using Subjective Logic for Enhanced Classification Accuracy
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Decoding Mouse Visual Tasks via Hierarchical Neural-Information Gradients

National Engineering Research Center for Multimedia Software, School of Computer Science, Wuhan University, Wuhan 430072, China
*
Authors to whom correspondence should be addressed.
Mathematics 2026, 14(1), 31; https://doi.org/10.3390/math14010031
Submission received: 18 November 2025 / Revised: 17 December 2025 / Accepted: 18 December 2025 / Published: 22 December 2025
(This article belongs to the Special Issue Machine Learning and Mathematical Methods in Computer Vision)

Abstract

Understanding how the brain encodes and decodes dynamic neural responses to visual stimuli is crucial for revealing visual information representation. Currently, most methods (including deep neural networks, DNNs) often overlook the dynamic generation process of neural data, such as hierarchical visual data, within the brain’s structure. In this work, we introduce two decoding paradigms: fine-grained decoding tests (single brain regions) and coarse-grained decoding tests (multiple regions). Using the Allen Institute’s Visual Coding Neuropixel dataset, we propose the Adaptive Topological Vision Transformer (AT-ViT), which exploits a biologically calibrated cumulative hierarchy derived from single-area decoding performance to adaptively decode topological relationships across brain regions. Extensive experiments confirm the ‘Information-Gradient Hypothesis’: single-area decoding accuracy should recovers the anatomical visual hierarchy, and AT-ViT achieves maximal performance when this data-driven gradient is respected. AT-ViT outperforms non-hierarchical baselines (ada-PCA/SVM) by 1.08–1.93% in natural scenes and 2.46–3.34% in static gratings across sessions, peaking at hierarchy 3 (visual cortex + thalamus/midbrain) with up to 96.21%, but declining 1–2% when including hippocampus data, highlighting its random, performance-hindering nature. This work demonstrates hierarchical networks’ superiority for brain visual tasks and opens avenues for studying hippocampal roles beyond visual decoding.
Keywords: adaptive decoding; fine-coarse-grained test paradigm; hierarchical information gradients; random performance adaptive decoding; fine-coarse-grained test paradigm; hierarchical information gradients; random performance

Share and Cite

MDPI and ACS Style

Feng, J.; Feng, X.; Luo, Y.; Li, J. Decoding Mouse Visual Tasks via Hierarchical Neural-Information Gradients. Mathematics 2026, 14, 31. https://doi.org/10.3390/math14010031

AMA Style

Feng J, Feng X, Luo Y, Li J. Decoding Mouse Visual Tasks via Hierarchical Neural-Information Gradients. Mathematics. 2026; 14(1):31. https://doi.org/10.3390/math14010031

Chicago/Turabian Style

Feng, Jingyi, Xiang Feng, Yong Luo, and Jing Li. 2026. "Decoding Mouse Visual Tasks via Hierarchical Neural-Information Gradients" Mathematics 14, no. 1: 31. https://doi.org/10.3390/math14010031

APA Style

Feng, J., Feng, X., Luo, Y., & Li, J. (2026). Decoding Mouse Visual Tasks via Hierarchical Neural-Information Gradients. Mathematics, 14(1), 31. https://doi.org/10.3390/math14010031

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop