资源分类
》 资源 》论文》Efficiency Through Procrastination: Approximately Optimal Algorithm Configuration with Runtime Guarantees

Efficiency Through Procrastination: Approximately Optimal Algorithm Configuration with Runtime Guarantees

2019-10-29 | |  40 |   39 |   0
Abstract Algorithm configuration methods have achieved much practical success, but to date have not been backed by meaningful performance guarantees. We address this gap with a new algorithm configuration framework, Structured Procrastination. With high probability and nearly as quickly as possible in the worst case, our framework finds an algorithm configuration that provably achieves near optimal performance. Further, its running time requirements asymptotically dominate those of existing methods

上一篇：Context-aware Path Ranking for Knowledge Base Completion

下一篇：Efficiently Enforcing Path Consistency on Qualitative Constraint Networks by Use of Abstraction

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...