Analog In-memory Training on General Non-ideal Resistive Elements: The Impact of Response Functions
Zhaoxian Wu, Quan Xiao, Tayfun Gokmen, Omobayode Fagbohungbe, Tianyi Chen
Abstract
As the economic and environmental costs of training and deploying large vision or language models increase dramatically, analog in-memory computing (AIMC) emerges as a promising energy-efficient solution. However, the training perspective, especially its training dynamic, is underexplored. In AIMC hardware, the trainable weights are represented by the conductance of resistive elements and updated using consecutive electrical pulses. While the conductance changes by a constant in response to each pulse, in reality, the change is scaled by asymmetric and non-linear response functions, leading to a non-ideal training dynamic. This paper provides a theoretical foundation for gradient-based training on AIMC hardware with non-ideal response functions. We demonstrate that asymmetric response functions negatively impact Analog SGD by imposing an implicit penalty on the objective. To overcome the issue, we propose Residual Learning algorithm, which provably converges exactly to a critical point by solving a bilevel optimization problem. We demonstrate that the proposed method can be extended to address other hardware imperfections, such as limited response granularity. As we know, it is the first paper to investigate the impact of a class of generic non-ideal response functions. The conclusion is supported by simulations validating our theoretical insights.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itBuilds on8
- Language Models are Few-Shot LearnersTom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah et al.NeurIPS 2020 · 64,255 citations
- On Penalty-based Bilevel Gradient Descent MethodHan Shen, Tianyi ChenICML 2023 · 105 citations
- On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic ApproximationJeongyeol Kwon, Dohyun Kwon, Stephen Wright, Robert D. NowakICLR 2024 · 61 citations
- Energy-based learning algorithms for analog computing: a comparative studyBenjamin Scellier, Maxence Ernoult, Jack D. Kendall, Suhas KumarNeurIPS 2023 · 54 citations
- Non-Convex Bilevel Games with Critical Point Selection MapsMichael Arbel, Julien MairalNeurIPS 2022 · 40 citations
Related papers
- Towards Exact Gradient-based Training on Analog In-memory ComputingZhaoxian Wu, Tayfun Gokmen, Malte J. Rasch, Tianyi ChenNeurIPS 2024 · 11 citations
- A fast algorithm to simulate nonlinear resistive networksBenjamin ScellierICML 2024 · 8 citations
- Towards training digitally-tied analog blocks via hybrid gradient computationTimothy Nest, Maxence ErnoultNeurIPS 2024 · 6 citations
- A Theoretical Framework for Inference LearningNick Alonso, Beren Millidge, Jeffrey L. Krichmar, Emre O. NeftciNeurIPS 2022 · 24 citations
- Training Neural Networks for and by InterpolationLeonard Berrada, Andrew Zisserman, M. Pawan KumarICML 2020 · 71 citations
