activity
20182025
most citedDeep Models of Interactions Across Sets

72 citations · 84 across the 7 of their papers we have counts for

collaborators

7 papers

cs.AI2025

Practical, Utilitarian Algorithm Configuration

Devon Graham, Eros Rojas Velez, Kevin Leyton-Brown

Utilitarian algorithm configuration identifies a parameter setting for a given algorithm that maximizes a user's utility. Utility functions offer a theoretically well-grounded appr…

cs.AI2024

Utilitarian Algorithm Configuration for Infinite Parameter Spaces

Devon Graham, Kevin Leyton-Brown

Utilitarian algorithm configuration is a general-purpose technique for automatically searching the parameter space of a given algorithm to optimize its performance, as measured by…

cs.AI2023★ 1 cited

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…

cs.AI2022

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…

cs.LG2019★ 4 cited

Equivariant Entity-Relationship Networks

Devon Graham, Junhao Wang, Siamak Ravanbakhsh

The relational model is a ubiquitous representation of big-data, in part due to its extensive use in databases. In this paper, we propose the Equivariant Entity-Relationship Networ…

cs.AI2019★ 7 cited

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…