Searcharxiv⌕ Search

arXiv subjects

Miguel C. Soriano

Publications and source records attributed to Miguel C. Soriano.

At least 19 recordsLinked to original sources

Determinants of hyperparameter robustness in connectome reservoir computing

Reservoir computing provides a controlled setting for studying how recurrent network architectureshapes computation: input signals are projected into a high-dimensional state space by a fixed nonlinear dynamical system, and only the readout is trained. However, reservoir performance can be dependent on hyperparameters; this paper asks which recurrent network features support robustness to those parameter changes. We characterize computational performance using memory capacity (MC), truncated single-delay information-processing capacity (IPC), and kernel rank (KR). Generalization across input histories is measured using generalization rank (GR), while hyperparameter robustness is quantified using the coefficient of variation (CV) of each metric across sweeps of target spectral radius, input scaling, leak rate, and neuron bias. To examine the architectural determinants of robustness, we construct perturbations that alter connectivity topology, excitatory/inhibitory sign structure, weight magnitudes, and weight placement while preserving complementary properties. Across these experiments, the C. elegans connectome consistently occupies a relatively low-variance regime. The central result is a performance-robustness tradeoff: architecture variants with higher task-agnostic performance also tend to exhibit greater hyperparameter sensitivity and poorer common-tail generalization. Across the E/I edge balance sweeps and shuffle controls, this tradeoff is closely associated with the raw spectral radius before normalization. Because every perturbed matrix is rescaled to the same target radius, matrices with lower raw spectral radius receive greater global amplification of their recurrent weights. The observed differences among architectures therefore characterize the joint effects of structural variation and architecture-specific global rescaling under spectral-radius normalization.

q-bio.NC↗

Photonic reservoir computing with dimensionally compressed readout

This work addresses a hardware constraint in reservoir computing: the limited size of the readout layer imposed by systems with a physical readout. We investigate a strategy to accommodate this constraint based on random projection, which compresses high-dimensional reservoir states into a lower-dimensional subspace while preserving key properties of the source space and information- processing capabilities. To evaluate this approach, we compare a small, standalone time delay reservoir against a larger configuration whose output is projected down to match the same restricted readout dimension. Using task-independent metrics, we demonstrate that the distribution of information-processing capacities may differ between the two configurations, even at identical readout sizes. Furthermore, we perform a comprehensive hyperparameter scan to assess how both systems behave under varying physical regimes. Finally, we benchmark this approach on the standard NARMA10 task, showing that the random projection framework can yield superior performance compared to a standalone constrained reservoir, within specific compression range. These results provide a scalable pathway to bypass physical readout bottlenecks in hardware-based reservoir computing.

cs.NE↗

Scalar Representations of Neural Network Training Dynamics

Training in artificial neural networks can be viewed as a trajectory evolving through a high-dimensional loss landscape. However, the large number of trainable parameters makes the direct analysis of these dynamics challenging. In this work, we treat such training trajectories as temporal networks and apply recently proposed strategies for the scalar embedding of temporal networks. We investigate whether such a scalar embedding provides a meaningful low-dimensional representation of neural network training dynamics. Using a multilayer perceptron trained on the MNIST classification task, we show that the embedding preserves the main dynamical features observed in the original parameter space, including the emergence of sensitivity to initial conditions for specific learning rate regimes and an accurate reconstruction of the network's maximum Lyapunov exponent. We then use the embedded scalar trajectory to define a characteristic time, analogous to a Lyapunov time, after which the exponential separation between initially close embedded trajectories saturates. This characteristic time captures the typical decorrelation time between initially close network trajectories in the original high-dimensional system. Finally, we investigate the statistical organization of asymptotic training states through a spacing observable defined in the embedded space. We find that the distributions of rescaled asymptotic spacings collapse onto a common form across initial conditions and are compatible with a skew lognormal distribution. Altogether, our results suggest that scalar low-dimensional embeddings provide a useful framework for studying and visualizing the dynamical properties of neural network optimization trajectories.

cs.LG↗

Computing with the complex nonlinear dynamics of an optomechanical oscillator

