Universal coding, information, prediction, and estimation
From MaRDI portal
Publication:3692595
DOI10.1109/TIT.1984.1056936zbMath0574.62003MaRDI QIDQ3692595
Publication date: 1984
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
prediction; parametric class of distributions; signal processing; order estimation; model selection criterion; complexity of models; universal codes; Shannon's information; code length inequality
62F10: Point estimation
62A01: Foundations and philosophical topics in statistics
94A17: Measures of information, entropy
62B10: Statistical aspects of information-theoretic topics
94A24: Coding theorems (Shannon theory)
Related Items
A test for randomness based on a complexity measure, Algorithmic complexity of points in dynamical systems, Counting probability distributions: Differential geometry and model selection, Schwarz, Wallace, and Rissanen: Intertwining Themes in Theories of Model Selection, Data driven versions of pearson's chisquare test for uniformity, Structure-generating mechanisms in agent-based models, Estimating the active dimension of the dynamics in a time series based on an information criterion, Stochastic complexity and the mdl principle, Strong consistency of the regularized least-squares estimates of infinite autoregressive models, Regularization in statistics, Multiple appearance models, Model selection and prediction: Normal regression, A comparative classification of complexity measures, Predictive stochastic complexity and model estimation for finite-state processes, Complex systems, complexity measures, grammars and model-inferring, Stochastic complexity in learning, Learning about the parameter of the Bernoulli model, On-line maximum likelihood prediction with respect to general loss functions, Information-theoretic determination of minimax rates of convergence, Applying MDL to learn best model granularity, Detecting and evaluating intrinsic nonlinearity present in the mutual dependence between two variables, On asymptotically optimal methods of prediction and adaptive coding for Markov sources, Information theory and superefficiency, Nonasymptotic bounds for autoregressive time series modeling., Adaptive estimation in autoregression or \(\beta\)-mixing regression via model selection, Algorithmic analysis of irrational rotations in a single neuron model, A network of autoregressive processing units for time series modeling, Solvable models of layered neural networks based on their differential structure, Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series, Universal codes as a basis for nonparametric testing of serial independence for time series, An empirical study of minimum description length model selection with infinite parametric complexity, Stochastic complexities of reduced rank regression in Bayesian estimation, Predictability, Complexity, and Learning, Statistical Inference, Occam's Razor, and Statistical Mechanics on the Space of Probability Distributions, Relations between information criteria for model-structure selection Part 3. Strong consistency of the predictive least squares criterion, ON RISSANEN'S LOWER BOUND ON THE ACCUMULATED MEAN-SQUARE PREDICTION ERROR, UNCERTAINTY AND ESTIMATION IN RECONSTRUCTABILITY ANALYSIS
