3 papers
cs.CL2026
QuickScope: Certifying Hard Questions in Dynamic LLM Benchmarks
Taylor Lundy, Narun K. Raman, Kevin Leyton-Brown
LLM benchmarks are increasingly dynamic: instead of containing a fixed set of questions, they define templates and parameters that can generate an effectively unlimited number of q…
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…