SearcharxivSearch

arXiv subjects

Susan Stepney

Publications and source records attributed to Susan Stepney.

At least 19 recordsLinked to original sources

Low-power analogue neural networks with trainable nonlinear connections for continuous control

Physical neural networks promise low-power machine learning by computing directly with analogue device physics, but most architectures force nonlinear device responses to act as scalar weights. Inspired by Kolmogorov-Arnold networks, we place trainable nonlinear functions on the connections, making each physical connection a learnable computational element. Realising these functions as analogue band-pass filters on field-programmable analogue arrays, we find that the benefit is task-dependent and follows from the smoothness of the physical basis: the networks represent smooth, continuously valued targets, including robotic kinematics, continuous control, and photovoltaic maximum-power-point tracking, with far fewer nodes and connections than multilayer perceptrons, but offer no parameter-efficiency advantage on classification-like decision boundaries. Trained networks transfer to hardware across approximately 35,000 connections with quantified fidelity, and a dedicated CMOS implementation is projected to operate at approximately 30 microwatts. A memristive realisation reproduces the same behaviour in simulation, indicating that the advantage comes from placing trainable nonlinearity on connections, rather than from a particular device.

cs.LG

Benchmarking the ORCA PT-2 Boson Sampler using Minimum Dominating Set Problems

We use boson sampling as part of a gradient-free variational algorithm (the Binary Bosonic Solver) to solve a minimum dominating set problem and compare these results to a number of exact and heuristic classical algorithms. The boson sampling has been performed on the physical PT-2 time-bin interferometer from ORCA Computing. The PT-2 device has been tested here using both a single- and double-loop configuration and the results are compared based on the best found solution and the overall run time. With the parameters used in this experiment, the boson sampler is outperformed by the classical methods, but we hypothesise that this is due to insufficient samples and iterations. We classically simulate boson sampling in a single-loop configuration to break down the runtime for individual algorithmic components, allowing for estimates of when boson sampling may outperform classical methods. This study recommends a watching brief on boson sampling as the complexity of the interferometer is improved and the loss in the hardware is reduced allowing for better performance from the associated algorithms.

quant-ph

When does a control system compute? Digital, mechanical and open-loop systems

Control systems are ubiquitous in modern technology, comprising an engineered plant to be kept within specific, often fine-tuned, limits, and a separate controller that ensures this is the case. While modern controllers often employ digital computers, other examples are purely mechanical, or even biological. It is an open question whether computation is happening within all controllers by virtue of them being part of a control system. Abstraction/ Representation theory (ART) has been developed to tackle just this question of whether a physical system is computing. Here, we demonstrate how to use ART to model control systems, and analyse them for computational properties. We determine that the plant of a control system is (a proxy for) the representational entity necessary in ART for the existence of any computation: the plant is the user of the controller. We consider specific systems: a digital thermostat, an electro-mechanical thermostat, the purely mechanical centrifugal governor, and an open-loop human-controlled heating system. We show that all these systems, and control systems in general, are performing some degree of computation. As an initial use of these results, we apply them to computationalism within cognitive theory: we show the governor is computing, so it cannot play its role of counter-example in the question of whether the brain is too.

cs.ET

Novel models of computation from novel physical substrates: a bosonic example

Unconventional physical computing is producing many novel and exotic devices that can potentially be used in a computational mode. Currently, these tend to be used to implement traditional models of computation, such as boolean logic circuits, or neuromorphic approaches. This runs the risk of failing to exploit the devices to their full potential. Here we describe a methodology for deriving a model of computation and domain specific language more closely matched to a given physical device's capabilities, and illustrate it with a case study of bosonic computing as implemented by a physical multi-component interferometer.

cs.ET

Open Questions about Time and Self-reference in Living Systems

