paper-with-me

홈 › Papers

Neural Reconstruction with Approximate Message Passing (NeuRAMP)

2011-12-01 · NeurIPS 2011 12 · Alyson K. Fletcher, Sundeep Rangan, Lav R. Varshney, Aniruddha Bhargava

Many functional descriptions of spiking neurons assume a cascade structure where inputs are passed through an initial linear filtering stage that produces a low-dimensional signal that drives subsequent nonlinear stages. This paper presents a novel and systematic parameter estimation procedure for such models and applies the method to two neural estimation problems: (i) compressed-sensing based neural mapping from multi-neuron excitation, and (ii) estimation of neural receptive yields in sensory neurons. The proposed estimation algorithm models the neurons via a graphical model and then estimates the parameters in the model using a recently-developed generalized approximate message passing (GAMP) method. The GAMP method is based on Gaussian approximations of loopy belief propagation. In the neural connectivity problem, the GAMP-based method is shown to be computational efficient, provides a more exact modeling of the sparsity, can incorporate nonlinearities in the output and significantly outperforms previous compressed-sensing methods. For the receptive field estimation, the GAMP method can also exploit inherent structured sparsity in the linear weights. The method is validated on estimation of linear nonlinear Poisson (LNP) cascade models for receptive fields of salamander retinal ganglion cells.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

compressed sensingparameter estimation

Similar Papers 제목 키워드 기반

Low-rank matrix reconstruction and clustering via approximate message passing

2013-12-01 · NeurIPS 2013 12 · Ryosuke Matsushita, Toshiyuki Tanaka

We study the problem of reconstructing low-rank matrices from their noisy observations. We formulate the problem in the Bayesian framework, which allows us to exploit structural properties of matrices in addition to low-…

Bayesian InferenceClustering

Tree-AMP: Compositional Inference with Tree Approximate Message Passing

2020-04-03 · Antoine Baker, Benjamin Aubin, Florent Krzakala, Lenka Zdeborová

We introduce Tree-AMP, standing for Tree Approximate Message Passing, a python package for compositional inference in high-dimensional tree-structured models. The package provides a unifying framework to study several ap…

Large-Scale Bayesian Tensor Reconstruction: An Approximate Message Passing Solution

2025-05-22 · Bingyang Cheng, Zhongtao Chen, Yichen Jin, Hao Zhang 외

Tensor CANDECOMP/PARAFAC decomposition (CPD) is a fundamental model for tensor reconstruction. Although the Bayesian framework allows for principled uncertainty quantification and automatic hyperparameter learning, exist…

Uncertainty Quantification

Approximate Message Passing with Restricted Boltzmann Machine Priors

2015-02-23 · Eric W. Tramel, Angélique Drémeau, Florent Krzakala

Approximate Message Passing (AMP) has been shown to be an excellent statistical approach to signal inference and compressed sensing problem. The AMP framework provides modularity in the choice of signal prior; here we pr…

compressed sensing

Approximate message-passing for convex optimization with non-separable penalties

2018-09-17 · Andre Manoel, Florent Krzakala, Gaël Varoquaux, Bertrand Thirion 외

We introduce an iterative optimization scheme for convex objectives consisting of a linear loss and a non-separable penalty, based on the expectation-consistent approximation and the vector approximate message-passing (V…