An optomechanical oscillator undergoes a Hopf bifurcation that connects two dynamical regimes with different information-processing capabilities: thermal Brownian motion and coherent self-sustained oscillation. Below threshold, the oscillator occupies a stable fixed point around which thermal fluctuations drive stochastic Brownian motion - a regime dominated by linear response, with only short-lived memory and negligible usable nonlinearity. Above threshold, radiation pressure, free-carrier dynamics, and thermo-optic relaxation act together to sustain a stable limit cycle that simultaneously provides both nonlinear transformation and dynamical memory. Here we show that this coherent regime can be used as a physical reservoir for computation: by perturbing the phonon-lasing attractor, the cavity performs nonlinear input-output transformations and retains short-term memory without any external feedback mechanism. Using only a single chip-integrated device with 20 virtual nodes, we reconstruct nonlinear functions, predict the evolution of chaotic time series, and perform spoken digit classification on a two-digit sub-task. The mechanical resonance frequency sets the intrinsic dynamical timescale of the reservoir and therefore its processing speed; while the present device operates near 0.4 GHz, optomechanical and nanomechanical systems can be engineered to reach multi-GHz and sub-terahertz frequencies, directly translating into a scalable path toward ultrafast integrated physical computing.

physics.optics↗

Leveraging chaotic transients in the training of artificial neural networks

Traditional algorithms to optimize artificial neural networks when confronted with a supervised learning task are usually exploitation-type relaxational dynamics such as gradient descent (GD). Here, we explore the dynamics of the neural network trajectory along training for unconventionally large learning rates. We show that for a region of values of the learning rate, the GD optimization shifts away from purely exploitation-like algorithm into a regime of exploration-exploitation balance, as the neural network is still capable of learning but the trajectory shows sensitive dependence on initial conditions --as characterized by positive network maximum Lyapunov exponent--. Interestingly, the characteristic training time required to reach an acceptable accuracy in the test set reaches a minimum precisely in such learning rate region, further suggesting that one can accelerate the training of artificial neural networks by locating at the onset of chaos. Our results --initially illustrated for the MNIST classification task-- qualitatively hold for a range of supervised learning tasks, {learning architectures (including both shallow and deep multilayer perceptrons and convolutional neural networks) and other hyperparameters (different activation functions and weight regularisation),} and showcase the emergent, constructive role of transient chaotic dynamics in the training of artificial neural networks.

cs.LG↗

Experimental memory control in continuous variable optical quantum reservoir computing

Quantum reservoir computing (QRC) offers a promising framework for online quantum-enhanced machine learning tailored to temporal tasks, yet practical implementations with native memory capabilities remain limited. Here, we demonstrate an optical QRC platform based on deterministically generated multimode squeezed states, exploiting both spectral and temporal multiplexing in a fully continuous-variable (CV) setting, and enabling controlled fading memory. Data is encoded via programmable phase shaping of the pump in an optical parametric process and retrieved through mode-selective homodyne detection. Real-time memory is achieved through feedback using electro-optic phase modulation, while long-term dependencies are achieved via spatial multiplexing. This architecture with minimal post-processing performs nonlinear temporal tasks, including parity checking and chaotic signal forecasting, with results corroborated by a high-fidelity Digital Twin. We show that leveraging the entangled multimode structure significantly enhances the expressivity and memory capacity of the quantum reservoir. This work establishes a scalable photonic platform for quantum machine learning, operating in CV encoding and supporting practical quantum-enhanced information processing.

quant-ph↗

Quantum machine learning via continuous-variable cluster states and teleportation

A new approach suitable for distributed quantum machine learning and exhibiting memory is proposed for a photonic platform. This measurement-based quantum reservoir computing takes advantage of continuous variable cluster states as the main quantum resource. Cluster states are key to several photonic quantum technologies, enabling universal quantum computing as well as quantum communication protocols. The proposed measurement-based quantum reservoir computing is based on a neural network of cluster states and local operations, where input data are encoded through measurement, thanks to quantum teleportation. In this design, measurements enable input injections, information processing and continuous monitoring for time series processing. The architecture's power and versatility are tested by performing a set of benchmark tasks showing that the protocol displays internal memory and is suitable for both static and temporal information processing without hardware modifications. This design opens the way to distributed machine learning.

quant-ph↗

Neural networks with quantum states of light

Quantum optical networks are instrumental to address fundamental questions and enable applications ranging from communication to computation and, more recently, machine learning. In particular, photonic artificial neural networks offer the opportunity to exploit the advantages of both classical and quantum optics. Photonic neuro-inspired computation and machine learning have been successfully demonstrated in classical settings, while quantum optical networks have triggered breakthrough applications such as teleportation, quantum key distribution and quantum computing. We present a perspective on the state of the art in quantum optical machine learning and the potential advantages of artificial neural networks in circuit designs and beyond, in more general analogue settings characterised by recurrent and coherent complex interactions. We consider two analogue neuro-inspired applications, namely quantum reservoir computing and quantum associative memories, and discuss the enhanced capabilities offered by quantum substrates, highlighting the specific role of light squeezing in this context.

