Raphael C. Pooser

dblp:219/5523 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2022
0000-0002-2922-453XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 3 since 2021
YearPublicationVenuePosition
2022 Unsupervised Digit Recognition Using Cosine Similarity In A Neuromemristive Competitive Learning System
abstract
This work addresses how to naturally adopt the l 2 -norm cosine similarity in the neuromemristive system and studies the unsupervised learning performance on handwritten digit image recognition. Proposed architecture is a two-layer fully connected neural network with a hard winner-take-all (WTA) learning module. For input layer, we propose single-spike temporal code that transforms input stimuli into the set of single spikes with different latencies and voltage levels. For a synapse model, we employ a compound memristor where stochastically switching binary-state memristors connected in parallel, which offers a reliable and scalable multi-state solution for synaptic weight storage. Hardware-friendly synaptic adaptation mechanism is proposed to realize spike-timing-dependent plasticity learning. Input spikes are sent out through those memristive synapses to each and every integrate-and-fire neuron in the fully connected output layer, where the hard WTA network motif introduces the competition based on cosine similarity for the given input stimuli. Finally, we present 92.64% accuracy performance on unsupervised digit recognition with only single-epoch MNIST dataset training via high-level simulations, including extensive analysis on the impact of system parameters.
Bon Woong Ku, Catherine D. Schuman, Md Musabbir Adnan, Tiffany M. Mintz, Raphael C. Pooser, Kathleen E. Hamilton, Garrett S. Rose, Sung Kyu Lim
ACM J. Emerg. Technol. Comput. Syst.5
2021 Building scalable variational circuit training for machine learning tasks
abstract
Parameterized quantum circuits (PQC) have emerged as a quantum analogue of deep neural networks and can be trained for discriminative or generative tasks and can be trained with gradient-based optimization on near-term quantum devices [1], [2], [3]. In the current era of quantum computing, known as the noisy intermediate scale quantum (NISQ) era [4], these devices contain a moderate number of qubits (< 100), and algorithmic performance is strongly impacted by hardware noise. Additionally, the training of PQCs are hybrid algorithms, in which the computational workflow is split between quantum and classical computing platforms.
Kathleen E. Hamilton, Emily Lynn, Tyler Kharazi, Titus Morris, Ryan S. Bennink, Raphael C. Pooser
DAC6
2021 Mode connectivity in the QCBM loss landscape: ICCAD Special Session Paper
abstract
Quantum circuit Born machines (QCBMs) and training via variational quantum algorithms (VQAs) are key applications for near-term quantum hardware. QCBM ansäatze designs are unique in that they do not require prior knowledge of a physical Hamiltonian. Many ansätze are built from fixed designs. In this work, we train and compare the performance of QCBM models built using two commonly employed parameterizations and two commonly employed entangling layer designs. In addition to comparing the overall performance of these models, we look at features and characteristics of the loss landscape-connectivity of minima in particular - to help understand the advantages and disadvantages of each design choice. We show that the rotational gate choices can improve loss landscape connectivity.
Kathleen E. Hamilton, Emily Lynn, Vicente Leyton-Ortega, Swarnadeep Majumder, Raphael C. Pooser
ICCAD5