Search

Energy statistics was proposed by Sz\' ekely in the 80's inspired by Newton's gravitational potential in classical mechanics and it provides a model-free hypothesis test for equality of distributions. In its original form, energy statistics was formulated in Euclidean spaces. More recently, it was generalized to metric spaces of negative type. In this paper, we consider a formulation for the clustering problem using a weighted version of energy statistics in spaces of negative type. We show that this approach leads to a quadratically constrained quadratic program in the associated kernel space, establishing connections with graph partitioning problems and kernel methods in machine learning. To find local solutions of such an optimization problem, we propose kernel k-groups, which is an extension of Hartigan's method to kernel spaces. Kernel k-groups is cheaper than spectral clustering and has the same computational cost as kernel k-means (which is based on Lloyd's heuristic) but our numerical results show an improved performance, especially in higher dimensions. Moreover, we verify the efficiency of kernel k-groups in community detection in sparse stochastic block models which has fascinating applications in several areas of science., several improvements; connections with community detection and stochastic block model. Matches published version

Since the beginning of the COVID-19 pandemic, pharmaceutical treatment hypotheses have abounded, each requiring careful evaluation. A randomized controlled trial generally provides the most credible evaluation of a treatment, but the efficiency and effectiveness of the trial depend on the existing evidence supporting the treatment. The researcher must therefore compile a body of evidence justifying the use of time and resources to further investigate a treatment hypothesis in a trial. An observational study can provide this evidence, but the lack of randomized exposure and the researcher’s inability to control treatment administration and data collection introduce significant challenges. A proper analysis of observational health care data thus requires contributions from experts in a diverse set of topics ranging from epidemiology and causal analysis to relevant medical specialties and data sources. Here we summarize these contributions as 10 rules that serve as an end-to-end introduction to retrospective pharmacoepidemiological analyses of observational health care data using a running example of a hypothetical COVID-19 study. A detailed supplement presents a practical how-to guide for following each rule. When carefully designed and properly executed, a retrospective pharmacoepidemiological analysis framed around these rules will inform the decisions of whether and how to investigate a treatment hypothesis in a randomized controlled trial. This work has important implications for any future pandemic by prescribing what we can and should do while the world waits for global vaccine distribution.

Evolution provides an important window into how cortical organization shapes function and vice versa. The complex mosaic of changes in brain morphology and functional organization that have shaped the mammalian cortex during evolution, complicates attempts to chart cortical differences across species. It limits our ability to fully appreciate how evolution has shaped our brain, especially in systems associated with unique human cognitive capabilities that lack anatomical homologues in other species. Here, we develop a function-based method for cross-species alignment that enables the quantification of homologous regions between humans and rhesus macaques, even when their location is decoupled from anatomical landmarks. Critically, we find cross-species similarity in functional organization reflects a gradient of evolutionary change that decreases from unimodal systems and culminates with the most pronounced changes in posterior regions of the default mode network (angular gyrus, posterior cingulate and middle temporal cortices). Our findings suggest that the establishment of the default mode network, as the apex of a cognitive hierarchy, has changed in a complex manner during human evolution - even within subnetworks.

Genome-wide association studies have demonstrated significant links between human brain structure and common DNA variants. Similar studies with rodents have been challenging because of smaller brain volumes. Using high field MRI (9.4 T) and compressed sensing, we have achieved microscopic resolution and sufficiently high throughput for rodent population studies. We generated whole brain structural MRI and diffusion connectomes for four diverse isogenic lines of mice (C57BL/6J, DBA/2J, CAST/EiJ, and BTBR) at spatial resolution 20,000 times higher than human connectomes. We measured narrow sense heritability (h2) I.e. the fraction of variance explained by strains in a simple ANOVA model for volumes and scalar diffusion metrics, and estimates of residual technical error for 166 regions in each hemisphere and connectivity between the regions. Volumes of discrete brain regions had the highest mean heritability (0.71 ± 0.23 SD, n = 332), followed by fractional anisotropy (0.54 ± 0.26), radial diffusivity (0.34 ± 0.022), and axial diffusivity (0.28 ± 0.19). Connection profiles were statistically different in 280 of 322 nodes across all four strains. Nearly 150 of the connection profiles were statistically different between the C57BL/6J, DBA/2J, and CAST/EiJ lines. Microscopic whole brain MRI/DTI has allowed us to identify significant heritable phenotypes in brain volume, scalar DTI metrics, and quantitative connectomes.

A common coordinate space enabling comparison across individuals is vital to understanding human brain organization and individual differences. By leveraging dimensionality reduction algorithms, high-dimensional fMRI data can be represented in a low-dimensional space to characterize individual features. Such a representative space encodes the functional architecture of individuals and enables the observation of functional changes across time. However, determining comparable functional features across individuals in resting-state fMRI in a way that simultaneously preserves individual-specific connectivity structure can be challenging. In this work we propose scalable joint embedding to simultaneously embed multiple individual brain connectomes within a common space that allows individual representations across datasets to be aligned. Using Human Connectome Project data, we evaluated the joint embedding approach by comparing it to the previously established orthonormal alignment model. Alignment using joint embedding substantially increased the similarity of functional representations across individuals while simultaneously capturing their distinct profiles, allowing individuals to be more discriminable from each other. Additionally, we demonstrated that the common space established using resting-state fMRI provides a better overlap of task-activation across participants. Finally, in a more challenging scenario - alignment across a lifespan cohort aged from 6 to 85 - joint embedding provided a better prediction of age (r2 = 0.65) than the prior alignment model. It facilitated the characterization of functional trajectories across lifespan. Overall, these analyses establish that joint embedding can simultaneously capture individual neural representations in a common connectivity space aligning functional data across participants and populations and preserve individual specificity.

Recently, deep learning has unlocked unprecedented success in various domains, especially using images, text, and speech. However, deep learning is only beneficial if the data have nonlinear relationships and if they are exploitable at available sample sizes. We systematically profiled the performance of deep, kernel, and linear models as a function of sample size on UKBiobank brain images against established machine learning references. On MNIST and Zalando Fashion, prediction accuracy consistently improves when escalating from linear models to shallow-nonlinear models, and further improves with deep-nonlinear models. In contrast, using structural or functional brain scans, simple linear models perform on par with more complex, highly parameterized models in age/sex prediction across increasing sample sizes. In sum, linear models keep improving as the sample size approaches ~10,000 subjects. Yet, nonlinearities for predicting common phenotypes from typical brain scans remain largely inaccessible to the examined kernel and deep learning methods., Schulz et al. systematically benchmark performance scaling with increasingly sophisticated prediction algorithms and with increasing sample size in reference machine-learning and biomedical datasets. Complicated nonlinear intervariable relationships remain largely inaccessible for predicting key phenotypes from typical brain scans.

Compelling evidence suggests the need for more data per individual to reliably map the functional organization of the human connectome. As the notion that ‘more data is better’ emerges as a golden rule for functional connectomics, researchers find themselves grappling with the challenges of how to obtain the desired amounts of data per participant in a practical manner, particularly for retrospective data aggregation. Increasingly, the aggregation of data across all fMRI scans available for an individual is being viewed as a solution, regardless of scan condition (e.g., rest, task, movie). A number of open questions exist regarding the aggregation process and the impact of different decisions on the reliability of resultant aggregate data. We leveraged the availability of highly sampled test-retest datasets to systematically examine the impact of data aggregation strategies on the reliability of cortical functional connectomics. Specifically, we compared functional connectivity estimates derived after concatenating from: 1) multiple scans under the same state, 2) multiple scans under different states (i.e. hybrid or general functional connectivity), and 3) subsets of one long scan. We also varied connectivity processing (i.e. global signal regression, ICA-FIX, and task regression) and estimation procedures. When the total number of time points is equal, and the scan state held constant, concatenating multiple shorter scans had a clear advantage over a single long scan. However, this was not necessarily true when concatenating across different fMRI states (i.e. task conditions), where the reliability from the aggregate data varied across states. Concatenating fewer numbers of states that are more reliable tends to yield higher reliability. Our findings provide an overview of multiple dependencies of data concatenation that should be considered to optimize reliability in analysis of functional connectivity data.