quant-ph↗

Role of coherence in many-body Quantum Reservoir Computing

Quantum Reservoir Computing (QRC) offers potential advantages over classical reservoir computing, including inherent processing of quantum inputs and a vast Hilbert space for state exploration. Yet, the relation between the performance of reservoirs based on complex and many-body quantum systems and non-classical state features is not established. Through an extensive analysis of QRC based on a transverse-field Ising model we show how different quantum effects, such as quantum coherence and correlations, contribute to improving the performance in temporal tasks, as measured by the Information Processing Capacity. Additionally, we critically assess the impact of finite measurement resources and noise on the reservoir's dynamics in different regimes, quantifying the limited ability to exploit quantum effects for increasing damping and noise strengths. Our results reveal a monotonic relationship between reservoir performance and coherence, along with the importance of quantum effects in the ergodic regime.

quant-ph↗

Learn one size to infer all: Exploiting translational symmetries in delay-dynamical and spatio-temporal systems using scalable neural networks

We design scalable neural networks adapted to translational symmetries in dynamical systems, capable of inferring untrained high-dimensional dynamics for different system sizes. We train these networks to predict the dynamics of delay-dynamical and spatio-temporal systems for a single size. Then, we drive the networks by their own predictions. We demonstrate that by scaling the size of the trained network, we can predict the complex dynamics for larger or smaller system sizes. Thus, the network learns from a single example and, by exploiting symmetry properties, infers entire bifurcation diagrams.

cs.LG↗

Adaptive control of recurrent neural networks using conceptors

Recurrent Neural Networks excel at predicting and generating complex high-dimensional temporal patterns. Due to their inherent nonlinear dynamics and memory, they can learn unbounded temporal dependencies from data. In a Machine Learning setting, the network's parameters are adapted during a training phase to match the requirements of a given task/problem increasing its computational capabilities. After the training, the network parameters are kept fixed to exploit the learned computations. The static parameters thereby render the network unadaptive to changing conditions, such as external or internal perturbation. In this manuscript, we demonstrate how keeping parts of the network adaptive even after the training enhances its functionality and robustness. Here, we utilize the conceptor framework and conceptualize an adaptive control loop analyzing the network's behavior continuously and adjusting its time-varying internal representation to follow a desired target. We demonstrate how the added adaptivity of the network supports the computational functionality in three distinct tasks: interpolation of temporal patterns, stabilization against partial network degradation, and robustness against input distortion. Our results highlight the potential of adaptive networks in machine learning beyond training, enabling them to not only learn complex patterns but also dynamically adjust to changing environments, ultimately broadening their applicability.

cs.LG↗

Quantum fidelity kernel with a trapped-ion simulation platform

Quantum kernel methods leverage a kernel function computed by embedding input information into the Hilbert space of a quantum system. However, large Hilbert spaces can hinder generalization capability, and the scalability of quantum kernels becomes an issue. To overcome these challenges, various strategies under the concept of inductive bias have been proposed. Bandwidth optimization is a promising approach that can be implemented using quantum simulation platforms. We propose trapped-ion simulation platforms as a means to compute quantum kernels and demonstrate their effectiveness for binary classification tasks. We compare the performance of the proposed method with an optimized classical kernel and evaluate the robustness of the quantum kernel against noise. The results show that ion trap platforms are well-suited for quantum kernel computation and can achieve high accuracy with only a few qubits.

quant-ph↗

Dynamical stability and chaos in artificial neural network trajectories along training

The process of training an artificial neural network involves iteratively adapting its parameters so as to minimize the error of the network's prediction, when confronted with a learning task. This iterative change can be naturally interpreted as a trajectory in network space -- a time series of networks -- and thus the training algorithm (e.g. gradient descent optimization of a suitable loss function) can be interpreted as a dynamical system in graph space. In order to illustrate this interpretation, here we study the dynamical properties of this process by analyzing through this lens the network trajectories of a shallow neural network, and its evolution through learning a simple classification task. We systematically consider different ranges of the learning rate and explore both the dynamical and orbital stability of the resulting network trajectories, finding hints of regular and chaotic behavior depending on the learning rate regime. Our findings are put in contrast to common wisdom on convergence properties of neural networks and dynamical systems theory. This work also contributes to the cross-fertilization of ideas between dynamical systems theory, network theory and machine learning

