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)
predictionparametric class of distributionssignal processingorder estimationmodel selection criterioncomplexity of modelsuniversal codesShannon's informationcode length inequality
Point estimation (62F10) Foundations and philosophical topics in statistics (62A01) Measures of information, entropy (94A17) Statistical aspects of information-theoretic topics (62B10) Coding theorems (Shannon theory) (94A24)
Related Items
Predictive stochastic complexity and model estimation for finite-state processes, Complex systems, complexity measures, grammars and model-inferring, Information optimality and Bayesian modelling, Counting probability distributions: Differential geometry and model selection, The Whole and the Parts: The Minimum Description Length Principle and the A-Contrario Framework, A lower-bound for the maximin redundancy in pattern coding, A test for randomness based on a complexity measure, Learning Coefficient of Generalization Error in Bayesian Estimation and Vandermonde Matrix-Type Singularity, Algorithmic complexity of points in dynamical systems, Stochastic complexity in learning, Learning about the parameter of the Bernoulli model, On-line maximum likelihood prediction with respect to general loss functions, A network of autoregressive processing units for time series modeling, Schwarz, Wallace, and Rissanen: Intertwining Themes in Theories of Model Selection, Strong consistency of the regularized least-squares estimates of infinite autoregressive models, Solvable models of layered neural networks based on their differential structure, Regularization in statistics, Multiple appearance models, ON RISSANEN'S LOWER BOUND ON THE ACCUMULATED MEAN-SQUARE PREDICTION ERROR, Minimax rates for conditional density estimation via empirical entropy, Game-theoretic statistics and safe anytime-valid inference, Consideration on the learning efficiency of multiple-layered neural networks with linear units, Using ideas of Kolmogorov complexity for studying biological texts, Data driven versions of pearson's chisquare test for uniformity, Optimal Sampling of Parametric Families: Implications for Machine Learning, Catching up Faster by Switching Sooner: A Predictive Approach to Adaptive Estimation with an Application to the AIC–BIC Dilemma, Sparse model selection in the highly under-sampled regime, Asymptotic property of universal lossless coding for independent piecewise identically distributed sources, Unnamed Item, Unnamed Item, UNCERTAINTY AND ESTIMATION IN RECONSTRUCTABILITY ANALYSIS, Search for Sparse Active Inputs: A Review, Compression based homogeneity testing, Structure-generating mechanisms in agent-based models, Model selection for estimating the non zero components of a Gaussian vector, Estimating the active dimension of the dynamics in a time series based on an information criterion, Nonlinear system identification via Laguerre network based fuzzy systems, Stochastic complexity and the mdl principle, Universal codes as a basis for time series testing, Predictability, Complexity, and Learning, A Bayesian Learning Coefficient of Generalization Error and Vandermonde Matrix-Type Singularities, Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series, Relations between information criteria for model-structure selection Part 3. Strong consistency of the predictive least squares criterion, 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, Macroeconomic simulation comparison with a multivariate extension of the Markov information criterion, Model selection and prediction: Normal regression, Information theory and superefficiency, Measuring the efficiency of the intraday Forex market with a universal data compression algorithm, Gaussian model selection with an unknown variance, Information-theoretic determination of minimax rates of convergence, Minimum description length revisited, Stochastic complexities of reduced rank regression in Bayesian estimation, Applying MDL to learn best model granularity, Statistical Inference, Occam's Razor, and Statistical Mechanics on the Space of Probability Distributions, Nonasymptotic bounds for autoregressive time series modeling., Adaptive estimation in autoregression or \(\beta\)-mixing regression via model selection, Detecting and evaluating intrinsic nonlinearity present in the mutual dependence between two variables, Optimal work extraction and the minimum description length principle, On asymptotically optimal methods of prediction and adaptive coding for Markov sources, A comparative classification of complexity measures, Algorithmic analysis of irrational rotations in a single neuron model