The mortality of Coronavirus disease 2019 (COVID-19) appears to be driven by acute respiratory distress syndrome (ARDS) and a dysregulated immune response to SARS-CoV-2. Emerging evidence suggests that a subset of COVID-19 is characterized by the development of a cytokine storm syndrome (CSS), and interleukin (IL)-6 levels are predictors of COVID-19 severity and in-hospital mortality. Targeting hyper-inflammation in COVID-19 may be critical for reducing mortality. Catecholamines enhance inflammatory injury by augmenting the production of IL-6 and other cytokines through a self-amplifying feed-forward loop in immune cells that requires alpha-1 adrenergic receptor (α1-AR) signaling. Prophylactic inhibition of catecholamine synthesis with the α1-AR antagonist prazosin reduced catecholamines and cytokine responses in mice, and resulted in markedly increased survival following various hyper-inflammatory stimuli. These findings offer a rationale for studying α1-AR antagonists in the prophylaxis of patients with COVID-19-CSS and ARDS. As high infection rates threaten to overwhelm hospital capacity during this pandemic, preventative approaches that ameliorate COVID-19 severity and reduce excessive mortality are desperately needed. We hypothesize that treatment with prazosin of individuals who test positive for SARS-CoV-2 could reduce catecholamine surges, secondary cytokine dysregulation, and mortality. To investigate a potential role for α1-AR antagonists in preventing poor outcomes in ARDS, we conducted a retrospective analysis of hospitalized patients diagnosed with ARDS. Using data from the Truven Health MarketScan Research Database (2010-2017), we identified 13,125 men (age 45-64) with ARDS, of whom 655 patients (5.0%) were prescribed α1-AR antagonists in the previous year. Applying logistic regression models, we found that patients with prior use of α1-AR antagonists had lower odds of invasive mechanical ventilation compared to non-users (adjusted OR=0.75, 95% CI 0.59-0.95, p=0.019). Perhaps more importantly, those patients had a ~36% lower incidence of both being ventilated and dying in the hospital (adjusted OR=0.59, 95% CI 0.34-0.95, p=0.042). By contrast, prior use of beta-adrenergic receptor (β-AR) antagonists was not correlated with either outcome. We extended these analyses to patients admitted with pneumonia. Of 108,956 subjects in this cohort, 5,498 patients (5.0%) were taking α1-AR antagonist. Similar to ARDS, patients with pneumonia on α1-AR antagonists (but no β-AR antagonists) had a lower odds of mechanical ventilation (adjusted OR=0.83, 95% CI 0.75-0.92, p

Elucidating how synaptic molecules such as AMPA receptors mediate neuronal communication and tracking their dynamic expression during behavior is crucial to understand cognition and disease, but current technological barriers preclude large-scale exploration of molecular dynamics in vivo. We have developed a suite of innovative methodologies that break through these barriers: a new knockin mouse line with fluorescently tagged endogenous AMPA receptors, two-photon imaging of hundreds of thousands of labeled synapses in behaving mice, and computer-vision-based automatic synapse detection. Using these tools, we can longitudinally track how the strength of synapses changes during behavior. We used this approach to generate an unprecedentedly detailed spatiotemporal map of synaptic plasticity underlying sensory experience. More generally, these tools can be used as an optical probe capable of measuring functional synapse strength across entire brain areas during any behavioral paradigm, describing complex system-wide changes with molecular precision.

In recent years, deep learning has unlocked unprecedented success in various domains, especially in image, text, and speech processing. These breakthroughs may hold promise for neuroscience and especially for brain-imaging investigators who start to analyze thousands of participants. However, deep learning is only beneficial if the data have nonlinear relationships and if they are exploitable at currently available sample sizes.We systematically profiled the performance of deep models, kernel models, and linear models as a function of sample size on UK Biobank brain images against established machine learning references. On MNIST and Zalando Fashion, prediction accuracy consistently improved when escalating from linear models to shallow-nonlinear models, and further improved when switching to deep-nonlinear models. The more observations were available for model training, the greater the performance gain we saw. In contrast, using structural or functional brain scans, simple linear models performed on par with more complex, highly parameterized models in age/sex prediction across increasing samplesizes. In fact, linear models kept improving as the sample size approached ~10,000 participants. Our results indicate that the increase in performance of linear models with additional data does not saturate at the limit of current feasibility. Yet, nonlinearities of common brain scans remain largely inaccessible to both kernel and deep learning methods at any axemined scale

Wearable devices provide a means of tracking hand position in relation to the head, but have mostly relied on wrist-worn inertial measurement unit sensors and proximity sensors, which are inadequate for identifying specific locations. This limits their utility for accurate and precise monitoring of behaviors or providing feedback to guide behaviors. A potential clinical application is monitoring body-focused repetitive behaviors (BFRBs), recurrent, injurious behaviors directed toward the body, such as nail biting and hair pulling, which are often misdiagnosed and undertreated. Here, we demonstrate that including thermal sensors achieves higher accuracy in position tracking when compared against inertial measurement unit and proximity sensor data alone. Our Tingle device distinguished between behaviors from six locations on the head across 39 adult participants, with high AUROC values (best was back of the head: median (1.0), median absolute deviation (0.0); worst was on the cheek: median (0.93), median absolute deviation (0.09)). This study presents preliminary evidence of the advantage of including thermal sensors for position tracking and the Tingle wearable device’s potential use in a wide variety of settings, including BFRB diagnosis and management.

Multiphoton imaging of genetically encoded calcium indicators is routinely used to report activity from populations of spatially resolved neurons in vivo. However, since the relationship between fluorescence and action potentials (APs) is nonlinear and varies over neurons, quantitatively inferring AP discharge is problematic. To address this we developed a biophysical model of calcium binding kinetics for the indicator GCaMP6s that accurately describes AP-evoked fluorescence changes in vivo. The model's physical interpretation allowed the same parameters to describe GCaMP6s binding kinetics for both in vitro binding assays and in vivo imaging. Using this model, we developed an algorithm to infer APs from fluorescence and measured its accuracy with cell-attached electrical recordings. This approach consistently inferred more accurate AP counts and times than alternative methods for firing rates from 0 to >20 Hz, while requiring less training data. These results demonstrate the utility of quantitative, biophysically grounded models for complex biological data.

Background: Surgical removal of malignancies may enhance the risk of recurrence but mechanisms remain poorly understood. Neutrophils, first line responders after surgical stress, can facilitate cancer progression. Neutrophils can expel nuclear DNA studded with proteins to form web-like structures known as Neutrophil Extracellular Traps (NETs) in response to stress. Here we aim to characterize the role of NETs in promoting metastatic cancer growth after surgical stress that is currently entirely unknown. Methods: We used a standardized mouse model of partial hepatic ischemia reperfusion, to stimulate surgical stress, directly or five days after splenic injection of MC38 colon carcinoma cells. Results: We found that NET formation is significantly increased in the immediate post-operative period in humans undergoing curative liver resection for colorectal cancer metastases. The risk of liver metastases recurrence was 4.22 times higher in patients with increased post-operative NET formation. In the murine model, we demonstrated increased NET deposition after surgical stress and this was associated with both increased formation of metastases and growth of already established micrometastatic disease. In vitro, NETs increase growth, invasion, migration and adhesion in multiple cancer cell lines. All the above effects were abrogated by NET inhibition with DNAse. NETs exert their pro-tumorigenic effects by releasing HMGB1 and activating TLR-9 dependent pathways in the cancer cells. In addition, as metastatic tumors continue to grow, hypoxia within the tumor microenvironment induces further neutrophil recruitment and NET formation that further accelerates tumor growth. Conclusions: These findings implicate NETs in the process of cancer metastasis progression and recurrence after surgery and identifies NETs as potential therapeutic targets. Citation Format: Samer Tohme, Hai Huang, Alexis Chidi, Richard Simmons, Allan Tsung. The role of neutrophil extracellular traps in promoting metastatic cancer following surgical stress. [abstract]. In: Proceedings of the AACR Special Conference on Tumor Metastasis; 2015 Nov 30-Dec 3; Austin, TX. Philadelphia (PA): AACR; Cancer Res 2016;76(7 Suppl):Abstract nr A30.

SEEK and you may find cancer earlier Many cancers can be cured by surgery and/or systemic therapies when detected before they have metastasized. This clinical reality, coupled with the growing appreciation that cancer's rapid genetic evolution limits its response to drugs, have fueled interest in methodologies for earlier detection of the disease. Cohen et al. developed a noninvasive blood test, called CancerSEEK that can detect eight common human cancer types (see the Perspective by Kalinich and Haber). The test assesses eight circulating protein biomarkers and tumor-specific mutations in circulating DNA. In a study of 1000 patients previously diagnosed with cancer and 850 healthy control individuals, CancerSEEK detected cancer with a sensitivity of 69 to 98% (depending on cancer type) and 99% specificity. Science , this issue p. 926 ; see also p. 866

k-means is one of the most influential and utilized machine learning algorithms. Its computation limits the performance and scalability of many statistical analysis and machine learning tasks. We rethink and optimize k-means in terms of modern NUMA architectures to develop a novel parallelization scheme that delays and minimizes synchronization barriers. The \textit{k-means NUMA Optimized Routine} (\textsf{knor}) library has (i) in-memory (\textsf{knori}), (ii) distributed memory (\textsf{knord}), and (iii) semi-external memory (\textsf{knors}) modules that radically improve the performance of k-means for varying memory and hardware budgets. \textsf{knori} boosts performance for single machine datasets by an order of magnitude or more. \textsf{knors} improves the scalability of k-means on a memory budget using SSDs. \textsf{knors} scales to billions of points on a single machine, using a fraction of the resources that distributed in-memory systems require. \textsf{knord} retains \textsf{knori}'s performance characteristics, while scaling in-memory through distributed computation in the cloud. \textsf{knor} modifies Elkan's triangle inequality pruning algorithm such that we utilize it on billion-point datasets without the significant memory overhead of the original algorithm. We demonstrate \textsf{knor} outperforms distributed commercial products like H$_2$O, Turi (formerly Dato, GraphLab) and Spark's MLlib by more than an order of magnitude for datasets of $10^7$ to $10^9$ points.

Sparse matrix multiplication is traditionally performed in memory and scales to large matrices using the distributed memory of multiple nodes. In contrast, we scale sparse matrix multiplication beyond memory capacity by implementing sparse matrix dense matrix multiplication (SpMM) in a semi-external memory (SEM) fashion; i.e., we keep the sparse matrix on commodity SSDs and dense matrices in memory. Our SEM-SpMM incorporates many in-memory optimizations for large power-law graphs. It outperforms the in-memory implementations of Trilinos and Intel MKL and scales to billion-node graphs, far beyond the limitations of memory. Furthermore, on a single large parallel machine, our SEM-SpMM operates as fast as the distributed implementations of Trilinos using five times as much processing power. We also run our implementation in memory (IM-SpMM) to quantify the overhead of keeping data on SSDs. SEM-SpMM achieves almost 100% performance of IM-SpMM on graphs when the dense matrix has more than four columns; it achieves at least 65% performance of IM-SpMM on all inputs. We apply our SpMM to three important data analysis tasks--PageRank, eigensolving, and non-negative matrix factorization--and show that our SEM implementations significantly advance the state of the art., published in IEEE Transactions on Parallel and Distributed Systems

Neuronal responses during sensory processing are influenced by both the organization of intracortical connections and the statistical features of sensory stimuli. How these intrinsic and extrinsic factors govern the activity of excitatory and inhibitory populations is unclear. Using two-photon calcium imaging in vivo and intracellular recordings in vitro, we investigated the dependencies between synaptic connectivity, feature selectivity and network activity in pyramidal cells and fast-spiking parvalbumin-expressing (PV) interneurons in mouse visual cortex. In pyramidal cell populations, patterns of neuronal correlations were largely stimulus-dependent, indicating that their responses were not strongly dominated by functionally biased recurrent connectivity. By contrast, visual stimulation only weakly modified co-activation patterns of fast-spiking PV cells, consistent with the observation that these broadly tuned interneurons received very dense and strong synaptic input from nearby pyramidal cells with diverse feature selectivities. Therefore, feedforward and recurrent network influences determine the activity of excitatory and inhibitory ensembles in fundamentally different ways.

Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs), we find that it efficiently achieves performance.