Living systems exhibit a range of fundamental characteristics: they are active, self-referential, self-modifying systems. This paper explores how these characteristics create challenges for conventional scientific approaches and why they require new theoretical and formal frameworks. We introduce a distinction between 'natural time', the continuing present of physical processes, and 'representational time', with its framework of past, present and future that emerges with life itself. Representational time enables memory, learning and prediction, functions of living systems essential for their survival. Through examples from evolution, embryogenesis and metamorphosis we show how living systems navigate the apparent contradictions arising from self-reference as natural time unwinds self-referential loops into developmental spirals. Conventional mathematical and computational formalisms struggle to model self-referential and self-modifying systems without running into paradox. We identify promising new directions for modelling self-referential systems, including domain theory, co-algebra, genetic programming, and self-modifying algorithms. There are broad implications for biology, cognitive science and social sciences, because self-reference and self-modification are not problems to be avoided but core features of living systems that must be modelled to understand life's open-ended creativity.

cs.ET

Benchmarking ORCA PT-1 Boson Sampler in Simulation

Boson Sampling, a non-universal computing paradigm, has resulted in impressive claims of quantum supremacy. ORCA Computing have developed a time-bin interferometer (TBI) that claims to use the principles of boson sampling to solve a number of computational problems including optimisation and generative adversarial networks. We solve a dominating set problem with a surveillance use case on the ORCA TBI simulator to benchmark the use of these devices against classical algorithms. Simulation has been used to consider the optimal performance of the computing paradigm without having to factor in noise, errors and scaling limitations. We show that the ORCA TBI is capable of solving moderately sized (n<250) dominating set problems with comparable success to linear programming and greedy methods. Wall clock timing shows that the simulator has worse scaling than the classical methods, but this is unlikely to carry over to the physical device where the outputs are measured rather than calculated.

quant-ph

RingSim- An Agent-based Approach for Modelling Mesoscopic Magnetic Nanowire Networks

We describe 'RingSim', a phenomenological agent-based model that allows numerical simulation of magnetic nanowire networks with areas of hundreds of micrometers squared for durations of hundreds of seconds; a practical impossibility for general-purpose micromagnetic simulation tools. In RingSim, domain walls (DWs) are instanced as mobile agents which respond to external magnetic fields, and their stochastic interactions with pinning sites and other DWs are described via simple phenomenological rules. We first present a detailed description of the model and its algorithmic implementation for simulating the behaviours of arrays of interconnected ring-shaped nanowires, which have previously been proposed as hardware platforms for unconventional computing applications. The model is then validated against a series of experimental measurements of an array's static and dynamic responses to rotating magnetic fields. The robust agreement between the modelled and experimental data demonstrates that agent-based modelling is a powerful tool for exploring mesoscale magnetic devices, enabling time scales and device sizes that are inaccessible to more conventional magnetic simulation techniques.

cond-mat.mes-hall

An analysis of the relative effects of connectivity and coupling interactions on spin networks emulating the D-Wave 2000Q quantum annealer

From available data, we show strong positive spatial correlations in the qubits of a D-Wave 2000Q quantum annealing chip that are connected to qubits outside their own unit cell. Then, by simulating the dynamics of three different spin networks and two different initial conditions, we then show that correlation between nodes is affected by a number of factors. The different connectivity of qubits within the network means that information transfer is not straightforward even when all the qubit-qubit couplings have equal weighting. Connected nodes behave even more dissimilarly when the couplings' strength is scaled according to the physical length of the connections (here to simulate dipole-dipole interactions). This highlights the importance of understanding the architectural features and potentially unprogrammed interactions/connections that can divert the performance of a quantum system away from the idealised model of identical qubits and couplings across the chip.

quant-ph

A methodology for comparing and benchmarking quantum devices

Quantum Computing (QC) is undergoing a high rate of development, investment and research devoted to its improvement.However, there is little consensus in the industry and wider literature as to what improvement might consist of beyond ambiguous statements of "more qubits" and "fewer errors". Before one can decide how to improve something, it is first necessary to define the criteria for success: what are the metrics or statistics that are relevant to the problem? The lack of clarity surrounding this question has led to a rapidly developing capability with little consistency or standards present across the board. This paper lays out a framework by which any user, developer or researcher can define, articulate and justify the success criteria and associated benchmarks that have been used to solve their problem or make their claim.

