arXiv subjects

Kohei Nakajima

Publications and source records attributed to Kohei Nakajima.

At least 55 records · Page 3Linked to original sources

arXiv2020

Step-like dependence of memory function on pulse width in spintronics reservoir computing

Physical reservoir computing is a type of recurrent neural network that applies the dynamical response from physical systems to information processing. However, the relation between computation performance and physical parameters/phenomena still remains unclear. This study reports our progress regarding the role of current-dependent magnetic damping in the computational performance of reservoir computing. The current-dependent relaxation dynamics of a magnetic vortex core results in an asymmetric memory function with respect to binary inputs. A fast relaxation caused by a large input leads to a fast fading of the input memory, whereas a slow relaxation by a small input enables the reservoir to keep the input memory for a relatively long time. As a result, a step-like dependence is found for the short-term memory and parity-check capacities on the pulse width of input data, where the capacities remain at 1.5 for a certain range of the pulse width, and drop to 1.0 for a long pulse-width limit. Both analytical and numerical analyses clarify that the step-like behavior can be attributed to the current-dependent relaxation time of the vortex core to a limit-cycle state. }

cond-mat.mes-hall↗

arXiv2020

Quantum reservoir computing: a reservoir approach toward quantum machine learning on near-term quantum devices

Quantum systems have an exponentially large degree of freedom in the number of particles and hence provide a rich dynamics that could not be simulated on conventional computers. Quantum reservoir computing is an approach to use such a complex and rich dynamics on the quantum systems as it is for temporal machine learning. In this chapter, we explain quantum reservoir computing and related approaches, quantum extreme learning machine and quantum circuit learning, starting from a pedagogical introduction to quantum mechanics and machine learning. All these quantum machine learning approaches are experimentally feasible and effective on the state-of-the-art quantum devices.

quant-ph↗

arXiv2020

Higher-Order Quantum Reservoir Computing

Quantum reservoir computing (QRC) is an emerging paradigm for harnessing the natural dynamics of quantum systems as computational resources that can be used for temporal machine learning tasks. In the current setup, QRC is difficult to deal with high-dimensional data and has a major drawback of scalability in physical implementations. We propose higher-order QRC, a hybrid quantum-classical framework consisting of multiple but small quantum systems that are mutually communicated via classical connections like linear feedback. By utilizing the advantages of both classical and quantum techniques, our framework enables an efficient implementation to boost the scalability and performance of QRC. Furthermore, higher-order settings allow us to implement a FORCE learning or an innate training scheme, which provides flexibility and high operability to harness high-dimensional quantum dynamics and significantly extends the application domain of QRC. We demonstrate the effectiveness of our framework in emulating large-scale nonlinear dynamical systems, including complex spatiotemporal chaos, which outperforms many of the existing machine learning techniques in certain situations.

quant-ph↗

arXiv2020

Periodic structure of memory function in spintronics reservoir with feedback current

The role of the feedback effect on physical reservoir computing is studied theoretically by solving the vortex-core dynamics in a nanostructured ferromagnet. Although the spin-transfer torque due to the feedback current makes the vortex dynamics complex, it is clarified that the feedback effect does not always contribute to the enhancement of the memory function in a physical reservoir. The memory function, characterized by the correlation coefficient between the input data and the dynamical response of the vortex core, becomes large when the delay time of the feedback current is not an integral multiple of the pulse width. On the other hand, the memory function remains small when the delay time is an integral multiple of the pulse width. As a result, a periodic behavior for the short-term memory capacity is observed with respect to the delay time, the phenomenon of which can be attributed to correlations between the virtual neurons via the feedback current.

cond-mat.mes-hall↗

arXiv2020

Physical reservoir computing -- An introductory perspective

