Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mark D. Stiles

dblp:182/2159 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0001-8238-4156ORCID · reported

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

Systems, architecture and hardware · 3 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Emerging computing paradigms · 43% Hardware accelerators and domain-specific architectures · 38% Memory systems · 13%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.412020
Streaming Batch Gradient Tracking for Neural Network Training (Student Abstract) · AAAI 2020
Emerging computing paradigms
bio-inspired computing
0.212016
Spintronic Nanodevices for Bioinspired Computing · Proc. IEEE 2016
Emerging computing paradigms
neuromorphic computing
0.212016
Spintronic Nanodevices for Bioinspired Computing · Proc. IEEE 2016
Memory systems › non-volatile memory
magnetic tunnel junction
0.112016
Spintronic Nanodevices for Bioinspired Computing · Proc. IEEE 2016
Memory systems
non-volatile memory
0.112016
Spintronic Nanodevices for Bioinspired Computing · Proc. IEEE 2016

Methods — techniques the papers use, named apart from their topics

streaming batch principal component analysis · 0.9low-rank approximation · 0.9minibatch gradient descent · 0.4mini-batch gradient descent · 0.4
YearPublicationVenuePosition
2023 Low-Rank Gradient Descent for Memory-Efficient Training of Deep In-Memory Arrays
abstract
The movement of large quantities of data during the training of a deep neural network presents immense challenges for machine learning workloads, especially those based on future functional memories deployed to store network models. As the size of network models begins to vastly outstrip traditional silicon computing resources, functional memories based on flash, resistive switches, magnetic tunnel junctions, and other technologies can store these new ultra-large models. However, new approaches are then needed to minimize hardware overhead, especially on the movement and calculation of gradient information that cannot be efficiently contained in these new memory resources. To do this, we introduce streaming batch principal component analysis (SBPCA) as an update algorithm. Streaming batch principal component analysis uses stochastic power iterations to generate a stochastic rank- k approximation of the network gradient. We demonstrate that the low-rank updates produced by streaming batch principal component analysis can effectively train convolutional neural networks on a variety of common datasets, with performance comparable to standard mini-batch gradient descent. Our approximation is made in an expanded vector form that can efficiently be applied to the rows and columns of crossbars for array-level updates. These results promise improvements in the design of application-specific integrated circuits based around large vector-matrix multiplier memories.
Siyuan Huang 0002, Brian Hoskins, Matthew W. Daniels, Mark D. Stiles, Gina C. Adam
ACM J. Emerg. Technol. Comput. Syst.4
2021 Temporal State Machines: Using Temporal Memory to Stitch Time-based Graph Computations
abstract
mappings of algorithms into hardware rely on researcher ingenuity and result in custom architectures that are difficult to systematize. We propose to associate race logic with the mathematical field of tropical algebra, enabling a more methodical approach toward building temporal circuits. This association between the mathematical primitives of tropical algebra and generalized race logic computations guides the design of temporally coded tropical circuits. It also serves as a framework for expressing high-level timing-based algorithms. This abstraction, when combined with temporal memory, allows for the systematic exploration of race logic-based temporal architectures by making it possible to partition feed-forward computations into stages and organize them into a state machine. We leverage analog memristor-based temporal memories to design such a state machine that operates purely on time-coded wavefronts. We implement a version of Dijkstra's algorithm to evaluate this temporal state machine. This demonstration shows the promise of expanding the expressibility of temporal computing to enable it to deliver significant energy and throughput advantages.
Advait Madhavan, Matthew W. Daniels, Mark D. Stiles
ACM J. Emerg. Technol. Comput. Syst.3
2020 Streaming Batch Gradient Tracking for Neural Network Training (Student Abstract)
abstract
Faster and more energy efficient hardware accelerators are critical for machine learning on very large datasets. The energy cost of performing vector-matrix multiplication and repeatedly moving neural network models in and out of memory motivates a search for alternative hardware and algorithms. We propose to use streaming batch principal component analysis (SBPCA) to compress batch data during training by using a rank-k approximation of the total batch update. This approach yields comparable training performance to minibatch gradient descent (MBGD) at the same batch size while reducing overall memory and compute requirements.
Siyuan Huang 0002, Brian Hoskins, Matthew W. Daniels, Mark D. Stiles, Gina C. Adam
AAAI4
2020 Storing and Retrieving Wavefronts with Resistive Temporal Memory
abstract
We extend the reach of temporal computing schemes by developing a memory for multi-channel temporal patterns or “wavefronts.” This temporal memory re-purposes conventional one-transistor-one-resistor (1T1R) memristor crossbars for use in an arrival-time coded, single-event-per-wire temporal computing environment. The memristor resistances and the associated circuit capacitances provide the necessary time constants, enabling the memory array to store and retrieve wavefronts. The retrieval operation of such a memory is naturally in the temporal domain and the resulting wavefronts can be used to trigger time-domain computations. While recording the wavefronts can be done using standard digital techniques, that approach has substantial translation costs between temporal and digital domains. To avoid these costs, we propose a spike timing dependent plasticity (STDP) inspired wavefront recording scheme to capture incoming wavefronts. We simulate these designs with experimentally validated memristor models and analyze the effects of memristor non-idealities on the operation of such a memory.
Advait Madhavan, Mark D. Stiles
ISCAS2
2016 Spintronic Nanodevices for Bioinspired Computing
abstract
Bioinspired hardware holds the promise of low-energy, intelligent, and highly adaptable computing systems. Applications span from automatic classification for big data management, through unmanned vehicle control, to control for biomedical prosthesis. However, one of the major challenges of fabricating bioinspired hardware is building ultra-high-density networks out of complex processing units interlinked by tunable connections. Nanometer-scale devices exploiting spin electronics (or spintronics) can be a key technology in this context. In particular, magnetic tunnel junctions (MTJs) are well suited for this purpose because of their multiple tunable functionalities. One such functionality, non-volatile memory, can provide massive embedded memory in unconventional circuits, thus escaping the von-Neumann bottleneck arising when memory and processors are located separately. Other features of spintronic devices that could be beneficial for bioinspired computing include tunable fast nonlinear dynamics, controlled stochasticity, and the ability of single devices to change functions in different operating conditions. Large networks of interacting spintronic nanodevices can have their interactions tuned to induce complex dynamics such as synchronization, chaos, soliton diffusion, phase transitions, criticality, and convergence to multiple metastable states. A number of groups have recently proposed bioinspired architectures that include one or several types of spintronic nanodevices. In this paper, we show how spintronics can be used for bioinspired computing. We review the different approaches that have been proposed, the recent advances in this direction, and the challenges toward fully integrated spintronics complementary metal-oxide-semiconductor (CMOS) bioinspired hardware.
Julie Grollier, Damien Querlioz, Mark D. Stiles
Proc. IEEE3
2016 Spintronics [Scanning the Issue]
abstract
Provides an overview of the technical articles and features presented in this issue.
Hideo Ohno, Mark D. Stiles, Bernard Dieny
Proc. IEEE2