Budget Allocation for Unknown Value Functions in a Lipschitz Space
Building learning models frequently requires evaluating numerous intermediate models. Examples include models considered during feature selection, model structure search, and parameter tunings. The evaluation of an intermediate model influences subsequent model exploration decisions. Although prior knowledge can provide initial quality estimates, true performance is only revealed after evaluation. In this work, we address the challenge of optimally allocating a bounded budget to explore the space of intermediate models. We formalize this as a general budget allocation problem over unknown-value functions within a Lipschitz space.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants
Optimizing expensive, non-convex, black-box Lipschitz continuous functions presents significant challenges, particularly when the Lipschitz constant of the underlying function is unknown. Such problems often demand numer…
global-optimizationFixed-Budget Best-Arm Identification with Heterogeneous Reward Variances
We study the problem of best-arm identification (BAI) in the fixed-budget setting with heterogeneous reward variances. We propose two variance-adaptive BAI algorithms for this setting: SHVar for known reward variances an…
No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints
Advertisers increasingly use automated bidding to optimize their ad campaigns on online advertising platforms. Autobidding optimizes an advertiser's objective subject to various constraints, e.g. average ROI and budget c…
Distributed Dual Gradient Tracking for Resource Allocation in Unbalanced Networks
This paper proposes a distributed dual gradient tracking algorithm (DDGT) to solve resource allocation problems over an unbalanced network, where each node in the network holds a private cost function and computes the op…
Combinatorial Multi-armed Bandits for Resource Allocation
We study the sequential resource allocation problem where a decision maker repeatedly allocates budgets between resources. Motivating examples include allocating limited computing time or wireless spectrum bands to multi…
Multi-Armed Bandits