Understanding the fundamental relationships between physics and its information-processing capability has been an active research topic for many years. Physical reservoir computing is a recently introduced framework that allows one to exploit the complex dynamics of physical systems as information-processing devices. This framework is particularly suited for edge computing devices, in which information processing is incorporated at the edge (e.g., into sensors) in a decentralized manner to reduce the adaptation delay caused by data transmission overhead. This paper aims to illustrate the potentials of the framework using examples from soft robotics and to provide a concise overview focusing on the basic motivations for introducing it, which stem from a number of fields, including machine learning, nonlinear dynamical systems, biological science, materials science, and physics.

nlin.AO↗

arXiv2020

Designing spontaneous behavioral switching via chaotic itinerancy

Chaotic itinerancy is a frequently observed phenomenon in high-dimensional and nonlinear dynamical systems, and it is characterized by the random transitions among multiple quasi-attractors. Several studies have revealed that chaotic itinerancy has been observed in brain activity, and it is considered to play a critical role in the spontaneous, stable behavior generation of animals. Thus, chaotic itinerancy is a topic of great interest, particularly for neurorobotics researchers who wish to understand and implement autonomous behavioral controls for agents. However, it is generally difficult to gain control over high-dimensional nonlinear dynamical systems. Hence, the implementation of chaotic itinerancy has mainly been accomplished heuristically. In this study, we propose a novel way of implementing chaotic itinerancy reproducibly and at will in a generic high-dimensional chaotic system. In particular, we demonstrate that our method enables us to easily design both the trajectories of quasi-attractors and the transition rules among them simply by adjusting the limited number of system parameters and by utilizing the intrinsic high-dimensional chaos. Finally, we quantitatively discuss the validity and scope of application through the results of several numerical experiments.

cs.RO↗

arXiv2020

Computing with vortices: Bridging fluid dynamics and its information-processing capability

Herein, the Karman vortex system is considered to be a large recurrent neural network, and the computational capability is numerically evaluated by emulating nonlinear dynamical systems and the memory capacity. Therefore, the Reynolds number dependence of the Karman vortex system computational performance is revealed and the optimal computational performance is achieved near the critical Reynolds number at the onset of Karman vortex shedding, which is associated with a Hopf bifurcation. Our finding advances the understanding of the relationship between the physical properties of fluid dynamics and its computational capability as well as provides an alternative to the widely believed viewpoint that the information processing capability becomes optimal at the edge of chaos.

physics.flu-dyn↗

arXiv2019

Optimal short-term memory before the edge of chaos in driven random recurrent networks

The ability of discrete-time nonlinear recurrent neural networks to store time-varying small input signals is investigated by mean-field theory. The combination of a small input strength and mean-field assumptions makes it possible to derive an approximate expression for the conditional probability density of the state of a neuron given a past input signal. From this conditional probability density, we can analytically calculate short-term memory measures, such as memory capacity, mutual information, and Fisher information, and determine the relationships among these measures, which have not been clarified to date to the best of our knowledge. We show that the network contribution of these short-term memory measures peaks before the edge of chaos, where the dynamics of input-driven networks is stable but corresponding systems without input signals are unstable.

nlin.AO↗

arXiv2019

Chaos in nanomagnet via feedback current

Nonlinear magnetization dynamics excited by spin-transfer effect with feedback current is studied both numerically and analytically. The numerical simulation of the Landau-Lifshitz-Gilbert equation indicates the positive Lyapunov exponent for a certain range of the feedback rate, which identifies the existence of chaos in a nanostructured ferromagnet. Transient behavior from chaotic to steady oscillation is also observed in another range of the feedback parameter. An analytical theory is also developed, which indicates the appearance of multiple attractors in a phase space due to the feedback current. An instantaneous imbalance between the spin-transfer torque and damping torque causes a transition between the attractors, and results in the complex dynamics.

cond-mat.mes-hall↗

arXiv2018

Information Processing Capability of Soft Continuum Arms

