While it is universally acknowledged that both bottom up and top down factors contribute to allocation of gaze, we currently have limited understanding of how top-down factors determine gaze choices in the context of ongoing natural behavior. One purely top-down model by Sprague, Ballard, and Robinson (2007) suggests that natural behaviors can be understood in terms of simple component behaviors, or modules, that are executed according to their reward value, with gaze targets chosen in order to reduce uncertainty about the particular world state needed to execute those behaviors. We explore the plausibility of the central claims of this approach in the context of a task where subjects walk through a virtual environment performing interceptions, avoidance, and path following. Many aspects of both walking direction choices and gaze allocation are consistent with this approach. Subjects use gaze to reduce uncertainty for task-relevant information that is used to inform action choices. Notably the addition of motion to peripheral objects did not affect fixations when the objects were irrelevant to the task, suggesting that stimulus saliency was not a major factor in gaze allocation. The modular approach of independent component behaviors is consistent with the main aspects of performance, but there were a number of deviations suggesting that modules interact. Thus the model forms a useful, but incomplete, starting point for understanding top-down factors in active behavior.

First spike latency has been suggested as a source of the information required for fast discrimination tasks. However, the accuracy of such a mechanism has not been analyzed rigorously. Here, we investigate the utility of first spike latency for encoding information about the location of a sound source, based on the responses of inferior colliculus (IC) neurons in the guinea pig to interaural phase differences (IPDs). First spike latencies of many cells in the guinea pig IC show unimodal tuning to stimulus IPD. We investigated the discrimination accuracy of a simple latency code that estimates stimulus IPD from the preferred IPD of the single cell that fired first. Surprisingly, despite being based on only a single spike, the accuracy of the latency code is comparable to that of a conventional rate code computed over the entire response. We show that spontaneous firing limits the capacity of the latency code to accumulate information from large neural populations. This detrimental effect can be overcome by generalizing the latency code to estimate the stimulus IPD from the preferred IPDs of the population of cells that fired the first n spikes. In addition, we show that a good estimate of the neural response time to the stimulus, which can be obtained from the responses of the cells whose response latency is invariant to stimulus identity, limits the detrimental effect of spontaneous firing. Thus, a latency code may provide great improvement in response speed at a small cost to the accuracy of the decision.

SummaryHumans have elegant bodies that allow gymnastics, piano playing, and tool use, but understanding how they do this in detail is difficult because their musculoskeletal systems are extremely complicated. Previous studies have shown that common movements such as reaching for a coffee cup, cycling a bicycle, or playing the piano have common patterns across subjects. This paper shows that an arbitrary set of whole-body movements used to trace large closed curves have common patterns both in the trajectory of the body's limbs and in variations within those trajectories. The commonality of the result should spur the search for explanations for its generality. One such principle could be that humans choose trajectories that are economical in energetic cost. Another synergistic possibility is that common movements can be saved in segments that can be combined to facilitate the process of deployment.

It has been suggested that the considerable noise in single-cell responses to a stimulus can be overcome by pooling information from a large population. Theoretical studies indicated that correlations in trial-to-trial fluctuations in the responses of different neurons may limit the improvement due to pooling. Subsequent theoretical studies have suggested that inherent neuronal diversity, i.e., the heterogeneity of tuning curves and other response properties of neurons preferentially tuned to the same stimulus, can provide a means to overcome this limit. Here we study the effect of spike-count correlations and the inherent neuronal heterogeneity on the ability to extract information from large neural populations. We use electrophysiological data from the guinea pig Inferior-Colliculus to capture inherent neuronal heterogeneity and single cell statistics, and introduce response correlations artificially. To this end, we generate pseudo-population responses, based on single-cell recording of neurons responding to auditory stimuli with varying binaural correlations. Typically, when pseudo-populations are generated from single cell data, the responses within the population are statistically independent. As a result, the information content of the population will increase indefinitely with its size. In contrast, here we apply a simple algorithm that enables us to generate pseudo-population responses with variable spike-count correlations. This enables us to study the effect of neuronal correlations on the accuracy of conventional rate codes. We show that in a homogenous population, in the presence of even low-level correlations, information content is bounded. In contrast, utilizing a simple linear readout, that takes into account the natural heterogeneity, even of neurons preferentially tuned to the same stimulus, within the neural population, one can overcome the correlated noise and obtain a readout whose accuracy grows linearly with the size of the population.

Response latency has been suggested as a possible source of information in the central nervous system when fast decisions are required. The accuracy of latency codes was studied in the past using a simplified readout algorithm termed the temporal-winner-take-all (tWTA). The tWTA is a competitive readout algorithm in which populations of neurons with a similar decision preference compete, and the algorithm selects according to the preference of the population that reaches the decision threshold first. It has been shown that this algorithm can account for accurate decisions among a small number of alternatives during short biologically relevant time periods. However, one of the major points of criticism of latency codes has been that it is unclear how can such a readout be implemented by the central nervous system. Here we show that the solution to this long standing puzzle may be rather simple. We suggest a mechanism that is based on reciprocal inhibition architecture, similar to that of the conventional winner-take-all, and show that under a wide range of parameters this mechanism is sufficient to implement the tWTA algorithm. This is done by first analyzing a rate toy model, and demonstrating its ability to discriminate short latency differences between its inputs. We then study the sensitivity of this mechanism to fine-tuning of its initial conditions, and show that it is robust to wide range of noise levels in the initial conditions. These results are then generalized to a Hodgkin-Huxley type of neuron model, using numerical simulations. Latency codes have been criticized for requiring a reliable stimulus-onset detection mechanism as a reference for measuring latency. Here we show that this frequent assumption does not hold, and that, an additional onset estimator is not needed to trigger this simple tWTA mechanism.