Abstract

New neuroscience technologies have led to massive functional neuronal data sets that hold promise for better understanding large populations of neurons and how the brain works. At the same time, the fact that a huge amount of neurons in the brain cannot be recorded simultaneously calls for novel statistical and machine learning methodologies. In particular, many neuronal activity data sets consist of multiple recordings of different subsets of neurons, when the same external stimulus is presented. In this paper, we focus on imputing this type of data set by modeling it as a noisy low-rank tensor completion problem with block-wise measurements. We propose a novel method consisting of a matrix completion algorithm for its unfolding and a further refinement based on gradient descent for the squared loss of low-rank Tucker decomposition. The output of our algorithm can be applied in many downstream data analysis tasks such as learning the functional neuronal connectivity. We provide simulations and real data experiments to validate our method and demonstrate its potential in terms of both low imputation errors and accurate graph estimation when applying it to adjust for the effect of external stimulus on neuronal activities.