paper-with-me

홈 › Papers

Memory AMP

2020-12-20 · Lei Liu, Shunqi Huang, Brian M. Kurkoski

Approximate message passing (AMP) is a low-cost iterative parameter-estimation technique for certain high-dimensional linear systems with non-Gaussian distributions. AMP only applies to independent identically distributed (IID) transform matrices, but may become unreliable (e.g., perform poorly or even diverge) for other matrix ensembles, especially for ill-conditioned ones. To solve this issue, orthogonal/vector AMP (OAMP/VAMP) was proposed for general right-unitarily-invariant matrices. However, the Bayes-optimal OAMP/VAMP (BO-OAMP/VAMP) requires a high-complexity linear minimum mean square error (MMSE) estimator. This prevents OAMP/VAMP from being used in large-scale systems. To address the drawbacks of AMP and BO-OAMP/VAMP, this paper offers a memory AMP (MAMP) framework based on the orthogonality principle, which ensures that estimation errors in MAMP are asymptotically IID Gaussian. To realize the required orthogonality for MAMP, we provide an orthogonalization procedure for the local memory estimators. In addition, we propose a Bayes-optimal MAMP (BO-MAMP), in which a long-memory matched filter is used for interference suppression. The complexity of BO-MAMP is comparable to AMP. To asymptotically characterize the performance of BO-MAMP, a state evolution is derived. The relaxation parameters and damping vector in BO-MAMP are optimized based on state evolution. Most crucially, the state evolution of the optimized BO-MAMP converges to the same fixed point as that of the high-complexity BO-OAMP/VAMP for all right-unitarily-invariant matrices, and achieves the Bayes optimal MSE predicted by the replica method if its state evolution has a unique fixed point. Finally, simulations are provided to verify the theoretical results' validity and accuracy.

📄 PDF Abstract BibTeX arXiv:2012.10861

Code (2)

Lei-IT/MAMP 공식 구현
Lei-IT/GMAMP

Tasks

Denoisingparameter estimation

Similar Papers 제목 키워드 기반

Pinpointing the Memory Behaviors of DNN Training

2021-04-01 · Jiansong Li, Xiao Dong, Guangli Li, Peng Zhao 외

The training of deep neural networks (DNNs) is usually memory-hungry due to the limited device memory capacity of DNN accelerators. Characterizing the memory behaviors of DNN training is critical to optimize the device m…

GPU

A Dual Memory Structure for Efficient Use of Replay Memory in Deep Reinforcement Learning

2019-07-15 · Wonshick Ko, Dong Eui Chang

In this paper, we propose a dual memory structure for reinforcement learning algorithms with replay memory. The dual memory consists of a main memory that stores various data and a cache memory that manages the data and …

Deep Reinforcement LearningOpenAI Gymreinforcement-learningReinforcement Learning+1

Concept of dynamic memory in economics

2017-12-25

In this paper we discuss a concept of dynamic memory and an application of fractional calculus to describe the dynamic memory. The concept of memory is considered from the standpoint of economic models in the framework o…

Hardware-software co-exploration with racetrack memory based in-memory computing for CNN inference in embedded systems

2025-07-02 · Benjamin Chen Ming Choong, Tao Luo, Cheng Liu, Bingsheng He 외 arxiv

Deep neural networks generate and process large volumes of data, posing challenges for low-resource embedded systems. In-memory computing has been demonstrated as an efficient computing infrastructure and shows promise f…

Predicting the Transition from Short-term to Long-term Memory based on Deep Neural Network

2020-12-07 · Gi-Hwan Shin, Young-Seok Kweon, Minji Lee

Memory is an essential element in people's daily life based on experience. So far, many studies have analyzed electroencephalogram (EEG) signals at encoding to predict later remembered items, but few studies have predict…

EEGElectroencephalogram (EEG)Retrieval