quant-ph

Reservoir Computing Benchmarks: a tutorial review and critique

Reservoir Computing is an Unconventional Computation model to perform computation on various different substrates, such as recurrent neural networks or physical materials. The method takes a 'black-box' approach, training only the outputs of the system it is built on. As such, evaluating the computational capacity of these systems can be challenging. We review and critique the evaluation methods used in the field of reservoir computing. We introduce a categorisation of benchmark tasks. We review multiple examples of benchmarks from the literature as applied to reservoir computing, and note their strengths and shortcomings. We suggest ways in which benchmarks and their uses may be improved to the benefit of the reservoir computing community.

cs.ET

Unsupervised self-organising map of prostate cell Raman spectra shows disease-state subclustering

Prostate cancer is a disease which poses an interesting clinical question: should it be treated? A small subset of prostate cancers are aggressive and require removal and treatment to prevent metastatic spread. However, conventional diagnostics remain challenged to risk-stratify such patients, hence, new methods of approach to biomolecularly subclassify the disease are needed. Here we use an unsupervised, self-organising map approach to analyse live-cell Raman spectroscopy data obtained from prostate cell-lines; our aim is to test the feasibility of this method to differentiate, at the single-cell-level, cancer from normal using high-dimensional datasets with minimal preprocessing. The results demonstrate not only successful separation of normal prostate and cancer cells, but also a new subclustering of the prostate cancer cell-line into two groups. Initial analysis of the spectra from each of the cancer subclusters demonstrates a differential expression of lipids, which, against the normal control, may be linked to disease-related changes in cellular signalling.

q-bio.QM

Noise-Aware Training of Neuromorphic Dynamic Device Networks

Physical computing has the potential to enable widespread embodied intelligence by leveraging the intrinsic dynamics of complex systems for efficient sensing, processing, and interaction. While individual devices provide basic data processing capabilities, networks of interconnected devices can perform more complex and varied tasks. However, designing networks to perform dynamic tasks is challenging without physical models and accurate quantification of device noise. We propose a novel, noise-aware methodology for training device networks using Neural Stochastic Differential Equations (Neural-SDEs) as differentiable digital twins, accurately capturing the dynamics and associated stochasticity of devices with intrinsic memory. Our approach employs backpropagation through time and cascade learning, allowing networks to effectively exploit the temporal properties of physical devices. We validate our method on diverse networks of spintronic devices across temporal classification and regression benchmarks. By decoupling the training of individual device models from network training, our method reduces the required training data and provides a robust framework for programming dynamical devices without relying on analytical descriptions of their dynamics.

cs.LG

Spatial correlations in the qubit properties of D-Wave 2000Q measured and simulated qubit networks

We show strong positive spatial correlations in the qubits of a D-Wave 2000Q quantum annealing chip that are connected to qubits outside their own unit cell. By simulating the dynamics of spin networks, we then show that correlation between nodes is affected by a number of factors. The different connectivity of qubits within the network means that information transfer is not straightforward even when all the qubit-qubit couplings have equal weighting. The similarity between connected nodes is further changed when the couplings' strength is scaled according to the physical length of the connections (here to simulate dipole-dipole interactions). This highlights the importance of understanding the architectural features and potentially unprogrammed interactions/connections that can divert the performance of a quantum system away from the idealised model of identical qubits and couplings across the chip.

quant-ph

A perspective on physical reservoir computing with nanomagnetic devices