Soft Continuum arms, such as trunk and tentacle robots, can be considered as the "dual" of traditional rigid-bodied robots in terms of manipulability, degrees of freedom, and compliance. Introduced two decades ago, continuum arms have not yet realized their full potential, and largely remain as laboratory curiosities. The reasons for this lag rest upon their inherent physical features such as high compliance which contribute to their complex control problems that no research has yet managed to surmount. Recently, reservoir computing has been suggested as a way to employ the body dynamics as a computational resource toward implementing compliant body control. In this paper, as a first step, we investigate the information processing capability of soft continuum arms. We apply input signals of varying amplitude and bandwidth to a soft continuum arm and generate the dynamic response for a large number of trials. These data is aggregated and used to train the readout weights to implement a reservoir computing scheme. Results demonstrate that the information processing capability varies across input signal bandwidth and amplitude. These preliminary results demonstrate that soft continuum arms have optimal bandwidth and amplitude where one can implement reservoir computing.

cs.RO↗

arXiv2018

Macromagnetic simulation for reservoir computing utilizing spin dynamics in magnetic tunnel junctions

The figures-of-merit for reservoir computing (RC), using spintronics devices called magnetic tunnel junctions (MTJs), are evaluated. RC is a type of recurrent neural network. The input information is stored in certain parts of the reservoir, and computation can be performed by optimizing a linear transform matrix for the output. While all the network characteristics should be controlled in a general recurrent neural network, such optimization is not necessary for RC. The reservoir only has to possess a non-linear response with memory effect. In this paper, macromagnetic simulation is conducted for the spin-dynamics in MTJs, for reservoir computing. It is determined that the MTJ-system possesses the memory effect and non-linearity required for RC. With RC using 5-7 MTJs, high performance can be obtained, similar to an echo-state network with 20-30 nodes, even if there are no magnetic and/or electrical interactions between the magnetizations.

cond-mat.mtrl-sci↗

arXiv2018

Machine learning with controllable quantum dynamics of a nuclear spin ensemble in a solid

We experimentally demonstrate quantum machine learning using NMR based on a framework of quantum reservoir computing. Reservoir computing is for exploiting natural nonlinear dynamics with large degrees of freedom, which is called a reservoir, for a machine learning purpose. Here we propose a concrete physical implementation of a quantum reservoir using controllable dynamics of a nuclear spin ensemble in a molecular solid. In this implementation, we demonstrate learning of nonlinear functions with binary or continuous variable inputs with low mean squared errors. Our implementation and demonstration paves a road toward exploiting quantum computational supremacy in NMR ensemble systems for information processing with reachable technologies.

quant-ph↗

arXiv2018

Boosting computational power through spatial multiplexing in quantum reservoir computing

Quantum reservoir computing provides a framework for exploiting the natural dynamics of quantum systems as a computational resource. It can implement real-time signal processing and solve temporal machine learning problems in general, which requires memory and nonlinear mapping of the recent input stream using the quantum dynamics in computational supremacy region, where the classical simulation of the system is intractable. A nuclear magnetic resonance spin-ensemble system is one of the realistic candidates for such physical implementations, which is currently available in laboratories. In this paper, considering these realistic experimental constraints for implementing the framework, we introduce a scheme, which we call a spatial multiplexing technique, to effectively boost the computational power of the platform. This technique exploits disjoint dynamics, which originate from multiple different quantum systems driven by common input streams in parallel. Accordingly, unlike designing a single large quantum system to increase the number of qubits for computational nodes, it is possible to prepare a huge number of qubits from multiple but small quantum systems, which are operationally easy to handle in laboratory experiments. We numerically demonstrate the effectiveness of the technique using several benchmark tasks and quantitatively investigate its specifications, range of validity, and limitations in detail.

quant-ph↗

arXiv2018

Use of recurrent infomax to improve the memory capability of input-driven recurrent neural networks

