On stochastic complexity and nonparametric density estimation
From MaRDI portal
Recommendations
- Density estimation by stochastic complexity
- scientific article; zbMATH DE number 3971958
- Nonparametric density estimation for nonmixing approximable stochastic processes
- Nonparametric Density Estimation Over Complicated Domains
- AR( infinity ) estimation and nonparametric stochastic complexity
- On stochastic complexity estimation: a decision-theoretic approach
- On nonparametric estimation of a functional of a probability density
- On the complexity of stochastic integration
- scientific article; zbMATH DE number 3954271
- Stationary densities and the stochastic approximation of a certain class of random algorithms
Cited in
(29)- Data compression and histograms
- Density estimation for time series by histograms
- Regression spline smoothing using the minimum description length principle
- Detecting and evaluating intrinsic nonlinearity present in the mutual dependence between two variables
- On histograms for linear processes
- Test for homogeneity of several populations by stochastic complexity
- Complexity of approximating Hölder classes from information with varying Gaussian noise
- On the computation of entropy prior complexity and marginal prior distribution for the Bernoulli model
- Information theoretic criteria in non-parametric density estimation. Bias and variance in the infinite dimensional case
- Data driven versions of neyman's test for uniformity based on bayesian rule
- Predictability, complexity, and learning
- scientific article; zbMATH DE number 996388 (Why is no real title available?)
- How many bins should be put in a regular histogram
- Minimum complexity density estimation
- Density estimation by stochastic complexity
- On stochastic complexity estimation: a decision-theoretic approach
- Histograms for stationary linear random fields
- How Many Clusters? An Information-Theoretic Perspective
- An Introduction to Coding Theory and the Two-Part Minimum Description Length Principle
- Schwarz, Wallace, and Rissanen: Intertwining Themes in Theories of Model Selection
- Data driven versions of pearson's chisquare test for uniformity
- Computational Limits to Nonparametric Estimation for Ergodic Processes
- Stochastic complexity, histograms and hypothesis testing of homogeneity
- Fluctuation-Dissipation Theorem and Models of Learning
- A comparison of automatic histogram constructions
- Fast and fully-automated histograms for large-scale data sets
- Causality indices for bivariate time series data: a comparative review of performance
- A rank-based sequential test of independence
- Bin width selection in multivariate histograms by the combinatorial method
This page was built for publication: On stochastic complexity and nonparametric density estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3810684)