A major question in neuroscience is how diverse subsets of synaptic connections in neural circuits are affected by experience dependent plasticity to form the basis for behavioral learning and memory. Differences in protein expression patterns at individual synapses could constitute a key to understanding both synaptic diversity and the effects of plasticity at different synapse populations. Our approach to this question leverages the immunohistochemical multiplexing capability of array tomography (ATomo) and the columnar organization of mouse barrel cortex to create a dataset comprising high resolution volumetric images of spared and deprived cortical whisker barrels stained for over a dozen synaptic molecules each. These dataset has been made available through the Open Connectome Project for interactive online viewing, and may also be downloaded for offline analysis using web, Matlab, and other interfaces.

Graph matching---aligning a pair of graphs to minimize their edge disagreements---has received wide-spread attention from both theoretical and applied communities over the past several decades, including combinatorics, computer vision, and connectomics. Its attention can be partially attributed to its computational difficulty. Although many heuristics have previously been proposed in the literature to approximately solve graph matching, very few have any theoretical support for their performance. A common technique is to relax the discrete problem to a continuous problem, therefore enabling practitioners to bring gradient-descent-type algorithms to bear. We prove that an indefinite relaxation (when solved exactly) almost always discovers the optimal permutation, while a common convex relaxation almost always fails to discover the optimal permutation. These theoretical results suggest that initializing the indefinite algorithm with the convex optimum might yield improved practical performance. Indeed, experimental results illuminate and corroborate these theoretical findings, demonstrating that excellent results are achieved in both benchmark and real data problems by amalgamating the two approaches., 14 pages, 11 figures, 3 tables

