1 1
نویسندگان
چکیده
Running title GLM with natural sounds 2 2 ABSTRACT In the auditory system, the stimulus-response properties of single neurons are often described in terms of the spectrotemporal receptive field (STRF), a linear kernel relating the spectrogram of the sound stimulus to the instantaneous firing rate of the neuron. Several algorithms have been used to estimate STRFs from responses to natural stimuli; these algorithms differ in their functional models, cost functions, and regularization methods. Here, we characterize the stimulus-response function of auditory neurons using a generalized linear model (GLM). In this model, each cell's input is described by: 1) a stimulus filter (STRF); and 2) a post-spike filter, which captures dependencies on the neuron's spiking history. The output of the model is given by a series of spike trains rather than instantaneous firing rate, allowing the prediction of spike train responses to novel stimuli. We fit the model by maximum penalized likelihood to the spiking activity of zebra finch auditory midbrain neurons in response to conspecific vocalizations (songs) and modulation limited (ml) noise. We compare this model to normalized reverse correlation (NRC), the traditional method for STRF estimation, in terms of predictive power and the basic tuning properties of the estimated STRFs. We find that a GLM with a sparse prior predicts novel responses to both stimulus classes significantly better than NRC. Importantly, we find that STRFs from the two models derived from the same responses can differ substantially and that GLM STRFs are more consistent between stimulus classes than NRC STRFs. These results suggest that a GLM with a sparse prior provides a more accurate characterization of spectrotemporal tuning than does the NRC method when responses to complex sounds are studied in these neurons.
منابع مشابه
DIGITAL EXCLUSION AMEND.indd
0 0 1 1 0 1 0 1 0 1 1 0 0 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0 1 1 1 1 0 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 0 0 0 1 0 1 0 1 0 1 0 1 1 1 0 0 1 0 1 0 1 0 1 0 1 1 0 0 1 1 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 1 1 1 0 0 1 0 1 0 1 0 0 1 1 1 0 1 1 1 1 0 0 0 1 0 1 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 0 1 0 0 1 1 1 0 0 0 1 1 0 0 0 1 0 1 0 1 0 0 1 1 1 0 0 1 1 0 0 1 1 0 1 1 0 0 1 0 1 0 1 1 0 0 1...
متن کاملConditional and unconditional infectiousness effects in vaccine trials.
[ ] [ ] ( ) [ ] ( ) [ ] ( ) [ ] ( ) [ ] ( ) [ ] ( ) [ ] ( ) [ ] ( ), 1 ) 1 ( Pr 1 ) 0 ( , 1 ) 1 ( | ) 1 , ( E 0 ) 0 ( , 0 ) 1 ( Pr 0 ) 0 ( , 0 ) 1 ( | ) 0 , ( E 1 ) 0 ( , 0 ) 1 ( Pr 1 ) 0 ( , 0 ) 1 ( | ) 0 , ( E 1 ) 0 ( , 1 ) 1 ( Pr 1 ) 0 ( , 1 ) 1 ( | ) 1 , ( E 0 ) 0 ( , 0 ) 1 ( Pr 0 ) 0 ( , 0 ) 1 ( | )) 1 ( , ( E 1 ) 0 ( , 0 ) 1 ( Pr 1 ) 0 ( , 0 ) 1 ( | )) 1 ( , ( E 1 ) 0 ( , 1 ) 1 ( Pr 1 ) 0...
متن کاملComputational Appendix: Hamilton Decompositions of 6-regular Cayley Graphs on Even Abelian Groups with Involution-free Connection Sets
Z2 ⊕ Z12 {(1, 4), (1, 5), (0, 3)}, {(1, 3), (1, 4), (0, 3)}, {(0, 1), (0, 2), (1, 1)}, {(1, 3), (0, 4), (1, 2)}, {(1, 3), (1, 5), (0, 3)}, {(0, 4), (0, 5), (1, 2)}, {(0, 2), (1, 5), (1, 2)}, {(1, 3), (0, 1), (1, 5)}, {(0, 1), (0, 3), (1, 2)}, {(1, 3), (0, 1), (0, 4)}, {(0, 2), (0, 3), (1, 2)}, {(1, 4), (1, 1), (1, 2)}, {(1, 4), (1, 5), (0, 5)}, {(1, 3), (0, 1), (0, 5)}, {(0, 2), (0, 3), (1, 1)}...
متن کاملGeneralized Gorshkov-Wirsing Polynomials and the Integer Chebyshev Problem
Interval LLL SIMPLEX HS Amoroso Lower # CP [-1, 1] 1/1.5314 1/1.5334 1/1.4772 1/1.4520 1/1.5417 8 [-1/2, 1/2] 1/2.3559 1/2.3619 1/2.1822 1/1.4520 1/2.3768 9 [-1/3, 1/3] 1/3.2522 1/3.2617 1/3.0000 1/1.3887 1/3.2842 7 [-2/3, 2/3] 1/1.8820 1/1.8883 1/1.7237 1/1.3887 1/1.9845 5 [-1/4, 1/4] 1/4.1921 1/4.2025 1/4.0000 1/1.1097 1/4.2260 6 [-3/4, 3/4] 1/1.7897 1/1.7935 1/1.7237 1/1.1097 1/1.9653 3 [-1/...
متن کامل4.3 Modiied Variants and Weaknesses 4 the Attack on Lucifer 3 Conditional Characteristics
Round output diierence input diierence p icb key fraction P = (f7g; 0) 1 A = 0 a = 0 1 1 2 B = f45g b = f7g p = 1=8 0 1/2 3 C = f6g c = f45g p = 1=8 1 1/2 4 f45g f6; 7g p = 1=8 0 1/2 5 0 0 1 1 6 f45g f6; 7g p = 1=8 0 1/2 7 f6g f45g p = 1=8 1 1/2 8 f45g f7g p = 1=8 0 1/2 9 0 0 1 1 8 f39g f7g p = 1=8 1 1/2 9 f7g f39g p = 1=8 1 1/2 T = (0; f39g) 17 ent fractions of the key space. Round output diie...
متن کاملAnalytic Solutions for a Functional Differential Equation Related to a Traffic Flow Model
and Applied Analysis 3 Proof. If we let h s ∑∞ n 1 ans n and substituting into 1.3 , we have α2 ∞ ∑ n 0 n 1 λ − 1 an 1s 2α ∞ ∑ n 1 ( n−1 ∑ i 0 i 1 ( λn−i − 1 )( λ − 1 ) an−iai 1 ) s ∞ ∑ n 2 ( n−2 ∑ i 0 n−i−1 ∑ k 1 i 1 ( λn−k−i − 1 )( λ − 1 )( λ − 1 ) an−k−iakai 1 ) s β ∞ ∑ n 1 ( n−1 ∑ i 0 i 1 ( λn−i − 1 )2 an−iai 1 ) s. 2.3 Comparing coefficients we obtain α2 ( λ0 − 1 ) a1 0, 2.4 α2 n 1 λ − 1 a...
متن کامل