More Like this

1. Resonator Networks, 1: An Efficient Solution for Factoring High-Dimensional, Distributed Representations of Data Structures

   https://doi.org/https://doi.org/10.1162/neco_a_01331  

   Frady, E. Paxon; Kent, Spencer J.; Olshausen, Bruno A.; Sommer, Friedrich (December 2020, Neural computation)

   null (Ed.)

   The ability to encode and manipulate data structures with distributed neural representations could qualitatively enhance the capabilities of traditional neural networks by supporting rule-based symbolic reasoning, a central property of cognition. Here we show how this may be accomplished within the framework of Vector Symbolic Architectures (VSAs) (Plate, 1991; Gayler, 1998; Kanerva, 1996), whereby data structures are encoded by combining high-dimensional vectors with operations that together form an algebra on the space of distributed representations. In particular, we propose an efficient solution to a hard combinatorial search problem that arises when decoding elements of a VSA data structure: the factorization of products of multiple codevectors. Our proposed algorithm, called a resonator network, is a new type of recurrent neural network that interleaves VSA multiplication operations and pattern completion. We show in two examples—parsing of a tree-like data structure and parsing of a visual scene—how the factorization problem arises and how the resonator network can solve it. More broadly, resonator networks open the possibility of applying VSAs to myriad artificial intelligence problems in real-world domains. The companion article in this issue (Kent, Frady, Sommer, & Olshausen, 2020) presents a rigorous analysis and evaluation of the performance of resonator networks, showing it outperforms alternative approaches. 

   more » « less
2. Neuromorphic visual scene understanding with resonator networks

   https://doi.org/10.1038/s42256-024-00848-0  

   Renner, Alpha; Supic, Lazar; Danielescu, Andreea; Indiveri, Giacomo; Olshausen, Bruno A; Sandamirskaya, Yulia; Sommer, Friedrich T; Frady, E Paxon (June 2024, Nature Machine Intelligence)

   Analysing a visual scene by inferring the configuration of a generative model is widely considered the most flexible and generalizable approach to scene understanding. Yet, one major problem is the computational challenge of the inference procedure, involving a combinatorial search across object identities and poses. Here we propose a neuromorphic solution exploiting three key concepts: (1) a computational framework based on vector symbolic architectures (VSAs) with complex-valued vectors, (2) the design of hierarchical resonator networks to factorize the non-commutative transforms translation and rotation in visual scenes and (3) the design of a multi-compartment spiking phasor neuron model for implementing complex-valued resonator networks on neuromorphic hardware. The VSA framework uses vector binding operations to form a generative image model in which binding acts as the equivariant operation for g eo me tric t ra nsformations. A scene can therefore be described as a sum of vector products, which can then be efficiently factorized by a resonator network to infer objects and their poses. The hierarchical resonator network features a partitioned architecture in which vector binding is equivariant for horizontal and vertical translation within one partition and for rotation and scaling within the other partition. The spiking neuron model allows mapping the resonator network onto efficient and low-power neuromorphic hardware. Our approach is demonstrated on synthetic scenes composed of simple two-dimensional shapes undergoing rigid geometric transformations and colour changes. A companion paper demonstrates the same approach in real-world application scenarios for machine vision and robotics. 

   more » « less
3. Validating an algebraic approach to characterizing resonator networks

   https://doi.org/10.1038/s41598-023-50089-1  

   Horowitz, Viva R; Carter, Brittany; Hernandez, Uriel F; Scheuing, Trevor; Alemán, Benjamín J (December 2024, Scientific Reports)

   Abstract Resonator networks are ubiquitous in natural and engineered systems, such as solid-state materials, electrical circuits, quantum processors, and even neural tissue. To understand and manipulate these networks it is essential to characterize their building blocks, which include the mechanical analogs of mass, elasticity, damping, and coupling of each resonator element. While these mechanical parameters are typically obtained from response spectra using least-squares fitting, this approach requires a priori knowledge of all parameters and is susceptible to large error due to convergence to local minima. Here we validate an alternative algebraic means to characterize resonator networks with no or minimal a priori knowledge. Our approach recasts the equations of motion of the network into a linear homogeneous algebraic equation and solves the equation with a set of discrete measured network response vectors. For validation, we employ our approach on noisy simulated data from a single resonator and a coupled resonator pair, and we characterize the accuracy of the recovered parameters using high-dimension factorial simulations. Generally, we find that the error is inversely proportional to the signal-to-noise ratio, that measurements at two frequencies are sufficient to recover all parameters, and that sampling near the resonant peaks is optimal. Our simple, powerful tool will enable future efforts to ascertain network properties and control resonator networks in diverse physical domains. 

   more » « less
4. Skyline Queries Constrained by Multi-cost Transportation Networks

   https://doi.org/10.1109/ICDE.2019.00087  

   Gong, Qixu; Cao, Huiping; Nagarkar, Parth (April 2019, 2019 IEEE 35th International Conference on Data Engineering (ICDE))

   Skyline queries are used to find the Pareto optimal solution from datasets containing multi-dimensional data points. In this paper, we propose a new type of skyline queries whose evaluation is constrained by a multi-cost transportation network (MCTN) and whose answers are off the network. This type of skyline queries is useful in many applications. For example, a person wants to find an apartment by considering not only the price and the surrounding area of the apartment, but also the transportation cost, time, and distance between the apartment and his/her work place. Most existing works that evaluate skyline queries on multi-cost networks (MCNs), which are either MCTNs or road networks, find interesting objects that locate on edges of the networks. Formally, our new type of skyline queries takes as input an MCTN, a query point q, and a set of objects of interest D with spatial information, where q and the objects in D are off the network. The answers to such queries are objects in D that are not dominated by other D objects when considering the multiple attributes of these objects and the multiple network cost from q to the solution objects. To evaluate such queries, we propose an exact search algorithm and its improved version by implementing several properties. The space of the exact skyline solutions is huge and can easily reach the order of thousands and incur long evaluation time. We further design much more efficient heuristic methods to find approximate solutions. We run extensive experiments using both real and synthetic datasets to test the effectiveness and efficiency of our proposed approaches. The results show that the exact search algorithm can be dramatically improved by utilizing several properties. The heuristic approaches to find approximate answers can largely reduce the query time and retrieve results that are comparable to the exact solutions. 

   more » « less
5. Learning Network Embedding with Community Structural Information

   https://doi.org/10.24963/ijcai.2019/407  

   Li, Yu; Wang, Ying; Zhang, Tingting; Zhang, Jiawei; Chang, Yi (August 2019, Proceedings of the 28th International Joint Conference on Artificial Intelligence)

   Network embedding is an effective approach to learn the low-dimensional representations of vertices in networks, aiming to capture and preserve the structure and inherent properties of networks. The vast majority of existing network embedding methods exclusively focus on vertex proximity of networks, while ignoring the network internal community structure. However, the homophily principle indicates that vertices within the same community are more similar to each other than those from different communities, thus vertices within the same community should have similar vertex representations. Motivated by this, we propose a novel network embedding framework NECS to learn the Network Embedding with Community Structural information, which preserves the high-order proximity and incorporates the community structure in vertex representation learning. We formulate the problem into a principled optimization framework and provide an effective alternating algorithm to solve it. Extensive experimental results on several benchmark network datasets demonstrate the effectiveness of the proposed framework in various network analysis tasks including network reconstruction, link prediction and vertex classification. 

   more » « less