cs.LG↗

Dissipation as a resource for Quantum Reservoir Computing

Dissipation induced by interactions with an external environment typically hinders the performance of quantum computation, but in some cases can be turned out as a useful resource. We show the potential enhancement induced by dissipation in the field of quantum reservoir computing introducing tunable local losses in spin network models. Our approach based on continuous dissipation is able not only to reproduce the dynamics of previous proposals of quantum reservoir computing, based on discontinuous erasing maps but also to enhance their performance. Control of the damping rates is shown to boost popular machine learning temporal tasks as the capability to linearly and non-linearly process the input history and to forecast chaotic series. Finally, we formally prove that, under non-restrictive conditions, our dissipative models form a universal class for reservoir computing. It means that considering our approach, it is possible to approximate any fading memory map with arbitrary precision.

quant-ph↗

Squeezing as a resource for time series processing in quantum reservoir computing

Squeezing is known to be a quantum resource in many applications in metrology, cryptography, and computing, being related to entanglement in multimode settings. In this work, we address the effects of squeezing in neuromorphic machine learning for time series processing. In particular, we consider a loop-based photonic architecture for reservoir computing and address the effect of squeezing in the reservoir, considering a Hamiltonian with both active and passive coupling terms. Interestingly, squeezing can be either detrimental or beneficial for quantum reservoir computing when moving from ideal to realistic models, accounting for experimental noise. We demonstrate that multimode squeezing enhances its accessible memory, which improves the performance in several benchmark temporal tasks. The origin of this improvement is traced back to the robustness of the reservoir to readout noise as squeezing increases.

quant-ph↗

Scalable photonic platform for real-time quantum reservoir computing

Quantum Reservoir Computing (QRC) exploits the information processing capabilities of quantum systems to solve non-trivial temporal tasks, improving over their classical counterparts. Recent progress has shown the potential of QRC exploiting the enlarged Hilbert space, but real-time processing and the achievement of a quantum advantage with efficient use of resources are prominent challenges towards viable experimental realizations. In this work, we propose a photonic platform suitable for real-time QRC based on a physical ensemble of reservoirs in the form of identical optical pulses recirculating through a closed loop. While ideal operation achieves maximum capacities, statistical noise is shown to undermine a quantum advantage. We propose a strategy to overcome this limitation and sustain the QRC performance when the size of the system is scaled up. The platform is conceived for experimental implementations to be viable with current technology.

quant-ph↗

Time Series Quantum Reservoir Computing with Weak and Projective Measurements

Quantum machine learning represents a promising avenue for data processing, also for purposes of sequential temporal data analysis, as recently proposed in quantum reservoir computing (QRC). The possibility to operate on several platforms and noise intermediate-scale quantum devices makes QRC a timely topic. A challenge that has not been addressed yet, however, is how to efficiently include quantum measurement in realistic protocols, while retaining the reservoir memory needed for sequential time series processing and preserving the quantum advantage offered by large Hilbert spaces. In this work, we propose different measurement protocols and assess their efficiency in terms of resources, through theoretical predictions and numerical analysis. We show that it is possible to exploit the quantumness of the reservoir and to obtain ideal performance both for memory and forecasting tasks with two successful measurement protocols. One consists in rewinding part of the dynamics determined by the fading memory of the reservoir and storing the corresponding data of the input sequence, while the other employs weak measurements operating online at the trade-off where information can be extracted accurately and without hindering the needed memory. Our work establishes the conditions for efficient protocols, being the fading memory time a key factor, and demonstrates the possibility of performing genuine online time-series processing with quantum systems.

quant-ph↗

Dynamical phase transitions in quantum reservoir computing

Closed quantum systems exhibit different dynamical regimes, like Many-Body Localization or thermalization, which determine the mechanisms of spread and processing of information. Here we address the impact of these dynamical phases in quantum reservoir computing, an unconventional computing paradigm recently extended into the quantum regime that exploits dynamical systems to solve nonlinear and temporal tasks. We establish that the thermal phase is naturally adapted to the requirements of quantum reservoir computing and report an increased performance at the thermalization transition for the studied tasks. Uncovering the underlying physical mechanisms behind optimal information processing capabilities of spin networks is essential for future experimental implementations and provides a new perspective on dynamical phases.

quant-ph↗