Universal coding, information, prediction, and estimation
From MaRDI portal
Publication:3692595
Recommendations
Cited in
(77)- Measuring the efficiency of the intraday Forex market with a universal data compression algorithm
- Gaussian model selection with an unknown variance
- 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
- Compression based homogeneity testing
- 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
- Using ideas of Kolmogorov complexity for studying biological texts
- Nonlinear system identification via Laguerre network based fuzzy systems
- Macroeconomic simulation comparison with a multivariate extension of the Markov information criterion
- 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
- A Bayesian learning coefficient of generalization error and Vandermonde matrix-type singularities
- Information optimality and Bayesian modelling
- Learning coefficient of generalization error in Bayesian estimation and Vandermonde matrix-type singularity
- Asymptotic property of universal lossless coding for independent piecewise identically distributed sources
- Statistical Inference, Occam's Razor, and Statistical Mechanics on the Space of Probability Distributions
- Sparse model selection in the highly under-sampled regime
- Relations between information criteria for model-structure selection Part 3. Strong consistency of the predictive least squares criterion
- A class of distortionless codes designed by Bayes decision theory
- One universally efficient estimation of the first-order autoregressive parameter and universal data compression
- Redundancy of Universal Coding, Kolmogorov Complexity, and Hausdorff Dimension
- scientific article; zbMATH DE number 3904487 (Why is no real title available?)
- ON RISSANEN'S LOWER BOUND ON THE ACCUMULATED MEAN-SQUARE PREDICTION ERROR
- scientific article; zbMATH DE number 4066122 (Why is no real title available?)
- UNCERTAINTY AND ESTIMATION IN RECONSTRUCTABILITY ANALYSIS
- scientific article; zbMATH DE number 3496010 (Why is no real title available?)
- A test for randomness based on a complexity measure
- Algorithmic complexity of points in dynamical systems
- Counting probability distributions: Differential geometry and model selection
- Strong optimality of the normalized ML models as universal codes and information in data
- Catching up Faster by Switching Sooner: A Predictive Approach to Adaptive Estimation with an Application to the AIC–BIC Dilemma
- Schwarz, Wallace, and Rissanen: Intertwining Themes in Theories of Model Selection
- Data driven versions of pearson's chisquare test for uniformity
- Fisher information and stochastic complexity
- Search for sparse active inputs: a review
- Minimum description length revisited
- The whole and the parts: the minimum description length principle and the a-contrario framework
- scientific article; zbMATH DE number 7625180 (Why is no real title available?)
- scientific article; zbMATH DE number 7625186 (Why is no real title available?)
- Optimal sampling of parametric families: implications for machine learning
- Universal coding and order identification by model selection
- Model selection for estimating the non zero components of a Gaussian vector
- Stochastic complexity and the mdl principle
- Optimal work extraction and the minimum description length principle
- Structure-generating mechanisms in agent-based models
- Estimating the active dimension of the dynamics in a time series based on an information criterion
- 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
- Logical activation functions for training arbitrary probabilistic Boolean operations
- Online prediction for streaming observational data
- Anytime-valid and asymptotically efficient inference driven by predictive recursion
- A cheat sheet for Bayesian prediction
- Sequential prediction under log-loss with side information
- Universal codes as a basis for time series testing
- Information-theoretic analysis of temporal dependence in discrete stochastic processes: application to precipitation predictability
- A lower-bound for the maximin redundancy in pattern coding
- Strong consistency of the regularized least-squares estimates of infinite autoregressive models
- Regularization in statistics
- Multiple appearance models
This page was built for publication: Universal coding, information, prediction, and estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3692595)
