Shay Snyder
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shay Snyder has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Maryam Parsa
George Mason University
8 shared publications - Maryam Parsa
George Mason University, Fairfax, VA, USA
6 shared publications - Cameron Nowzari
George Mason University Fairfax VA USA
3 shared publications - Catherine D. Schuman
Department of Electrical Engineering and Computer Science, University of Tennessee, Knoxville, TN, USA
3 shared publications - Guojing Cong
Data and AI Section, Oak Ridge National Laboratory
3 shared publications - Shruti R. Kulkarni
Oak Ridge National Laboratory
3 shared publications
Latest Publications
- Open Access
- 4 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 233-240
SRMU: Relevance-Gated Updates for Streaming Hyperdimensional Memories
- 4 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 233-240
Open AccessSRMU: Relevance-Gated Updates for Streaming Hyperdimensional Memories
- Open Access
- 2 March 2026
- Published by Springer Nature in npj Unconventional Computing
- Vol. 3 (1) , 13
Brain Inspired Probabilistic Occupancy Grid Mapping with Vector Symbolic Architectures
- 2 March 2026
- Published by Springer Nature in npj Unconventional Computing
- Vol. 3 (1) , 13
Open AccessBrain Inspired Probabilistic Occupancy Grid Mapping with Vector Symbolic Architectures
- Open Access
- 1 December 2025
- Published by AIP Publishing in APL Photonics
- Vol. 10 (12)
OptiCAM: An optical content-addressable memory architecture for ultra-fast pattern matching
Content-Addressable Memory (CAM) circuits enable inherently parallel and high-speed search operations, making them essential for data-intensive applications, such as packet classification in high-speed networking, pattern recognition, and artificial intelligence. However, as CMOS technology continues to scale, conventional electrical CAMs suffer from increasing interconnect delays, hindering their performance and energy efficiency in large-scale deployments. In contrast, photonic systems leverage light as the information carrier, offering ultra-fast data transmission with minimal signal degradation due to their length-independent impedance characteristics. In this work, we introduce OptiCAM—an optical CAM architecture that employs silicon photonic microring resonators and photodiode-based latch structures to store data and execute matching entirely in the optical domain. Furthermore, we present a novel sectioned array architecture that provides a pathway to build scalable CAM arrays, effectively overcoming the wavelength limitations imposed by the microring resonators’ free spectral range. Our OptiCAM design, evaluated on a 16 × 16 photonic CAM array using the commercial GlobalFoundries’ 45SPCLO technology node, achieves a remarkable search latency of 100 ps and an energy consumption of 100.9 fJ/bit per search.
- 1 December 2025
- Published by AIP Publishing in APL Photonics
- Vol. 10 (12)
Open AccessOptiCAM: An optical content-addressable memory architecture for ultra-fast pattern matching
Content-Addressable Memory (CAM) circuits enable inherently parallel and high-speed search operations, making them essential for data-intensive applications, such as packet classification in high-speed networking, pattern recognition, and artificial intelligence. However, as CMOS technology continues to scale, conventional electrical CAMs suffer from increasing interconnect delays, hindering their performance and energy efficiency in large-scale deployments. In contrast, photonic systems leverage light as the information carrier, offering ultra-fast data transmission with minimal signal degradation due to their length-independent impedance characteristics. In this work, we introduce OptiCAM—an optical CAM architecture that employs silicon photonic microring resonators and photodiode-based latch structures to store data and execute matching entirely in the optical domain. Furthermore, we present a novel sectioned array architecture that provides a pathway to build scalable CAM arrays, effectively overcoming the wavelength limitations imposed by the microring resonators’ free spectral range. Our OptiCAM design, evaluated on a 16 × 16 photonic CAM array using the commercial GlobalFoundries’ 45SPCLO technology node, achieves a remarkable search latency of 100 ps and an energy consumption of 100.9 fJ/bit per search.
- Open Access
- 23 July 2025
- Published by IOP Publishing in Neuromorphic Computing and Engineering
- Vol. 5 (3) , 034005
A retina-inspired pathway to real-time motion prediction inside image sensors for extreme-edge intelligence
The ability to predict motion in real time is fundamental to many maneuvering activities in animals, particularly those critical for survival, such as attack and escape responses. Given its significance, it is no surprise that motion prediction (MP) in animals begins in the retina. Similarly, autonomous systems utilizing computer vision could greatly benefit from the capability to predict motion in real time. Therefore, for computer vision applications, MP should be integrated directly at the camera pixel level. Towards that end, we present a retina-inspired neuromorphic framework capable of performing real-time, energy-efficient MP directly within camera pixels. Our hardware-algorithm framework, implemented using GlobalFoundries’ 22 nm FDSOI technology, integrates key retinal MP compute blocks, including a biphasic filter, spike adder, non-linear circuit, and a 2D array for multi-directional MP. Additionally, integrating the sensor and MP compute die using a 3D Cu–Cu hybrid bonding approach improves design compactness by minimizing area usage and simplifying routing complexity. Validated on real-world object stimuli, the model delivers efficient, low-latency MP for decision-making scenarios reliant on predictive visual computation, while consuming only 18.56 pJ/MP in our mixed-signal hardware implementation.
- 23 July 2025
- Published by IOP Publishing in Neuromorphic Computing and Engineering
- Vol. 5 (3) , 034005
Open AccessA retina-inspired pathway to real-time motion prediction inside image sensors for extreme-edge intelligence
The ability to predict motion in real time is fundamental to many maneuvering activities in animals, particularly those critical for survival, such as attack and escape responses. Given its significance, it is no surprise that motion prediction (MP) in animals begins in the retina. Similarly, autonomous systems utilizing computer vision could greatly benefit from the capability to predict motion in real time. Therefore, for computer vision applications, MP should be integrated directly at the camera pixel level. Towards that end, we present a retina-inspired neuromorphic framework capable of performing real-time, energy-efficient MP directly within camera pixels. Our hardware-algorithm framework, implemented using GlobalFoundries’ 22 nm FDSOI technology, integrates key retinal MP compute blocks, including a biphasic filter, spike adder, non-linear circuit, and a 2D array for multi-directional MP. Additionally, integrating the sensor and MP compute die using a 3D Cu–Cu hybrid bonding approach improves design compactness by minimizing area usage and simplifying routing complexity. Validated on real-world object stimuli, the model delivers efficient, low-latency MP for decision-making scenarios reliant on predictive visual computation, while consuming only 18.56 pJ/MP in our mixed-signal hardware implementation.
- Open Access
On the Privacy-Preserving Properties of Spiking Neural Networks with Unique Surrogate Gradients and Quantization Levels
As machine learning models increasingly process sensitive data, understanding their vulnerability to privacy attacks is vital. Membership inference attacks (MIAs) exploit model responses to infer whether specific data points were used during training, posing a significant privacy risk. Prior research suggests that spiking neural networks (SNNs), which rely on event-driven computation and discrete spike-based encoding, exhibit greater resilience to MIAs than artificial neural networks (ANNs). This resilience stems from their non-differentiable activations and inherent stochasticity, which obscure the correlation between model responses and individual training samples. To enhance privacy in SNNs, we explore two techniques: quantization and surrogate gradients. Quantization, which reduces precision to limit information leakage, has improved privacy in ANNs. Given SNNs' sparse and irregular activations, quantization may further disrupt the activation patterns exploited by MIAs. We assess the vulnerability of SNNs and ANNs under weight and activation quantization across multiple datasets, using the attack model's receiver operating characteristic (ROC) curve area under the curve (AUC) metric, where lower values indicate stronger privacy, and evaluate the privacy-accuracy trade-off. Our findings show that quantization enhances privacy in both architectures with minimal performance loss, though full-precision SNNs remain more resilient than quantized ANNs. Additionally, we examine the impact of surrogate gradients on privacy in SNNs. Among five evaluated gradients, spike rate escape provides the best privacy-accuracy trade-off, while arctangent increases vulnerability to MIAs. These results reinforce SNNs' inherent privacy advantages and demonstrate that quantization and surrogate gradient selection significantly influence privacy-accuracy trade-offs in SNNs.
Open AccessOn the Privacy-Preserving Properties of Spiking Neural Networks with Unique Surrogate Gradients and Quantization Levels
As machine learning models increasingly process sensitive data, understanding their vulnerability to privacy attacks is vital. Membership inference attacks (MIAs) exploit model responses to infer whether specific data points were used during training, posing a significant privacy risk. Prior research suggests that spiking neural networks (SNNs), which rely on event-driven computation and discrete spike-based encoding, exhibit greater resilience to MIAs than artificial neural networks (ANNs). This resilience stems from their non-differentiable activations and inherent stochasticity, which obscure the correlation between model responses and individual training samples. To enhance privacy in SNNs, we explore two techniques: quantization and surrogate gradients. Quantization, which reduces precision to limit information leakage, has improved privacy in ANNs. Given SNNs' sparse and irregular activations, quantization may further disrupt the activation patterns exploited by MIAs. We assess the vulnerability of SNNs and ANNs under weight and activation quantization across multiple datasets, using the attack model's receiver operating characteristic (ROC) curve area under the curve (AUC) metric, where lower values indicate stronger privacy, and evaluate the privacy-accuracy trade-off. Our findings show that quantization enhances privacy in both architectures with minimal performance loss, though full-precision SNNs remain more resilient than quantized ANNs. Additionally, we examine the impact of surrogate gradients on privacy in SNNs. Among five evaluated gradients, spike rate escape provides the best privacy-accuracy trade-off, while arctangent increases vulnerability to MIAs. These results reinforce SNNs' inherent privacy advantages and demonstrate that quantization and surrogate gradient selection significantly influence privacy-accuracy trade-offs in SNNs.
- Open Access
Generalizable Reinforcement Learning with Biologically Inspired Hyperdimensional Occupancy Grid Maps for Exploration and Goal-Directed Path Planning
Real-time autonomous systems utilize multi-layer computational frameworks to perform critical tasks such as perception, goal finding, and path planning. Traditional methods implement perception using occupancy grid mapping (OGM), segmenting the environment into discretized cells with probabilistic information. This classical approach is well-established and provides a structured input for downstream processes like goal finding and path planning algorithms. Recent approaches leverage a biologically inspired mathematical framework known as vector symbolic architectures (VSA), commonly known as hyperdimensional computing, to perform probabilistic OGM in hyperdimensional space. This approach, VSA-OGM, provides native compatibility with spiking neural networks, positioning VSA-OGM as a potential neuromorphic alternative to conventional OGM. However, for large-scale integration, it is essential to assess the performance implications of VSA-OGM on downstream tasks compared to established OGM methods. This study examines the efficacy of VSA-OGM against a traditional OGM approach, Bayesian Hilbert Maps (BHM), within reinforcement learning based goal finding and path planning frameworks, across a controlled exploration environment and an autonomous driving scenario inspired by the F1-Tenth challenge. Our results demonstrate that VSA-OGM maintains comparable learning performance across single and multi-scenario training configurations while improving performance on unseen environments by approximately 47%. These findings highlight the increased generalizability of policy networks trained with VSA-OGM over BHM, reinforcing its potential for real-world deployment in diverse environments.
Open AccessGeneralizable Reinforcement Learning with Biologically Inspired Hyperdimensional Occupancy Grid Maps for Exploration and Goal-Directed Path Planning
Real-time autonomous systems utilize multi-layer computational frameworks to perform critical tasks such as perception, goal finding, and path planning. Traditional methods implement perception using occupancy grid mapping (OGM), segmenting the environment into discretized cells with probabilistic information. This classical approach is well-established and provides a structured input for downstream processes like goal finding and path planning algorithms. Recent approaches leverage a biologically inspired mathematical framework known as vector symbolic architectures (VSA), commonly known as hyperdimensional computing, to perform probabilistic OGM in hyperdimensional space. This approach, VSA-OGM, provides native compatibility with spiking neural networks, positioning VSA-OGM as a potential neuromorphic alternative to conventional OGM. However, for large-scale integration, it is essential to assess the performance implications of VSA-OGM on downstream tasks compared to established OGM methods. This study examines the efficacy of VSA-OGM against a traditional OGM approach, Bayesian Hilbert Maps (BHM), within reinforcement learning based goal finding and path planning frameworks, across a controlled exploration environment and an autonomous driving scenario inspired by the F1-Tenth challenge. Our results demonstrate that VSA-OGM maintains comparable learning performance across single and multi-scenario training configurations while improving performance on unseen environments by approximately 47%. These findings highlight the increased generalizability of policy networks trained with VSA-OGM over BHM, reinforcing its potential for real-world deployment in diverse environments.
- Open Access
Spiking Neural Networks as a Controller for Emergent Swarm Agents
Drones which can swarm and loiter in a certain area cost hundreds of dollars, but mosquitos can do the same and are essentially worthless. To control swarms of low-cost robots, researchers may end up spending countless hours brainstorming robot configurations and policies to ``organically" create behaviors which do not need expensive sensors and perception. Existing research explores the possible emergent behaviors in swarms of robots with only a binary sensor and a simple but hand-picked controller structure. Even agents in this highly limited sensing, actuation, and computational capability class can exhibit relatively complex global behaviors such as aggregation, milling, and dispersal, but finding the local interaction rules that enable more collective behaviors remains a significant challenge. This paper investigates the feasibility of training spiking neural networks to find those local interaction rules that result in particular emergent behaviors. In this paper, we focus on simulating a specific milling behavior already known to be producible using very simple binary sensing and acting agents. To do this, we use evolutionary algorithms to evolve not only the parameters (the weights, biases, and delays) of a spiking neural network, but also its structure. To create a baseline, we also show an evolutionary search strategy over the parameters for the incumbent hand-picked binary controller structure. Our simulations show that spiking neural networks can be evolved in binary sensing agents to form a mill.
Open AccessSpiking Neural Networks as a Controller for Emergent Swarm Agents
Drones which can swarm and loiter in a certain area cost hundreds of dollars, but mosquitos can do the same and are essentially worthless. To control swarms of low-cost robots, researchers may end up spending countless hours brainstorming robot configurations and policies to ``organically" create behaviors which do not need expensive sensors and perception. Existing research explores the possible emergent behaviors in swarms of robots with only a binary sensor and a simple but hand-picked controller structure. Even agents in this highly limited sensing, actuation, and computational capability class can exhibit relatively complex global behaviors such as aggregation, milling, and dispersal, but finding the local interaction rules that enable more collective behaviors remains a significant challenge. This paper investigates the feasibility of training spiking neural networks to find those local interaction rules that result in particular emergent behaviors. In this paper, we focus on simulating a specific milling behavior already known to be producible using very simple binary sensing and acting agents. To do this, we use evolutionary algorithms to evolve not only the parameters (the weights, biases, and delays) of a spiking neural network, but also its structure. To create a baseline, we also show an evolutionary search strategy over the parameters for the incumbent hand-picked binary controller structure. Our simulations show that spiking neural networks can be evolved in binary sensing agents to form a mill.
- Open Access
- 12 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 608-613
Transductive Spiking Graph Neural Networks for Loihi
- 12 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 608-613
Open AccessTransductive Spiking Graph Neural Networks for Loihi
- Open Access
- 12 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 776-778
Asynchronous Neuromorphic Optimization in Lava
- 12 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 776-778
Open AccessAsynchronous Neuromorphic Optimization in Lava
- Open Access
Exploration of Novel Neuromorphic Methodologies for Materials Applications
Many of today's most interesting questions involve understanding and interpreting complex relationships within graph-based structures. For instance, in materials science, predicting material properties often relies on analyzing the intricate network of atomic interactions. Graph neural networks (GNNs) have emerged as a popular approach for these tasks; however, they suffer from limitations such as inefficient hardware utilization and over-smoothing. Recent advancements in neuromorphic computing offer promising solutions to these challenges. In this work, we evaluate two such neuromorphic strategies known as reservoir computing and hyperdimensional computing. We compare the performance of both approaches for bandgap classification and regression using a subset of the Materials Project dataset. Our results indicate recent advances in hyperdimensional computing can be applied effectively to better represent molecular graphs.
Open AccessExploration of Novel Neuromorphic Methodologies for Materials Applications
Many of today's most interesting questions involve understanding and interpreting complex relationships within graph-based structures. For instance, in materials science, predicting material properties often relies on analyzing the intricate network of atomic interactions. Graph neural networks (GNNs) have emerged as a popular approach for these tasks; however, they suffer from limitations such as inefficient hardware utilization and over-smoothing. Recent advancements in neuromorphic computing offer promising solutions to these challenges. In this work, we evaluate two such neuromorphic strategies known as reservoir computing and hyperdimensional computing. We compare the performance of both approaches for bandgap classification and regression using a subset of the Materials Project dataset. Our results indicate recent advances in hyperdimensional computing can be applied effectively to better represent molecular graphs.