Saccades and drifts differentially modulate neuronal activity in V1: Effects of retinal image motion, position, and extraretinal influences

In natural vision, continuously changing input is generated by fast saccadic eye movements and slow drifts. We analyzed effects of fixational saccades, voluntary saccades, and drifts on the activity of macaque V1 neurons. Effects of fixational saccades and small voluntary saccades were equivalent. In the presence of a near-optimal stimulus, separate populations of neurons fired transient bursts after saccades, sustained discharges during drifts, or both. Strength, time course, and selectivity of activation by fast and slow eye movements were strongly correlated with responses to flashed or to externally moved stimuli. These neuronal properties support complementary functions for post-saccadic bursts and drift responses. Local post-saccadic bursts signal rapid motion or abrupt change of potentially salient stimuli within the receptive field; widespread synchronized bursts signal occurrence of a saccade. Sustained firing during drifts conveys more specific information about location and contrast of small spatial features that contribute to perception of fine detail. In addition to stimulus-driven responses, biphasic extraretinal modulation accompanying saccades was identified in one third of the cells. Brief perisaccadic suppression was followed by stronger and longer-lasting enhancement that could bias perception in favor of saccade targets. These diverse patterns of neuronal activation underlie the dynamic encoding of our visual world

Faster Family-wise Error Control for Neuroimaging with a Parametric Bootstrap

In neuroimaging, hundreds to hundreds of thousands of tests are performed across a set of brain regions or all locations in an image. Recent studies have shown that the most common family-wise error (FWE) controlling procedures in imaging, which rely on classical mathematical inequalities or Gaussian random field theory, yield FWE rates that are far from the nominal level. Depending on the approach used, the FWER can be exceedingly small or grossly inflated. Given the widespread use of neuroimaging as a tool for understanding neurological and psychiatric disorders, it is imperative that reliable multiple testing procedures are available. To our knowledge, only permutation joint testing procedures have been shown to reliably control the FWER at the nominal level. However, these procedures are computationally intensive due to the increasingly available large sample sizes and dimensionality of the images, and analyses can take days to complete. Here, we develop a parametric bootstrap joint testing procedure. The parametric bootstrap procedure works directly with the test statistics, which leads to much faster estimation of adjusted \emph{p}-values than resampling-based procedures while reliably controlling the FWER in sample sizes available in many neuroimaging studies. We demonstrate that the procedure controls the FWER in finite samples using simulations, and present region- and voxel-wise analyses to test for sex differences in developmental trajectories of cerebral blood flow

Relaxed Locally Correctable Codes

Locally decodable codes (LDCs) and locally correctable codes (LCCs) are error-correcting codes in which individual bits of the message and codeword, respectively, can be recovered by querying only few bits from a noisy codeword. These codes have found numerous applications both in theory and in practice. A natural relaxation of LDCs, introduced by Ben-Sasson et al. (SICOMP, 2006), allows the decoder to reject (i.e., refuse to answer) in case it detects that the codeword is corrupt. They call such a decoder a relaxed decoder and construct a constant-query relaxed LDC with almost-linear blocklength, which is sub-exponentially better than what is known for (full-fledged) LDCs in the constant-query regime. We consider an analogous relaxation for local correction. Thus, a relaxed local corrector reads only few bits from a (possibly) corrupt codeword and either recovers the desired bit of the codeword, or rejects in case it detects a corruption. We give two constructions of relaxed LCCs in two regimes, where the first optimizes the query complexity and the second optimizes the rate: 1. Constant Query Complexity: A relaxed LCC with polynomial blocklength whose corrector only reads a constant number of bits of the codeword. This is a sub-exponential improvement over the best constant query (full-fledged) LCCs that are known. 2. Constant Rate: A relaxed LCC with constant rate (i.e., linear blocklength) with quasi-polylogarithmic query complexity. This is a nearly sub-exponential improvement over the query complexity of a recent (full-fledged) constant-rate LCC of Kopparty et al. (STOC, 2016)

Proofs of proximity for context-free languages and read-once branching programs

Proofs of proximity are probabilistic proof systems in which the verifier only queries a sub-linear number of input bits, and soundness only means that, with high probability, the input is close to an accepting input. In their minimal form, called Merlin-Arthur proofs of proximity ( MAP ), the verifier receives, in addition to query access to the input, also free access to an explicitly given short (sub-linear) proof. A more general notion is that of an interactive proof of proximity ( IPP ), in which the verifier is allowed to interact with an all-powerful, yet untrusted, prover. MAP s and IPP s may be thought of as the NP and IP analogues of property testing, respectively

Impact of emphysema heterogeneity on pulmonary function

Results: The majority (128/160) of the subjects with COPD had a heterogeneity greater than zero. After adjusting for age, gender, smoking history, and extent of emphysema, heterogeneity in depicted disease in upper lobe dominant cases was positively associated with pulmonary function measures, such as FEV1 Predicted (p<.001) and FEV1/FVC (p<.001), as well as disease severity (p<0.05). We found a negative association between HI% , RV/TLC (p<0.001), and DLco% (albeit not a statistically significant one, p = 0.06) in this group of patients

Constraining conformal field theories with a slightly broken higher spin symmetry

We consider three dimensional conformal field theories that have a higher spin symmetry that is slightly broken. The theories have a large N limit, in the sense that the operators separate into single trace and multitrace and obey the usual large N factorization properties. We assume that the spectrum of single trace operators is similar to the one that one gets in the Vasiliev theories. Namely, the only single trace operators are the higher spin currents plus an additional scalar. The anomalous dimensions of the higher spin currents are of order 1/N. Using the slightly broken higher spin symmetry we constrain the three point functions of the theories to leading order in N. We show that there are two families of solutions. One family can be realized as a theory of N fermions with an O(N) Chern-Simons gauge field, the other as a N bosons plus the Chern-Simons gauge field. The family of solutions is parametrized by the 't Hooft coupling. At special parity preserving points we get the critical O(N) models, both the Wilson-Fisher one and the Gross-Neveu one. Our analysis also fixes the on shell three point functions of Vasiliev's theory on AdS_4 or dS_4.Comment: 54 pages, 3 figure