惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

V
Visual Studio Blog
A
About on SuperTechFans
J
Java Code Geeks
G
Google Developers Blog
L
LangChain Blog
小众软件
小众软件
宝玉的分享
宝玉的分享
云风的 BLOG
云风的 BLOG
P
Proofpoint News Feed
博客园 - 【当耐特】
IT之家
IT之家
F
Fortinet All Blogs
aimingoo的专栏
aimingoo的专栏
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
阮一峰的网络日志
阮一峰的网络日志
V
V2EX
博客园 - Franky
博客园_首页
雷峰网
雷峰网
Microsoft Security Blog
Microsoft Security Blog
Vercel News
Vercel News
B
Blog
月光博客
月光博客
酷 壳 – CoolShell
酷 壳 – CoolShell

stat.ML updates on arXiv.org

Adaptive multi-fidelity optimization with fast learning rates Enhancing AI and Dynamical Subseasonal Forecasts with Probabilistic Bias Correction Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Stylistic-STORM (ST-STORM) : Perceiving the Semantic Nature of Appearance Collective Kernel EFT for Pre-activation ResNets PRIM-cipal components analysis One-Shot Generative Flows: Existence and Obstructions Structural interpretability in SVMs with truncated orthogonal polynomial kernels Amortized Optimal Transport from Sliced Potentials MinShap: A Modified Shapley Value Approach for Feature Selection Unsupervised feature selection using Bayesian Tucker decomposition Multi-User mmWave Beam and Rate Adaptation via Combinatorial Satisficing Bandits Best of both worlds: Stochastic & adversarial best-arm identification Scalable Model-Based Clustering with Sequential Monte Carlo Expert-Guided Class-Conditional Goodness-of-Fit Scores for Interpretable Classification with Informative Missingness: An Application to Seismic Monitoring Lightweight Geometric Adaptation for Training Physics-Informed Neural Networks Gating Enables Curvature: A Geometric Expressivity Gap in Attention Zeroth-Order Optimization at the Edge of Stability Differentially Private Conformal Prediction CLion: Efficient Cautious Lion Optimizer with Enhanced Generalization Generative Augmented Inference Improving Machine Learning Performance with Synthetic Augmentation PAC-MCTS: Bias-Aware Pruning for Robust LLM-Guided Search and Planning Path-Sampled Integrated Gradients Heat and Matérn Kernels on Matchings Doubly Outlier-Robust Online Infinite Hidden Markov Model Momentum Further Constrains Sharpness at the Edge of Stochastic Stability Multistage Conditional Compositional Optimization BOAT: Navigating the Sea of In Silico Predictors for Antibody Design via Multi-Objective Bayesian Optimization
Quantum Circuit Generation via test-time learning with la...
[Submitted on 3 Feb 2026 (v1), last revised 7 Jul 2026 (this ver · 2026-02-03 · via stat.ML updates on arXiv.org

View PDF HTML (experimental)

Abstract:Deploying large language models (LLMs) as optimizers for black-box scientific design problems requires efficient test-time refinement under expensive evaluations and without training data. We propose a \emph{memory-augmented test-time optimization} framework that combines episodic memory of high-scoring candidates, score-difference feedback, and restart-from-best sampling to improve iterative search. We evaluate the approach on quantum circuit synthesis, where the objective is to maximize the Meyer--Wallach (MW) global entanglement measure under an exponentially expensive black-box oracle. On 20-qubit circuits, the framework achieves $Q(\psi)=0.99$ without feedback. On the more challenging 25-qubit task, feedback and restart mechanisms enable multiple runs to reach $Q(\psi)=1.0$ within 45 oracle calls, while a budget-matched random hill-climbing baseline stalls below $Q(\psi)\approx0.29$. These results demonstrate that memory and evaluator feedback substantially improve the sample efficiency of LLM-based black-box optimization and establish quantum circuit synthesis as a challenging benchmark for test-time optimization.

Submission history

From: Adriano Macarone-Palmieri [view email]
[v1] Tue, 3 Feb 2026 12:41:25 UTC (714 KB)
[v2] Thu, 5 Feb 2026 16:53:11 UTC (714 KB)
[v3] Fri, 6 Feb 2026 22:10:56 UTC (715 KB)
[v4] Thu, 12 Feb 2026 11:53:26 UTC (715 KB)
[v5] Tue, 7 Jul 2026 22:50:14 UTC (722 KB)