## A Computationally Efficient Method for Nonparametric Modeling of Neural Spiking Activity with Point Processes

- Todd P. Coleman, Sridevi S. Sarma
- Neural Computation
- 2010

Highly Influenced

5 Excerpts

- Published 1991 in IEEE Trans. Information Theory

The minimum complexity or minimum description-length criterion developed by Kolmogorov, Rissanen, Wallace, So&in, and others leads to consistent probability density estimators. These density estimators are defined to achieve the best compromise between likelihood and simplicity. A related issue is the compromise between accuracy of approximations and complexity relative to the sample size. An index of resolvability is studied which is shown to bound the statistical accuracy of the density estimators, as well as the informationtheoretic redundancy. Index Terms -Kolmogorov complexity, minimum description-length criterion, universal data compression, bounds on redundancy, resolvability of functions, model selection, density estimation, discovery of probability laws, consistency, statistical convergence rates.

Citations per Year

Semantic Scholar estimates that this publication has **369** citations based on the available data.

See our **FAQ** for additional information.

Showing 1-10 of 218 extracted citations

Highly Influenced

5 Excerpts

Highly Influenced

9 Excerpts

Highly Influenced

9 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

20 Excerpts

Highly Influenced

12 Excerpts

Highly Influenced

8 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

5 Excerpts

@article{Barron1991MinimumCD,
title={Minimum complexity density estimation},
author={Andrew R. Barron and Thomas M. Cover},
journal={IEEE Trans. Information Theory},
year={1991},
volume={37},
pages={1034-1054}
}