2009
NIPS
NeurIPS 2009
Beyond Convexity: Online Submodular Minimization
Abstract
We consider an online decision problem over a discrete space in which the loss function is submodular. We give algorithms which are computationally efficient and are Hannan-consistent in both the full information and bandit settings.
🌉
Interdisciplinary Bridge
— Machine Learning and Mathematics & Optimization
📈
Trend Setter
— Online Algorithms
🧭
Keyword Pioneer
— submodular minimization
🐣
Hot Topic Early Bird
— online learning
🐝
Cross-Pollinator
— Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Security & Privacy, Speech & Audio
Authors
Topics
Mathematics & Optimization > Optimization > Online Algorithms
Machine Learning > Learning Types > Online Learning
Machine Learning > Optimization & Theory > Online Algorithms
Mathematics & Optimization > Optimization > Discrete Optimization
Machine Learning > Learning Types > Optimization
Mathematics & Optimization > Optimization > Submodular Optimization