An event-based architecture for solving constraint satisfaction problems

Constraint satisfaction problems (CSPs) are typically solved using conventional von Neumann computing architectures. However, these architectures do not reflect the distributed nature of many of these problems and are thus ill-suited to solving them. In this paper we present a hybrid analog/digital hardware architecture specifically designed to solve such problems. We cast CSPs as networks of stereotyped multi-stable oscillatory elements that communicate using digital pulses, or events. The oscillatory elements are implemented using analog non-stochastic circuits. The non-repeating phase relations among the oscillatory elements drive the exploration of the solution space. We show that this hardware architecture can yield state-of-the-art performance on a number of CSPs under reasonable assumptions on the implementation. We present measurements from a prototype electronic chip to demonstrate that a physical implementation of the proposed architecture is robust to practical non-idealities and to validate the theory proposed.Comment: First two authors contributed equally to this wor

Rhythmic inhibition allows neural networks to search for maximally consistent states

Gamma-band rhythmic inhibition is a ubiquitous phenomenon in neural circuits yet its computational role still remains elusive. We show that a model of Gamma-band rhythmic inhibition allows networks of coupled cortical circuit motifs to search for network configurations that best reconcile external inputs with an internal consistency model encoded in the network connectivity. We show that Hebbian plasticity allows the networks to learn the consistency model by example. The search dynamics driven by rhythmic inhibition enable the described networks to solve difficult constraint satisfaction problems without making assumptions about the form of stochastic fluctuations in the network. We show that the search dynamics are well approximated by a stochastic sampling process. We use the described networks to reproduce perceptual multi-stability phenomena with switching times that are a good match to experimental data and show that they provide a general neural framework which can be used to model other 'perceptual inference' phenomena

Solving constraint-satisfaction problems with distributed neocortical-like neuronal networks

Finding actions that satisfy the constraints imposed by both external inputs and internal representations is central to decision making. We demonstrate that some important classes of constraint satisfaction problems (CSPs) can be solved by networks composed of homogeneous cooperative-competitive modules that have connectivity similar to motifs observed in the superficial layers of neocortex. The winner-take-all modules are sparsely coupled by programming neurons that embed the constraints onto the otherwise homogeneous modular computational substrate. We show rules that embed any instance of the CSPs planar four-color graph coloring, maximum independent set, and Sudoku on this substrate, and provide mathematical proofs that guarantee these graph coloring problems will convergence to a solution. The network is composed of non-saturating linear threshold neurons. Their lack of right saturation allows the overall network to explore the problem space driven through the unstable dynamics generated by recurrent excitation. The direction of exploration is steered by the constraint neurons. While many problems can be solved using only linear inhibitory constraints, network performance on hard problems benefits significantly when these negative constraints are implemented by non-linear multiplicative inhibition. Overall, our results demonstrate the importance of instability rather than stability in network computation, and also offer insight into the computational role of dual inhibitory mechanisms in neural circuits.Comment: Accepted manuscript, in press, Neural Computation (2018

Winner-take-all in a phase oscillator system with adaptation.

We consider a system of generalized phase oscillators with a central element and radial connections. In contrast to conventional phase oscillators of the Kuramoto type, the dynamic variables in our system include not only the phase of each oscillator but also the natural frequency of the central oscillator, and the connection strengths from the peripheral oscillators to the central oscillator. With appropriate parameter values the system demonstrates winner-take-all behavior in terms of the competition between peripheral oscillators for the synchronization with the central oscillator. Conditions for the winner-take-all regime are derived for stationary and non-stationary types of system dynamics. Bifurcation analysis of the transition from stationary to non-stationary winner-take-all dynamics is presented. A new bifurcation type called a Saddle Node on Invariant Torus (SNIT) bifurcation was observed and is described in detail. Computer simulations of the system allow an optimal choice of parameters for winner-take-all implementation

Synchronization Analysis of Winner-Take-All Neuronal Networks

With the physical limitations of current CMOS technology, it becomes necessary to design and develop new methods to perform simple and complex computations. Nature is efficient, so many in the scientific community attempt to mimic it when optimizing or creating new systems and devices. The human brain is looked to as an efficient computing device, inspiring strong interest in developing powerful computer systems that resemble its architecture and behavior such as neural networks. There is much research focusing on both circuit designs that behave like neurons and arrangement of these electromechanical neurons to compute complex operations. It has been shown previously that the synchronization characteristics of neural oscillators can be used not only for primitive computation functions such as convolution but for complex non-Boolean computations. With strong interest in the research community to develop biologically representative neural networks, this dissertation analyzes and simulates biologically plausible networks, the four-dimensional Hodgkin-Huxley and the simpler two-dimensional Fitzhugh-Nagumo neural models, fashioned in winner-take-all neuronal networks. The synchronization behavior of these neurons coupled together is studied in detail. Different neural network topologies are considered including lateral inhibition and inhibition via a global interneuron. Then, this dissertation analyzes the winner-take-all behaviors, in terms of both firing rates and phases, of neuronal networks with different topologies. A technique based on phase response curve is suggested for the analysis of synchronization phase characteristics of winner-take-all networks. Simulations are performed to validate the analytical results. This study promotes the understanding of winner-take-all operations in biological neuronal networks and provides a fundamental basis for applications of winner-take-all networks in modern computing systems