Difficulty of Singularity in Population Coding
From MaRDI portal
Recommendations
Cites work
- Algebraic analysis for nonidentifiable learning machines
- Asymptotic behaviors of population codes
- Asymptotics for likelihood ratio tests under loss of identifiability
- Attention modulation of neural tuning through peak and base rate
- Doubly Distributional Population Codes: Simultaneous Representation of Uncertainty and Multiplicity
- Dynamics of pattern formation in lateral-inhibition type neural fields
- Information processing in a neuron ensemble with the multiplicative correlation structure
- Information-theoretic asymptotics of Bayes methods
- Likelihood ratio of unidentifiable models and multilayer neural networks
- On asymptotic properties of predictive distributions
- On density estimation under relative entropy loss criterion
- On the Volume of Tubes
- Population Coding and Decoding in a Neural Field: A Computational Study
- Population coding with correlation and an unfaithful model
- Sequential Bayesian Decoding with a Population of Neurons
- Synchronous Firing and Higher-Order Interactions in Neuron Pool
- Testing in locally conic models, and application to mixture models
- Tubes and Spheres in n-Spaces, and a Class of Statistical Problems
Cited in
(7)- Optimum signal in a diffusion leaky integrate-and-fire neuronal model
- Effect of spontaneous activity on stimulus detection in a simple neuronal model
- Information-theoretic bounds and approximations in neural population coding
- Unconscious Biases in Neural Populations Coding Multiple Stimuli
- Presynaptic spontaneous activity enhances the accuracy of latency coding
- Dynamics of Learning Near Singularities in Layered Networks
- Decoding spike train ensembles: tracking a moving stimulus
This page was built for publication: Difficulty of Singularity in Population Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5706664)
