← Back to papers
2011 COLT COLT 2011

Missing Information Impediments to Learnability

Abstract

To what extent is learnability impeded when information is missing in learning instances? We present relevant known results and concrete open problems, in the context of a natural extension of the PAC learning model that accounts for arbitrarily missing information.

🚀 Conference Pioneer — COLT 2011
📈 Trend Setter — Supervised Learning
🧭 Keyword Pioneer — missing information
🐣 Hot Topic Early Bird — sample complexity
🐝 Cross-Pollinator — Artificial Intelligence, Computer Science, Data Science & Analytics, Deep Learning, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics
🌉 Interdisciplinary Bridge — Artificial Intelligence and Machine Learning

Authors

Loizos Michael

Topics

Machine Learning > Optimization & Theory > Learning Theory Machine Learning > Learning Types > Online Learning Machine Learning > Learning Types > Supervised Learning Artificial Intelligence > Core AI > Knowledge Representation

Keywords

information theory learning theory online learning sample complexity pac learning missing information feature missing
Download PDF

Related papers

Competitive Closeness Testing 2011
Bandits, Query Learning, and the Haystack Dimension 2011
Minimax Policies for Combinatorial Prediction Games 2011
Sample Complexity Bounds for Differentially Private Learning 2011
Multiclass Learnability and the ERM principle 2011