arrow
Return

In-memory analog computing for non-negative matrix factorization

delete2026-01-19
delete0
delete
OA
AI
S
Shiqing Wang
Y
Yubiao Luo
P
Pushen Zuo
Y
Y. B. Li
L
Lunshuai Pan
D
Daniele Ielmini
孙
孙仲 (Zhong Sun) *
DOI:10.1038/s41467-026-68609-8delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Non-negative matrix factorization (NMF) is a powerful technique for extracting latent structures from high-dimensional data, with applications spanning recommender systems, bioinformatics, and image processing. However, conventional digital hardware struggles to efficiently handle large-scale NMF due to computational complexity and memory bottlenecks. In this work, we propose an in-memory analog NMF solver based on a reconfigurable compact generalized inverse circuit, optimized using the conductance compensation principle. This circuit significantly reduces power consumption by minimizing the number of operational amplifiers while supporting various non-negative regression constraints. By integrating the alternating non-negative least squares algorithm, we achieve efficient and accurate factorization with a limited number of iterations. Experimental validation demonstrates the effectiveness of our analog NMF solver in real-world tasks, including image compression and collaborative filtering-based recommender systems, achieving high accuracy with orders-of-magnitude improvements in speed and energy efficiency over FPGA- and GPU-based digital solvers. These results highlight the potential of analog matrix computing for enabling real-time, large-scale NMF applications. The implementation of non-negative matrix factorization–a powerful technique finding hidden patterns in high-dimensional data – remains challenging due to computational complexity. Wang et al. report an in-memory analogy solver, enabling accurate factorization with fast operation at low power consumption.
Keywords:
Non-negative matrix factorization
In-memory analog computing
Generalized inverse circuit
Alternating non-negative least squares
Power-efficient computation
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Nature Communications cover
Nature Communications
IF:
15.7
Papers:
9.4W
Citations:
91.2W

Organization

P
Peking University
Scholars:
1.0W
Papers: 3.8K
Citations: 14.7W
P
politecnico di milano
Scholars:
2.0K
Papers: 901
Citations: 0
Cited Papers

Cited Papers

BlockAMC: Scalable In-Memory Analog Matrix Computing for Solving Linear Systems
err
IF0
err2024-03-25
err0
PREAI
errLunshuai Pan; Pushen Zuo; Yubiao Luo; Zhong Sun; Ru Huang
errShare
errSave
A Logic-Process Compatible RRAM with 15.43 Mb/mm2 Density and 10years@150°C retention using STI-less Dynamic-Gate and Self-Passivation Sidewall
err
IF0
err2023-12-09
err0
PREAI
errQishen Wang; Yuhang Yang; Zongwei Wang; Shengyu Bao; Jingwei Sun; Linbo Shan; Lin Bao; Yi Gao; Haisu Zhang; Yaotian Ling; Wuzhi Zhang; Yansheng Wang; Yimao Cai; Ru Huang
errShare
errSave
Performance of Two Approaches of Embedded Recommender Systems
err
err0
PREAI
errPajuelo-Holguera,Francisco; Gómez-Pulido,Juan A.; Ortega,Fernando
errShare
errSave
Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably
err2018-10-02
err0
errOAAI
errDohyung Park; Anastasios Kyrillidis; Constantine Caramanis; Sujay Sanghavi
errShare
errSave
researcher View more