Engineering PapersSearch

DOE OSTI · 3004328

Analog Systems for Edge Optimization

Abstract

Over the past decade, analog computing has the subject of substantial research interest providing a path toward improved computational efficiency in the post-Dennard era. Analog matrix vector multiplication (MVM) accelerators provide a popular approach given the ubiquity of MVM operations in numerous applications. However, historically analog computing systems can struggle with applications requiring high precision due to the inherent susceptibility of these systems to analog non-idealities. Therefore, prior work on analog systems has focused either on applications known to be tolerant of limited precision (e.g., neural network inference), or using expensive techniques to emulate high-precision using many analog MVM operations. In this work, we propose an alternative approach. Motivated by recent advances in inexact nonlinear solvers and optimizers, we explore the potential of co-designing optimization algorithms which can take full advantage of the fundamentally inexact analog MVM operations. To enable these co-designed algorithms we also develop a general mathematical theory of the precision and energy efficiency of analog operations, and a new system architecture for tightly-coupled analog and digital computation. Finally, we examine the applicability of analog computing to a wider class of symmetric positive definite systems and find potential in using analog operations as a sparse approximate inverse preconditioner. With these core innovations, this project provides a path toward effectively implementing optimization algorithms on power-constrained autonomous and semi-autonomous systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Feinberg, Benjamin McCulloch [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)] (ORCID:0000000204500067), Agarwal, Sapan [Sandia National Lab. (SNL-CA), Livermore, CA (United States)] (ORCID:0000000236766986), Bennett, Christopher [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)] (ORCID:000000026989292X), Boman, Erik Gunnar [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)], Durbin, Cameron Ford [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)], Flores, Jacob Michael [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)] (ORCID:0009000387747560), Javeed, Aurya [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)], Kouri, Drew Philip [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)] (ORCID:0000000270793195), Ortega, Eduardo Esquivel [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)], Ridzal, Denis [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)] (ORCID:000900003286424X), Tunnell, Mark [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)], Wahby, William [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)] (ORCID:0000000210668915), Xiao, Tianyao Patrick [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)] (ORCID:0000000190662961). 2025-09-01. Analog Systems for Edge Optimization. https://doi.org/10.2172/3004328

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

TANTE: Time-adaptive operator learning via neural Taylor expansion

Operator learning for time-dependent partial differential equations (PDEs) has seen rapid progress in recent years, enabling efficient approximation of complex spatiotemporal dynamics. However, most existing methods rely on fixed time step sizes during rollout, which limits their ability to adapt to varying temporal complexity and often leads to error accumulation. In this work, we propose the Time-Adaptive Transformer with Neural Taylor Expansion (TANTE), a novel operator-learning framework that produces continuous-time predictions with adaptive step sizes. TANTE predicts future states by performing a Taylor expansion at the current state, where neural networks learn both the higher-order temporal derivatives and the local radius of convergence. This allows the model to dynamically adjust its rollout based on the local behavior of the solution, thereby reducing cumulative error and improving computational efficiency. We demonstrate the effectiveness of TANTE across a wide range of PDE benchmarks, achieving superior accuracy and adaptability compared to fixed-step baselines, delivering accuracy gains of 60-80 % and speed-ups of 30-40 % at inference time.

97 MATHEMATICS AND COMPUTING

Structured illumination for surface-resolved grazing-incidence X-ray scattering

Grazing-incidence (GI) scattering techniques are widely used to characterize thin films, offering high surface sensitivity and insight into morphology and structure. However, these approaches typically provide statistical averaged information due to elongated footprint or limited spatial resolution due to beam size. Here we introduce a method that combines structured illumination with GI X-ray scattering and leverages our computational imaging approach to resolve local structural details. We demonstrate that our method captures local features of an organic semiconductor thin film without the need for sample rotation as in tomography. The method expands GI techniques from statistical averaging to high-resolution imaging, thereby providing the capability for detailed analysis of local material properties, such as domain shape, orientation and polymorphism, which are critical for advancing material design towards more efficient and tailored materials.

97 MATHEMATICS AND COMPUTING