Metraipolis › archive › dc_e353c49d2edc
Finding the Needle in a Haystack: Test-Time Analog Circuit Representation Adaptation for Bayesian Optimization — arXiv:2608.12687
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.12687
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T04:27:23.456Z
- SHA-256 of the archived text
29c18f5589521d9cfe1899b4585986a7ef2e2921a6ed72604a06248a433d2b66- Stable URL of this page
https://metraipolis.com/documento/dc_e353c49d2edc
How to cite
Finding the Needle in a Haystack: Test-Time Analog Circuit Representation Adaptation for Bayesian Optimization — arXiv:2608.12687 — arXiv (en), https://arxiv.org/abs/2608.12687 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e353c49d2edc (Metraipolis archive dc_e353c49d2edc, sha256 29c18f5589521d9cfe1899b4585986a7ef2e2921a6ed72604a06248a433d2b66)
BibTeX
@misc{dce353c49d2edc,
title = {Finding the Needle in a Haystack: Test-Time Analog Circuit Representation Adaptation for Bayesian Optimization — arXiv:2608.12687},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.12687},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e353c49d2edc; sha256 29c18f5589521d9cfe1899b4585986a7ef2e2921a6ed72604a06248a433d2b66},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12687. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Bayesian optimization (BO) is a sample-efficient framework for analog circuit topology search, where evaluating each candidate topology can require costly simulation. However, representation-based BO methods typically treat circuit embeddings as fixed after encoder training. This creates a mismatch between representation learning and optimization: embeddings learned to encode or reconstruct circuit structure are not necessarily organized according to the figure of merit (FoM) being optimized. This paper introduces Test-Time Analog Representation Adaptation for Bayesian Optimization (TTARO), an online deep-kernel BO framework that adapts circuit representations throughout the search process. Starting from pretrained circuit embeddings, TTARO jointly learns a nonlinear feature transformation and a Gaussian-process surrogate using the FoM labels of the circuits evaluated so far. Following each new evaluation, TTARO updates the representation and surrogate before selecting the next candidate. We compare TTARO with conventional Gaussian Process-based BO over fixed embeddings and with Deep Kernel Learning (DKL), which learns the representation only from the initial evaluated designs and keeps it fixed throughout the remainder of the search. By continually incorporating newly observed FoM labels into representation learning, TTARO aligns the search space with the optimization objective as BO progresses. In our experiments, TTARO reduces regret AUC by 15.2% on average relative to BO and by 20.7% relative to DKL across 40 encoder/kernel/acquisition settings, outperforming prior art in most settings with reductions as large as 46.7%. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-14 in cs.LG). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2608.12687 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T04:20:35.821Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).