Neural networks have revolutionized the area of artificial intelligence and introduced transformative applications to almost every scientific field and industry. However, this success comes at a great price; the energy requirements for training advanced models are unsustainable. One promising way to address this pressing issue is by developing low-energy neuromorphic hardware that directly supports the algorithm's requirements. The intrinsic non-volatility, non-linearity, and memory of spintronic devices make them appealing candidates for neuromorphic devices. Here we focus on the reservoir computing paradigm, a recurrent network with a simple training algorithm suitable for computation with spintronic devices since they can provide the properties of non-linearity and memory. We review technologies and methods for developing neuromorphic spintronic devices and conclude with critical open issues to address before such devices become widely used.

cs.ET

Quantifying the Computational Capability of a Nanomagnetic Reservoir Computing Platform with Emergent Magnetization Dynamics

Devices based on arrays of interconnected magnetic nano-rings with emergent magnetization dynamics have recently been proposed for use in reservoir computing applications, but for them to be computationally useful it must be possible to optimise their dynamical responses. Here, we use a phenomenological model to demonstrate that such reservoirs can be optimised for classification tasks by tuning hyperparameters that control the scaling and input rate of data into the system using rotating magnetic fields. We use task-independent metrics to assess the rings' computational capabilities at each set of these hyperparameters and show how these metrics correlate directly to performance in spoken and written digit recognition tasks. We then show that these metrics, and performance in tasks, can be further improved by expanding the reservoir's output to include multiple, concurrent measures of the ring arrays magnetic states.

cond-mat.mes-hall

Reservoir Computing with Magnetic Thin Films

Advances in artificial intelligence are driven by technologies inspired by the brain, but these technologies are orders of magnitude less powerful and energy efficient than biological systems. Inspired by the nonlinear dynamics of neural networks, new unconventional computing hardware has emerged with the potential to exploit natural phenomena and gain efficiency, in a similar manner to biological systems. Physical reservoir computing demonstrates this with a variety of unconventional systems, from optical-based to memristive systems. Reservoir computers provide a nonlinear projection of the task input into a high-dimensional feature space by exploiting the system's internal dynamics. A trained readout layer then combines features to perform tasks, such as pattern recognition and time-series analysis. Despite progress, achieving state-of-the-art performance without external signal processing to the reservoir remains challenging. Here we perform an initial exploration of three magnetic materials in thin-film geometries via microscale simulation. Our results reveal that basic spin properties of magnetic films generate the required nonlinear dynamics and memory to solve machine learning tasks (although there would be practical challenges in exploiting these particular materials in physical implementations). The method of exploration can be applied to other materials, so this work opens up the possibility of testing different materials, from relatively simple (alloys) to significantly complex (antiferromagnetic reservoirs).

cs.ET

MetaChem: An Algebraic Framework for Artificial Chemistries

We introduce MetaChem, a language for representing and implementing Artificial Chemistries. We motivate the need for modularisation and standardisation in representation of artificial chemistries. We describe a mathematical formalism for Static Graph MetaChem, a static graph based system. MetaChem supports different levels of description, and has a formal description; we illustrate these using StringCatChem, a toy artificial chemistry. We describe two existing Artificial Chemistries -- Jordan Algebra AChem and Swarm Chemistries -- in MetaChem, and demonstrate how they can be combined in several different configurations by using a MetaChem environmental link. MetaChem provides a route to standardisation, reuse, and composition of Artificial Chemistries and their tools.

cs.ET

Visualising high-dimensional state spaces with "Tuple Plots"

Complex systems are described with high-dimensional data that is hard to visualise. Inselberg's parallel coordinates are one representation technique for visualising high-dimensional data. Here we generalise Inselberg's approach, and use it for visualising trajectories through high dimensional state spaces. We introduce two geometric projections of parallel coordinate representations -- 'plan tuple plots' and 'side tuple plots' -- and demonstrate a link between state space and ordinary space representations. We provide examples from many domains to illustrate use of the approach, including Cellular Automata, Random Boolean Networks, coupled logistic maps, reservoir computing, search algorithms, Turing Machines, and flocking.

physics.data-an