Incremental Mutual Information: A New Method for Characterizing the Strength and Dynamics of Connections in Neuronal Circuits

Understanding the computations performed by neuronal circuits requires characterizing the strength and dynamics of the connections between individual neurons. This characterization is typically achieved by measuring the correlation in the activity of two neurons. We have developed a new measure for studying connectivity in neuronal circuits based on information theory, the incremental mutual information (IMI). By conditioning out the temporal dependencies in the responses of individual neurons before measuring the dependency between them, IMI improves on standard correlation-based measures in several important ways: 1) it has the potential to disambiguate statistical dependencies that reflect the connection between neurons from those caused by other sources (e. g. shared inputs or intrinsic cellular or network mechanisms) provided that the dependencies have appropriate timescales, 2) for the study of early sensory systems, it does not require responses to repeated trials of identical stimulation, and 3) it does not assume that the connection between neurons is linear. We describe the theory and implementation of IMI in detail and demonstrate its utility on experimental recordings from the primate visual system

Quantifying dimensionality: Bayesian cosmological model complexities

We demonstrate a measure for the effective number of parameters constrained by a posterior distribution in the context of cosmology. In the same way that the mean of the Shannon information (i.e. the Kullback-Leibler divergence) provides a measure of the strength of constraint between prior and posterior, we show that the variance of the Shannon information gives a measure of dimensionality of constraint. We examine this quantity in a cosmological context, applying it to likelihoods derived from Cosmic Microwave Background, large scale structure and supernovae data. We show that this measure of Bayesian model dimensionality compares favourably both analytically and numerically in a cosmological context with the existing measure of model complexity used in the literature.Comment: 14 pages, 9 figures. v2: updates post peer-review. v3: typographical correction to equation 3

Similarity Search Over Graphs Using Localized Spectral Analysis

This paper provides a new similarity detection algorithm. Given an input set of multi-dimensional data points, where each data point is assumed to be multi-dimensional, and an additional reference data point for similarity finding, the algorithm uses kernel method that embeds the data points into a low dimensional manifold. Unlike other kernel methods, which consider the entire data for the embedding, our method selects a specific set of kernel eigenvectors. The eigenvectors are chosen to separate between the data points and the reference data point so that similar data points can be easily identified as being distinct from most of the members in the dataset.Comment: Published in SampTA 201

Retrieval of Leaf Area Index (LAI) and Soil Water Content (WC) Using Hyperspectral Remote Sensing under Controlled Glass House Conditions for Spring Barley and Sugar Beet

Leaf area index (LAI) and water content (WC) in the root zone are two major hydro-meteorological parameters that exhibit a dominant control on water, energy and carbon fluxes, and are therefore important for any regional eco-hydrological or climatological study. To investigate the potential for retrieving these parameter from hyperspectral remote sensing, we have investigated plant spectral reflectance (400-2,500 nm, ASD FieldSpec3) for two major agricultural crops (sugar beet and spring barley) in the mid-latitudes, treated under different water and nitrogen (N) conditions in a greenhouse experiment over the growing period of 2008. Along with the spectral response, we have measured soil water content and LAI for 15 intensive measurement campaigns spread over the growing season and could demonstrate a significant response of plant reflectance characteristics to variations in water content and nutrient conditions. Linear and non-linear dimensionality analysis suggests that the full band reflectance information is well represented by the set of 28 vegetation spectral indices (SI) and most of the variance is explained by three to a maximum of eight variables. Investigation of linear dependencies between LAI and soil WC and pre-selected SI's indicate that: (1) linear regression using single SI is not sufficient to describe plant/soil variables over the range of experimental conditions, however, some improvement can be seen knowing crop species beforehand; (2) the improvement is superior when applying multiple linear regression using three explanatory SI's approach. In addition to linear investigations, we applied the non-linear CART (Classification and Regression Trees) technique, which finally did not show the potential for any improvement in the retrieval process

Tangent space estimation for smooth embeddings of Riemannian manifolds

Numerous dimensionality reduction problems in data analysis involve the recovery of low-dimensional models or the learning of manifolds underlying sets of data. Many manifold learning methods require the estimation of the tangent space of the manifold at a point from locally available data samples. Local sampling conditions such as (i) the size of the neighborhood (sampling width) and (ii) the number of samples in the neighborhood (sampling density) affect the performance of learning algorithms. In this work, we propose a theoretical analysis of local sampling conditions for the estimation of the tangent space at a point P lying on a m-dimensional Riemannian manifold S in R^n. Assuming a smooth embedding of S in R^n, we estimate the tangent space T_P S by performing a Principal Component Analysis (PCA) on points sampled from the neighborhood of P on S. Our analysis explicitly takes into account the second order properties of the manifold at P, namely the principal curvatures as well as the higher order terms. We consider a random sampling framework and leverage recent results from random matrix theory to derive conditions on the sampling width and the local sampling density for an accurate estimation of tangent subspaces. We measure the estimation accuracy by the angle between the estimated tangent space and the true tangent space T_P S and we give conditions for this angle to be bounded with high probability. In particular, we observe that the local sampling conditions are highly dependent on the correlation between the components in the second-order local approximation of the manifold. We finally provide numerical simulations to validate our theoretical findings