Search Results for author: Garrett T. Kenyon

Found 17 papers, 0 papers with code

Implementing and Benchmarking the Locally Competitive Algorithm on the Loihi 2 Neuromorphic Processor

no code implementations25 Jul 2023 Gavin Parpart, Sumedh R. Risbud, Garrett T. Kenyon, Yijing Watkins

Neuromorphic processors have garnered considerable interest in recent years for their potential in energy-efficient and high-speed computing.

Benchmarking

Sampling binary sparse coding QUBO models using a spiking neuromorphic processor

no code implementations2 Jun 2023 Kyle Henke, Elijah Pelofske, Georg Hahn, Garrett T. Kenyon

We demonstrate neuromorphic computing is suitable for sampling low energy solutions of binary sparse coding QUBO models, and although Loihi 1 is capable of sampling very sparse solutions of the QUBO models, there needs to be improvement in the implementation in order to be competitive with simulated annealing.

Dictionary Learning with Accumulator Neurons

no code implementations30 May 2022 Gavin Parpart, Carlos Gonzalez, Terrence C. Stewart, Edward Kim, Jocelyn Rego, Andrew O'Brien, Steven Nesbit, Garrett T. Kenyon, Yijing Watkins

The Locally Competitive Algorithm (LCA) uses local competition between non-spiking leaky integrator neurons to infer sparse representations, allowing for potentially real-time execution on massively parallel neuromorphic architectures such as Intel's Loihi processor.

Dictionary Learning

Prediction and compression of lattice QCD data using machine learning algorithms on quantum annealer

no code implementations3 Dec 2021 Boram Yoon, Chia Cheng Chang, Garrett T. Kenyon, Nga T. T. Nguyen, Ermal Rrapaj

In the compression algorithm, we define a mapping from lattice QCD data of floating-point numbers to the binary coefficients that closely reconstruct the input data from a set of basis vectors.

BIG-bench Machine Learning regression

Uncovering Universal Features: How Adversarial Training Improves Adversarial Transferability

no code implementations ICML Workshop AML 2021 Jacob M. Springer, Melanie Mitchell, Garrett T. Kenyon

Adversarial examples for neural networks are known to be transferable: examples optimized to be misclassified by a “source” network are often misclassified by other “destination” networks.

A Little Robustness Goes a Long Way: Leveraging Robust Features for Targeted Transfer Attacks

no code implementations NeurIPS 2021 Jacob M. Springer, Melanie Mitchell, Garrett T. Kenyon

Adversarial examples for neural network image classifiers are known to be transferable: examples optimized to be misclassified by a source classifier are often misclassified as well by classifiers with different architectures.

Adversarial Perturbations Are Not So Weird: Entanglement of Robust and Non-Robust Features in Neural Network Classifiers

no code implementations9 Feb 2021 Jacob M. Springer, Melanie Mitchell, Garrett T. Kenyon

The results we present in this paper provide new insight into the nature of the non-robust features responsible for adversarial vulnerability of neural network classifiers.

The Selectivity and Competition of the Mind's Eye in Visual Perception

no code implementations23 Nov 2020 Edward Kim, Maryam Daniali, Jocelyn Rego, Garrett T. Kenyon

Research has shown that neurons within the brain are selective to certain stimuli.

It's Hard for Neural Networks To Learn the Game of Life

no code implementations3 Sep 2020 Jacob M. Springer, Garrett T. Kenyon

To investigate how weight initializations affect performance, we examine small convolutional networks that are trained to predict n steps of the two-dimensional cellular automaton Conway's Game of Life, the update rules of which can be implemented efficiently in a 2n+1 layer convolutional network.

A regression algorithm for accelerated lattice QCD that exploits sparse inference on the D-Wave quantum annealer

no code implementations14 Nov 2019 Nga T. T. Nguyen, Garrett T. Kenyon, Boram Yoon

We propose a regression algorithm that utilizes a learned dictionary optimized for sparse inference on a D-Wave quantum annealer.

Denoising regression

Image classification using quantum inference on the D-Wave 2X

no code implementations28 May 2019 Nga T. T. Nguyen, Garrett T. Kenyon

To establish a benchmark for classification performance on this reduced dimensional data set, we used an AlexNet-like architecture implemented in TensorFlow, obtaining a classification score of $94. 54 \pm 0. 7 \%$.

General Classification Image Classification

Classifiers Based on Deep Sparse Coding Architectures are Robust to Deep Learning Transferable Examples

no code implementations17 Nov 2018 Jacob M. Springer, Charles S. Strauss, Austin M. Thresher, Edward Kim, Garrett T. Kenyon

Although deep learning has shown great success in recent years, researchers have discovered a critical flaw where small, imperceptible changes in the input to the system can drastically change the output classification.

General Classification

Phase Transitions in Image Denoising via Sparsely Coding Convolutional Neural Networks

no code implementations26 Oct 2017 Jacob Carroll, Nils Carlson, Garrett T. Kenyon

Neural networks are analogous in many ways to spin glasses, systems which are known for their rich set of dynamics and equally complex phase diagrams.

Image Denoising

Sparse Coding on Stereo Video for Object Detection

no code implementations19 May 2017 Sheng Y. Lundquist, Melanie Mitchell, Garrett T. Kenyon

We show that replacing a typical supervised convolutional layer with an unsupervised sparse-coding layer within a DCNN allows for better performance on a car detection task when only a limited number of labeled training examples is available.

Image Classification Object +2

Replicating Kernels with a Short Stride Allows Sparse Reconstructions with Fewer Independent Kernels

no code implementations17 Jun 2014 Peter F. Schultz, Dylan M. Paiton, Wei Lu, Garrett T. Kenyon

We find, for example, that for 16x16-pixel receptive fields, using eight kernels and a stride of 2 leads to sparse reconstructions of comparable quality as using 512 kernels and a stride of 16 (the nonoverlapping case).

Cannot find the paper you are looking for? You can Submit a new open access paper.