Currently, connectomes (e.g., functional or structural brain graphs) can be estimated in humans at $\approx 1~mm^3$ scale using a combination of diffusion weighted magnetic resonance imaging, functional magnetic resonance imaging and structural magnetic resonance imaging scans. This manuscript summarizes a novel, scalable implementation of open-source algorithms to rapidly estimate magnetic resonance connectomes, using both anatomical regions of interest (ROIs) and voxel-size vertices. To assess the reliability of our pipeline, we develop a novel nonparametric non-Euclidean reliability metric. Here we provide an overview of the methods used, demonstrate our implementation, and discuss available user extensions. We conclude with results showing the efficacy and reliability of the pipeline over previous state-of-the-art., Published as part of 2013 IEEE GlobalSIP conference

The preservation of our cultural heritage is of paramount importance. Thanks to recent developments in digital acquisition techniques, powerful image analysis algorithms are developed which can be useful non-invasive tools to assist in the restoration and preservation of art. In this paper we propose a semi-supervised crack detection method that can be used for high-dimensional acquisitions of paintings coming from different modalities. Our dataset consists of a recently acquired collection of images of the Ghent Altarpiece (1432), one of Northern Europe's most important art masterpieces. Our goal is to build a classifier that is able to discern crack pixels from the background consisting of non-crack pixels, making optimal use of the information that is provided by each modality. To accomplish this we employ a recently developed non-parametric Bayesian classifier, that uses tensor factorizations to characterize any conditional probability. A prior is placed on the parameters of the factorization such that every possible interaction between predictors is allowed while still identifying a sparse subset among these predictors. The proposed Bayesian classifier, which we will refer to as conditional Bayesian tensor factorization or CBTF, is assessed by visually comparing classification results with the Random Forest (RF) algorithm., 8 pages, double column

