Name
Abstract | ||
|---|---|---|
The best algorithm for a computational problem generally depends on the "relevant inputs," a concept that depends on the application domain and often defies formal articulation. Although there is a large literature on empirical approaches to selecting the best algorithm for a given application domain, there has been surprisingly little theoretical analysis of the problem.
We model the problem of identifying a good algorithm from data as a statistical learning problem. Our framework captures several state-of-the-art empirical and theoretical approaches to the problem, and our results identify conditions under which these approaches are guaranteed to perform well. We interpret our results in the contexts of learning greedy heuristics, instance feature-based algorithm selection, and parameter tuning in machine learning.
|
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3394625 | Communications of the ACM |
DocType | Volume | Issue |
Journal | 63 | 6 |
ISSN | Citations | PageRank |
0001-0782 | 1 | 0.35 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rishi R. Gupta | 1 | 19 | 4.08 |
| Tim Roughgarden | 2 | 4177 | 353.32 |