The limitations of optimization from samples

DOI10.1145/3055399.3055406zbMath1369.68275arXiv1512.06238OpenAlexW2963333531MaRDI QIDQ4978042

Eric Balkanski, Yaron Singer, Aviad Rubinstein

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.06238

zbMATH Keywords

optimizationPAC learningcoverage functions

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (7)

The Limitations of Optimization from Samples ⋮ The platform design problem ⋮ Seeding with Costly Network Information ⋮ When Are Welfare Guarantees Robust ⋮ The Complexity of Partial Function Extension for Coverage Functions ⋮ Robust budget allocation via continuous submodular functions ⋮ Approximate Modularity Revisited

This page was built for publication: The limitations of optimization from samples