We demonstrate a meaningful prospective power analysis for an (admittedly idealized) illustrative connectome inference task. Modeling neurons as vertices and synapses as edges in a simple random graph model, we optimize the trade-off between the number of (putative) edges identified and the accuracy of the edge identification procedure. We conclude that explicit analysis of the quantity/quality trade-off is imperative for optimal neuroscientific experimental design. In particular, more though more errorful edge identification can yield superior inferential performance., 8 pages, 1 figure

Deducing the structure of neural circuits is one of the central problems of modern neuroscience. Recently-introduced calcium fluorescent imaging methods permit experimentalists to observe network activity in large populations of neurons, but these techniques provide only indirect observations of neural spike trains, with limited time resolution and signal quality. In this work we present a Bayesian approach for inferring neural circuitry given this type of imaging data. We model the network activity in terms of a collection of coupled hidden Markov chains, with each chain corresponding to a single neuron in the network and the coupling between the chains reflecting the network's connectivity matrix. We derive a Monte Carlo Expectation--Maximization algorithm for fitting the model parameters; to obtain the sufficient statistics in a computationally-efficient manner, we introduce a specialized blockwise-Gibbs algorithm for sampling from the joint activity of all observed neurons given the observed fluorescence data. We perform large-scale simulations of randomly connected neuronal networks with biophysically realistic parameters and find that the proposed methods can accurately infer the connectivity in these networks given reasonable experimental and computational constraints. In addition, the estimation accuracy may be improved significantly by incorporating prior knowledge about the sparseness of connectivity in the network, via standard L$_1$ penalization methods., Published in at http://dx.doi.org/10.1214/09-AOAS303 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org)