The inherent transient dynamics of recurrent neural networks (RNNs) have been exploited as a computational resource in input-driven RNNs. However, the information processing capability varies from RNN to RNN, depending on their properties. Many authors have investigated the dynamics of RNNs and their relevance to the information processing capability. In this study, we present a detailed analysis of the information processing capability of an RNN optimized by recurrent infomax (RI), which is an unsupervised learning scheme that maximizes the mutual information of RNNs by adjusting the connection strengths of the network. Thus, we observe that a delay-line structure emerges from the RI and the network optimized by the RI possesses superior short-term memory, which is the ability to store the temporal information of the input stream in its transient dynamics.

cs.NE↗

arXiv2016

Harnessing disordered quantum dynamics for machine learning

Quantum computer has an amazing potential of fast information processing. However, realisation of a digital quantum computer is still a challenging problem requiring highly accurate controls and key application strategies. Here we propose a novel platform, quantum reservoir computing, to solve these issues successfully by exploiting natural quantum dynamics, which is ubiquitous in laboratories nowadays, for machine learning. In this framework, nonlinear dynamics including classical chaos can be universally emulated in quantum systems. A number of numerical experiments show that quantum systems consisting of at most seven qubits possess computational capabilities comparable to conventional recurrent neural networks of 500 nodes. This discovery opens up a new paradigm for information processing with artificial intelligence powered by quantum physics.

quant-ph↗

arXiv2014

Measuring information transfer in a soft robotic arm

Soft robots can exhibit diverse behaviors with simple types of actuation by partially outsourcing control to the morphological and material properties of their soft bodies, which is made possible by the tight coupling between control, body, and environment. In this paper, we present a method that will quantitatively characterize these diverse spatiotemporal dynamics of a soft body based on the information-theoretic approach. In particular, soft bodies have the ability to propagate the effect of actuation through the entire body, with a certain time delay, due to their elasticity. Our goal is to capture this delayed interaction in a quantitative manner based on a measure called momentary information transfer. We extend this measure to soft robotic applications and demonstrate its power using a physical soft robotic platform inspired by the octopus. Our approach is illustrated in two ways. First, we statistically characterize the delayed actuation propagation through the body as a strength of information transfer. Second, we capture this information propagation directly as local information dynamics. As a result, we show that our approach can successfully characterize the spatiotemporal dynamics of the soft robotic platform, explicitly visualizing how information transfers through the entire body with delays. Further extension scenarios of our approach are discussed for soft robotic applications in general.

cs.IT↗

arXiv2014

Dynamics Underneath Symbols: A Case Study in Autonomous Agents

Our cognition is structuring the informational layer, consisting of perception, anticipation, and action, and it should also be sustained on a physical basis. In this paper, we aim to explore the relationship between the informational layer and the physical layer from a dynamical systems point of view. As an example, the fluctuation of choice is investigated by using a simulated agent. By setting a T-maze, the agent should choose one arm of the maze if a corresponding token is presented. We prepared two types of tokens, corresponding to the left and right arm of the maze. After training the network of the agent to successfully choose the corresponding arm, we presented two tokens simultaneously to the agent and observed its behavior. As a result, we found several behaviors, which are difficult to speculate on from a case in which only a single token is presented to the agent. Detailed analyses and the implications of the model are discussed.

nlin.AO↗

arXiv2014

Exploiting short-term memory in soft body dynamics as a computational resource

Soft materials are not only highly deformable but they also possess rich and diverse body dynamics. Soft body dynamics exhibit a variety of properties, including nonlinearity, elasticity, and potentially infinitely many degrees of freedom. Here we demonstrate that such soft body dynamics can be employed to conduct certain types of computation. Using body dynamics generated from a soft silicone arm, we show that they can be exploited to emulate functions that require memory and to embed robust closed-loop control into the arm. Our results suggest that soft body dynamics have a short-term memory and can serve as a computational resource. This finding paves the way toward exploiting passive body dynamics for control of a large class of underactuated systems.

physics.comp-ph↗