Computational Models of Multisensory Integration with Recurrent Neural Networks: A Critical Review and Future Directions
Bibliographic record
Abstract
Multisensory integration (MSI) is a core brain function underlying perception, learning, and behavior. Understanding the computational mechanisms of MSI is key to advancing AI and brain‐inspired systems. While earlier models relied on probabilistic frameworks, recurrent neural networks (RNNs) offer advantages in capturing temporal dynamics and neural computations. This review presents a critical examination of computational models of MSI, focusing on the evolution from probabilistic integration to modern RNN‐based methods. Biological evidence for temporal coordination in multisensory areas is analyzed and explored how different RNN architectures (e.g., vanilla, long short‐term memory, and gated recurrent unit) simulate these dynamics. Comparative analyses show RNNs’ superiority in robustness and learning efficiency, with up to 46.9% improvement in classification tasks involving sensory fusion. We introduce a taxonomy of MSI tasks and a novel evaluation framework for model benchmarking. Real‐world case studies—from speech recognition to prosthetic control—highlight practical applications. Challenges in interpretability, data efficiency, and generalization are also discussed. The review provides actionable insights for future research in both computational neuroscience and artificial intelligence. By bridging neurobiological principles and machine learning, RNN‐based models pave the way for intelligent systems capable of flexible, context‐aware multisensory processing.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".