paper-with-me

Papers

Utilitarian Algorithm Configuration for Infinite Parameter Spaces

2024-05-28 · 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 a given utility function, on a given set of inputs. Recently introduced utilitarian configuration procedures offer optimality guarantees about the returned parameterization while provably adapting to the hardness of the underlying problem. However, the applicability of these approaches is severely limited by the fact that they only search a finite, relatively small set of parameters. They cannot effectively search the configuration space of algorithms with continuous or uncountable parameters. In this paper we introduce a new procedure, which we dub COUP (Continuous, Optimistic Utilitarian Procrastination). COUP is designed to search infinite parameter spaces efficiently to find good configurations quickly. Furthermore, COUP maintains the theoretical benefits of previous utilitarian configuration procedures when applied to finite parameter spaces but is significantly faster, both provably and experimentally.

📄 PDF Abstract BibTeX arXiv:2405.18246

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Practical, Utilitarian Algorithm Configuration

2025-10-16 · Devon Graham, Eros Rojas Velez, Kevin Leyton-Brown arxiv

Utilitarian algorithm configuration identifies a parameter setting for a given algorithm that maximizes a user's utility. Utility functions offer a theoretically well-grounded approach to optimizing decision-making under…

ImpatientCapsAndRuns: Approximately Optimal Algorithm Configuration from an Infinite Pool

2020-12-01 · NeurIPS 2020 12 · Gellert Weisz, András György, Wei-I Lin, Devon Graham 외

Algorithm configuration procedures optimize parameters of a given algorithm to perform well over a distribution of inputs. Recent theoretical work focused on the case of selecting between a small number of alternatives. …

Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees

2019-05-26 · Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik

Algorithms typically come with tunable parameters that have a considerable impact on the computational resources they consume. Too often, practitioners must hand-tune the parameters, a tedious and error-prone task. A rec…

Clustering

On Performance Estimation in Automatic Algorithm Configuration

2019-11-19 · Shengcai Liu, Ke Tang, Yunwen Lei, Xin Yao

Over the last decade, research on automated parameter tuning, often referred to as automatic algorithm configuration (AAC), has made significant progress. Although the usefulness of such tools has been widely recognized …

Impartial utilitarianism on infinite utility streams

2025-02-07 · Kensei Nakamura

When evaluating policies that affect future generations, the most commonly used criterion is the discounted utilitarian rule. However, in terms of intergenerational fairness, it is difficult to justify prioritizing the c…

Fairness