☆
3.8
Proceedings Paper
How Much Data Is Sufficient to Learn High-Performing Algorithms? Generalization Guarantees for Data-Driven Algorithm Design
STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (2021)
导出引文
没有可用的引文
评价这篇论文
主要评分表示论文的整体质量水平。次要评分独立反映论文的优点或缺点。
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationAdd your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload Now