Photonic reservoir computing with complex networks

• URL: http://arxiv.org/abs/2607.23285v1
• Date: Sat, 25 Jul 2026 16:39:56 GMT
• Title: Photonic reservoir computing with complex networks
• Abstract summary: Photonic reservoir computing has attracted increasing attention as a fast and low-cost approach for time-series prediction.<n>The effect of the internal connection structure (network topology) on the computing performance has not been investigated for large-scale photonic reservoirs.<n>We introduce complex network structures such as small-world and scale-free network topologies of the internal nodes in the reservoir.
• Score: 1.641989164066004
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Photonic reservoir computing has attracted increasing attention as a fast and low-cost approach for time-series prediction. Photonic reservoir computing utilizes the high speed, broad bandwidth, and spatial parallelism of light. However, the effect of the internal connection structure (network topology) on the computing performance has not been investigated for large-scale photonic reservoirs. In this study, we experimentally and numerically demonstrate photonic reservoir computing using a spatial light modulator to systematically evaluate the relationship between the network topology and the performance of reservoir computing. We introduce complex network structures such as small-world and scale-free network topologies of the internal nodes in the reservoir. We perform the memory capacity measurement and the one-step-ahead prediction task of the chaotic time series to compare the performance. We found that the small-world network exhibits the maximum memory capacity and the best prediction performance. Our numerical calculations reveal that the performance of the time-series prediction can be optimized by changing the rewiring probability of the network and the leak rate of the reservoir. We also implement photonic human brain network as a reservoir, which is designed by the connectomes of human brain activities. We found that the network topology strongly affects the performance of reservoir computing, and the small-world network structure outperforms the other configurations.

Related papers

• Identifying structural design principles shaping the computational abilities of recurrent neural networks [1.5346678870160888]
  We characterize the computational abilities of recurrent neural networks as a function of their connectivity.<n>For small networks, we constructed the complete catalogs'' of network-function performance.<n>We show that having local 2- and 3-cycles in a network strongly enhances its computational ability.
  arXiv  Detail & Related papers  (2026-06-22T19:17:25Z)
• ANCRe: Adaptive Neural Connection Reassignment for Efficient Depth Scaling [57.91760520589592]
  Scaling network depth has been a central driver behind the success of modern foundation models.<n>This paper revisits the default mechanism for deepening neural networks, namely residual connections.<n>We introduce adaptive neural connection reassignment (ANCRe), a principled and lightweight framework that parameterizes and learns residual connectivities from the data.
  arXiv  Detail & Related papers  (2026-02-09T18:54:18Z)
• Deep Lookup Network [76.66809324649154]
  In many resource-limited edge devices, complicated operations can be calculated via lookup tables to reduce computational cost.<n>We introduce a generic and efficient lookup operation which can be used as a basic operation for the construction of neural networks.<n>By replacing computationally expensive multiplication operations with our lookup operations, we develop lookup networks for the image classification, image super-resolution, and point cloud classification tasks.
  arXiv  Detail & Related papers  (2025-09-17T03:31:41Z)
• Asymmetrically connected reservoir networks learn better [0.0]
  connectivity within the high-dimensional recurrent layer of a reservoir network is crucial for its performance. We show that connectivity within the high-dimensional recurrent layer of a reservoir network is crucial for its performance.
  arXiv  Detail & Related papers  (2024-10-01T11:15:18Z)
• Neuromorphic on-chip reservoir computing with spiking neural network architectures [0.562479170374811]
  Reservoir computing is a promising approach for harnessing the computational power of recurrent neural networks. This paper investigates the application of integrate-and-fire neurons within reservoir computing frameworks for two distinct tasks. We study the reservoir computing performance using a custom integrate-and-fire code, Intel's Lava neuromorphic computing software framework, and via an on-chip implementation in Loihi.
  arXiv  Detail & Related papers  (2024-07-30T05:05:09Z)
• LitE-SNN: Designing Lightweight and Efficient Spiking Neural Network through Spatial-Temporal Compressive Network Search and Joint Optimization [48.41286573672824]
  Spiking Neural Networks (SNNs) mimic the information-processing mechanisms of the human brain and are highly energy-efficient. We propose a new approach named LitE-SNN that incorporates both spatial and temporal compression into the automated network design process.
  arXiv  Detail & Related papers  (2024-01-26T05:23:11Z)
• Convergence and scaling of Boolean-weight optimization for hardware reservoirs [0.0]
  We analytically derive the scaling laws for highly efficient Coordinate Descent applied to optimize the readout layer of a random recurrently connection neural network. Our results perfectly reproduce the convergence and scaling of a large-scale photonic reservoir implemented in a proof-of-concept experiment.
  arXiv  Detail & Related papers  (2023-05-13T12:15:25Z)
• Dense Hebbian neural networks: a replica symmetric picture of supervised learning [4.133728123207142]
  We consider dense, associative neural-networks trained by a teacher with supervision. We investigate their computational capabilities analytically, via statistical-mechanics of spin glasses, and numerically, via Monte Carlo simulations.
  arXiv  Detail & Related papers  (2022-11-25T13:37:47Z)
• Semi-supervised Network Embedding with Differentiable Deep Quantisation [81.49184987430333]
  We develop d-SNEQ, a differentiable quantisation method for network embedding. d-SNEQ incorporates a rank loss to equip the learned quantisation codes with rich high-order information. It is able to substantially compress the size of trained embeddings, thus reducing storage footprint and accelerating retrieval speed.
  arXiv  Detail & Related papers  (2021-08-20T11:53:05Z)
• Group Fisher Pruning for Practical Network Compression [58.25776612812883]
  We present a general channel pruning approach that can be applied to various complicated structures. We derive a unified metric based on Fisher information to evaluate the importance of a single channel and coupled channels. Our method can be used to prune any structures including those with coupled channels.
  arXiv  Detail & Related papers  (2021-08-02T08:21:44Z)
• PredRNN: A Recurrent Neural Network for Spatiotemporal Predictive Learning [109.84770951839289]
  We present PredRNN, a new recurrent network for learning visual dynamics from historical context. We show that our approach obtains highly competitive results on three standard datasets.
  arXiv  Detail & Related papers  (2021-03-17T08:28:30Z)
• Understanding the Effects of Data Parallelism and Sparsity on Neural Network Training [126.49572353148262]
  We study two factors in neural network training: data parallelism and sparsity. Despite their promising benefits, understanding of their effects on neural network training remains elusive.
  arXiv  Detail & Related papers  (2020-03-25T10:49:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.