Prediction in M-complete problems with limited sample size

DOI10.1214/13-BA826zbMATH Open1329.62121MaRDI QIDQ908026FDOQ908026

Authors: Jennifer Lynn Clarke, Bertrand S. Clarke, Chi Wai Yu 

Publication date: 2 February 2016

Published in: Bayesian Analysis (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.ba/1378729923

Recommendations

• Minimax prediction under random sample size
• Minimax nonparametric prediction under random sample size
• Publication:5748760
• A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
• scientific article; zbMATH DE number 1497364
• Minimax prediction in finite populations
• On the ``prediction problem
• Sample size lower bounds in PAC learning by Algorithmic Complexity Theory

zbMATH Keywords

model selectionpredictionensemble methodsmodel list selectionbasis selection\(\mathcal M\)-complete

Mathematics Subject Classification ID

Bayesian inference (62F15) Inference from stochastic processes and prediction (62M20)

Cited In (7)

• In praise of partially interpretable predictors
• A Bayes interpretation of stacking for \(\mathcal{M}\)-complete and \(\mathcal{M}\)-open settings
• Regular, median and Huber cross‐validation: A computational comparison
• Title not available (Why is that?)
• Sample Analogs to Multidimensional Coverages with Applications to Prediction
• Computer Experiments: Prediction Accuracy, Sample Size and Model Complexity Revisited
• Bayesian restricted likelihood methods: conditioning on insufficient statistics in Bayesian regression (with discussion)

This page was built for publication: Prediction in \(\mathcal M\)-complete problems with limited sample size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908026)