2011
COLT
COLT 2011
Bounds on Individual Risk for Log-loss Predictors
Abstract
In sequential prediction with log-loss as well as density estimationwith risk measured by KL divergence, one is often interested in the expected instantaneous loss, or, equivalently, the individual risk at a given fixed sample size $n$. For Bayesianprediction and estimation methods, it is often easy to obtain bounds on the cumulative risk. Such results are based on bounding the individual sequence regret, a technique that is very well known in the COLT community. Motivated by the easiness of proofs for the cumulative risk, our open problem is to use the results on cumulative risk to prove corresponding individual-risk bounds.
🚀
Conference Pioneer
— COLT 2011
📈
Trend Setter
— Bayesian Learning
🧭
Keyword Pioneer
— bayesian prediction
🐝
Cross-Pollinator
— Artificial Intelligence, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning
🌉
Interdisciplinary Bridge
— Machine Learning and Mathematics & Optimization
🐣
Hot Topic Early Bird
— density estimation
Authors
Topics
Machine Learning > Optimization & Theory > Learning Theory
Machine Learning > Optimization & Theory > Theory
Machine Learning > Bayesian & Probabilistic > Bayesian Learning
Machine Learning > Learning Types > Online Learning
Machine Learning > Optimization & Theory > Information Theory
Mathematics & Optimization > Probability