The revolution in neuroscientific data acquisition is creating an analysis challenge. We propose leveraging cloud-computing technologies to enable large-scale neurodata storing, exploring, analyzing, and modeling. This utility will empower scientists globally to generate and test theories of brain function and dysfunction.

As recent advances in calcium sensing technologies facilitate simultaneously imaging action potentials in neuronal populations, complementary analytical tools must also be developed to maximize the utility of this experimental paradigm. Although the observations here are fluorescence movies, the signals of interest--spike trains and/or time varying intracellular calcium concentrations--are hidden. Inferring these hidden signals is often problematic due to noise, nonlinearities, slow imaging rate, and unknown biophysical parameters. We overcome these difficulties by developing sequential Monte Carlo methods (particle filters) based on biophysical models of spiking, calcium dynamics, and fluorescence. We show that even in simple cases, the particle filters outperform the optimal linear (i.e., Wiener) filter, both by obtaining better estimates and by providing error bars. We then relax a number of our model assumptions to incorporate nonlinear saturation of the fluorescence signal, as well external stimulus and spike history dependence (e.g., refractoriness) of the spike trains. Using both simulations and in vitro fluorescence observations, we demonstrate temporal superresolution by inferring when within a frame each spike occurs. Furthermore, the model parameters may be estimated using expectation maximization with only a very limited amount of data (e.g., approximately 5-10 s or 5-40 spikes), without the requirement of any simultaneous electrophysiology or imaging experiments.

SummaryWe describe automated technologies to probe the structure of neural tissue at nanometer resolution and use them to generate a saturated reconstruction of a sub-volume of mouse neocortex in which all cellular objects (axons, dendrites, and glia) and many sub-cellular components (synapses, synaptic vesicles, spines, spine apparati, postsynaptic densities, and mitochondria) are rendered and itemized in a database. We explore these data to study physical properties of brain tissue. For example, by tracing the trajectories of all excitatory axons and noting their juxtapositions, both synaptic and non-synaptic, with every dendritic spine we refute the idea that physical proximity is sufficient to predict synaptic connectivity (the so-called Peters’ rule). This online minable database provides general access to the intrinsic complexity of the neocortex and enables further data-driven inquiries.Video Abstract