Andrea Carbonati
Multi-Agent LLMs for Adaptive Acquisition in Bayesian Optimization.
Rel. Alessio Burrello. Politecnico di Torino, Corso di laurea magistrale in Ingegneria Informatica (Computer Engineering), 2025
|
|
PDF (Tesi_di_laurea)
- Tesi
Accesso limitato a: Solo utenti staff fino al 12 Dicembre 2026 (data di embargo). Licenza: Creative Commons Attribution Non-commercial No Derivatives. Download (3MB) |
Abstract
Bayesian Optimization (BO) is widely used to optimize expensive black-box objectives by learning a probabilistic surrogate and querying new points via an acquisition function. Classic approaches, however, tightly bind acquisition behavior to the surrogate (often a GP) and a small set of fixed statistics, which can make exploration–exploitation tradeoffs inflexible and sensitive to hyperparameters. These limitations become acute in higher-dimensional or irregular landscapes relevant to engineering design. We propose an agentic LLM framework that shifts the locus of intelligence from a static, model-tied acquisition rule to a problem-adaptive acquisition designer implemented with one or more large language models. Prior LLM-for-optimization efforts have largely focused on direct candidate generation (or meta-prompted solution search), leaving the acquisition design step to conventional surrogates; by contrast, we use LLM agents to recommend task-appropriate metrics and weights and to compose an acquisition function aligned with user criteria.
This fills a gap identified in the literature, addressing prompt rigidity and the lack of user-aligned selection criteria in existing frameworks
Relatori
Anno Accademico
Tipo di pubblicazione
Numero di pagine
Corso di laurea
Classe di laurea
Ente in cotutela
Aziende collaboratrici
URI
![]() |
Modifica (riservato agli operatori) |
