885 citations · 2.4k across the 41 of their papers we have counts for
14 papers · 1 filter
Utilitarian Algorithm Configuration
Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden
We present the first nontrivial procedure for configuring heuristic algorithms to maximize the utility provided to their end users while also offering theoretical guarantees about…
UNSAT Solver Synthesis via Monte Carlo Forest Search
Chris Cameron, Jason Hartford, Taylor Lundy +4
We introduce Monte Carlo Forest Search (MCFS), a class of reinforcement learning (RL) algorithms for learning policies in {tree MDPs}, for which policy execution involves traversin…
Better Peer Grading through Bayesian Inference
Hedayat Zarkoob, Greg d'Eon, Lena Podina +1
Peer grading systems aggregate noisy reports from multiple students to approximate a true grade as closely as possible. Most current systems either take the mean or median of repor…
Formalizing Preferences Over Runtime Distributions
Devon R. Graham, Kevin Leyton-Brown, Tim Roughgarden
When trying to solve a computational problem, we are often faced with a choice between algorithms that are guaranteed to return the right answer but differ in their runtime distrib…
Matching Papers and Reviewers at Large Conferences
Kevin Leyton-Brown, Mausam, Yatin Nandwani +4
Peer-reviewed conferences, the main publication venues in CS, rely critically on matching highly qualified reviewers for each paper. Because of the growing scale of these conferenc…
Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration
Robert Kleinberg, Kevin Leyton-Brown, Brendan Lucier +1
Algorithm configuration methods optimize the performance of a parameterized heuristic algorithm on a given distribution of problem instances. Recent work introduced an algorithm co…